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.
LDPC, MRC, Reed-Solomon, SPC, turbo
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.
Copy
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
Copy
@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},}
Copy
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 -