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 ing 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.