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

Best, M.R. and Burnashev, M.V. and Levy, Y. and Rabinovich, A. and Fishburn, P.C. and Calderbank, A.R. and Costello, D.J. (1995) On a technique to calculate the exact performance of a convolutional code. IEEE Transactions on Information Theory, 41 (2). pp. 441-447. ISSN 0018-9448

Preview

PDF
554Kb

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
Item Type:	Article
Copyright:	©1995 IEEE
Link to this item:	http://purl.utwente.nl/publications/55671
Official URL:	http://dx.doi.org/10.1109/18.370145
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page