Lecture 9: Polynomial Multiplication with FFT - Part 1

This lecture introduces polynomial multiplication using Discrete Fourier Transform (DFT) and its efficient representation using Fast Fourier Transform (FFT). We consider the duality of polynomial representation both: coefficient representation and point-value representation. Converting from coefficient representation to point-value representation corresponds to the discrete Fourier transform whilst the reverse direction corresponds to inverse Fourier transform. Instruction language is Arabic, however, all the slides, material, definitions, concepts, examples, etc., are all in English.