A logarithmic upper bound on the minimum distance of turbo codes

被引：44
|
作者：
Breiling, M [1 ]
机构：
[1] Univ Erlangen Nurnberg, Lehrstuhl Nachrichtentech 2, D-8520 Erlangen, Germany
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2004年 / 50卷 / 08期
关键词：
interleaver design; minimum-distance bounds; turbo code;
D O I：
10.1109/TIT.2004.831763
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We derive new upper bounds on the minimum distance, which turbo codes can maximally attain with the optimum interleaver of a given length. The new bounds grow approximately logarithmically with the interleaver length, and they are tighter than all previously derived bounds for medium-length and long interleavers. An extensive discussion highlights the impacts of the new bounds in the context of interleaver design and provides some new design guidelines.
引用
收藏
页码：1692 / 1710
页数：19
相关论文
共 50 条
  • [1] Upper bound on the minimum distance of turbo codes
    Breiling, M
    Huber, JB
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2001, 49 (05) : 808 - 815
  • [2] A new upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) : 2985 - 2997
  • [3] New upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 313 - 313
  • [4] On the minimum distance of turbo codes
    Truhachev, D
    Lentmaier, M
    Wintzell, O
    Zigangirov, KS
    [J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 84 - 84
  • [5] Upper bounds on the minimum distance for turbo codes using CPP interleavers
    Lucian Trifina
    Daniela Tarniceriu
    Jonghoon Ryu
    Ana-Mirela Rotopanescu
    [J]. Telecommunication Systems, 2021, 76 : 423 - 447
  • [6] Upper bounds on the minimum distance for turbo codes using CPP interleavers
    Trifina, Lucian
    Tarniceriu, Daniela
    Ryu, Jonghoon
    Rotopanescu, Ana-Mirela
    [J]. TELECOMMUNICATION SYSTEMS, 2021, 76 (03) : 423 - 447
  • [7] An upper bound on the minimum distance of serially concatenated convolutional codes
    Perotti, Alberto
    Benedetto, Sergio
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) : 5501 - 5509
  • [8] New upper bound for binary codes with minimum distance four
    Kim, JK
    Hahn, SG
    [J]. DISCRETE MATHEMATICS, 1998, 187 (1-3) : 291 - 295
  • [9] An upper bound on the minimum distance of serially concatenated convolutional codes
    Perotti, A
    Benedetto, S
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 314 - 314
  • [10] Further upper bounds on the minimum distance for turbo codes using CPP interleavers
    Trifina, Lucian
    Tarniceriu, Daniela
    Ryu, Jonghoon
    Rotopanescu, Ana-Mirela
    [J]. PHYSICAL COMMUNICATION, 2020, 43
12345