Separable concatenated codes with iterative map filtering

  • J. Lodge
  • R. Young
  • P. Guinand
Decoding Techniques
Part of the Lecture Notes in Computer Science book series (LNCS, volume 793)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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.Google Scholar
  2. [2]
    G.D. Forney, “The Viterbi algorithm,” Proc. IEEE, vol. 61, pp. 268–278, Mar. 1973.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    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.Google Scholar
  6. [6]
    G.D. Forney, “Convoluational codes I: Algebraic structure,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 720–738, Nov. 1970.CrossRefGoogle Scholar
  7. [7]
    J.H. McClellan and C.M. Rader, Number Theory in Digital Signal Processing, Englewood Cliffs N. J., Prentice-Hall Inc., 1979, Chapter III.Google Scholar
  8. [8]
    J.G. Proakis, Digital Communications, New York NY, McGraw-Hill Book Company, 1983, Chapter 5.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    G.D. Forney, “Coset codes II: Binary lattices and related codes,” IEEE Trans. on Inform. Theory, vol. 34, pp. 1152–1187, Sept. 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • J. Lodge
    • 1
  • R. Young
    • 1
  • P. Guinand
    • 1
  1. 1.Communications Research CentreOttawaCanada

Personalised recommendations