Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CASC
2009
Springer

favoriteEmaildiscussreport

130views Mathematics» more CASC 2009»

Code Generation for Polynomial Multiplication

13 years 11 months ago

Code Generation for Polynomial Multiplication

Download www.csd.uwo.ca

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.

Ling Ding, Éric Schost

Real-time Traffic

CASC 2009 | Code Generation Techniques | Explicit Versions | Mathematics | Polynomial Multiplication |

claim paper

Related Content

» Determination of the Best CRC Codes with up to 10Bit Redundancy

» Polynomialtime algorithms for coding across multiple unicasts

» Modular Representations of Polynomials Hyperdense Coding and Fast Matrix Multiplication

» Skewcyclic codes

» From Equation to VHDL Using Rewriting Logic for Automated Function Generation

» Predicting the Shrinking Generator with Fixed Connections

» A Polynomial Algorithm for Codes Based on Directed Graphs

» Ramanujans class invariants and their use in elliptic curve cryptography

» Generating All Abductive Explanations for Queries on Propositional Horn Theories

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CASC
Authors	Ling Ding, Éric Schost

Comments (0)