Lecture 11: Polynomial and Integer Multiplication using the FFT

Background Material



  1. Review of evaluation, pointwise product, interpolation algorithm for polynomial multiplication.
  2. The inverse DFT.
  3. Computation of the FFT in Z_p.
    1. The primitive element theorem.
    2. The prime number theorem and Fourier primes.
  4. The three primes algorithm.

Lecture Slides

  1. fast.ppt - power point slides containing lecture notes on FFT-based polynomial and integer (3 primes) multiplication.

Maple worksheets and programs


Created: Nov. 15, 2005 by jjohnson@cs.drexel.edu