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

Authors:
M. R. Best;M. V. Burnashev;Y. Levy;A. Rabinovich;P. C. Fishburn;A. R. Calderbank;D. J. Costello, Jr.
Affiliations:
Dept. of Electr. Eng., Twente Univ., Enschede;-;-;-;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 2

On Upper Bounds for the Decoding Error Probability of Convolutional Codes

Problems of Information Transmission
Exact erasure channel density evolution for protograph-based generalized LDPC codes

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1

Quantified Score

Hi-index	754.84

Visualization

Abstract

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