Generalized Two-Magnitude Check Node Updating with Self Correction for 5G LDPC Codes Decoding

Research output: Contribution to conferenceOther

Abstract

The min-sum (MS) and approximate-min* (a-min*) algorithms are alternatives of the belief propagation (BP) algorithm for decoding low-density parity-check (LDPC) codes. To lower the BP decoding complexity, both algorithms compute two magnitudes at each check node (CN) and pass them to the neighboring variable nodes (VNs).
In this work we propose a new algorithm, ga-min*, that generalizes the MS and a-min* in terms of number of incoming messages to a CN.
We analyze and demonstrate a condition to improve the performance when applying self-correction to the ga-min*.
Simulations on 5G LDPC codes show that the proposed decoding algorithm yields comparable performance to the a-min* with a significant reduction in complexity, and it is robust against LLR mismatch.

Details

Authors
Organisations
Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Communication Systems

Keywords

  • LDPC codes, Iterative Decoding, Generalized Min Sum
Original languageEnglish
Publication statusPublished - 2019
Publication categoryResearch
Peer-reviewedYes
Event12th International ITG Conference on Systems, Communications and Coding - Rostock Univeristy, Rostock, Germany
Duration: 2019 Feb 112019 Feb 14
https://www.scc2019.net/

Conference

Conference12th International ITG Conference on Systems, Communications and Coding
Abbreviated titleSCC
CountryGermany
CityRostock
Period2019/02/112019/02/14
Internet address

Total downloads

No data available