An efficient algorithm for trellis-coded vector quantisation
Hu Mingyou, Tan Boon Tiong · 2002
An efficient trellis-coded vector quantisation (TCVQ) algorithm based on the modified set-partition method and partial distance search scheme is presented. Using the modified set-partition method, the minimum distance within subset can be maximized as much as possible, and thus improve the performance of TCVQ. A novel partial distance search method based on the codebook structure of TCVQ is also proposed to reduce the computational complexity of the minimum distortion encoding for TCVQ. Experimental results show that it can reduce about 80-90% computational complexity for different codebook size when compared with the full search TCVQ.