Title :
Bounds on the performance of sphere decoding of linear block codes
Author :
El-Khamy, Mostafa ; Vikalo, Haris ; Hassibi, Babak
Author_Institution :
Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA
fDate :
29 Aug.-1 Sept. 2005
Abstract :
A sphere decoder searches for the closest lattice point within a certain search radius. The search radius provides a tradeoff between performance and complexity. We derive tight upper bounds on the performance of sphere decoding of linear block codes. The performance of soft-decision sphere decoding on AWGN channels as well as that of hard-decision sphere decoding on binary symmetric channels is analyzed.
Keywords :
AWGN channels; block codes; channel coding; computational complexity; linear codes; search problems; AWGN channels; binary symmetric channels; hard-decision decoding; linear block codes; search radius; soft-decision decoding; sphere decoding; AWGN channels; Block codes; Chromium; Electronic mail; High definition video; Lattices; Maximum likelihood decoding; Modulation coding; Performance analysis; Upper bound;
Conference_Titel :
Information Theory Workshop, 2005 IEEE
Print_ISBN :
0-7803-9480-1
DOI :
10.1109/ITW.2005.1531854
