Upper bounds on the number of bursts at the output of a Viterbi decoder

Burst error statistics at the output of a Viterbi decoder are investigated. Upper bounds on the number of bursts of any length have been derived analytically for a hard decision. A Viterbi decoder for a hard decision has been simulated on a digital computer. Simulation studies have been made on decoders of different constraint lengths and for different probabilities of error for the Binary Symmetric Channel. Number of bursts of different lengths at the output of these decoders have been counted. The results from the simulation study agree with the upper bounds obtained analytically.