An upper bound on frame error rate (FER) for generalized concatenated convolutional codes (GCCC's) with iterative decoding is presented. The GCCC is a generalized concatenated code which consists of an inner binary convolutional code and outer Reed-Solomon codes. The FER bound is derived from the average weight enumerator of the inner code. We can optimize the configuration of the outer code since the FER bound can be easily computed. Some optimum outer code profiles will be shown. The results show that combination of GCCC and iterative decoding attains fairly small frame error probability (PB
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
Tadashi WADAYAMA, Koichiro WAKASUGI, Masao KASAHARA, "An Upper Bound on Frame Error Rate for Generalized Concatenated Convolutional Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E82-A, no. 6, pp. 1126-1130, June 1999, doi: .
Abstract: An upper bound on frame error rate (FER) for generalized concatenated convolutional codes (GCCC's) with iterative decoding is presented. The GCCC is a generalized concatenated code which consists of an inner binary convolutional code and outer Reed-Solomon codes. The FER bound is derived from the average weight enumerator of the inner code. We can optimize the configuration of the outer code since the FER bound can be easily computed. Some optimum outer code profiles will be shown. The results show that combination of GCCC and iterative decoding attains fairly small frame error probability (PB
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e82-a_6_1126/_p
Copy
@ARTICLE{e82-a_6_1126,
author={Tadashi WADAYAMA, Koichiro WAKASUGI, Masao KASAHARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Upper Bound on Frame Error Rate for Generalized Concatenated Convolutional Codes},
year={1999},
volume={E82-A},
number={6},
pages={1126-1130},
abstract={An upper bound on frame error rate (FER) for generalized concatenated convolutional codes (GCCC's) with iterative decoding is presented. The GCCC is a generalized concatenated code which consists of an inner binary convolutional code and outer Reed-Solomon codes. The FER bound is derived from the average weight enumerator of the inner code. We can optimize the configuration of the outer code since the FER bound can be easily computed. Some optimum outer code profiles will be shown. The results show that combination of GCCC and iterative decoding attains fairly small frame error probability (PB
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - An Upper Bound on Frame Error Rate for Generalized Concatenated Convolutional Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1126
EP - 1130
AU - Tadashi WADAYAMA
AU - Koichiro WAKASUGI
AU - Masao KASAHARA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E82-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 1999
AB - An upper bound on frame error rate (FER) for generalized concatenated convolutional codes (GCCC's) with iterative decoding is presented. The GCCC is a generalized concatenated code which consists of an inner binary convolutional code and outer Reed-Solomon codes. The FER bound is derived from the average weight enumerator of the inner code. We can optimize the configuration of the outer code since the FER bound can be easily computed. Some optimum outer code profiles will be shown. The results show that combination of GCCC and iterative decoding attains fairly small frame error probability (PB
ER -