一种基于牛顿迭代法求解LSF的有效算法  

An Efficient Method for the Computation of Line Spectral Frequencies Based on Newton-Raphson

作　　者：刘璐[1] 郭立[1] 王妙锋[1] 

机构地区：[1]中国科学技术大学电子科学与技术系,安徽合肥230026

出　　处：《微电子学与计算机》2006年第4期149-152,共4页Microelectronics & Computer

摘　　要：文章针对10阶LSF参数求解,提出一种基于牛顿迭代法的有效算法,并通过实验比较了该算法和经典的Kabal搜索算法的运算量、精度。该算法避免了多项式降次,计算量又远远小于经典的搜索算法,适于用大规模集成电路实现,而且可以推广应用于求解更高阶LSF参数。Focusing on the characteristics of 10th-order LSF （line spectral frequencies）, this paper proposed an efficient method based on Newton Raphson. Experiment and analysis was given to compare the precision and computational quantity between our method and the traditional Kabal＇s method. Our algorithm not only avoids polynomial deflation but also is more efficient than traditional rootfinding algorithm and it is fit for being realized by VLSI. Furthermore, our method could be deduced to high-order LSF application.

关 键 词：语音编码 线谱频率 牛顿迭代法 大规模集成电路 

分 类 号：TN912.32[电子电信—通信与信息系统]