摘要
本文研究了近年来在码激励线性预测(CELP)编码方案中涌现出来的一些典型快速算法,对其进行了分类,比较了它们的计算复杂度和存贮要求。
This paper discussed a number of typical fast algorithms emerged in recent years for Code-Excited Linear Predictive (CELP) coding. They are classified into a number of basic methods, and their computational complexity and storage requirerments are compared.
关键词
语音处理
线性预测
码激励
编码
Speech processing, Linear predictive, Vector quantization
