Fast vector quantisation encoding algorithm using zero-tree data structure

Wen Jyi Hwang, Biing Yau Chen

Research output: Contribution to journalArticlepeer-review


A fast codeword search algorithm based on partial distance search (PDS) and zero-tree data structure is presented. Before the fast search, the zero-trees of the wavelet coefficients of codewords and sourcewords are first identified. The PDS is then preformed only over the wavelet coefficients which are not inside the zero-trees. The algorithm is well-suited to applications where degradation in average distortion is allowed to achieve very low arithmetic complexity.

Original languageEnglish
Pages (from-to)1290-1292
Number of pages3
JournalElectronics Letters
Issue number15
Publication statusPublished - 1997 Jul 17
Externally publishedYes


  • Data structures
  • Vector quantisation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Fast vector quantisation encoding algorithm using zero-tree data structure'. Together they form a unique fingerprint.

Cite this