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.

作者: Daniel N.Liu Michael P.Fitz

作者单位: Department of Electrical Engineering University of California Los Angeles, Los Angeles, CA, 90095

会议类型: 国际会议

会议名称: 2006年IEEE信息理论国际会议(Proceedings of 2006 IEEE Information Theory Workshop ITW06)

会议地点: 成都

会议语种:英文

页码: 458-462

在线出版日期: 2006-10-22（万方平台首次上网日期，不代表论文的发表时间）