Telecharger Cours

The Discrete Fourier Transform - IRMA, Strasbourg

FDd ? FDd is bijective. ? Hence FDd is bijective (on polynomials of degree ? d). ? (PQ)(?i ) = P(?i )Q(?i ) so FDd (PQ) = FDd (P) ? FDd (Q).



Download