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

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 const...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1995-03, Vol.41 (2), p.441-447
Main Authors: Best, M.R., Burnashev, M.V., Levy, Y., Rabinovich, A., Fishburn, P.C., Calderbank, A.R., Costello, D.J.
Format: Article
Language:English
Subjects:
Algorithms
Communications
Computer errors
Computer simulation
Conferences
Convolutional codes
Cryptography
Engineering profession
Error probability
Information technology
Maximum likelihood decoding
NASA
Quantization
Viterbi algorithm
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
ISSN:0018-9448
1557-9654
DOI:10.1109/18.370145