The Minimum Distance of Turbo-Like Codes

被引：12
|
作者：
Bazzi, Louay [1 ]
Mahdian, Mohammad [4 ]
Spielman, Daniel A. [2 ,3 ]
机构：
[1] Amer Univ Beirut, Dept Elect & Comp Engn, Beirut, Lebanon
[2] Yale Univ, Dept Comp Sci, New Haven, CT 06520 USA
[3] Yale Univ, Program Appl Math, New Haven, CT 06520 USA
[4] Yahoo Res, Santa Clara, CA 95054 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2009年 / 55卷 / 01期
关键词：
Asymptotic growth; concatenated codes; minimum distance; repeat-accumulate-accumulate (RAA) codes; turbo codes; SERIAL CONCATENATION;
D O I：
10.1109/TIT.2008.2008114
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Worst-case upper bounds are derived on the minimum distance of parallel concatenated turbo codes, serially concatenated convolutional codes, repeat-accumulate codes, repeat-convolute codes, and generalizations of these codes obtained by allowing nonlinear and large-memory constituent codes. It is shown that parallel-concatenated turbo codes and repeat-convolute codes with sub-linear memory are asymptotically bad. It is also shown that depth-two serially concatenated codes with constant-memory outer codes and sublinear-memory inner codes are asymptotically bad. Most of these upper bounds hold even when the convolutional encoders are replaced by general finite-state automata encoders. In contrast, it is proven that depth-three serially concatenated codes obtained by concatenating a repetition code with two accumulator codes through random permutations can be asymptotically good.
引用
收藏
页码：6 / 15
页数：10
相关论文
共 50 条
  • [31] A class of turbo-like LDPC codes and their decoding based on neural network
    Zhao, ZJ
    Wu, XJ
    Yang, J
    IEEE 2005 International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications Proceedings, Vols 1 and 2, 2005, : 961 - 965
  • [32] Turbo-like MIMO systems with and without space-time codes
    Gonzalez-Lopez, M.
    Vazquez-Araujo, F. J.
    Castedo, L.
    Garcia-Frias, J.
    2007 9TH INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND ITS APPLICATIONS, VOLS 1-3, 2007, : 1427 - +
  • [33] Bounding performance of LDPC codes and turbo-like codes for IEEE 802.16 broadband wireless Internet
    Chung, Kyuhyuk
    Heo, Jun
    FRONTIERS OF HIGH PERFORMANCE COMPUTING AND NETWORKING - ISPA 2006 WORKSHOPS, PROCEEDINGS, 2006, 4331 : 1044 - +
  • [34] New upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 313 - 313
  • [35] A new upper bound on the minimum distance of turbo codes
    Perotti, A
    Benedetto, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (12) : 2985 - 2997
  • [36] A logarithmic upper bound on the minimum distance of turbo codes
    Breiling, M
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) : 1692 - 1710
  • [37] A Construction of Turbo-Like Codes for Iterative Channel Estimation Based on Probabilistic Bias
    Takeuchi, Keigo
    Muller, Ralf R.
    Vehkapera, Mikko
    2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011), 2011,
  • [38] Distributed Turbo-Like Codes for Multi-User Cooperative Relay Networks
    Youssef, Roua
    Amat, Alexandre Graell I.
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [39] On Gallager bounding technique with applications to turbo-like codes over fading channels
    Sason, I
    Shamai, S
    21ST IEEE CONVENTION OF THE ELECTRICAL AND ELECTRONIC ENGINEERS IN ISRAEL - IEEE PROCEEDINGS, 2000, : 431 - 434
  • [40] On the suboptimality of iterative decoding for turbo-like and LDPC codes with cycles in their graph representation
    Isaka, M
    Fossorier, MPC
    Imai, H
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (05) : 845 - 854
12345