Novel techniques of a list sphere decoder for high throughput

Author

Lee, Jin ; Park, Sin-Chong

Author_Institution

Inf. & Commun. Univ.

Volume

3

fYear

2006

fDate

20-22 Feb. 2006

Lastpage

1787

Abstract

Since finding the nearest point in a lattice for multi-input multi-output (MIMO) channels is NP-hard, simplified algorithms such as a 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 a sphere decoder (SD) and a list sphere decoder (LSD) with depth-first tree searching are summarized. Numerous simulations have been carried out and comparison has been made based on of the average number of processing cycles

Keywords

MIMO systems; channel coding; computational complexity; iterative decoding; tree searching; MIMO channels; NP-hard; channel decoding; computational complexity; depth-first tree searching; iterative decoding; iterative detection; list sphere decoder; multiinput multioutput channels; Computational complexity; Data mining; Decision trees; Iterative decoding; Lattices; MIMO; Maximum likelihood decoding; Maximum likelihood detection; Sorting; Throughput; List sphere decoder and LSD; MIMO; Multi-input multi-output; SD; Sphere decoder;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Communication Technology, 2006. ICACT 2006. The 8th International Conference

Conference_Location

Phoenix Park

Print_ISBN

89-5519-129-4

Type

conf

DOI

10.1109/ICACT.2006.206335

Filename

1625940