Abstract
This paper describes a selective root finding method for polynomials based in Complex Analysis results. It can find the poles of the speech signal LPC model that are close to the unit circle, without wasting computations with the others, lesser significant ones. This feature makes our method faster than the standard ones for speech analysis. These poles are in better correspondence with the formants than the local maxima of the spectral envelope. Experimental results are showed. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Zapata, J. L. G., Martín, J. C. D., & Vilda, P. G. (2004). Parallel root-finding method for LPC analysis of speech. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3206, pp. 529–536). https://doi.org/10.1007/978-3-540-30120-2_67
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
