On maximum contention-free interleavers and permutation polynomials over integer rings

IEEE Transactions on Information Theory

Volumn 52, Issue 3, 2006, Pages 1249-1253

  Takeshita, Oscar Y ^a,b  

^a IEEE   (United States)

^b Ohio State University   (United States)

Author keywords

Algebraic; Contention free; Interleaver; Parallel processing; Permutation polynomial; Quadratic; Turbo code

Indexed keywords

CONTENTION FREE; INTERLEAVER; PERMUTATION POLYNOMIAL;

CHANNEL CODING; COMPUTER SIMULATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; QUADRATIC PROGRAMMING;

TURBO CODES;

EID: 33747786275     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.864450     Document Type: Article

References (26)

1. J. Sun and O. Y. Takeshita, "Interleavers for turbo codes using permutation polynomials over integer rings," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 101-119, Jan. 2005.
2. A. Nimbalker, T. K. Blankenship, B. Classon, T. E. Fuja, and D. J. Costello Jr., "Contention-free interleavers," in Proc. 2004 IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 54.
3. C. Berrou, S. K. Y. Saouter, C. Douillard, and M. Jézéquel, "Designing good permutations for turbo codes: Toward a single model," in Proc. Int. Conf. Communications, vol. 1, Paris, France, Jun. 2004, pp. 341-345.
4. C. J. Corrada-Bravo and I. Rubio, "Deterministic interleavers for turbo codes with random-like performance and simple implementation," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003.
5. A. Giulietti, L. van der Perre, and M. Strum, "Parallel turbo coding interleavers: Avoiding collisions in access to storage elements," IEE Electron. Lett., vol. 38, no. 5, pp. 232-234, Feb. 2002.
6. H. R. Sadjadpour, N. J. A. Sloane, M. Salehi, and O. Nebe, "Interleaver design for turbo codes," IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 831-837, May 2001.
7. O. Y. Takeshita and D. J. Costello Jr., "New deterministic interleaver designs for turbo codes," IEEE Trans. Inf. Theory, vol. 46, no. 6, pp. 1988-2006, Sep. 2000.
8. S. Crozier, J. Lodge, P. Guinand, and A. Hunt, "Performance of turbo codes with relative prime and golden interleaving strategies," in Proc. 6th Int. Mobile Satellite Conf. (IMSC'99), Ottawa, ON, Canada, Jun. 1999, pp. 268-275.
9. F. Daneshgaran and M. Mondin, "Design of interleaves for turbo codes: Iterative interleaver growth algorithms of polynomial complexity," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 1845-1859, Sep. 1999.
10. O. Y. Takeshita and D. J. Costello Jr., "On deterministic linear interleavers for turbo-codes," in Proc. 35th Annual Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 1997, pp. 711-712.
11. S. Dolinar and D. Divsalar, "Weight distribution of turbo codes using random and nonrandom permutations," JPL, TDA Progr. Rep. 42-122, Aug. 1995.
12. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, May 1993, pp. 1064-1070.
13. J. Ryu and O. Y. Takeshita, "On quadratic inverses for quadratic permutation polynomials over integer rings," IEEE Trans. Inf. Theory, to be published.
14. M. Cheng, M. Nakashima,J. Hamkins, B. Moision, and M. Barsoum,"A decoder architecture for high-speed free-space laser communications," in Proc. SPIE, vol. 5712, Apr. 2005, pp. 174-185.
15. R. Dobkin, M. Peleg, and R. Ginosar, "Parallel interleaver design and VLSI architecture for low-latency MAP turbo decoders," IEEE Trans. VLSI Syst., vol. 13. no. 4, pp. 427-438, Apr. 2005.
16. T. K. Blankenship, B. Classon, and V. Desai, "High-throughput turbo decoding techniques for 4 G," in Proc. Int. Conf. 30 Wireless and Beyond, San Francisco, CA, May 2002, pp. 137-142.
17. A. Tarable, G. Montorsi, and S. Benedetto, "Mapping of interleaving laws to parallel turbo decoder architectures," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 153-156.
18. M. J. Thul, F. Gilbert, and N. Wehn, "Concurrent interleaving architectures for high-throughput channel coding," in Proc. 2003 IEEE Int. Conf. Acoustics, Speech and Signal Processing, Victoria, Hong Kong, Apr. 2003, pp. 613-616.
19. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. Oxford, U.K.: Oxford Univ. Press, 1979.
20. G. Mullen and H. Stevens, "Polynomial functions (mod m)," Acta. Math. Hung., vol. 44, pp. 237-241, 1984.
21. R. Garello, P. Pierloni, and S. Benedetto, "Computing the free distance of turbo codes and serially concatenated codes with interleavers: Algorithms and applications," IEEE J. Sel. Areas Commun., vol. 19, no. 5, pp. 800-812, May 2001.
22. E. Rosnes and Ø. Ytrehus, "Improved algorithms for the determination of turbo-code weight distributions," IEEE Trans. Commun., vol. 53, no. 1, pp. 20-26, Jan. 2005.
23. P. Guinand and J. Lodge, "Trellis termination for turbo encoders," in Proc. 17th Biennial Symp. Communications, Kingston, ON, Canada, May 1994, pp. 389-392.
24. S. Crozier, "New high-spread high-distance interleavers for turbo-codes," in Proc. 20th Biennial Symp. Communications, Kingston, ON, Canada, May 2000, pp. 3-7.
25. E. Boutillon and D. Gnaedig, "Maximum spread of D-dimensional multiple turbo codes," IEEE Trans. Commun., vol. 53, no. 8, pp. 1237-1242, Aug. 2005.
26. The 3rd Generation Partnership Project (3GPP) (2005). [Online]. Available: http://www.3gpp.org/