Message-Passing Decoding of Lattices Using Gaussian Mixtures

Details Message-Passing Decoding of Lattices Using Gaussian Mixtures Message-Passing Decoding of Lattices Using Gaussian Mixtures

2008-02-05

arxiv.org/abs/0802.0554v1

Computer Science

Information Theory

Cite this paper as: Brian Kurkoski and Justin Dauwels, "Message-passing decoding of lattices using Gaussian mixtures," in Pr

Scientific paper

A lattice decoder which represents messages explicitly as a mixture of Gaussians functions is given. In order to prevent the number of functions in a mixture from growing as the decoder iterations progress, a method for replacing N Gaussian functions with M Gaussian functions, with M < N, is given. A squared distance metric is used to select functions for combining. A pair of selected Gaussians is replaced by a single Gaussian with the same first and second moments. The metric can be computed efficiently, and at the same time, the proposed algorithm empirically gives good results, for example, a dimension 100 lattice has a loss of 0.2 dB in signal-to-noise ratio at a probability of symbol error of 10^{-5}.

Affiliated with

Also associated with

No associations

Rating

Message-Passing Decoding of Lattices Using Gaussian Mixtures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Message-Passing Decoding of Lattices Using Gaussian Mixtures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message-Passing Decoding of Lattices Using Gaussian Mixtures will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-45361