A novel search algorithm for LSF VQ

Jinyu Li, Xin Luo, Ren Hua Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Because classical fast vector quantization(VQ) algorithms can't be used in the LSF vector quantizers that use varying weighted Euclidean distance, a novel fast VQ search algorithm-CRVQCS (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.

Original languageEnglish (US)
Title of host publication6th International Conference on Spoken Language Processing, ICSLP 2000
PublisherInternational Speech Communication Association
ISBN (Electronic)7801501144, 9787801501141
StatePublished - 2000
Externally publishedYes
Event6th International Conference on Spoken Language Processing, ICSLP 2000 - Beijing, China
Duration: Oct 16 2000Oct 20 2000

Other

Other6th International Conference on Spoken Language Processing, ICSLP 2000
CountryChina
CityBeijing
Period10/16/0010/20/00

ASJC Scopus subject areas

  • Linguistics and Language
  • Language and Linguistics

Fingerprint Dive into the research topics of 'A novel search algorithm for LSF VQ'. Together they form a unique fingerprint.

  • Cite this

    Li, J., Luo, X., & Wang, R. H. (2000). A novel search algorithm for LSF VQ. In 6th International Conference on Spoken Language Processing, ICSLP 2000 International Speech Communication Association.