Basic Fast Fourier (FFT) Demonstrator
This page contains a demonstration of the workings of the Fast Fourier transformation at the most basic level,
showing explicitely how the values of the output are arithmatically correlated to the values of the input,
through all intermediate steps.
For ease of use, a dozen or so input patterns have been predefined, and can be chosen through a form.
Also, two possible FFT evalution patterns are defined.
To further simplify things, inputs in the predefined patterns are limited to unitary and small single-digit values.
For those who want to experiment a bit more, a Free Choice option is also available.