By Topic

Ant colony algorithm for finding good interleaving pattern in turbo codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. Hoshyar ; Dept. of Electr. & Comput. Eng., Tehran Univ., Iran ; S. H. Jamali ; C. Locus

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.7 dB with sizes of 50 and 100 for the interleavers found by the ACS algorithm compared with the randomly generated interleavers

Published in:

IEE Proceedings - Communications  (Volume:147 ,  Issue: 5 )