DocumentCode :
2322518
Title :
Implementation Issues of a List Sphere Decoder
Author :
Lee, Jin ; Park, Sungchung ; Zhang, Yuping ; Parhi, Keshab K. ; Park, Sin-Chong
Author_Institution :
Inf. & Commun. Univ., Seoul
Volume :
3
fYear :
2006
fDate :
14-19 May 2006
Abstract :
Since finding the nearest point in a lattice for multi-input multi-output (MIMO) channels is NP-hard, simplified algorithms such as sphere decoder (SD) have been proposed. List sphere decoder (LSD), which is a modified version of SD, allows soft information to be extracted for channel decoding and iterative detection/decoding. In this paper, recently proposed efficient methods for reducing the computational complexity of SD and LSD with depth-first tree searching are summarized. Numerous simulations have been carried out and comparison has been made based on the average number of processing cycles. We also present two efficient schemes which can decrease hardware complexity without significant performance degradation, restricted list updating in LSD and restricted node storing at each tree level
Keywords :
MIMO systems; channel coding; computational complexity; demodulation; iterative decoding; tree searching; MIMO channels; NP-hard; channel decoding; computational complexity; depth-first tree searching; hardware complexity; iterative detection-decoding; list sphere decoder; multi-input multi-output channels; Computational complexity; Computational modeling; Data mining; Decision trees; Degradation; Hardware; Iterative algorithms; Iterative decoding; Lattices; MIMO;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on
Conference_Location :
Toulouse
ISSN :
1520-6149
Print_ISBN :
1-4244-0469-X
Type :
conf
DOI :
10.1109/ICASSP.2006.1660824
Filename :
1660824
Link To Document :
بازگشت