|
For Full-Text PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
|
A New Reduced-Complexity Decoding Algorithm for LDPC Codes
Guohui SUN Jing JIN Wenbin YAO Hongwen YANG
Publication
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 Keyword: LDPC codes, SPA, MSA,
Full Text: PDF(219.5KB)>>
Summary:
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.
|
|
|