next up previous contents index
suivant: An exercice with fft monter: Fourier transformation précédent: Fast Fourier Transform :   Table des matières   Index

Inverse Fast Fourier Transform : ifft

ifft takes as argument a list $ \tt [b_0,..b_{N-1}]$ where N is a power of two.
ifft returns the list $ \tt [a_0,..a_{N-1}]$ such that

$\displaystyle \tt fft([a_0,..a_{N-1}])=[b_0,..b_{N-1}]$

Input :
Output :
[0.0, 1.0, 1.0, 0.0]

giac documentation written by Renée De Graeve and Bernard Parisse