Message-Passing Decoding of Lattices Using Gaussian Mixtures
| dc.creator | Kurkoski, Brian M. | |
| dc.creator | Dauwels, Justin | |
| dc.date | 2008-02-05 | |
| dc.date.accessioned | 2026-07-07T09:18:46Z | |
| dc.date.available | 2026-07-07T09:18:46Z | |
| dc.description | 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}. | |
| dc.description | Cite this paper as: Brian Kurkoski and Justin Dauwels, "Message-passing decoding of lattices using Gaussian mixtures," in Proceedings of the 30th Symposium on Information Theory and its Applications (SITA 2007), pp. 877-882, November 27-30, 2007, Shima, Mie, Japan | |
| dc.identifier | https://arxiv.org/abs/0802.0554 | |
| dc.identifier | http://arxiv.org/abs/0802.0554 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154146 | |
| dc.subject | Information Theory | |
| dc.title | Message-Passing Decoding of Lattices Using Gaussian Mixtures | |
| dc.type | text |