On a Technique to Calculate the Exact Performance of a Convolutional Code

Published

Journal Article

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. © 1995 IEEE

Full Text

Duke Authors

Cited Authors

  • Best, MR; Burnashev, MV; Lévy, Y; Rabinovich, A; Fishburn, PC; Calderbank, AR; Costello, DJ

Published Date

  • January 1, 1995

Published In

Volume / Issue

  • 41 / 2

Start / End Page

  • 441 - 447

Electronic International Standard Serial Number (EISSN)

  • 1557-9654

International Standard Serial Number (ISSN)

  • 0018-9448

Digital Object Identifier (DOI)

  • 10.1109/18.370145

Citation Source

  • Scopus