Fast Fourier Transform
An algorithm, or digital calculation routine, that efficiently calculates the discrete Fourier transform from the sampled time waveform. In other words it converts, or "transforms" a signal from the time domain into the frequency domain.
- Applications
- Spectral Estimation (Periodograms)
- Fast Convolutions (Fast Frequency Domain FIR Filters)
- Transform Coding (Used In STC, IRIDUM Vocoders, MPEGS, AC-3)
- Speech Recognition and Speech "Pitch" Modifications
- Speech and Image Enhancement (Spectral Noise Subtraction)
- Adaptive System Identification and Noise Cancellation
- Numerical Computation (solving systems of equations, finite elements, etc)
Subjects: Analysis Mechanical Engineering Noise & Vibration Physics Signal Processing
- Further reading:
- Discrete-time Signal Processing, , US Imports & PHIPEs
- Fourier Transform and Its Applications, , McGraw-Hill Book Company Ltd
- Fast Fourier Transform and Its Applications, , Prentice-Hall
- Weblinks:
- Bruel & Kjaer - Technical Reviews These documents give detailed articles on measurement and signal processing theory.