Ant colony algorithm for finding good interleaving pattern in turbo codes

被引：4

作者：

Hoshyar, R ^{[1
]}

Jamali, SH ^{[1
]}

Locus, C ^{[1
]}

机构：

[1] Univ Tehran, Dept Elect & Comp Engn, Tehran, Iran

来源：

IEE PROCEEDINGS-COMMUNICATIONS | 2000年 / 147卷 / 05期

关键词：

D O I：

10.1049/ip-com:20000446

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

The excellent performance of recently proposed turbo codes depends strongly on their interleaver pattern. Exhaustive searching for a good interleaving pattern is a very difficult task, growing in the order of N!, where N is the interleaver size. The authors present a modified version of the ant colony system (ACS) algorithm for finding good interleaver patterns used in turbo codes. By defining an approximate evaluation method for turbo codes with specified interleaver patterns, a fitness function for use in the modified ACS algorithm is obtained. The simulation results show gains up to 0.7dB with sizes of 50 and 100 for the interleavers found by the ACS algorithm compared with the randomly generated interleavers.

引用

页码：257 / 262

页数：6

共 8 条

[1] Punctured turbo-codes for BPSK/QPSK channels [J].

Açikel, OF ;

Ryan, WE .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (09) :1315-1323

[2]

BENDETTO S, 1996, 42127 TEL DAT ACQ PR

[3]

BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109/ICC.1993.397441

[4] Design of interleavers for turbo codes: Iterative interleaver growth algorithms of polynomial complexity [J].

Daneshgaran, F ;

Mondin, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) :1845-1859

[5]

DIVSALAR D, 1999, 42139 TMO

[6]

Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892

[7] Iterative decoding of binary block and convolutional codes [J].

Hagenauer, J ;

Offer, E ;

Papke, L .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) :429-445

[8]

Viterbi A., 1995, CDMA: Principles of Spread Spectrum Communication

← 1 →