The binary vector quantization

Long Jhe Yan*, Shaw-Hwa Hwang

*Corresponding author for this work

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

2 Scopus citations

Abstract

The binary search algorithm for vector quantization is firstly proposed in this paper. It employs jointly sensitive-codeword based on the binary tree search structure to improve the search structure. Comparisons of experimental results show that the proposed algorithm performs the best. Most of search space is reduced. In the case of G.729's LSP quantization, more than 58% of search space is reduced.

Original languageEnglish
Title of host publication2008 3rd International Symposium on Communications, Control, and Signal Processing, ISCCSP2008
Pages604-607
Number of pages4
DOIs
StatePublished - 5 Sep 2008
Event2008 3rd International Symposium on Communications, Control, and Signal Processing, ISCCSP2008 - St. Julians, Malta
Duration: 12 Mar 200814 Mar 2008

Publication series

Name2008 3rd International Symposium on Communications, Control, and Signal Processing, ISCCSP 2008

Conference

Conference2008 3rd International Symposium on Communications, Control, and Signal Processing, ISCCSP2008
CountryMalta
CitySt. Julians
Period12/03/0814/03/08

Keywords

  • Binary VQ (BVQ)
  • Jointly sensitive-codeword
  • TSVQ
  • VQ

Fingerprint Dive into the research topics of 'The binary vector quantization'. Together they form a unique fingerprint.

  • Cite this

    Yan, L. J., & Hwang, S-H. (2008). The binary vector quantization. In 2008 3rd International Symposium on Communications, Control, and Signal Processing, ISCCSP2008 (pp. 604-607). [4537296] (2008 3rd International Symposium on Communications, Control, and Signal Processing, ISCCSP 2008). https://doi.org/10.1109/ISCCSP.2008.4537296