Performance bounds for convolutional codes over finite state channels

We present an analytical method for evaluating performance bounds for a communication system that employs a convolutional code, a block interleaving with finite interleaving depth, a binary channel with memory modeled as a finite state channel (FSC), and a decoder that implements the Viterbi algorithm with Hamming metric.