Multiple description trellis-coded vector quantization

In this paper multiple description schemes for trellis coded vector quantizers are introduced. For these schemes, the Viterbi algorithm provides an optimal path for encoding and the design procedure utilizes the generalized Lloyd algorithm for suboptimal codebooks. The schemes are generalization of [11, 13] in both temporal and spatial senses. A lower bound on rate-distortion region for more than three descriptions is given. The lower bound is a generalization of Ozarow's achievable region [15] for a two channel and three description scheme.