Design of interleavers for turbo codes: Iterative interleaver growth algorithms of polynomial complexity

被引:21
作者
Daneshgaran, F [1 ]
Mondin, M
机构
[1] Calif State Univ Los Angeles, Dept Elect & Comp Engn, Los Angeles, CA 90032 USA
[2] Politecn Torino, Dipartimento Elettr, I-10129 Turin, Italy
关键词
interleavers; iterative algorithms; optimization; permutations; turbo codes;
D O I
10.1109/18.782105
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses the problem of designing interleavers for parallel concatenated convolutional codes (PCCC's) tailored to specific constituent codes. We start by establishing the role of the interleaver in the PCCC and the various parameters that influence the performance of the PCCC with a given interleaver, Subsequently, we define a canonical form of the interleaving engine denoted as the finite-state pc rmuter (FSP) and demonstrate the minimal delay property of this canonical form, For any given permutation, we present a procedure for deriving the canonical FSP engine, We address the issue of implementation of the FSP and propose a very simple structure for the FSP, Next, using the structural property of the FSP engine, we develop a systematic iterative technique for construction of interleavers with a complexity that is polynomial in the interleaver size. Subsequently, we develop a cost function that, coupled with the iterative interleaver growth procedure, can be used to design optimized interleavers for PCCC's, We provide examples of application of the interleaver design technique, and compare the designed interleavers with some of the interleavers of comparable size found in the literature.
引用
收藏
页码:1845 / 1859
页数:15
相关论文
共 21 条
[1]  
ANDERSEN JD, 1997, P INT S TURB COD REL, P154
[2]  
[Anonymous], 1993, PROC IEEE INT C COMM, DOI 10.1109/ICC.1993.397441
[3]   OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].
BAHL, LR ;
COCKE, J ;
JELINEK, F ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287
[4]   INTERLEAVER DESIGN FOR TURBO CODES [J].
BARBULESCU, AS ;
PIETROBON, SS .
ELECTRONICS LETTERS, 1994, 30 (25) :2107-2108
[5]   TERMINATING THE TRELLIS OF TURBO-CODES IN THE SAME STATE [J].
BARBULESCU, AS ;
PIETROBON, SS .
ELECTRONICS LETTERS, 1995, 31 (01) :22-23
[6]   Design of parallel concatenated convolutional codes [J].
Benedetto, S ;
Montorsi, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1996, 44 (05) :591-600
[7]   Unveiling turbo codes: Some results on parallel concatenated coding schemes [J].
Benedetto, S ;
Montorsi, G .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) :409-428
[8]   Near optimum error correcting coding and decoding: Turbo-codes [J].
Berrou, C ;
Glavieux, A .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1996, 44 (10) :1261-1271
[9]  
CHI D, 1992, P 1992 IEEE MIL COMM, P799
[10]  
Daneshgaran F., 1997, P INT S TURB COD REL, P251