Received 30.11.2010,
Revised 14.02.2011,
Accepted 01.04.2011
Searching for vectors in codebooks in binary tree-based speech compression
Oleksandr Tkachenko, Oksana Hrijo TukaloIt is shown that the use of a binary tree allows to significantly reduce the number of distance measurements required to find the nearest neighboring vector. The main factors affecting the search efficiency are analyzed. Several options for dividing the parameter domain when creating a tree are considered.
Tkachenko, O., & Hrijo Tukalo, O.
(2011).
Searching for vectors in codebooks in binary tree-based speech compression.
Information Technologies and Computer Engineering,
8(1),
44-49.
References
References in the process of publication