By Topic

An economical binary tree structure for vector quantization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chang, L. ; Dept. of Electr. Eng., Queen''s Univ., Kingston, Ont., Canada ; Bayoumi, M.M.

The authors present a new way to organize the codebook for vector quantization of speech. The new structure can reduce the storage requirement almost by half without any increase in the computational cost. The key is to store only the final code vectors in a tree structure. To facilitate the search at each node, one stores the indices that point to the code vectors that lie nearest to the other branches instead of the centroids of branches. The performance of the new method is compared with that of the conventional method. The new method offers a better compromise for applications that have limited computational resources and storage room and have less stringent distortion rate requirements

Published in:

Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference on

Date of Conference:

14-17 Apr 1991