Multistage decoding of codes and lattices based on elimination rules

Moshe Ran*, Jakov Snyders

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
Pages348-351
Number of pages4
StatePublished - 1996
EventProceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr
Duration: 5 Nov 19966 Nov 1996

Conference

ConferenceProceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel
CityJerusalem, Isr
Period5/11/966/11/96

Fingerprint

Dive into the research topics of 'Multistage decoding of codes and lattices based on elimination rules'. Together they form a unique fingerprint.

Cite this