A New Reduced-Complexity Decoding Algorithm for LDPC Codes

Guohui SUN  Jing JIN  Wenbin YAO  Hongwen YANG  

IEICE TRANSACTIONS on Communications   Vol.E90-B   No.7   pp.1835-1838
Publication Date: 2007/07/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e90-b.7.1835
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
LDPC codes,  SPA,  MSA,  

Full Text: PDF>>
Buy this Article

This letter proposes a new algorithm for the check node update in the decoding of low-density parity-check (LDPC) codes. The proposed algorithm is based on a new approximation formula of standard sum-product algorithm (SPA) which can reduce the approximation error of min-sum algorithm (MSA) and has almost the same performance as sum-product algorithm (SPA) under both floating precision operation and fixed-point operation. Besides, the new approximation formula can be implemented in simple structures competitive with MSA.