A New Reduced-Complexity Decoding Algorithm for LDPC Codes

Guohui SUN; Jing JIN; Wenbin YAO; Hongwen YANG

doi:10.1093/ietcom/e90-b.7.1835

A New Reduced-Complexity Decoding Algorithm for LDPC Codes

Guohui SUN, Jing JIN, Wenbin YAO, Hongwen YANG

Full Text Views

0

Share
Cite this

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E90-B No.7 pp.1835-1838

Publication Date: 2007/07/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e90-b.7.1835

Type of Manuscript: LETTER

Category: Fundamental Theories for Communications

Cite this

Copy

Guohui SUN, Jing JIN, Wenbin YAO, Hongwen YANG, "A New Reduced-Complexity Decoding Algorithm for LDPC Codes" in IEICE TRANSACTIONS on Communications, vol. E90-B, no. 7, pp. 1835-1838, July 2007, doi: 10.1093/ietcom/e90-b.7.1835.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.7.1835/_p

Copy

@ARTICLE{e90-b_7_1835,
author={Guohui SUN, Jing JIN, Wenbin YAO, Hongwen YANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A New Reduced-Complexity Decoding Algorithm for LDPC Codes},
year={2007},
volume={E90-B},
number={7},
pages={1835-1838},
abstract={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.},
keywords={},
doi={10.1093/ietcom/e90-b.7.1835},
ISSN={1745-1345},
month={July},}

Copy

TY - JOUR
TI - A New Reduced-Complexity Decoding Algorithm for LDPC Codes
T2 - IEICE TRANSACTIONS on Communications
SP - 1835
EP - 1838
AU - Guohui SUN
AU - Jing JIN
AU - Wenbin YAO
AU - Hongwen YANG
PY - 2007
DO - 10.1093/ietcom/e90-b.7.1835
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2007
AB - 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.
ER -