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

Wei Zhou; Michael Lentmaier

doi:10.30420/454862047

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

Wei Zhou, Michael Lentmaier

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

320 Downloads (Pure)

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.

Original language	English
Title of host publication	SCC 2019 - 12th International ITG Conference on Systems, Communications and Coding
Publisher	VDE Verlag gmbh Berlin
Pages	274-279
ISBN (Electronic)	978-3-8007-4862-4
ISBN (Print)	978-3-8007-4898-3
DOIs	https://doi.org/10.30420/454862047
Publication status	Published - 2019
Event	12th International ITG Conference on Systems, Communications and Coding - Rostock Univeristy, Rostock, Germany Duration: 2019 Feb 11 → 2019 Feb 14 https://www.scc2019.net/

Conference

Conference	12th International ITG Conference on Systems, Communications and Coding
Abbreviated title	SCC
Country/Territory	Germany
City	Rostock
Period	2019/02/11 → 2019/02/14
Internet address	https://www.scc2019.net/

Subject classification (UKÄ)

Communication Systems

Free keywords

LDPC codes
Iterative Decoding
Generalized Min Sum

Access to Document

10.30420/454862047

document_12_18Accepted author manuscript, 569 KB

Cite this

@inproceedings{e828fa4cd25c4363935754f30c198288,

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

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. ",

keywords = "LDPC codes, Iterative Decoding, Generalized Min Sum",

author = "Wei Zhou and Michael Lentmaier",

year = "2019",

doi = "10.30420/454862047",

language = "English",

isbn = "978-3-8007-4898-3",

pages = "274--279",

booktitle = "SCC 2019 - 12th International ITG Conference on Systems, Communications and Coding",

publisher = "VDE Verlag gmbh Berlin",

note = "12th International ITG Conference on Systems, Communications and Coding, SCC ; Conference date: 11-02-2019 Through 14-02-2019",

url = "https://www.scc2019.net/",

}

Zhou, W & Lentmaier, M 2019, Generalized Two-Magnitude Check Node Updating with Self Correction for 5G LDPC Codes Decoding. in SCC 2019 - 12th International ITG Conference on Systems, Communications and Coding., S8-3, VDE Verlag gmbh Berlin, pp. 274-279, 12th International ITG Conference on Systems, Communications and Coding, Rostock, Germany, 2019/02/11. https://doi.org/10.30420/454862047

Generalized Two-Magnitude Check Node Updating with Self Correction for 5G LDPC Codes Decoding. / Zhou, Wei; Lentmaier, Michael.
SCC 2019 - 12th International ITG Conference on Systems, Communications and Coding. VDE Verlag gmbh Berlin, 2019. p. 274-279 S8-3.

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

TY - GEN

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

AU - Zhou, Wei

AU - Lentmaier, Michael

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - LDPC codes

KW - Iterative Decoding

KW - Generalized Min Sum

U2 - 10.30420/454862047

DO - 10.30420/454862047

M3 - Paper in conference proceeding

SN - 978-3-8007-4898-3

SP - 274

EP - 279

BT - SCC 2019 - 12th International ITG Conference on Systems, Communications and Coding

PB - VDE Verlag gmbh Berlin

T2 - 12th International ITG Conference on Systems, Communications and Coding

Y2 - 11 February 2019 through 14 February 2019

ER -

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

Abstract

Conference

Subject classification (UKÄ)

Free keywords

Access to Document

Fingerprint

Cite this