๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fast encoding algorithms for tree-structured vector quantization

โœ Scribed by Jim Z.C. Lai

Book ID
114197837
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
507 KB
Volume
15
Category
Article
ISSN
0262-8856

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the fast search algorithms for vector
On the fast search algorithms for vector quantization encoding
โœ Wen-Shiung Chen; Lili Hsieh; Shang-Yuan Yuan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 128 KB

## 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

Fast Vector Quantization Encoding Based
Fast Vector Quantization Encoding Based onK-d Tree Backtracking Search Algorithm
โœ V. Ramasubramanian; K.K. Paliwal ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 404 KB

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