Variable Length Tree-Structured Subvector Quantization

Abstract

It is demonstrated in this paper that the encoding complexity advantage of a variable-length tree-structured vector quantizer (VLTSVQ) can be enhanced by encoding low dimensional subvectors of a source vector instead of the source vector itself at the nodes of the tree structure without signiicantly sacriicing coding performance. The greedy tree growing… (More)

Topics

6 Figures and Tables

Slides referencing similar topics