FFT

Syntax: FFT(R)

R = a range

FFT generates the Discrete Fourier Transform of the range R using a Fast Fourier Transform algorithm. The length of the range must be a power of 2. FFT will produce the same results as a DFT, but it is much faster ($N \log N$ time time, as opposed to $N^2$ time).

Examples:

Vector C1..C4 =

	C
1	1.2
2	3.4
3	54.3
4	0.34

FFT(C1..C4) =

59.24	0
-53.1	3.06
51.76	0
-53.1	-3.06

Excel function: N/A