Low Complexity Weighted Reliability-Based Iterative Decoding of LDPC Codes

Zhiliang HUANG  Ming CHEN  Chunjuan DIAO  Jiamin LI  

IEICE TRANSACTIONS on Communications   Vol.E95-B   No.11   pp.3572-3575
Publication Date: 2012/11/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E95.B.3572
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
reliability-based,  iterative decoding,  LDPC codes,  min sum,  

Full Text: PDF(212.5KB)>>
Buy this Article

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.