Low Complexity Weighted Reliability-Based Iterative Decoding of LDPC Codes

DOI Web Site 1 Citations 18 References
  • HUANG Zhiliang
    National Monile Communications Research Laboratory, Southeast University
  • CHEN Ming
    National Monile Communications Research Laboratory, Southeast University
  • DIAO Chunjuan
    National Monile Communications Research Laboratory, Southeast University
  • LI Jiamin
    National Monile Communications Research Laboratory, Southeast University

Search this article

Description

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.

Journal

Citations (1)*help

See more

References(18)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top