Fast Fourier Transforms

by Emily Ware

Submitted : Spring 2017

A Fast Fourier transform (FFT) algorithm computes the Discrete Fourier Transform (DFT) of a sequence. Fourier analysis converts a signal from its original domain (often time or space) to a representation in the frequency domain and vice versa. In electrical engineering, an FFT is used to the frequencies in the pole pass to detect faulty rotor bars. The FFT converts the AC motor current waveforms from the amplitude vs. time into frequency vs. time. The FFT reads the frequencies at various peak amplitudes, with outlying frequenices identifying broken rotors. 

[ Back ]