Low-complexity generalized layered space-time MIMO detection

Group layered space-time codes can attain a better tradeoff between data rate and diversity gain. In this paper, we propose two generalized detection algorithms for GLST. Firstly, we present a non-ordering linear detection with an extended Gaussian elimination algorithm. Then an ordered successive detection algorithm is derived. These algorithms can reduce computational complexity, as low as O(Nt²Nr) per symbol interval, by using the characteristics of the channel matrix. Nt and Nr are the number of transmitter and receiver antennas, respectively. Simulation results show that the proposed detectors can achieve low-complexity and better performance over linear MMSE ones