.png){kind=icon}
.png){kind=icon}
Return
Variable-dimension vector quantization
.png){kind=icon}
PRE
AI
DOI：10.1109/97.508164.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In many signal compression applications, the evolution of the signal over time can be represented by a sequence of random vectors with varying dimensionality. Frequently, the generation of such variable-dimension vectors can be modeled as a random sampling of another signal vector with a large but fixed dimension. Efficient quantization of these variable-dimension vectors is a challenging task and a critical issue in speech coding algorithms based on harmonic spectral modeling. We introduce a simple and effective formulation of the problem and present a novel technique, called variable-dimension vector quantization (VDVQ), where the input variable-dimension vector is directly quantized with a single universal codebook. The application of VDVQ to low bit-rate speech coding demonstrates significant gain in subjective quality as well as in rate-distortion performance over prior indirect methods.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available