Low Complexity Weighted Reliability-Based Iterative Decoding of LDPC Codes

Zhiliang HUANG; Ming CHEN; Chunjuan DIAO; Jiamin LI

doi:10.1587/transcom.E95.B.3572

Low Complexity Weighted Reliability-Based Iterative Decoding of LDPC Codes

Zhiliang HUANG, Ming CHEN, Chunjuan DIAO, Jiamin LI

Full Text Views

0

Share
Cite this

Summary :

This letter presents a novel weighted reliability-based (WRB) algorithm for decoding low-density parity-check (LDPC) codes. Viewing the well-known normalized min sum (NMS) algorithm as reliability-based, the WRB algorithm can be seen as a simplified version of the NMS algorithm. Unlike the NMS algorithm, the WRB algorithm does not update the soft information sent between the variable nodes and check nodes, which greatly reduces the decoding complexity. For finite geometry LDPC codes with larger row redundancy and column weights, simulation results show that the WRB algorithm almost matches the error performance of the NMS algorithm.

Publication: IEICE TRANSACTIONS on Communications Vol.E95-B No.11 pp.3572-3575

Publication Date: 2012/11/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E95.B.3572

Type of Manuscript: LETTER

Category: Fundamental Theories for Communications

Cite this

Copy

Zhiliang HUANG, Ming CHEN, Chunjuan DIAO, Jiamin LI, "Low Complexity Weighted Reliability-Based Iterative Decoding of LDPC Codes" in IEICE TRANSACTIONS on Communications, vol. E95-B, no. 11, pp. 3572-3575, November 2012, doi: 10.1587/transcom.E95.B.3572.
Abstract: This letter presents a novel weighted reliability-based (WRB) algorithm for decoding low-density parity-check (LDPC) codes. Viewing the well-known normalized min sum (NMS) algorithm as reliability-based, the WRB algorithm can be seen as a simplified version of the NMS algorithm. Unlike the NMS algorithm, the WRB algorithm does not update the soft information sent between the variable nodes and check nodes, which greatly reduces the decoding complexity. For finite geometry LDPC codes with larger row redundancy and column weights, simulation results show that the WRB algorithm almost matches the error performance of the NMS algorithm.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.3572/_p

Copy

@ARTICLE{e95-b_11_3572,
author={Zhiliang HUANG, Ming CHEN, Chunjuan DIAO, Jiamin LI, },
journal={IEICE TRANSACTIONS on Communications},
title={Low Complexity Weighted Reliability-Based Iterative Decoding of LDPC Codes},
year={2012},
volume={E95-B},
number={11},
pages={3572-3575},
abstract={This letter presents a novel weighted reliability-based (WRB) algorithm for decoding low-density parity-check (LDPC) codes. Viewing the well-known normalized min sum (NMS) algorithm as reliability-based, the WRB algorithm can be seen as a simplified version of the NMS algorithm. Unlike the NMS algorithm, the WRB algorithm does not update the soft information sent between the variable nodes and check nodes, which greatly reduces the decoding complexity. For finite geometry LDPC codes with larger row redundancy and column weights, simulation results show that the WRB algorithm almost matches the error performance of the NMS algorithm.},
keywords={},
doi={10.1587/transcom.E95.B.3572},
ISSN={1745-1345},
month={November},}

Copy

TY - JOUR
TI - Low Complexity Weighted Reliability-Based Iterative Decoding of LDPC Codes
T2 - IEICE TRANSACTIONS on Communications
SP - 3572
EP - 3575
AU - Zhiliang HUANG
AU - Ming CHEN
AU - Chunjuan DIAO
AU - Jiamin LI
PY - 2012
DO - 10.1587/transcom.E95.B.3572
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2012
AB - This letter presents a novel weighted reliability-based (WRB) algorithm for decoding low-density parity-check (LDPC) codes. Viewing the well-known normalized min sum (NMS) algorithm as reliability-based, the WRB algorithm can be seen as a simplified version of the NMS algorithm. Unlike the NMS algorithm, the WRB algorithm does not update the soft information sent between the variable nodes and check nodes, which greatly reduces the decoding complexity. For finite geometry LDPC codes with larger row redundancy and column weights, simulation results show that the WRB algorithm almost matches the error performance of the NMS algorithm.
ER -