Content deleted Content added
m Disambiguating links to FFT (disambiguation) (link changed to Fast Fourier transform) using DisamAssist. |
|||
Line 98:
=== MD FFT ===
A [[fast Fourier transform]] (FFT) is an algorithm to compute the discrete Fourier transform (DFT) and its inverse. An FFT computes the DFT and produces exactly the same result as evaluating the DFT definition directly; the only difference is that an FFT is much faster. (In the presence of round-off error, many FFT algorithms are also much more accurate than evaluating the DFT definition directly).There are many different FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group theory and number theory. See more in [[Fast Fourier transform|FFT]].
=== MD DFT ===
| |||