Sixth European Conference on Speech Communication and Technology
(EUROSPEECH'99)

Budapest, Hungary
September 5-9, 1999

Efficient Vector Quantization Using an N-Path Binary Tree Search Algorithm

R. San-Segundo, R. Córdoba, J. Ferreiros, A. Gallardo, J. Colás, J. Pastor, Y. López

Grupo de Tecnología del Habla, Departamento de Ingeniería Electrónica, Universidad Politécnica de Madrid, E.T.S.I. Telecomunicación, Ciudad Universitaria s/n, Madrid, Spain

We propose the utilization of a new n-path binary tree search algorithm for vector quantization. Our target is to reduce the complexity (time processing) of the vector quantizer maintaining the quantization distortion. The algorithm has been applied to an isolated digit recognizer by telephone based on DHMM and to a speaker dependent continuous speech system based on SCHMM, so we will also give the recognition results for both of them. We have tested several alternatives to calculate the centroids of the higher levels of the tree. In all the experiments we have considered the following parameters for the evaluation: average distortion, same choice percentage, average distortion for the mistakes and processing time. Our reference has been the standard quantization (computing the distance with all centroids). In this reference case the distortion was 220.9 and the processing time was 2.1 seconds. With the n-path binary tree search algorithm, we have obtained a 0.7 seconds processing time with a similar distortion: 226.4. In the semicontinuous system, we have obtained a reduction of 71 % in vector quantization processing time, maintaining the word accuracy.

Keywords: vector quantization, binary tree search, CPU time reduction


Full Paper (PDF)   Gnu-Zipped Postscript

Bibliographic reference.  San-Segundo, R. / Córdoba, R. / Ferreiros, J. / Gallardo, A. / Colás, J. / Pastor, J. / López, Y. (1999): "Efficient vector quantization using an n-path binary tree search algorithm", In EUROSPEECH'99, 93-96.