Anonymous user
Fast Fourier transform: Difference between revisions
m
added true subscripts (2) instead of a half-sized character.
(→{{header|Mathematica}} / {{header|Wolfram Language}}: simplification) |
m (added true subscripts (2) instead of a half-sized character.) |
||
Line 8:
and results in a sequence of equal length, again of complex numbers.
If you need to restrict yourself to real numbers, the output should
be the magnitude (i.e. sqrt(re
The classic version is the recursive Cooley–Tukey FFT. [http://en.wikipedia.org/wiki/Cooley–Tukey_FFT_algorithm Wikipedia] has pseudo-code for that.
| |||