Reduced-Memory Decoding of Low-Density Lattice Codes
Reduced-Memory Decoding of Low-Density Lattice Codes
复制标题
DOI：
10.1109/lcomm.2010.07.092350
复制
发表时间：
2010-07-01
期刊：
影响因子：
--
通讯作者：
Dauwels, Justin
中科院分区：
文献类型：
--
作者：
Kurkoski, Brian;Dauwels, Justin
这封信描述了一个有限维的低密度晶格码的信念传播解码器，其中的信息被表示为单个高斯函数。与先前提出的解码器相比，由于每个消息仅由两个值组成，即均值和方差，因此内存减少。复杂性也降低了，因为检查节点操作是在单个高斯上，避免了以前需要的近似，并且因为可变节点在更少的高斯上执行近似。对于晶格维度n =1000和10,000，与使用更多内存的解码器相比，该解码器的信噪比损失不超过0.1 dB。
This letter describes a belief-propagation decoder for low-density lattice codes of finite dimension, in which the messages are represented as single Gaussian functions. Compared to previously-proposed decoders, memory is reduced because each message consists of only two values, the mean and variance. Complexity is also reduced because the check node operations are on single Gaussians, avoiding approximations needed previously, and because the variable node performs approximations on a smaller number of Gaussians. For lattice dimension n =1000 and 10,000, this decoder looses no more than 0.1 dB in SNR, compared to the decoders which use much more memory.