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

Forskningsoutput: KonferensbidragAnnan

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.

Detaljer

Författare
Enheter & grupper
Forskningsområden

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Kommunikationssystem

Nyckelord

Originalspråkengelska
StatusPublished - 2019
PublikationskategoriForskning
Peer review utfördJa
Evenemang12th International ITG Conference on Systems, Communications and Coding - Rostock Univeristy, Rostock, Tyskland
Varaktighet: 2019 feb 112019 feb 14
https://www.scc2019.net/

Konferens

Konferens12th International ITG Conference on Systems, Communications and Coding
Förkortad titelSCC
LandTyskland
OrtRostock
Period2019/02/112019/02/14
Internetadress

Nedladdningar

Ingen tillgänglig data