**** Fast Fourier Transform by Vincent Thiernesse ****
**** version 3 , 14/12/2006 ****

First I apologize cause it is not so fast because of basic but I'll try to enhance that point.

You can archive all files...and then run FOURIER()

This program makes 128 points FFT from three sources:
*) cbl2 data collection
*) built in data edition
*) make your own 128 points list and store it in var data

Femax = 50000 Khz
F0 = 50000 / 64 / n = 390.625 Hz / n

This program include windowing and several plot modes: abs, sin, cos, log and log-log.

you can also make a user window.


edition:
*) you can use the build_in editor
*) you can first store you func in var data (dim 128 list)
exemple:
seq(x^2/128^2,x,0,127) (sto) data
then run fourier() and choose fft128

Cn coefficients are saved in var datap: Cn = datap[n+1]

advices: 
*) if you want to use this program to calculate fourier an, bn, cn, make sure that you function is synchronous.
*) if it is not use appropriate window.

Good luck !!!

Vincent

PS: CBL bug fixed