• DocumentCode
    390442
  • Title

    The computation of line spectral frequency using the second Chebyshev polynomials

  • Author

    Tianren, Yao ; Juanjuan, Xiang ; Wei, Lu

  • Author_Institution
    Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., China
  • Volume
    1
  • fYear
    2002
  • fDate
    26-30 Aug. 2002
  • Firstpage
    190
  • Abstract
    Recently, there has been a growing interest in the use of line spectral frequency (LSF) to code the filter parameters for linear predictive coding (LPC) of speech. We present a new version of the algorithm used by J. Rothweiler for computing LSF coefficients (see IEEE Trans. Speech and Audio Processing, vol.7, no.5, 1999). This new version uses the second Chebyshev polynomials to reduce the function order. Theoretical research indicates that the improved algorithm can lead to more concise expressions, eliminate multiplication and reduce the complexity of computation further when the linear prediction order increases.
  • Keywords
    computational complexity; filtering theory; linear predictive coding; polynomials; spectral analysis; speech coding; computational complexity; line spectral frequency; linear prediction order; second Chebyshev polynomials; Chebyshev approximation; Frequency; Linear predictive coding; Nonlinear filters; Polynomials; Quantization; Reflection; Spectral shape; Speech analysis; Speech coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing, 2002 6th International Conference on
  • Print_ISBN
    0-7803-7488-6
  • Type

    conf

  • DOI
    10.1109/ICOSP.2002.1181023
  • Filename
    1181023