Fourier transform: Difference between revisions
| Line 23: | Line 23: | ||
and IFFT is defined as: | and IFFT is defined as: | ||
<math display="block">a_m = \frac{1}{n} \sum_{k=0}^{n-1} \hat{f}(\xi) \exp \left\{ 2 \pi i \frac{mk}{n} \right\}</math> | <math display="block">a_m = \frac{1}{n} \sum_{k=0}^{n-1} \hat{f}(\xi) \exp \left\{ 2 \pi i \frac{mk}{n} \right\}</math> | ||
That the main different between the FFT and IFFT is the negative symbol in the exponent. | |||
You can implement IFFT as <code>IFFT(x) = conj(FFT(conj(x)))</code><ref name="siembida2010ifft"></ref>. | |||
==Properties== | ==Properties== | ||