Computational efficiency of list sphere detection

Author

Hedley, Mark ; Suzuki, Hajime ; Daniels, Graham

Author_Institution

CSIRO ICT Centre, Epping, NSW

fYear

2006

fDate

1-3 Feb. 2006

Firstpage

66

Lastpage

70

Abstract

In this paper the performance of a promising MIMO detection algorithm, list sphere detection, is evaluated for a range of list lengths and for four variations to the basic algorithm. The evaluation uses a MIMO-OFDM-BICM system simulation to show bit error performance versus the computational effort, and the results are compared to maximum likelihood detection. The results provide guidance on the selection of an appropriate list length and algorithm. In applications where a short list length must be used due to memory or computation constraints the results show the loss in performance that can be expected

Keywords

MIMO systems; OFDM modulation; error statistics; interleaved codes; maximum likelihood detection; modulation coding; MIMO detection algorithm; MIMO-OFDM-BICM system; bit error performance; computation constraints; computational efficiency; list sphere detection; maximum likelihood detection; memory constraints; Australia; Computational efficiency; Computational modeling; Decoding; Detection algorithms; Forward error correction; Gaussian noise; MIMO; Mathematics; Memory management;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications Theory Workshop, 2006. Proceedings. 7th Australian

Conference_Location

Perth, WA

Print_ISBN

1-4244-0213-1

Type

conf

DOI

10.1109/AUSCTW.2006.1625257

Filename

1625257