MULTISTAGE STORAGE-CONSTRAINED AND ENTROPY-CONSTRAINED TREE-STRUCTURED VECTOR QUANTIZATION

This paper proposes a new algorithm for the design of a tree-structure d vector quantizer that operates under storage and entropy constraints ; hence, it is called the storage- and entropy-constrained tree-struct ured vector quantizer (SECTSVQ), The algorithm uses the tree-growing a pproach and designs the tree one stage/layer at a time, The constraint s on the rate and storage size, i.e., the number of nodes or codewords , at each stage are specified prior to the design procedure, While gro wing the tree, at each stage the algorithm optimally allocates the rat e and the number of nodes available for the current stage to the nodes of the previous stage using the dynamic programming technique, The no des of the current stage are then determined based on the allocations, In addition to being useful as a tree-structured VQ, SECTSVQ is parti cularly suited for application in progressive transmission, Moreover, the optimal allocation technique used in the design can be effectively applied to other optimal resource allocation problems, The SECTSVQ al gorithm is implemented for various sources and is shown to compare fav orably with other VQ's.