Code Generation for Polynomial Multiplication

We discuss the family of “divide-and-conquer” algorithms for polynomial multiplication, that generalize Karatsuba’s algorithm. We give explicit versions of transposed and short products for this family of algorithms and describe code generation techniques that result in highperformance implementations.

• Type: Conference
• Year: 2009
• Where: CASC
• Authors: Ling Ding, Éric Schost
• Keywords: CASC 2009, Code Generation Techniques, Explicit Versions, Mathematics, Polynomial Multiplication