A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form
Juliano Bandeira Lima, Daniel Panario, Qiang Wang · IEEE Transactions on Computers · 2010
In this paper, we present a new method for multiplying polynomials in Chebyshev form. Our approach has two steps. First, the well-known Karatsuba's algorithm is applied to polynomials constructed by using Chebyshev coefficients. Then, from the obtained result, extra arithmetic operations are used to write the final result in Chebyshev form. The proposed algorithm has a quadratic computational complexity. We also compare our method to other approaches.