Iterative Decoding Based on the Concave-Convex Procedure
Summary :
New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.5 pp.1346-1364
- Publication Date
- 2005/05/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.5.1346
- Type of Manuscript
- PAPER
- 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, Ken HARADA, Ryosuke TOHYAMA, Kohichi SAKANIWA, "Iterative Decoding Based on the Concave-Convex Procedure" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 5, pp. 1346-1364, May 2005, doi: 10.1093/ietfec/e88-a.5.1346.
Abstract: New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.5.1346/_p
Copy
@ARTICLE{e88-a_5_1346,
author={Tomoharu SHIBUYA, Ken HARADA, Ryosuke TOHYAMA, Kohichi SAKANIWA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Iterative Decoding Based on the Concave-Convex Procedure},
year={2005},
volume={E88-A},
number={5},
pages={1346-1364},
abstract={New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding.},
keywords={},
doi={10.1093/ietfec/e88-a.5.1346},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - Iterative Decoding Based on the Concave-Convex Procedure
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1346
EP - 1364
AU - Tomoharu SHIBUYA
AU - Ken HARADA
AU - Ryosuke TOHYAMA
AU - Kohichi SAKANIWA
PY - 2005
DO - 10.1093/ietfec/e88-a.5.1346
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2005
AB - New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding.
ER -
English
