Abstract
In this paper we describe two methods of interleaving for use with generalized product block codes that can be decoded using a “turbo” decoding strategy. These methods are designed to avoid certain specific error patterns. One method has a number theoretic basis while the other uses finite projective planes. Simulation results are presented.
Preview
Unable to display preview. Download preview PDF.
References
J. Lodge, P. Hoeher, and J. Hagenauer, “The decoding of multidimensional codes using separable MAP’ filters',” in Proc. of Queen's University 16th Biennial Symp. on Communications, pp. 343–346, May 1992.
J. Hagenauer, E. Offer, and L. Papke, “Iterative ('turbo')-decoding of binary block and convolutional codes,” IEEE Trans. in Info. Thy. Vol.42, No.3, pp. 429–445, Mar. 1996.
C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit errorcorrecting coding and decoding: Turbo-codes (1),” Proc. of IEEE Int. Conf. on Comm., Geneva, pp. 1064–1070, May 1993.
L.M. Batten, “Combinatorics of Finite Geometries,” Cambridge, Cambridge University Press, 1986.
M. Hall, Jr., “Combinatorial Theory,” New York, John Wiley & Sons, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guinand, P., Lodge, J., Papke, L. (1996). An alternative approach to the design of interleavers for block “turbo” codes. In: Chouinard, JY., Fortier, P., Gulliver, T.A. (eds) Information Theory and Applications II. CWIT 1995. Lecture Notes in Computer Science, vol 1133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025138
Download citation
DOI: https://doi.org/10.1007/BFb0025138
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61748-8
Online ISBN: 978-3-540-70647-2
eBook Packages: Springer Book Archive