Estimating the minimum distance of Turbo-codes using double and triple impulse methods

IEEE Communications Letters

Volumn 9, Issue 7, 2005, Pages 631-633

  Crozier, Stewart ^a   Guinand, Paul ^a   Hunt, Andrew ^a  

^a Industry Canada   (Canada)

Author keywords

Interleaving; Iterative processing; Minimum distance; Turbo code

Indexed keywords

ALGORITHMS; DECODING; ENCODING (SYMBOLS); ESTIMATION; ITERATIVE METHODS;

INTERLEAVING; ITERATIVE PROCESSING; MINIMUM DISTANCE;

TURBO CODES;

EID: 23144434808     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2005.1461687     Document Type: Article

References (13)

1. C. Berrou, A. Glavieux, and P. Thitmajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. Of IEEE Int. Conf. On Comm., May 1993, pp. 1064-1070.
2. L. Perez, J. Seghers, and D. Costello, "A distance spectrum interpretation of Turbo codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1698-1709, Nov. 1996.
3. D. Divsalar and F. Pollara, "Multiple turbo codes for deep-space communications," JPL, TDA Progress Report 42-121, May 15, 1995.
4. S. Benedetto and G. Montorsi, "Unveiling Turbo codes: some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, pp. 409-428, Mar. 1996.
5. S. Crozier, "New high-spread high-distance interleavers for Turbo-codes," in Proc. 20th Biennial Symposium on Communications, May 28-31 2000, pp. 3-7 (see www.crc.ca/fec).
6. S. Crozier and P. Guinand, "High-performance low-memory interleaver banks for Turbo-codes," in Proc. 54th IEEE Vehicular Technology Conference, VTC Fall 2001, Oct. 2001 (see www.crc.ca/fec).
7. S. Crozier and P. Guinand, "Distance bounds and the design of high-distanee interleavers for Turbo-codes," in Proc. 21st Biennial Symposium on Communications, June 2002, pp. 10-14 (see www.crc.ca/fec).
8. S. Crozier and P. Guinand, "Distance upper bounds and true minimum distance results for Turbo-codes designed with DRP interleavers," in Proc. International Symposium on Turbo Codes, Sept. 2003, pp. 169-172 (see www.crc.ca/fec).
9. R. Garello, P. Pierleoni, 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, pp. 800-812, May 2001.
10. E. Rosnes and O. Ytrehus, "An efficient algorithm for tailbiting turbo codes weight distribution calculation," in Proc. 3rd Int. Symp. Turbo Codes, Sept. 2003, pp. 439-442.
11. C. Berrou, S. Vaton, M. Jezequel, and C. Douilard, "Computing the minimum distance of linear codes by the error impulse method," in Proc. IEEE Global Telecommunications Conference, GLOBECOM'02, Nov. 2002, pp. 1017-1020.
12. R. Garello and A. Vila, "The all-zero iterative decoding algorithm for turbo code minimum distance computation," in Proc. IEEE Int. Conf. Commun. (ICC'04), June 2004, pp. 361-364.
13. X. Hu, M. Fossorier, and E. Eleftheriou, "On the computation of the minimum distance of low-density parity-check codes," in Proc. of Int. Conf. Commun. (ICC'04), June 2004, pp. 767-771.