New sub-optimal detection algorithm of layered space-time code

As an important space-time code, the layered space-time (LST) code has been studying widely since it was firstly proposed by Foschini in 1996. To exploit its potential, the Bell Lab Layered Space-Time (BLAST) structure of the LST was proposed by Bell Lab. There are two types of BLAST architectures: vertical BLAST (V-BLAST) and diagonally BLAST (D-BLAST). Detection algorithms of V-BLAST were proposed by Golden (see Electronics Letters, vol.35, no.1, 1999). His detection process uses linear combination nulling and successive symbol cancellation (SSC) based on inversing and ordering. However, inversing (Moore-Penrose pseudoinverse) and ordering operation for each iteration bring a huge computation complexity. To detect M transmit antenna signals, Golden's detection algorithm needs M inversing and M ordering operations. Aiming at this shortcoming, a new detection algorithm for layered space-time code is proposed. This new sub-optimal detection algorithm is based on Greville inversing process, with two inversing and one ordering process. Simulation results show us the proposed sub-optimal scheme still has a good BER performance.

[1]  Babak Hassibi,et al.  An efficient square-root algorithm for BLAST , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[2]  M. J. Gans,et al.  On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

[3]  Gerard J. Foschini,et al.  Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas , 1996, Bell Labs Technical Journal.

[4]  Joseph M. Kahn,et al.  Layered space-time codes for wireless communications using multiple transmit antennas , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[5]  Reinaldo A. Valenzuela,et al.  V-BLAST: an architecture for realizing very high data rates over the rich-scattering wireless channel , 1998, 1998 URSI International Symposium on Signals, Systems, and Electronics. Conference Proceedings (Cat. No.98EX167).

[6]  Reinaldo A. Valenzuela,et al.  Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture , 1999 .

[7]  Chen-Nee Chuah,et al.  Capacity growth of multi-element arrays in indoor and outdoor wireless channels , 2000, 2000 IEEE Wireless Communications and Networking Conference. Conference Record (Cat. No.00TH8540).

[8]  Joseph M. Kahn,et al.  Scalable layered space-time codes for wireless communications: performance analysis and design criteria , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[9]  Zhang Ping,et al.  New detection algorithm of V-BLAST space-time code , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[10]  David Finkelstein,et al.  SPACE--TIME CODE. , 1969 .

[11]  Koichi Shinoda,et al.  High speed speech recognition using tree-structured probability density function , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.