We propose a quantized decoding algorithm for low- density parity-check codes where the variable node update rule of the standard min-sum algorithm is replaced with a look-up table (LUT) that is designed using an information-theoretic criterion. We show that even with message resolutions as low as 3 bits, the proposed algorithm can achieve better error rates than a floating-point min-sum decoder. Moreover, we study in detail the effect of different decoder design parameters, like the design SNR and the LUT tree structure on the performance of our decoder, and we propose some complexity reduction techniques, such as LUT re-use and message alphabet downsizing.
Quantized message passing for LDPC codes
Michael Meidlinger,Alexios Balatsoukas-Stimming,A. Burg,G. Matz
Published 2015 in Asilomar Conference on Signals, Systems and Computers
ABSTRACT
PUBLICATION RECORD
- Publication year
2015
- Venue
Asilomar Conference on Signals, Systems and Computers
- Publication date
2015-11-01
- Fields of study
Mathematics, Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-7 of 7 references · Page 1 of 1
CITED BY
Showing 1-26 of 26 citing papers · Page 1 of 1