Reduced-Complexity Shortest Path-Sphere Decoder with Soft-Decision for Coded MIMO Systems

摘要：

This paper proposes a detection for the coded MIMO systems that applies Dijkstra shortest path search with multiple surviving nodes to sphere decoder (SD). It is fitter to search multiple surviving nodes with a simple and direct strategy, leading to a very low complexity. And from the two aspects of time complexity and space complexity, we compare the proposed algorithm with QRM-MLD. Simulation results show that it can cut down time complexity to 1/30 of the latter and space complexity to about 40％ with the gain of 1dB of Eb/N0 when BER=10-4 at the same time.

作者: Hui Zhao Hang Long Wenbo Wang

作者单位: School of Telecommunications Engineering Beijing University of Telecommunications and Posts Beijing, P.R.China

会议类型: 国际会议

会议名称: 2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)

会议地点: 广西桂林

会议语种:英文

页码: 1095-1098

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