Issue No. 06 - June (2012 vol. 61)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2011.110
Pascal Giorgi , (LIRMM), CNRS, Université Montpellier 2, Montpellier
In a recent paper, Lima, Panario, and Wang have provided a new method to multiply polynomials expressed in Chebyshev basis which reduces the total number of multiplication for small degree polynomials. Although their method uses Karatsuba's multiplication, a quadratic number of operations are still needed. In this paper, we extend their result by providing a complete reduction to polynomial multiplication in monomial basis, which therefore offers many subquadratic methods. Our reduction scheme does not rely on basis conversions and we demonstrate that it is efficient in practice. Finally, we show a linear time equivalence between the polynomial multiplication problem under monomial basis and under Chebyshev basis.
Theory of computation, computations on polynomials, arithmetic, polynomial multiplication, Chebyshev basis.
P. Giorgi, "On Polynomial Multiplication in Chebyshev Basis," in IEEE Transactions on Computers, vol. 61, no. , pp. 780-789, 2011.