Reduced complexity bounded distance decoding of the Leech lattice

Ofer Amrani*, Yair Be'ery, Alexander Vardy

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A new efficient algorithm for bounded-distance decoding of the Leech lattice is presented. The algorithm decodes correctly at least up to the guaranteed error-correction radius of the Leech lattice The proposed decoder is based on projecting the points of the Leech lattice onto the codewords of the (6,3,4) quarternary code, - the hexacode H6. Projection on the luxacode induces partition of the Leech lattice into four cosets of Q24, beyond the conventional partition into two H24 cosets. This enables bounded-distance decoding of the Leech lattice with only 1127 real operations in the worst case, as compared to about 3600 operations for the maximum-likelihood decoding of [9]. The proposed algorithm is at least 30% more efficient than Forney's algorithm in terms of computational complexity, while the coding gain loss is no more than 0.05 dB (over BER ranging from 10-1 to 10-6).

Original languageEnglish
Title of host publicationProceedings of the 1993 IEEE International Symposium on Information Theory
PublisherPubl by IEEE
Pages61
Number of pages1
ISBN (Print)0780308786
StatePublished - 1993
EventProceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA
Duration: 17 Jan 199322 Jan 1993

Publication series

NameProceedings of the 1993 IEEE International Symposium on Information Theory

Conference

ConferenceProceedings of the 1993 IEEE International Symposium on Information Theory
CitySan Antonio, TX, USA
Period17/01/9322/01/93

Fingerprint

Dive into the research topics of 'Reduced complexity bounded distance decoding of the Leech lattice'. Together they form a unique fingerprint.

Cite this