On the Analysis and Design of Good Algebraic Interleavers

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: 6Language: englishTyp: PDF

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

Xie, Kai; Li, Jing (Electrical and Computer Engineering Dept, Lehigh University, Bethlehem, 18015)
Wang, Wenbo (School of Telecom. Engineering, Beijing U of Posts & Telecom., Beijing, P.R. China, 100876)

This paper analyzes, classifies and searches for good coprime interleavers using the recently-developed metric of cycle correlation sum (CCS). A subset of good coprime interleavers, referred to as regular coprime interleavers, are identified and formulated. It is shown that regular coprime interleavers perform as well as random interleavers, but can be generated on-the-fly using virtually no parameters. Another subset of coprime interleavers, referred to as linear coprime interleavers, comprise some of the best (short-length) interleavers including the Golden prime interleaver. Comparison of these coprime interleavers with the Welch-Costas interleavers, the Takeshita-Costello interleavers, random interleavers and S-random interleavers is performed through CCS evaluation, graph presentation and computer simulations.