Title :
Single-Gaussian messages and noise thresholds for decoding low-density lattice codes
Author :
Kurkoski, Brian M. ; Yamaguchi, Kazuhiko ; Kobayashi, Kingo
Author_Institution :
Dept. of Inf. & Comput. Eng., Univ. of Electro-Commun., Chofu, Japan
fDate :
June 28 2009-July 3 2009
Abstract :
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.
Keywords :
Gaussian noise; computational complexity; decoding; quantisation (signal); belief-propagation decoder messages; code designs; computational complexity; decoding algorithm; decoding low-density lattice codes; noise thresholds; quantized-message decoder; single Gaussian functions; single-Gaussian decoding; single-Gaussian messages; AWGN channels; Additive white noise; Computational complexity; Convergence; Convolution; Gaussian noise; Iterative decoding; Lattices; Source coding; Sparse matrices;
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Conference_Location :
Seoul
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
978-1-4244-4313-0
DOI :
10.1109/ISIT.2009.5205680