Tech > DFT EXAMPLE
an example of discrete Fourier transform for the cyclic group of n elements (the usual dft)
made by cid
uploaded by cidrb
language: lua
added:
- CLICK TO PLAY -
On iPhone or iPad: tap Play full screen, then Share > Add to Home Screen to play without the browser bars.
1
Comments
 cidrb
|
This is an example of computation of the discrete Fourier transform (DFT) on the cyclic group of n elements on a real vector. Note: The characters were chosen as exp(-2 pi x y /n) (i.e. with minus sign).
The data is generated randomly. Press "z" for new data. Since the DFT is complex valued, the resulting function is pictured in two colors, representing real and imaginary part). You can freely use this code for anything. |
|
cidrb
|
Note: This is not the FFT algorithm. It is computed by the definition (i.e. O(n^2) operations).
|