An Upper Bound on Frame Error Rate for Generalized Concatenated Convolutional Codes


IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E82-A   No.6   pp.1126-1130
Publication Date: 1999/06/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Information Theory and Coding Theory
generalized concatenated code,  convolutional code,  frame error rate,  iterative decoding,  

Full Text: PDF(173.3KB)>>
Buy this Article

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 10-13, Eb/N0 = 6 dB) with relatively simple component code (16-state convolutional code and Reed-Solomon code of length 32).