DocumentCode :
3274017
Title :
The computation of line spectrum pair using modified complex-free Ferrari formula
Author :
Chen, Shi-Huang ; Ruan, Jiun-Ching ; Chen, Chia-Hsiang ; Wu, Hsin-Te ; Truong, T.K.
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Shu-Te Univ., Taiwan
fYear :
2005
fDate :
13-16 Dec. 2005
Firstpage :
393
Lastpage :
396
Abstract :
This paper proposed a fast algorithm for computing the line spectrum pairs (LSP) parameters that are widely used in speech coding systems. The first step of the proposed algorithm is to derive a quartic equation from the 1st derivative of the given 5-degree LSP polynomial. Then the approximate extremes of the 5-degree LSP polynomial can be found by applying the proposed modified complex-free Ferrari´s formula to the above quartic equation. By the use of these approximate extremes as the initial approximations, one can easily solve the roots of the 5-degree LSP polynomial via Newton´s method and get the accurate LSP parameters. One of main advantages of the proposed algorithm is that the modified complex-free Ferrari´s formula can rapidly determine the roots of a quartic equation and resulting in considerable computational saving. In comparison with other methods, the proposed algorithm can determine precise LSP parameters with the lowest computational complexity.
Keywords :
Newton method; computational complexity; speech coding; Newton method; computational complexity; line spectrum pair; modified complex-free Ferrari formula; quartic equation; speech coding systems; Computational complexity; Computer science; Discrete cosine transforms; Equations; Linear predictive coding; Newton method; Nonlinear filters; Parameter estimation; Polynomials; Speech coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Signal Processing and Communication Systems, 2005. ISPACS 2005. Proceedings of 2005 International Symposium on
Print_ISBN :
0-7803-9266-3
Type :
conf
DOI :
10.1109/ISPACS.2005.1595429
Filename :
1595429
Link To Document :
بازگشت