A new upper bound on the minimum distance of turbo codes

被引：17

作者：

Perotti, A ^{[1
]}

Benedetto, S ^{[1
]}

机构：

[1] Politecn Torino, CERCOM, I-10129 Turin, Italy

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2004年 / 50卷 / 12期

关键词：

minimum distance; performance bounds; permutations; turbo codes;

D O I：

10.1109/TIT.2004.838358

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, a new upper bound on the minimum distance of turbo codes is derived. The new bound is obtained by construction of an undirected graph which reflects the characteristics of the constituent codes and the interleaver. The resulting expression shows that the minimum distance of a turbo code grows approximately with the base-3 logarithm of the information word length. The new bound is easy to compute, applies to rate k(o)/n(o) constituent encoders, and often improves over existing results.

引用

页码：2985 / 2997

页数：13

共 17 条

[1] [Anonymous], 1993, INT C COMMUNICATIONS, DOI DOI 10.1109/ICC.1993.397441
[2] BAZZI L, MINIMUM DISTANCE TUR
[3] Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding
Benedetto, S
Divsalar, D
Montorsi, G
Pollara, F
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) : 909 - 926
[4] Unveiling turbo codes: Some results on parallel concatenated coding schemes
Benedetto, S
Montorsi, G
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) : 409 - 428
[5] The advantages of non-binary turbo codes
Berrou, C
Jézéquel, M
Douillard, C
Kerouédan, S
[J]. 2001 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2001, : 61 - 63
[6] BIGGS N, 1998, ELECT J COMBIN, V5
[7] A logarithmic upper bound on the minimum distance of turbo codes
Breiling, M
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) : 1692 - 1710
[8] Combinatorial analysis of the minimum distance of turbo codes
Breiling, M
Huber, JB
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) : 2737 - 2750
[9] Upper bound on the minimum distance of turbo codes
Breiling, M
Huber, JB
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (05) : 808 - 815
[10] DOLINAR S, 1995, TDA PROGR REPORT, V42, P56

← 1 2 →