Implementation of a fast Fourier transform (FFT) for image processing applications

Different fast Fourier transform (FFT) algorithms for hardware implementation have been considered. We propose an implementation whereby two radix-N
^1/2
passes are carried out in parallel and in which each N
^1/2
-point transform is carried out via a serial input parallel output transform circuit. The processing rate is one clock cycle per input point for the N-point transform regardless of the value of N chosen. The circuit is being implemented with TTL logic and will be used to perform spatial frequency domain filtering on two dimensional infrared camera images in real time; real time meaning processing between frame display.