The Computation of Line Spectral Frequencies Using Chebyshev Polynomials

Research output: Contribution to journalArticle

124 Scopus citations

Abstract

Line spectral frequencies provide an alternate parameterization of the analysis and synthesis filters used in linear predictive coding (LPC) of speech. In this paper, a new method of converting between the direct form predictor coefficients and line spectral frequencies is presented. The system polynomial for the analysis filter is converted to two even-order symmetric polynomials with interlacing roots on the unit circle. The line spectral frequencies are given by the positions of the roots of these two auxiliary polynomials. The response of each of these polynomials on the unit circle is expressed as a series expansion in Chebyshev polynomials. The line spectral frequencies are found using an iterative root finding algorithm which searches for real roots of a real function. The algorithm developed is simple in structure and is designed to constrain the maximum number of evaluations of the series expansions. The method is highly accurate and can be used in a form that avoids the storage of trigonometric tables or the computation of trigonometric functions. The reconversion of line spectral frequencies to predictor coefficients uses an efficient algorithm derived by expressing the root factors as an expansion in Chebyshev polynomials.

Original languageEnglish (US)
Pages (from-to)1419-1426
Number of pages8
JournalIEEE Transactions on Acoustics, Speech, and Signal Processing
Volume34
Issue number6
DOIs
StatePublished - Dec 1986

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Signal Processing

Cite this