IEICE TRANSACTIONS on Fundamentals
Complexity-Reducing Algorithm for Serial Scheduled Min-Sum Decoding of LDPC Codes
Summary :
We propose a complexity-reducing algorithm for serial scheduled min-sum decoding that reduces the number of check nodes to process during an iteration. The check nodes to skip are chosen based on the reliability, a syndrome and a log-likelihood-ratio (LLR) value, of the incoming messages. The proposed algorithm is evaluated by computer simulations and shown to reduce the decoding complexity about 20% compared with a conventional serial scheduled min-sum decoding with small fractional decibel degradation in error correction performance.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E92-A No.10 pp.2411-2417
- Publication Date
- 2009/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E92.A.2411
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Coding Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hironori UCHIKAWA, Kohsuke HARADA, "Complexity-Reducing Algorithm for Serial Scheduled Min-Sum Decoding of LDPC Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E92-A, no. 10, pp. 2411-2417, October 2009, doi: 10.1587/transfun.E92.A.2411.
Abstract: We propose a complexity-reducing algorithm for serial scheduled min-sum decoding that reduces the number of check nodes to process during an iteration. The check nodes to skip are chosen based on the reliability, a syndrome and a log-likelihood-ratio (LLR) value, of the incoming messages. The proposed algorithm is evaluated by computer simulations and shown to reduce the decoding complexity about 20% compared with a conventional serial scheduled min-sum decoding with small fractional decibel degradation in error correction performance.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E92.A.2411/_p
Copy
@ARTICLE{e92-a_10_2411,
author={Hironori UCHIKAWA, Kohsuke HARADA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Complexity-Reducing Algorithm for Serial Scheduled Min-Sum Decoding of LDPC Codes},
year={2009},
volume={E92-A},
number={10},
pages={2411-2417},
abstract={We propose a complexity-reducing algorithm for serial scheduled min-sum decoding that reduces the number of check nodes to process during an iteration. The check nodes to skip are chosen based on the reliability, a syndrome and a log-likelihood-ratio (LLR) value, of the incoming messages. The proposed algorithm is evaluated by computer simulations and shown to reduce the decoding complexity about 20% compared with a conventional serial scheduled min-sum decoding with small fractional decibel degradation in error correction performance.},
keywords={},
doi={10.1587/transfun.E92.A.2411},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - Complexity-Reducing Algorithm for Serial Scheduled Min-Sum Decoding of LDPC Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2411
EP - 2417
AU - Hironori UCHIKAWA
AU - Kohsuke HARADA
PY - 2009
DO - 10.1587/transfun.E92.A.2411
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E92-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2009
AB - We propose a complexity-reducing algorithm for serial scheduled min-sum decoding that reduces the number of check nodes to process during an iteration. The check nodes to skip are chosen based on the reliability, a syndrome and a log-likelihood-ratio (LLR) value, of the incoming messages. The proposed algorithm is evaluated by computer simulations and shown to reduce the decoding complexity about 20% compared with a conventional serial scheduled min-sum decoding with small fractional decibel degradation in error correction performance.
ER -
English
