A Residual Structure For Trellis Coded Vector Quantization
Fangzhou Xu, R.L. Frost · 2005
A residual structure for fixed-rate trellis-coded vector quantization (TCRVQ) is presented. Optimality conditions for the stagewise code vectors of TCRVQ follow straightforwardly from those for conventional RVQ [l]. TCRVQ is interpreted as a kind of generalized coset code and a new fast encoding algorithm is described. We show that by exhaustively searching only one coset it is possible to identify the minimum distance code vector in every other coset at an additional cost of only one compare per code vector. Experimental results are described for the memoryless Gaussian and Laplacian sources and for a Gauss-Markov source at rates of R = 1 and 2 bitslsample, and for a variety of vector sizes. Very good results are obtained with modest vector dimensions.