Simulation of Vector Trellis Encoding Systems

Most tree or trellis encoding data compression systems use decoders which form scalar outputs as a (possibly nonlinear) function of the contents of a shift register containing received channel symbols. We here develop design algorithms for trellis encoding systems having decoders not constrained to have such a scalar sliding-block code structure. In particular, we consider using the decoder of a finite-state vector quantizer together with a vector trellis search. Simulation results are presented for vector trellis encoding systems for Gauss-Markov sources, sampled speech data, and LPC speech data.