Average Number of Facets per Cell in Tree-Structured Vector Quantizer

Upper and lower bounds are derived for the average number of facets per cell in the encoder partition of binary Tree-Structured Vector Quantizers. The achievability of tile bounds is described as well. It is shown in particular that the average number of facets per cell for unbalanced trees must lie asymptotically between 3 and 4 in R/sup 2/, and each of these bounds can be achieved, whereas for higher dimensions it is shown that an arbitrarily large percentage of the cells can each have a linear number (in codebook size) of facets. Analogous results are also indicated for balanced trees.