The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
선형 블록 코드의 MAP(APP라고도 함) 디코딩 및 MAX-LogMAP 디코딩을 위한 새로운 알고리즘이 제시됩니다. 알고리즘은 선형 블록 코드의 구조적 특성을 기반으로 고안되었으며 오류 성능을 저하시키지 않으면서 디코딩 복잡성을 줄이는 데 성공합니다. 제안된 알고리즘은 디코더의 처리량을 향상시키는 병렬 및 파이프라인 처리에 적합합니다. 제안된 알고리즘의 디코딩 복잡도를 평가하기 위해 잘 알려진 일부 코드에 대한 시뮬레이션 결과를 제시합니다. 결과는 알고리즘이 상대적으로 낮은 속도의 코드에 대해 기존 BCJR 기반 알고리즘보다 특히 효율적이라는 것을 보여줍니다.
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.
부
Yuichi KAJI, Ryujiro SHIBUYA, Toru FUJIWARA, Tadao KASAMI, Shu LIN, "MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 10, pp. 1884-1890, October 2000, doi: .
Abstract: New algorithms for the MAP (also known as the APP) decoding and the MAX-LogMAP decoding of linear block codes are presented. The algorithms are devised based on the structural properties of linear block codes, and succeeds in reducing the decoding complexity without degrading the error performance. The proposed algorithms are suitable for the parallel and pipeline processing which improves the throughput of the decoder. To evaluate the decoding complexity of the proposed algorithms, simulation results for some well-known codes are presented. The results show that the algorithms are especially efficient than the conventional BCJR-based algorithms for codes whose rate are relatively low.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_10_1884/_p
부
@ARTICLE{e83-a_10_1884,
author={Yuichi KAJI, Ryujiro SHIBUYA, Toru FUJIWARA, Tadao KASAMI, Shu LIN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure},
year={2000},
volume={E83-A},
number={10},
pages={1884-1890},
abstract={New algorithms for the MAP (also known as the APP) decoding and the MAX-LogMAP decoding of linear block codes are presented. The algorithms are devised based on the structural properties of linear block codes, and succeeds in reducing the decoding complexity without degrading the error performance. The proposed algorithms are suitable for the parallel and pipeline processing which improves the throughput of the decoder. To evaluate the decoding complexity of the proposed algorithms, simulation results for some well-known codes are presented. The results show that the algorithms are especially efficient than the conventional BCJR-based algorithms for codes whose rate are relatively low.},
keywords={},
doi={},
ISSN={},
month={October},}
부
TY - JOUR
TI - MAP and LogMAP Decoding Algorithms for Linear Block Codes Using a Code Structure
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1884
EP - 1890
AU - Yuichi KAJI
AU - Ryujiro SHIBUYA
AU - Toru FUJIWARA
AU - Tadao KASAMI
AU - Shu LIN
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2000
AB - New algorithms for the MAP (also known as the APP) decoding and the MAX-LogMAP decoding of linear block codes are presented. The algorithms are devised based on the structural properties of linear block codes, and succeeds in reducing the decoding complexity without degrading the error performance. The proposed algorithms are suitable for the parallel and pipeline processing which improves the throughput of the decoder. To evaluate the decoding complexity of the proposed algorithms, simulation results for some well-known codes are presented. The results show that the algorithms are especially efficient than the conventional BCJR-based algorithms for codes whose rate are relatively low.
ER -