首页> 外文会议>European Conference on Speech Communication and Technology >Quality-Complexity Trade-off in Predictive LSF Quantization
【24h】

Quality-Complexity Trade-off in Predictive LSF Quantization

机译:预测LSF量化的质量复杂性权衡

获取原文

摘要

In this paper several techniques are investigated for reduction of complexity and/or improving quality of a line spectrum frequencies (LSF) quantization based on switched prediction (SP) and vector quantization (VQ). For switched prediction, a higher number of prediction matrices is proposed. Quality of the quantized speech is improved by the prediction multi-candidate and delayed decision algorithm. It is shown that quantizers with delayed decision can save up to one bit still having similar or even lower complexity than the baseline quantizers with 2 switched matrices. By efficient implementation of prediction, lower complexity can be achieved through use of prediction matrices with reduced number of non-zero elements. By combining such sparse matrices and multiple prediction candidates, the best quality-complexity compromise quantizers can be obtained as demonstrated by experimental results.
机译:在本文中,研究了几种技术,用于减少基于开关预测(SP)和矢量量化(VQ)的线频率频率(LSF)量化的复杂性和/或提高质量。对于切换预测,提出了更大量的预测矩阵。预测多候选和延迟决策算法改善了量化语音的质量。结果表明,具有延迟判定的量化器可以节省多达一个比具有2个切换矩阵的基线量化器相似甚至更低的复杂性。通过有效地实现预测,可以通过使用具有减少数量的非零元素的预测矩阵来实现更低的复杂性。通过组合这种稀疏矩阵和多个预测候选,可以通过实验结果所证明的可以获得最佳质量复杂性折衷量器。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号