The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A low density lattice decoder via non-parametric belief propagation
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Reduced-memory decoding of low-density lattice codes
IEEE Communications Letters
Hi-index | 0.00 |
A new method for decoding low-density lattice codes is given, wherein the belief-propagation decoder messages are single Gaussian functions. Since the message can be represented by two numbers, a mean and a variance, the complexity of this decoder is lower than previous decoders, which either quantized the mixture, or used a mixture of Gaussians. The computational complexity at the check node is also lower. The performance of various code designs, under single-Gaussian decoding, is evaluated by noise thresholds. In particular, the proposed decoding algorithm has noise threshold within 0.1 dB of the quantized-message decoder, which is considerably more complex.