A Contention-Free Parallel Access by Butterfly Networks for Turbo Interleavers

A theoretical foundation for any turbo interleaver to be a contention-free interleaver to access data in parallel by a butterfly network is presented. A contention-free parallel access of multiple memories in parallel plays a crucial role for implementing high speed turbo decoders for high data rate applications. The presented theoretical analysis shows that a butterfly network has a sufficiently rich permutation structure to be a routing network between parallel decoder units and multiple memories. Thus turbo code design is independent of the designing of a contention-free parallel access by butterfly networks. In particular, a turbo interleaver needs not to provide a built-in contention-free parallel access for any parallel access by butterfly networks. We demonstrate how to apply this theory to turbo interleavers widely used in commercial telecommunication standards.

[1]  Tomás Lang,et al.  Interconnections Between Processors and Memory Modules Using the Shuffle-Exchange Network , 1976, IEEE Transactions on Computers.

[2]  Sergio Benedetto,et al.  Design issues on the parallel implementation of versatile, highspeed iterative decoders , 2006 .

[3]  Amer Baghdadi,et al.  Butterfly and Benes-Based on-Chip Communication Networks for Multiprocessor Turbo Decoding , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[4]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[5]  Sartaj Sahni,et al.  A Self-Routing Benes Network and Parallel Permutation Algorithms , 1981, IEEE Transactions on Computers.

[6]  Sergio Benedetto,et al.  Further results on mapping functions , 2005, IEEE Information Theory Workshop, 2005..

[7]  Oscar Y. Takeshita,et al.  On maximum contention-free interleavers and permutation polynomials over integer rings , 2005, IEEE Transactions on Information Theory.

[8]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[9]  E·J·尼米南.  Extended turbo interleavers for parallel turbo decoding , 2010 .

[10]  Shimon Even,et al.  Some compact layouts of the butterfly , 1999, SPAA '99.

[11]  Claude Berrou,et al.  Designing good permutations for turbo codes: towards a single model , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[12]  Claude Berrou,et al.  Turbo codes with rate-m/(m+1) constituent convolutional codes , 2005, IEEE Transactions on Communications.

[13]  Jyrki Lahtonen,et al.  On the Degree of the Inverse of Quadratic Permutation Polynomial Interleavers , 2010, IEEE Transactions on Information Theory.

[14]  Sergio Benedetto,et al.  Mapping interleaving laws to parallel turbo decoder architectures , 2004, IEEE Communications Letters.

[15]  Tse-Yun Feng,et al.  The Universality of the Shuffle-Exchange Network , 1981, IEEE Transactions on Computers.

[16]  Sergio Benedetto,et al.  Mapping interleaving laws to parallel turbo and LDPC decoder architectures , 2004, IEEE Transactions on Information Theory.

[17]  Guido Masera,et al.  Interconnection framework for high-throughput, flexible LDPC decoders , 2006, Proceedings of the Design Automation & Test in Europe Conference.