Implementation issues of a List sphere decoder

Jin Lee, Sungchung Park, Yuping Zhang, Keshab K Parhi, Sin Chong Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings
StatePublished - Dec 1 2006
Event2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006 - Toulouse, France
Duration: May 14 2006May 19 2006

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume3
ISSN (Print)1520-6149

Other

Other2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006
CountryFrance
CityToulouse
Period5/14/065/19/06

Fingerprint Dive into the research topics of 'Implementation issues of a List sphere decoder'. Together they form a unique fingerprint.

Cite this