Iterative interleaver growth algorithms of polynomial complexity for turbo codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 418-

  Daneshgaran, F ^a   Mondin, M ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC BEHAVIORS; DESIGN PROCEDURE; GROWTH ALGORITHMS; INTERLEAVERS; PARALLEL CONCATENATED CONVOLUTIONAL CODES;

INFORMATION THEORY; ITERATIVE METHODS; OPTIMIZATION;

TURBO CODES;

EID: 84890349879     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.709023     Document Type: Conference Paper

References (5)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon Limit terror-Correcting Coding and Decoding: Turbo-Codes," Proc. fcC'93, Geneva, Switzerland, May 23-26, 1993.
2. S. Benedetto and G. Montorsi, "Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes," Proc. ICC'95, pp.663-667, Seattle, Washington, June 18-22, 1995.
3. F. Daneshgaran and M. Mondin, "Minimal Delay Realization of Permutations With Application to Turbo Coding," Proc. ISITA 96, Victoria, Canada, Sept. 1996.
4. H. Herzberg, "Multilevel Turbo Coding with a Short Latency", Proc. IEEE ISIT'97, pp.112, Ulm, Germany, June 1997.
5. A. Barbulescu, S, Pietrobon, "Terminating the Trellis of Turbo-Codes in the Same State," Elec. Letters, Vol.31, No.l, pp. 22-23, Jan. 1995.