Content deleted Content added
change FFT to DFT and explain the relationship |
m add WikiLink |
||
Line 56:
}}
where DFT and IDFT refer to the [[discrete Fourier transform]] and its inverse, evaluated over <math>N</math> discrete points. For efficiency, the transforms are customarily implemented by the [[Fast Fourier transform]] (FFT) algorithm, and <math>N</math> is chosen to be an integer power-of-2.
==Pseudocode==
| |||