What on earth is DFT?
DFT stands for Discrete Fourier Transform and is used to split one wave into multiple waves of differing frequencies. Although fourier transforms are technically calculated using integration, DFT uses summation so that it can be computed (computers unfortunately cannot count to infinity, which is required for integration). The formula is pictured to the rightbelow and requires knowledge of the complex number system to use.
How is DFT Utilised Here?
There are two ways that DFT can be utilised in this program.
The algorithm pictured to the leftabove
is is the main function of this application. It takes in an list of coordinates as inputs, runs it through the DFT
algorithm and outputs information to draw the multitude of waves (as circles).
The second way (currently not implemented) is by just passing in a series of y coordinates, it can recreate any wave
as a multitude of waves with differing frequencies (once again, depicted as circles) assuming that points are moving
away (as if the x axis were time).
Upload an Image or Draw an Outline