IEICE TRANSACTIONS on Fundamentals
A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code
Summary :
A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.12 pp.3306-3309
- Publication Date
- 2003/12/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Information 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
Toshiyuki ISHIDA, Yuichi KAJI, "A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code" in IEICE TRANSACTIONS on Fundamentals,
vol. E86-A, no. 12, pp. 3306-3309, December 2003, doi: .
Abstract: A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_12_3306/_p
Copy
@ARTICLE{e86-a_12_3306,
author={Toshiyuki ISHIDA, Yuichi KAJI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code},
year={2003},
volume={E86-A},
number={12},
pages={3306-3309},
abstract={A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A Call-by-Need Recursive Algorithm for the LogMAP Decoding of a Binary Linear Block Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3306
EP - 3309
AU - Toshiyuki ISHIDA
AU - Yuichi KAJI
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2003
AB - A new algorithm for the LogMAP decoding of linear block codes is considered. The decoding complexity is evaluated analytically and by computer simulation. The proposed algorithm is an improvement of the recursive LogMAP algorithm proposed by the authors. The recursive LogMAP algorithm is more efficient than the BCJR algorithm for low-rate codes, but the complexity grows considerably large for high-rate codes. The aim of the proposed algorithm is to solve the complexity explosion of the recursive LogMAP algorithm for high-rate codes. The proposed algorithm is more efficient than the BCJR algorithm for well-known linear block codes.
ER -
English
