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.
Original language | English |
---|---|
Pages | 348-351 |
Number of pages | 4 |
State | Published - 1996 |
Event | Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr Duration: 5 Nov 1996 → 6 Nov 1996 |
Conference
Conference | Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel |
---|---|
City | Jerusalem, Isr |
Period | 5/11/96 → 6/11/96 |