Dynamic windowed codebook search algorithm in vector quantization

Yih Chuan Lin, Shen Chuan Tai

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


We present an efficient codebook search algorithm in a vector quantization (VQ)-based system that searches only through a window of consecutive codewords on the preordered codebook, rather than all codewords in the codebook, and achieves full-search-equivalent performance. The ordering technique used to rearrange the positions of codewords in the codebook utilizes the scattering orientation of codewords in the k-dimensional space or the compactness property of signal energy on the transform domain. The procedure for determining the search window on the ordered codebook relies on the geometric relations among input vector and codewords to eliminate those codewords that are certain not to be the closest codeword to the input vector. Finally, the closest codeword to an input vector is selected from the determined search window by an improved partial distortion search algorithm. In comparison with other existing fast algorithms, the proposed algorithm requires the least number of multiplications and the least total number of distortion measurements.

Original languageEnglish
Article number33105
Pages (from-to)2921-2929
Number of pages9
JournalOptical Engineering
Issue number10
Publication statusPublished - 1996 Oct

All Science Journal Classification (ASJC) codes

  • Atomic and Molecular Physics, and Optics
  • Engineering(all)


Dive into the research topics of 'Dynamic windowed codebook search algorithm in vector quantization'. Together they form a unique fingerprint.

Cite this