DocumentCode
2451346
Title
Efficient decoding of the Gosset, Coxeter-Todd and the Barnes-Wall lattices
Author
Ran, Moshe ; Snyders, Jakov
Author_Institution
Dept. of Electr. Eng., Tel Aviv Univ., Israel
fYear
1998
fDate
16-21 Aug 1998
Firstpage
92
Abstract
Low complexity maximum-likelihood and bounded-distance soft decoding algorithms are presented for several block and lattice codes. The bounded-distance algorithms are based upon multilevel constructions of the codes. To demonstrate the approach, maximum-likelihood and bounded-distance decoders are devised for several well known codes and sphere packings in 8, 12 and 16 dimensions
Keywords
block codes; computational complexity; lattice theory; maximum likelihood decoding; modulation coding; Barnes-Wall lattice; Coxeter-Todd lattice; Gosset lattice; block codes; bounded-distance soft decoding; coded modulation; efficient decoding; lattice codes; low complexity decoding; maximum-likelihood decoding; multilevel construction; sphere packings; AWGN; Additive white noise; Channel capacity; Delay; Iterative decoding; Lattices; Maximum likelihood decoding; Modulation coding; Performance gain; Radio access networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location
Cambridge, MA
Print_ISBN
0-7803-5000-6
Type
conf
DOI
10.1109/ISIT.1998.708678
Filename
708678
Link To Document