fft The radix-2 algorithms are the simplest FFT algorithms.

The decimation-in-time (DIT) radix-2 FFT recursively partitions

a DFT into two half-length DFTs of the even-indexed and odd-indexed

time samples.

The outputs of these shorter FFTs are reused to compute many outputs