Abstract
New efficient algorithm for maximum likelihood soft-decision decoding of the Leech lattice is presented. The superiority of this decoder with respect to both computational and memory complexities, compared to previously published decoding methods is demonstrated. Gain factors in the range of 2-10 are achieved. The Leech lattice has been recently suggested for practical implementation of block-coded modulation and the decoder is described here in that context.
| Original language | English |
|---|---|
| Pages (from-to) | 959-966 |
| Number of pages | 8 |
| Journal | IEEE Journal on Selected Areas in Communications |
| Volume | 7 |
| Issue number | 6 |
| DOIs | |
| State | Published - Aug 1989 |