A new metric for permutation polynomial interleaves

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1983-1987

  Takeshita, Oscar Y ^a  

^a Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERLEAVER METRIC; PERMUTATION POLYNOMIAL;

COMPUTER SIMULATION; METRIC SYSTEM; QUADRATIC PROGRAMMING; TURBO CODES;

POLYNOMIALS;

EID: 39049165174     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261896     Document Type: Conference Paper

References (20)

1. J. Sun and O. Y. Takeshita, "Interleavers for turbo codes using permutation polynomials over integer rings," IEEE Trans. Inform. Theory, vol. 51, no. 1, pp. 101-119, Jan. 2005.
2. 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. International Conference on Communications, vol. 1, Paris, France, June 2004, pp. 341-345.
3. C. J. Corrada-Bravo and I. Rubio, "Deterministic interleavers for turbo codes with random-like performance and simple implementation," in Proc. 3rd International Symposium on Turbo Codes, Brest, France, Sept. 2003.
4. H. R. Sadjadpour, N. J. A. Sloane, M. Salehi, and G. Nebe, "Interleaver design for turbo codes," IEEE J. Select. Areas Commun., vol. 19, no. 5, pp. 831-837, May 2001.
5. O. Y. Takeshita and D. J. Costello, Jr., "New deterministic interleaver designs for turbo codes," IEEE Trans. Inform. Theory, vol. 46, no. 6, pp. 1988-2006, Sept. 2000.
6. S. Crozier and P. Guinand, "High-performance low-memory interleaver banks for turbo-codes," in Proc. 54th IEEE Vehicular Technology Conference (VTC 2001 Fall), Atlantic City, New Jersey, Oct. 2001, pp. 2394-2398.
7. F. Daneshgaran and M. Mondin, "Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexity," IEEE Trans. Inform. Theory, vol. 45, no. 6, pp. 1845-1859, Sept. 1999.
8. S. Dolinar and D. Divsalar, "Weight distribution of turbo codes using random and nonrandom permutations," JPL, TDA Progress Report 42-122, Aug. 1995.
9. J. Ryu and O. Y. Takeshita, "On quadratic inverses for quadratic permutation polynomials over integer rings," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 1254-1260, Mar. 2006.
10. O. Y. Takeshita, "On maximum contention-free interleavers and permutation polynomials over integer rings," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 1249-1253, Mar. 2006.
11. C. Y. Lee, "Some properties of nonbinary error-correcting codes," IRE Trans. Inform. Theory, vol. 4, no. 2, pp. 77-82, June 1958.
12. S. Crozier, "New high-spread high-distance interleavers for turbo-codes," in Proc. 20th Biennial Symposium on Communications, Kingston, Ontario, Canada, May 2000, pp. 3-7.
13. 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.
14. O. Y. Takeshita, "Permutation polynomial interleavers: an algebraic-geometric perspective," IEEE Trans. Inform. Theory, Jan. 2006, submitted for publication. [Online]. Available: http://arxiv.org/abs/cs. IT/0601048/
15. G. D. Forney, Jr., "Geometrically uniform codes," IEEE Trans. Inform. Theory, vol. 37, no. 5, pp. 1241-1260, Sept. 2001.
16. P. M. Neumann, G. A. Stoy, and E. C. Thompson, Groups and Geometry. Oxford University Press, 1994.
17. M. Breiling, "A logarithmic upper bound on the minimum distance of turbo codes," IEEE Trans. Inform. Theory, vol. 50, no. 8, pp. 1692-1710, Aug. 2004.
18. "The 3rd generation partnership project (3GPP)," 2005. [Online]. Available: http://www.3gpp.org/
19. P. Guinand and J. Lodge, "Trellis termination for turbo encoders," in Proc. 17th Biennial Symposium on Communications, Kingston, Ontario, Canada, May 1994, pp. 389-392.
20. S. Crozier and P. Guinand, "Distance upper bounds and true minimum distance results for turbo-codes designed with DRP interleavers," in Proc. 3rd International Symposium on Turbo Codes & Related Topics, Brest, France, Sept. 2003, pp. 169-172.