One-Dimensional Fast Fourier Transform (1D FFT)

Implementation of 1D Fast Fourier Transform using butterfly algorithm for frequency domain conversion; 2D FFT extends this foundation by applying two successive 1D FFT operations - first along rows then columns.