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

Fingerprint

Quantization
Computational Complexity

ASJC Scopus subject areas

  • Linguistics and Language
  • Language and Linguistics

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.

A novel search algorithm for LSF VQ. / Li, Jinyu; Luo, Xin; Wang, Ren Hua.

6th International Conference on Spoken Language Processing, ICSLP 2000. International Speech Communication Association, 2000.

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

Li, J, Luo, X & Wang, RH 2000, A novel search algorithm for LSF VQ. in 6th International Conference on Spoken Language Processing, ICSLP 2000. International Speech Communication Association, 6th International Conference on Spoken Language Processing, ICSLP 2000, Beijing, China, 10/16/00.
Li J, Luo X, Wang RH. A novel search algorithm for LSF VQ. In 6th International Conference on Spoken Language Processing, ICSLP 2000. International Speech Communication Association. 2000
Li, Jinyu ; Luo, Xin ; Wang, Ren Hua. / A novel search algorithm for LSF VQ. 6th International Conference on Spoken Language Processing, ICSLP 2000. International Speech Communication Association, 2000.
@inproceedings{e266b984329e44d695d80d2463bb7b93,
title = "A novel search algorithm for LSF VQ",
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.",
author = "Jinyu Li and Xin Luo and Wang, {Ren Hua}",
year = "2000",
language = "English (US)",
booktitle = "6th International Conference on Spoken Language Processing, ICSLP 2000",
publisher = "International Speech Communication Association",

}

TY - GEN

T1 - A novel search algorithm for LSF VQ

AU - Li, Jinyu

AU - Luo, Xin

AU - Wang, Ren Hua

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85009126365&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85009126365&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85009126365

BT - 6th International Conference on Spoken Language Processing, ICSLP 2000

PB - International Speech Communication Association

ER -