Skip to main content
SpringerLink
Log in

On Upper Bounds for the Decoding Error Probability of Convolutional Codes

  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

A new approach to upper bounding the decoding error probability of convolutional codes is proposed. Its idea is, instead of evaluating the individual contribution of each fundamental path, to compare it with contribution of another (lighter) fundamental path. This allows us to (1) take into account the dependence between different fundamental paths based on the code tree structure; (2) represent the decoding error probability through the contribution of the first fundamental paths and a correction factor; (3) get much more accurate estimates.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Viterbi, A.J. and Omura, J.K., Principles of Digital Communication, New York: McGraw-Hill, 1979.

    Google Scholar 

  2. Lin, S. and Costello, D.J., Error Control Coding, Englewood Cliffs: Prentice-Hall, 1983.

    Google Scholar 

  3. Cedervall, M., Johannesson, R., and Zigangirov, K.Sh., A New Upper Bound on the First-Event Error Probability for Maximum-Likelihood Decoding of Fixed Binary Convolutional Codes, IEEE Trans. Inf. Theory, 1984, vol. 30, no. 5, pp. 762–766.

    Google Scholar 

  4. Post, K.A., Bounding the First Event Error Probability. A RandomWalk with Counting Arguments, Proc. 2nd Joint Swedish-Soviet Int. Workshop on Information Theory, Granna, Sweden, 1985, pp. 195–203.

    Google Scholar 

  5. Poltyrev, G., Bounds on the Decoding Error Probability of Binary Linear Codes via Their Spectra, IEEE Trans. Inf. Theory, 1994, vol. 40, no. 4, pp. 1284–1292.

    Google Scholar 

  6. Burnashev, M.V and Cohn, D.L., On Bit-Error Probability for Convolutional Codes, Probl. Peredachi Inf., 1990, vol. 26, no. 4, pp. 3–15 [Probl. Inf. Trans. (Engl. Transl.), 1990, vol. 26, no. 4, pp. 289–298].

    Google Scholar 

  7. Best, M.R., Burnashev, M.V., Lévy, Y., Rabinovich, A., Fishburn, P.C., Calderbank, A.R., and Costello, D.J., Jr., On a Technique to Calculate the Exact Performance of a Convolutional Code, IEEE Trans. Inf. Theory, 1995, vol. 41, no. 2, pp. 441–447.

    Google Scholar 

  8. Burnashev, M.V., On One Extremal Property of Hamming Halfspaces, Probl. Peredachi Inf., 1993, vol. 29, no. 3, pp. 3–5 [Probl. Inf. Trans. (Engl. Transl.), 1993, vol. 29, no. 3, pp. 288–290].

    Google Scholar 

  9. Burnashev, M.V., Cohn, D.L., and Arora, A.S., An Arbitrarily Tight Union Bound for Convolutional Codes through Bifurcation, Proc. Conf. on Commun., Control, and Comput., Allerton, 1988, pp. 1059–1060.

Download references

Authors
  1. M. V. Burnashev
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burnashev, M.V. On Upper Bounds for the Decoding Error Probability of Convolutional Codes. Problems of Information Transmission 37, 307–324 (2001). https://doi.org/10.1023/A:1013867132522

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013867132522

Keywords

Search

Navigation