DocumentCode :
1491236
Title :
Upper bound on the minimum distance of turbo codes
Author :
Breiling, Marco ; Huber, Johannes B.
Author_Institution :
Lehrstuhl fur Nachrichtentech. II, Erlangen-Nurnberg Univ., Germany
Volume :
49
Issue :
5
fYear :
2001
fDate :
5/1/2001 12:00:00 AM
Firstpage :
808
Lastpage :
815
Abstract :
An upper bound on the minimum distance of turbo codes is derived, which depends only on the interleaver length and the component scramblers employed. The derivation of this bound considers exclusively turbo encoder input words of weight 2. The bound does not only hold for a particular interleaver but for all possible interleavers including the best. It is shown that in contrast to general linear binary codes the minimum distance of turbo codes cannot grow stronger than the square root of the block length. This implies that turbo codes are asymptotically bad. A rigorous proof for the bound is provided, which is based on a geometric approach
Keywords :
turbo codes; block length; component scramblers; geometric approach; interleaver length; minimum distance; turbo codes; turbo encoder input words; upper bound; Algorithm design and analysis; Binary codes; Bit error rate; Communications Society; Concatenated codes; Hamming weight; Terminology; Turbo codes; Upper bound;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/26.923804
Filename :
923804
Link To Document :
بازگشت