Design of suitable permutations for irregular turbo codes
Résumé
The authors propose a method based on the Dijkstras algorithm and an estimation of the distance to search for efficient interleavers, adapted to irregular turbo codes, in order to reduce the flattening effect. Simulations show that a gain of three decades and a half in the error floor is obtained for short block sizes.