Implementation issues of a List sphere decoder

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

Implementation issues of a List sphere decoder

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

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings
State	Published - Dec 1 2006
Event	2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006 - Toulouse, France Duration: May 14 2006 → May 19 2006

Publication series

Name	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume	3
ISSN (Print)	1520-6149

Other

Other	2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006
Country	France
City	Toulouse
Period	5/14/06 → 5/19/06

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

Cite this

Implementation issues of a List sphere decoder. / Lee, Jin; Park, Sungchung; Zhang, Yuping; Parhi, Keshab K; Park, Sin Chong.

2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings. 2006. 1660824 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings; Vol. 3).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Lee, J, Park, S, Zhang, Y, Parhi, KK & Park, SC 2006, Implementation issues of a List sphere decoder. in 2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings., 1660824, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, vol. 3, 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006, Toulouse, France, 5/14/06.

@inproceedings{bdc883aa76394be6a3b803b072df67a0,

title = "Implementation issues of a List sphere decoder",

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.",

author = "Jin Lee and Sungchung Park and Yuping Zhang and Parhi, {Keshab K} and Park, {Sin Chong}",

year = "2006",

month = dec,

day = "1",

language = "English (US)",

isbn = "142440469X",

series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

booktitle = "2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings",

note = "2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006 ; Conference date: 14-05-2006 Through 19-05-2006",

}

TY - GEN

T1 - Implementation issues of a List sphere decoder

AU - Lee, Jin

AU - Park, Sungchung

AU - Zhang, Yuping

AU - Parhi, Keshab K

AU - Park, Sin Chong

PY - 2006/12/1

Y1 - 2006/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33947694581&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947694581&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33947694581

SN - 142440469X

SN - 9781424404698

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

BT - 2006 IEEE International Conference on Acoustics, Speech, and Signal Processing - Proceedings

T2 - 2006 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2006

Y2 - 14 May 2006 through 19 May 2006

ER -