DocumentCode :
3088550
Title :
A study of performance and decoding complexity in lattice codes
Author :
Sheppard, J.A. ; Burr, A.G.
Author_Institution :
Dept. of Electron., York Univ., UK
fYear :
1997
fDate :
29 Jun-4 Jul 1997
Firstpage :
523
Abstract :
The decoding complexities and coding gains at finite error rates of a number of Barnes-Wall lattices and their sub-lattices have been estimated, and the performance/complexity trade-off compared with that of the Leech lattice
Keywords :
channel coding; computational complexity; decoding; lattice theory; Barnes-Wall lattices; Leech lattice; coding gains; decoding complexity; finite error rates; lattice codes; performance; sub-lattices; AWGN channels; Costs; Degradation; Encoding; Error analysis; Iterative decoding; Lattices; Performance gain; Scattering; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
Type :
conf
DOI :
10.1109/ISIT.1997.613460
Filename :
613460
Link To Document :
بازگشت