On a technique to calculate the exact performance of a convolutional code

M.R. Best, M.V. Burnashev, Y. Levy, A. Rabinovich, P.C. Fishburn, A.R. Calderbank, D.J. Costello

Research output: Contribution to journalArticleAcademic

32 Citations (Scopus)


A Markovian technique is described to calculate the exact performance of the Viterbi algorithm used as either a channel decoder or a source encoder for a convolutional code. The probability of information bit error and the expected Hamming distortion are computed for codes of various rates and constraint lengths. The concept of tie-breaking rules is introduced and its influence on decoder performance is examined. Computer simulation is used to verify the accuracy of the results. Finally, we discuss the issue of when a coded system outperforms an uncoded system in light of the new results
Original languageUndefined
Pages (from-to)441-447
JournalIEEE transactions on information theory
Issue number2
Publication statusPublished - 1995
Externally publishedYes


  • IR-55671

Cite this