Karatsuba multiplication with temporary space of size ≤ n
Abstract
We describe in this short note how it is possible to perform a Karatsuba multiplication of two polynomials of degree n − 1 using a buffer holding at most n − 1 coefficients if n is even, and n coefficients if n is odd. This method is valid for any n (in other words, when n ≥ 2). Similar results can be obtained for the Karatsuba squaring.
Domains
Computer Arithmetic
Origin : Files produced by the author(s)
Loading...