On Reduced Complexity Decoding Algorithms for STBC-MTCM in Fast Fading Channels

摘要

STBC-MTCM scheme which achieves high rate, full diversity and large coding gains is an outstanding example of transmit diversity scheme for multiple-antenna system. In the case of time selective fast fading (TSFF) or frequency selective fading (FSF) channels, the performance of current existing STBC-MTCM decoder suffers from an irreducible error floor.In this paper, we present two computational efficient decoding algorithms: zero-forcing (ZF) detector and linear minimum mean square error (LMMSE) detector to combat the fast fading channels. The proposed decoding algorithms provide a robust performance across range of channel conditions from quasi-static (slow) fading to TSFF or FSF. Simulation results suggest that our proposed decoding algorithms have near Maximum-Likelihood (ML) performance while being computational more efficient.