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
São apresentados novos algoritmos para decodificação MAP (também conhecido como APP) e decodificação MAX-LogMAP de códigos de blocos lineares. Os algoritmos são desenvolvidos com base nas propriedades estruturais dos códigos de blocos lineares e conseguem reduzir a complexidade da decodificação sem degradar o desempenho do erro. Os algoritmos propostos são adequados para o processamento paralelo e em pipeline, o que melhora o rendimento do decodificador. Para avaliar a complexidade de decodificação dos algoritmos propostos, são apresentados resultados de simulação para alguns códigos bem conhecidos. Os resultados mostram que os algoritmos são especialmente eficientes do que os algoritmos convencionais baseados em BCJR para códigos cuja taxa é relativamente baixa.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -