DocumentCode
1675261
Title
Multistage decoding of codes and lattices based on elimination rules
Author
Ran, Moshe ; Snyders, Jakov
Author_Institution
Dept. of Electr. Eng. Syst., Tel Aviv Univ., Israel
fYear
1996
Firstpage
348
Lastpage
351
Abstract
Low complexity maximum likelihood (ML) and bounded distance (BD) soft decoding algorithms are presented for several block and lattice codes. The BD algorithms are based upon multilevel constructions of the codes. The decoding procedures utilize an elimination stage which exploit the structure of the code. The method is demonstrated by devising ML and BD decoders for the Gosset and 16-dimensional Barness-Wall lattices
Keywords
block codes; computational complexity; lattice theory; maximum likelihood decoding; 16-dimensional Barness-Wall lattices; Gosset lattice; block codes; bounded distance soft decoding algorithms; elimination rules; lattice codes; low complexity maximum likelihood decoding; multilevel constructions; multistage decoding; AWGN; Additive white noise; Channel capacity; Iterative decoding; Lattices; Modulation coding; Performance gain; Radio access networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Electronics Engineers in Israel, 1996., Nineteenth Convention of
Conference_Location
Jerusalem
Print_ISBN
0-7803-3330-6
Type
conf
DOI
10.1109/EEIS.1996.566986
Filename
566986
Link To Document