Skip to main content
SpringerLink
Log in

Decoding techniques for convolutional codes

  • Section 5 Convolutional Codes
  • Conference paper
  • First Online:
EUROCODE '90 (EUROCODE 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 514))

  • 181 Accesses

Abstract

The basic principles and limitations of decoding techniques for convolutional codes are presented. Regarding the decoding process as being a search procedure through the tree or trellis representation of the code, methods to circumvent the inherent shorthcomings of Viterbi and sequential decoding are presented.

This work was supported in part by the Natural Sciences and Engineering Research Council of Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.W. Wu, D. Haccoun, R. Peile, Y. Hirata, "Coding for Satellite Communications", IEEE Trans. Select Areas Commun., Vol. SAC 5, pp. 724–748, May 1987.

    Article  Google Scholar 

  2. I.M. Jacobs, "Practical Applications of Coding", IEEE Trans. Inf. Theory, Vol. IT20, pp. 305–310, May 1974.

    Article  Google Scholar 

  3. V.K. Bhargava, D. Haccoun, R. Matyas, P. Nuspl, "Digital Communication by Satellite", J. Wiley, New York, 1981.

    Google Scholar 

  4. W.W. Wu, "Coding for Satellite and Space Channels", in Special Issue on Coding for Digital Transmission Systems, Inter. J. Electronics, Vol. 55, No 1, pp. 189–212, July 1983.

    Google Scholar 

  5. A.J. Viterbi, "Convolutional Codes and their Performance in Communication Systems", IEEE Trans. on Commun, Technol., Vol. COM-19, pp. 751–772, Oct. 1971.

    Google Scholar 

  6. F. Jelinek, "A Fast Sequential Decoding Algorithm Using a Stack", IBM Journ. Research Develop., Vol. 13, pp. 675–685, Nov. 1969.

    Google Scholar 

  7. D. Haccoun, M. Ferguson, "Generalized Stack Algorithms for the Decoding of Convolutional Codes", IEEE Trans. Inf. Theory, Vol. IT-21, pp. 638–651, Nov. 1975.

    Article  Google Scholar 

  8. R.M. Fano, "A Heuristic Discussion of Probabilistic Decoding", IEEE Trans. Inform. Theory, Vol. IT-9, Apr. 1962.

    Google Scholar 

  9. I.M. Jacobs and E.R. Berlekamp, "A Lower Bound to the Distribution of Computation for Sequential Decoding", IEEE Trans. Inform. Theory, Vol. IT-13, pp. 167–174, Apr. 1967.

    Article  Google Scholar 

  10. D. Haccoun, "Variabilité de calculs et débordements de décodeurs séquentiels à pile", Traitement du Signal (Paris, France), Vol. 3, no. 3, pp. 127–143, Dec. 1986.

    Google Scholar 

  11. J.B. Cain, G.C. Clark, Jr., and J.M. Geist, "Punctured convolutional codes of rate (n-1)/n and simplified maximum likelihood decoding", IEEE Trans. Inform. Theory, Vol. IT-25, pp. 97–100, Jan. 1979.

    Article  Google Scholar 

  12. Y. Yasuda, Y. Hirata, K. Nakamura, and S. Otani, "Development of variable-rate Viterbi decoder and its performance characteristics", presented a the 6th Int. Conf. Digital Satellite Commun., Phoenix, AZ, Sept. 1983.

    Google Scholar 

  13. Y. Yasuda, K. Kashiki, and Y. Hirata, "High-rate punctured convolutional codes for soft decision Viterbi decoding", IEEE Trans. Commun., Vol. COM-32, pp. 315–319, Mar. 1984.

    Article  Google Scholar 

  14. D. Haccoun and G. Bégin, "High rate punctured convolutional codes for Viterbi and sequential decoding", IEEE Trans. Commun., Vol. 37, pp. 1113–1125, Nov. 1989.

    Article  Google Scholar 

  15. G. Bégin and D. Haccoun, "High rate punctured convolutional codes: Structure properties and construction technique", IEEE Trans. commun., Vol. 37, pp. 1381–1385, Dec. 1989.

    Article  Google Scholar 

  16. G. Bégin, D. Haccoun, C. Paquin, "Further results on high-rate punctured convolutional codes for Viterbi and sequential decoding", IEEE Trans. Commun., Vol. 38, pp. 1922–1928, Nov. 1990.

    Article  Google Scholar 

  17. J. Hagenauer, "Rate-compatible punctured convolutional codes (RCPC codes) and their applications", IEEE Trans. on Commun., Vol. COM-36, pp. 389–400, Apr. 1988.

    Article  Google Scholar 

  18. S. Kallel, D. Haccoun, "Generalized Type II hybrid ARQ scheme using punctured convolutional codes", IEEE Trans. on Commun., Vol. 38, pp. 1938–1946, Nov. 1990.

    Article  Google Scholar 

  19. G. Bégin, D. Haccoun, "Sequential decoding of high rate punctured convolutional codes", to be published.

    Google Scholar 

  20. Chi-Chao Chao and R.J. Mc Eliece, "On the path weight enumerators of convolutional codes", Book of Abstracts, IEEE Intern. Symp. on Inform. Theory, Kobe, Japan, June 1988.

    Google Scholar 

  21. D. Haccoun, P. Montreuil, C. Paquin, "On the rate of growth of the incorrect paths of convolutional codes", to be published.

    Google Scholar 

  22. J.B. Anderson, "Limited search trellis decoding of convolutional codes", IEEE Trans. on Inform. Theory, Vol. IT-35, pp. 944–955, September 1989.

    Article  Google Scholar 

  23. G.J. Foschini, "A reduced state variant of maximum likelihood sequence detection attaining optimum performance for high signal-to-noise ratios", IEEE Trans. Inform. Theory, Vol. IT-23, pp. 605–609, Sept. 1977.

    Article  Google Scholar 

  24. S.J. Simmons, "Breadth-first trellis decoding with adaptive effort", IEEE Trans. on Commun., Vol. COM-38, pp. 3–12, January 1990.

    Article  Google Scholar 

  25. F. Chang, D. Haccoun, "Layered Viterbi decoding", to be published.

    Google Scholar 

  26. S. Mohan and J.B. Anderson, "Speech encoding by a stack algorithm", IEEE Trans. on Commun., Vol. COM-28, pp. 825–830, June 1980.

    Article  Google Scholar 

  27. P.R. Chevillat and E. Eleftheriou, "Decoding of trellis-encoded signals in the presence of intersymbol interference and noise", IEEE Trans. on Commun., Vol. COM-37, pp. 669–676, July 1989.

    Article  Google Scholar 

  28. D. Haccoun, S. Kallel, "Application of multiple path sequential decoding for intersymbol interference reduction problem", Proceedings of IEE, Feb. 1991.

    Google Scholar 

  29. C.F. Lin, "A truncated Viterbi algorithm approach to trellis codes", Ph.D. dissertation, Elec., Comput, Syst. Eng. Dept., Rensselaer Polytech. Inst., Troy, NY, Sept. 1986.

    Google Scholar 

  30. D. Haccoun, J. Belzile, "Bidirectional algorithms for the decoding of convolutional codes", Book of Abstract, IEEE International Symp. on Information Theory, San Diego, Calif., Jan. 1990.

    Google Scholar 

  31. J. Belzile, D. Haccoun, "Bidirectional algorithms for decoding long convolutional codes", to be published.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Ecole Polytechnique de Montréal, H3C 3A7, Montréal, Québec, Canada

    David Haccoun

Authors
  1. David Haccoun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gérard Cohen Pascale Charpin

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haccoun, D. (1991). Decoding techniques for convolutional codes. In: Cohen, G., Charpin, P. (eds) EUROCODE '90. EUROCODE 1990. Lecture Notes in Computer Science, vol 514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54303-1_136

Download citation

  • DOI: https://doi.org/10.1007/3-540-54303-1_136

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54303-9

  • Online ISBN: 978-3-540-47546-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation