Fast VQ Codebook Search Algorithms Using Index Table


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 10, pp. 3272-3279, Oct. 2000
10.3745/KIPSTE.2000.7.10.3272,   PDF Download:

Abstract

In this paper, we propose two fast VQ codebook search algorithms efficient to the Wavelet/VQ coding schemes. It is well known that the probability having large values in wavelet coefficient blocks is very low. In order to apply this property to codebook search, the index tables of the reordered codebook in each wavelet subband are used. The exit condition in PDE can be satisfied in an early stage by comparing the large coefficients of the codeword with their corresponding elements of input vector using the index tables. As a result, search time can be reduced.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
D. Y. Lee, J. H. Hwang, C. S. Hong, Y. S. Kwak, "Fast VQ Codebook Search Algorithms Using Index Table," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 10, pp. 3272-3279, 2000. DOI: 10.3745/KIPSTE.2000.7.10.3272.

[ACM Style]
Dae Young Lee, Jae Ho Hwang, Choong Seon Hong, and Yoon Sik Kwak. 2000. Fast VQ Codebook Search Algorithms Using Index Table. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 10, (2000), 3272-3279. DOI: 10.3745/KIPSTE.2000.7.10.3272.