• DocumentCode
    1269
  • Title

    Comments on “On the Polynomial Multiplication in Chebyshev Form”

  • Author

    Sun-Mi Park ; Ku-Young Chang ; Dowon Hong ; Changho Seo

  • Author_Institution
    Dept. of Appl. Math., Kongju Nat. Univ., Gongju, South Korea
  • Volume
    63
  • Issue
    12
  • fYear
    2014
  • fDate
    Dec. 2014
  • Firstpage
    3162
  • Lastpage
    3163
  • Abstract
    In the above paper, Akleylek proposed an efficient multiplication algorithm for polynomials in Chebyshev form. In this comment, we show that a recombination of the above proposed algorithm induces more efficient algorithm for the multiplications of polynomials in Chebyshev form.
  • Keywords
    Chebyshev approximation; computational complexity; polynomial approximation; Chebyshev polynomials; arithmetic complexity; polynomial multiplication algorithm; Algorithm design and analysis; Chebyshev approximation; Circuits and systems; Complexity theory; Polynomials; Chebyshev polynomials; arithmetic complexity; polynomial multiplication; theory of computation;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2013.179
  • Filename
    6594739
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1269