Treffer: Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing.

Title:
Design and Decoding of Irregular LDPC Codes Based on Discrete Message Passing.
Authors:
Meidlinger, Michael1 (AUTHOR) michael@meidlinger.info, Matz, Gerald2 (AUTHOR), Burg, Andreas3 (AUTHOR)
Source:
IEEE Transactions on Communications. Mar2020, Vol. 68 Issue 3, p1329-1343. 15p.
Database:
Business Source Elite

Weitere Informationen

We consider discrete message passing (MP) decoding of low-density parity check (LDPC) codes based on information-optimal symmetric look-up table (LUT). A link between discrete message labels and the associated log-likelihood ratio values (defined in terms of density evolution distributions) is established. This link gives rise to an algebraic structure on the message labels and leads to an interpretation of LUT decoding as a form of quantized belief propagation. We then exploit the algebraic structure for low-complexity LUT decoder designs. Our LUT decoding framework is the first to also apply to irregular LDPC codes by taking into account the degree distribution in a joint LUT design. We exploit the relation between LUT decoding and belief propagation to obtain stability conditions and irregular LDPC code designs optimized for LUT decoding. The resulting decoders outperform floating-point precision min-sum decoders at LUT resolutions as low as 3 bit s for regular codes and 4 bits for irregular codes. [ABSTRACT FROM AUTHOR]

Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)