Message-passing decoding of lattices using Gaussian mixtures

A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the number of functions from growing as the decoder iterations progress, a method for reducing the number of Gaussians at each step is g...

Full description

Saved in:
Bibliographic Details
Main Authors: Kurkoski, B., Dauwels, J.
Format: Conference Proceeding
Language:English
Subjects:
Approximation algorithms
Approximation methods
Complexity theory
Decoding
Distance measurement
Inference algorithms
Lattices
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A belief-propagation decoder for low-density lattice codes, which represents messages explicitly as a mixture of Gaussians functions, is given. In order to prevent the number of functions from growing as the decoder iterations progress, a method for reducing the number of Gaussians at each step is given. A squared distance metric is used, which is shown to be a lower bound on the divergence. For an unconstrained power system, comparisons are made with a quantized implementation. For a dimension 100 lattice, a loss of about 0.2 dB was found; for dimension 1000 and 10000 lattices, the difference in error rate was indistinguishable. The memory required to store the messages is substantially superior to the quantized implementation.
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2008.4595439