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
이 편지는 외부 코드가 단일 패리티 검사(SPC) 코드인 연결 코드에 대한 간단한 반복 디코딩 알고리즘을 제안합니다. 잘못된 내부 코드워드는 MRC(Maximum Ratio Combining)를 통해 반복적으로 결합된 후 다시 디코딩됩니다. RS 외부 코드 연결을 대수적으로 복호화하여 삭제된 부분을 복구하는 기존 방식에 비해 제안 방식은 MRC 처리로 인해 더 나은 성능을 갖는다. 반면, 제안된 방식은 선형 결합이 대수적 디코딩보다 간단하고 MRC 이득이 내부 디코더에 대한 요구 사항을 느슨하게 할 수 있기 때문에 덜 복잡합니다.
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.
부
Xiaogang CHEN, Hongwen YANG, "Iterative Decoding of SPC Outer Coded Concatenation Codes with Maximal Ratio Combining" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 9, pp. 2983-2986, September 2008, doi: 10.1093/ietcom/e91-b.9.2983.
Abstract: This letter proposes a simple iterative decoding algorithm for the concatenation codes where the outer code is single-parity-check (SPC) code. The erroneous inner codewords are iteratively combined with maximum ratio combining (MRC) and then re-decoded. Compared with the conventional scheme where the RS outer code concatenation is algebraically decoded to recover the erasures, the proposed scheme has better performance due to MRC processing. On the other hand, the proposed scheme is less complex because the linear combination is simpler than algebraical decoding and the MRC gain can loose the requirement for inner decoder.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.9.2983/_p
부
@ARTICLE{e91-b_9_2983,
author={Xiaogang CHEN, Hongwen YANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Iterative Decoding of SPC Outer Coded Concatenation Codes with Maximal Ratio Combining},
year={2008},
volume={E91-B},
number={9},
pages={2983-2986},
abstract={This letter proposes a simple iterative decoding algorithm for the concatenation codes where the outer code is single-parity-check (SPC) code. The erroneous inner codewords are iteratively combined with maximum ratio combining (MRC) and then re-decoded. Compared with the conventional scheme where the RS outer code concatenation is algebraically decoded to recover the erasures, the proposed scheme has better performance due to MRC processing. On the other hand, the proposed scheme is less complex because the linear combination is simpler than algebraical decoding and the MRC gain can loose the requirement for inner decoder.},
keywords={},
doi={10.1093/ietcom/e91-b.9.2983},
ISSN={1745-1345},
month={September},}
부
TY - JOUR
TI - Iterative Decoding of SPC Outer Coded Concatenation Codes with Maximal Ratio Combining
T2 - IEICE TRANSACTIONS on Communications
SP - 2983
EP - 2986
AU - Xiaogang CHEN
AU - Hongwen YANG
PY - 2008
DO - 10.1093/ietcom/e91-b.9.2983
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2008
AB - This letter proposes a simple iterative decoding algorithm for the concatenation codes where the outer code is single-parity-check (SPC) code. The erroneous inner codewords are iteratively combined with maximum ratio combining (MRC) and then re-decoded. Compared with the conventional scheme where the RS outer code concatenation is algebraically decoded to recover the erasures, the proposed scheme has better performance due to MRC processing. On the other hand, the proposed scheme is less complex because the linear combination is simpler than algebraical decoding and the MRC gain can loose the requirement for inner decoder.
ER -