Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure
Summary :
In this letter, we show the effectiveness of a double-loop algorithm based on the concave-convex procedure (CCCP) in decoding linear codes. For this purpose, we numerically compare the error performance of CCCP-based decoding algorithm with that of a conventional iterative decoding algorithm based on belief propagation (BP). We also investigate computational complexity and its relation to the error performance.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.10 pp.2601-2606
- Publication Date
- 2003/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (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
Tomoharu SHIBUYA, Kohichi SAKANIWA, "Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure" in IEICE TRANSACTIONS on Fundamentals,
vol. E86-A, no. 10, pp. 2601-2606, October 2003, doi: .
Abstract: In this letter, we show the effectiveness of a double-loop algorithm based on the concave-convex procedure (CCCP) in decoding linear codes. For this purpose, we numerically compare the error performance of CCCP-based decoding algorithm with that of a conventional iterative decoding algorithm based on belief propagation (BP). We also investigate computational complexity and its relation to the error performance.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_10_2601/_p
Copy
@ARTICLE{e86-a_10_2601,
author={Tomoharu SHIBUYA, Kohichi SAKANIWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure},
year={2003},
volume={E86-A},
number={10},
pages={2601-2606},
abstract={In this letter, we show the effectiveness of a double-loop algorithm based on the concave-convex procedure (CCCP) in decoding linear codes. For this purpose, we numerically compare the error performance of CCCP-based decoding algorithm with that of a conventional iterative decoding algorithm based on belief propagation (BP). We also investigate computational complexity and its relation to the error performance.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2601
EP - 2606
AU - Tomoharu SHIBUYA
AU - Kohichi SAKANIWA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2003
AB - In this letter, we show the effectiveness of a double-loop algorithm based on the concave-convex procedure (CCCP) in decoding linear codes. For this purpose, we numerically compare the error performance of CCCP-based decoding algorithm with that of a conventional iterative decoding algorithm based on belief propagation (BP). We also investigate computational complexity and its relation to the error performance.
ER -
English
