Tree searched multi-stage vector quantization of LPC parameters for 4 kb/s speech coding
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15206149) , 105-108 vol.1
- https://doi.org/10.1109/icassp.1992.225961
Abstract
The authors present a tree searched multi-stage vector quantization (TS-MSVQ) scheme which achieves spectral distortion lower than 1 dB with low complexity and good robustness using 24 b/frame. The M-L search is used and it is shown that it achieves performance close to that of the optimal search for a relatively small M. The best performance/complexity trade-offs are obtained with relatively small size codebooks cascaded in a three-four stage configuration. Results for log-area ratio (LAR) and line spectral pain (LSP) parameters are presented. A training technique which reduces outliers at the expense of a slight average performance degradation is introduced. The robustness across different languages and input spectral shapings is studied. Finally, it is shown that TS-MSVQ significantly outperforms the split-codebook approach.Keywords
This publication has 4 references indexed in Scilit:
- Spectral quantization and interpolation for CELP codersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Analysis-by-synthesis linear predictive speech coding at 2.4 kbit/sPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Enhanced multistage vector quantization by joint codebook designIEEE Transactions on Communications, 1992
- Efficient vector quantization of LPC parameters at 24 bits/framePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991