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 条

[1] Spatially Coupled Turbo-Like Codes
Moloudi, Saeedeh
Lentmaier, Michael
Amat, Alexandre Graell I.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2017, 63 (10) : 6199 - 6215
[2] Turbo and turbo-like codes: Principles and applications in telecommunications
Gracie, Ken
Hamon, Marie-Helene
PROCEEDINGS OF THE IEEE, 2007, 95 (06) : 1228 - 1254
[3] A comparison of low complexity turbo-like codes
Costello, DJ
Banerjee, A
He, C
Massey, PC
THIRTY-SIXTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS - CONFERENCE RECORD, VOLS 1 AND 2, CONFERENCE RECORD, 2002, : 16 - 20
[4] Design of Turbo-Like Codes for Short Frames
Yang, Fan
Luo, Zhendong
Tian, Baoyu
Li, Yubai
IEEE COMMUNICATIONS LETTERS, 2010, 14 (02) : 172 - 174
[5] General coding theorems for turbo-like codes
Jin, H
McEliece, RJ
2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 120 - 120
[6] Wheel codes: Turbo-like codes on graphs of small order
Radebaugh, C
Koetter, R
Powell, C
2003 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2003, : 78 - 81
[7] On the minimum distance of turbo codes
Truhachev, D
Lentmaier, M
Wintzell, O
Zigangirov, KS
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 84 - 84
[8] Braided Convolutional Codes: A New Class of Turbo-Like Codes
Zhang, Wei
Lentmaier, Michael
Zigangirov, Kamil Sh.
Costello, Daniel J., Jr.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) : 316 - 331
[9] New low-complexity turbo-like codes
Massey, PC
Costello, DJ
2001 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, 2001, : 70 - 72
[10] Turbo-like codes for the block-fading channel
Fàbregas, AG
Caire, G
2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 375 - 375

← 1 2 3 4 5 →