DocumentCode :
460523
Title :
Reduced-Complexity Shortest Path-Sphere Decoder with Soft-Decision for Coded MIMO Systems
Author :
Zhao, Hui ; Long, Hang ; Wang, Wenbo
Author_Institution :
Sch. of Telecommun. Eng., Beijing Univ. of Posts & Telecommun.
Volume :
2
fYear :
2006
fDate :
25-28 June 2006
Firstpage :
1095
Lastpage :
1098
Abstract :
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 1 dB of Eb/N0 when BER=10-4 at the same time
Keywords :
MIMO communication; encoding; error statistics; maximum likelihood decoding; maximum likelihood detection; BER; Dijkstra shortest path search; bit error rate; coded MIMO system detection; multiple input multiple output; multiple surviving nodes; shortest path-sphere decoder; soft-decision; Computational efficiency; Computer simulation; Covariance matrix; Detection algorithms; Diversity methods; MIMO; Maximum likelihood decoding; Maximum likelihood detection; Receiving antennas; Transmitting antennas;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, Circuits and Systems Proceedings, 2006 International Conference on
Conference_Location :
Guilin
Print_ISBN :
0-7803-9584-0
Electronic_ISBN :
0-7803-9585-9
Type :
conf
DOI :
10.1109/ICCCAS.2006.284838
Filename :
4064079
Link To Document :
بازگشت