Permutation models for B3G turbo codes

Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany

Proceedings: TURBO - CODING - 2006

Pages: 5Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Saouter, Yannick (GET-ENST Bretagne PRACOM-TAMCIC (CNRS 2872), Technopôle Brest-Iroise - CS 83818 - 29238 Brest Cedex 3, France)

Various models have been proposed for the design of interleavers for turbo code systems. Most of them require to be implemented as lookup tables. In this article, we apply the former Almost Regular Permutation for the case of binary codes. This model obtains slightly better error correcting performance than the standard 3G model and is easier to implement especially in the prospect of high speed decoding. Thus it might be a good candidate for arising B3G (Beyond 3G) technologies.