Permutation polynomial interleavers: An algebraic-geometric perspective

IEEE Transactions on Information Theory

Volumn 53, Issue 6, 2007, Pages 2116-2132

  Takeshita, Oscar Y ^a  

^a The Ohio State University   (United States)

Author keywords

Algebraic; Geometry; Interleaver; PP; Quadratic; Quasi cyclic; Spread; Turbo code

Indexed keywords

COMPUTER SIMULATION; GEOMETRY; POLYNOMIALS; TURBO CODES;

FRAME ERROR RATES; MAXIMUM-SPREAD INTERLEAVERS;

CHANNEL CODING;

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

References (33)

1. J. Sun and O. Y. Takeshita, "Interleavers for turbo codes using PPs 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, 2004, p. 54.
3. C. Berrou, S. K. Y. Saouter, C. Douillard, and M. Jézéquel, "Designing-good permutations for turbo codes: Towards a single model," in Proc. Int. Conf. Communications, Paris, Franca, Jun. 2004, vol. 1, 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, 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 G. 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. Croazier, "New high-spread high-distance interleavers for turbo-codes," in Proc. 20th Bienn. Symp. Communications, Kingston, ON, Canada, May 2000, pp. 3-7.
9. S. Crozier and P. Guinand, "High-performance low-memory interleaver banks for turbo-codes," in Proc. 54th IEEE Vehicular Technology Conf. (VTC 2001 Fall), Atlantic City, NJ, Oct. 2001, pp. 2394-2398.
10. F. Daneshgaran and M. Mondin, "Design of interleavers for turbo codes: Iterative interleaver growth algorithms of polynomial complexity," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 1845-1859, Sep. 1999.
11. O. Y. Takeshita and D. J. Costello Jr., "On deterministic linear interleavers for turbo-codes," in Proc. 35th Annu. Allerton Conf. Communication, Control, and Computing, Monnticello, IL, Sep. 1997, pp. 711-712.
12. S. Drolinar and D. Divsalar, Weight Distribution of Turbo Codes Using Random and Nonrandom Permutations, Jet Propulsion Lab., Pasadena, CA, 1995, PDA Prog. Rep. 42-122.
13. A. S. Barbulescu and S. S. Pietrobon, "Interleaver design for turbo codes," IEE Electron. Lett., vol. 30, no. 25, pp. 2107-2108, Dec. 1994.
14. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
15. O. Y. Takeshita, "On maximum contention-free interleavers and PPs over integer rings," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1249-1253, Mar. 2006.
16. J. Ryu and O. Y. Takeshita, "On quadratic inverses for quadratic PPs over integer rings," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1254-1260, Mar. 2006.
17. M. Cheng, M. Nakashima, J. Hamkins, B. Moision, and M. Barsoum, "A decoder architecture for high-speed free-space laser communications," Proc. SPIE, vol. 5712, pp. 174-185, Apr. 2005.
18. O. Y. Takeshita, "A new construction for LDPC codes using PPs over integer rings," IEEE Trans. Inf. Theory, [Online]. Available: http://arxiv.org/abs/cs.IT/0506091/, submitted for publication
19. w," Finite Fields and their Applications, vol. 7, pp. 287-292, Feb. 2001.
20. C. Y. Lee, "Some properties of nonbinary error-correcting codes," IRE Trans. Inf. Theory, vol. 74, no. 2, pp. 77-82, Jun. 1958.
21. M. Breiling, "A logarithmic upper bound on the minimum distance of turbo codes," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1692-1710, Aug. 2004.
22. 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.
23. B. Moision and M. Klimesh, Some Observations on Permutation Polynomials, Jet Propulsion Lab., Pasadena, CA, Inter-office Memo. 331. 2005. 1. 1..
24. G. D. Forney, Jr., "Geometrically uniform codes," IEEE Trans. Inf. Theory, vol. 37, no. 5, pp. 1241-1260, Sep. 1991.
25. P. M. Neumann, G. A. Stoy, and E. C. Thompson, Groups and Geometry Oxford, U.K.: Oxford Univ. Press, 1994.
26. 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.
27. C. Weiss, C. Bettstetter, and S. Reidel, "Code construction and decoding of parallel concatenated tail-biting codes," IEEE Trans. Inf. Theory, vol. 47, no. 1, pp. 366-386, Jan. 2001.
28. P. Guinand and J. Lodge, "Trellis termination for turbo encoders," in Proc. 17th Bienn. Symp. Communications, Kingston, ON, Canada, May 1994, pp. 389-392.
29. J. Gathen and J. Gerhard, Modern Computer Algebra. Cambridge, U.K.: Cambridge Univ. Press, 1999.
30. 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. Select. Areas Commun., vol. 19, no. 5, pp. 800-812, May 2001.
31. "The 3rd Generation Partnership Project (3GPP)," 2005 [Online]. Available: http://www.3gpp.org/
32. S. Crozier and P. Guinand, "Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 169-172.
33. D. Divsalar and F. Pollara, Multiple Turbo Codes for Deep-Space Communications Jet Propulsion Lab., Pasadena, CA, 1995, TDA Progr. Rep. 42-121.