By Topic

Reduced-Memory Decoding of Low-Density Lattice Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kurkoski, B. ; Dept. of Inf., Commun. Eng., Univ. of Electro-Commun., Chofu, Japan ; Dauwels, J.

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.

Published in:

Communications Letters, IEEE  (Volume:14 ,  Issue: 7 )