Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei, China Because classical fast vector quantization(VQ) algorithms can't error(1): function not defined be used in the LSF vector quantizers that use varying weighted Euclidean distance, a novel fast VQ search algorithm - CRVQ-CS (Constrained Range Vector Quantization based on Component Searching) is presented in this paper. The CRVQ-CS algorithm works well with the varying weighted Euclidean distance and yields the same result as full search VQ with reduced computational complexity does. Although the CRVQ-CS algorithm is proposed for VQ using varying weighted Euclidean distance measure, it is also suitable for VQ using simple Euclidean distance measure.
Cite as: Li, J., Luo, X., Wang, R.-H. (2000) A novel search algorithm for LSF VQ. Proc. 6th International Conference on Spoken Language Processing (ICSLP 2000), vol. 2, 194-197, doi: 10.21437/ICSLP.2000-242
@inproceedings{li00d_icslp,
author={Jinyu Li and Xin Luo and Ren-Hua Wang},
title={{A novel search algorithm for LSF VQ}},
year=2000,
booktitle={Proc. 6th International Conference on Spoken Language Processing (ICSLP 2000)},
pages={vol. 2, 194-197},
doi={10.21437/ICSLP.2000-242}
}