Advanced Algorithms Analysis and Design - Lecture 43: Polynomials and fast fourier transform. In this lecture we will cover the following: the coefficient representation; point value presentation; discrete fourier transform; complex root of unity; FFT recursive algorithm; . |