An Upper Bound on Bit Error Rate for Concatenated Convolutional Code

Tadashi WADAYAMA  Koichiro WAKASUGI  Masao KASAHARA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E80-A   No.11   pp.2123-2129
Publication Date: 1997/11/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
concatenated code,  convolutional code,  interleave,  Reed-Solomon code,  burst correction,  

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




Summary: 
This paper presents a new upper bound on overall bit error rate (BER) for a concatenated code which consists of an inner convolutional code and an outer interleaved Reed-Solomon code. The upper bound on BER is derived based on a lower bound on the effective minimum distance of the concatenated code. This upper bound can be used for the cases when the interleaver size is small such that the conventional upper bound is not applicable.