Abstract
In practice, very efficient signalling over radio channels requires more than designing very powerful codes. It requires designing very powerful codes that have special structure so that practical decoding schemes can be used with excellent, but not necessarily optimal, results. Examples of two such approaches include the concatenation of convolutional and Reed-Solomon coding, and the use of very large constraint-length convolutional codes with reduced-state decoding. In this paper, powerful codes are obtained by using simple block codes to construct multidimensional product codes. The decoding of multidimensional product codes, using separable symbol-by-symbol maximum a posteriori (MAP) “filters”, is described. Simulation results are presented for three-dimensional product codes constructed with the (16,11) extended Hamming code. The extension of the concept to concatenated convolutional codes is given. The relationship between the free distance and the interleaving factors is examined, and then exemplified with computer simulation. Potential applications are briefly discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Hagenauer and P. Hoeher, “A Viterbi algorithm with soft-decision outputs and its applications,” Proc. GLOBECOM'89, Dallas, Texas, pp. 47.1.1–47.1.7, Nov. 1989.
G.D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268–278, Mar. 1973.
J.K. Wolf, “Efficient maximum likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–81, January 1978.
L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 284–287, Mar. 1974.
J.H. Lodge, P. Hoeher and J. Hagenauer, “The decoding of multidimensional codes using separable MAP ‘filters',” Proc. Queen's University 16th Biennial Symp. on Communications, pp.343–346, May 1992.
G.D. Forney, “Convoluational codes I: Algebraic structure,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 720–738, Nov. 1970.
J.H. McClellan and C.M. Rader, Number Theory in Digital Signal Processing, Englewood Cliffs N. J., Prentice-Hall Inc., 1979, Chapter III.
J.G. Proakis, Digital Communications, New York NY, McGraw-Hill Book Company, 1983, Chapter 5.
J. Lodge, R. Young, P. Hoeher, and J. Hagenauer, “Separable MAP ‘filters’ for the decoding of product and concatenated codes,” Proceedings of the IEEE International Conference on Communications, pp. 1740–1745, Geneva, Switerzerland, May 1993.
J.H. Lodge and R.J. Young, “Separable concatenated codes with iterative MAP decoding for Rician fading channels,” Proceedings of the Third International Mobile Satellite Conference IMSC '93, pp. 467–472, Pasadena, CA, June 1993.
J.H. Lodge and R.J. Young, “Separable concatenated codes with iterative MAP decoding for Rayleigh fading channels,” Proceedings of the Fifth Annual Conference on Wireless Communications, pp. 703–712, Calgary, Canada, July 1993.
G.D. Forney, “Coset codes II: Binary lattices and related codes,” IEEE Trans. on Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lodge, J., Young, R., Guinand, P. (1994). Separable concatenated codes with iterative map filtering. In: Gulliver, T.A., Secord, N.P. (eds) Information Theory and Applications. ITA 1993. Lecture Notes in Computer Science, vol 793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57936-2_41
Download citation
DOI: https://doi.org/10.1007/3-540-57936-2_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57936-6
Online ISBN: 978-3-540-48392-2
eBook Packages: Springer Book Archive