• DocumentCode
    2262310
  • Title

    The computation of line spectrum pair frequencies using Tschirnhaus transform

  • Author

    Chen, Shi-Huang ; Chang, Yaotsu ; Syuan, Chang Jian Yu

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Shu-Te Univ., Taiwan
  • fYear
    2009
  • fDate
    24-27 May 2009
  • Firstpage
    2333
  • Lastpage
    2336
  • Abstract
    In this paper, a new algorithm based on the Tschirnhaus transforms is developed to reduce the computation complexity of the 10-order line spectrum pairs (LSP) frequencies. 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 extremes of the 5-degree LSP polynomial can be found by applying the Tschirnhaus transform to the above quartic equation. By the use of these extremes as the initial approximations, one can easily solve the roots of the 5-degree LSP polynomial via the Newton´s method and get the accurate LSP frequencies. One of the main advantages of the proposed algorithm is the rapid root determination of a quartic equation without complex number operations and resulting in considerable computational saving. Compared to other methods, the proposed algorithm can determine the precise LSP frequencies with the lowest computational complexity.
  • Keywords
    Newton method; computational complexity; linear codes; polynomials; speech coding; transforms; 5-degree LSP polynomial; Newton method; Tschirnhaus transform; computational complexity; line spectrum pair frequencies; linear predictive coding; quartic equation; speech coding system; Cities and towns; Computational complexity; Computer science; Discrete cosine transforms; Equations; Frequency; Linear predictive coding; Mathematics; Newton method; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2009. ISCAS 2009. IEEE International Symposium on
  • Conference_Location
    Taipei
  • Print_ISBN
    978-1-4244-3827-3
  • Electronic_ISBN
    978-1-4244-3828-0
  • Type

    conf

  • DOI
    10.1109/ISCAS.2009.5118267
  • Filename
    5118267