## Abstract One of the major difficulties arising in vector quantization (VQ) is high encoding time complexity. Based on the wellβknown partial distance search (PDS) method and a special order of codewords in VQ codebook, two simple and efficient methods are introduced in fast full search vector qu
An improved fast encoding algorithm for vector quantization
β Scribed by Li-Juan Liu; Xu-Bang Shen; Xue-Cheng Zou
- Publisher
- John Wiley and Sons
- Year
- 2003
- Tongue
- English
- Weight
- 148 KB
- Volume
- 55
- Category
- Article
- ISSN
- 1532-2882
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we consider the K-d tree-based backtracking search algorithm and study its performance in the context of vector quantization encoding of speech waveform. We discuss the basic algorithm in detail and highlight the features of optimization as observed from theoretical analysis and from t
Given an undirected graph with edge costs and a subset of k nodes called terminals, a multiway cut is a subset of edges whose removal disconnects each terminal from the rest. Multiway Cut is the problem of finding a multiway cut of minimum cost. Previously, a very simple combinatorial algorithm due
Time-domain averaging (TDA) is a common method to extract a periodic component of interest from a noisy compound signal. With the period of the interesting component determined, we often consecutively cut out some segments in length of the period from the compound signal and directly average them. I