Inferensys

Glossary

Fast Fourier Transform (FFT)

An algorithm that converts a time-domain vibration signal into its constituent frequencies to identify specific mechanical fault signatures.
Moody home-office setup in a converted highrise loft, analyst working late with multiple screens showing knowledge graph visualizations, city lights through large windows behind.
SIGNAL PROCESSING ALGORITHM

What is Fast Fourier Transform (FFT)?

The Fast Fourier Transform (FFT) is an efficient algorithm that converts a time-domain signal into its constituent frequency components, enabling the identification of specific mechanical fault signatures in vibration analysis.

The Fast Fourier Transform (FFT) is a computationally optimized algorithm for computing the Discrete Fourier Transform (DFT). It decomposes a complex time-domain waveform—such as a vibration signal from an accelerometer—into a spectrum of discrete sinusoidal frequencies. This transformation reveals the amplitude and phase of each frequency component, allowing engineers to map specific peaks to physical phenomena like shaft rotation speed or bearing pass frequencies.

In predictive maintenance, FFT is the foundational mathematical tool for vibration analysis. By converting raw sensor data into the frequency domain, it isolates fault signatures such as imbalance, misalignment, and bearing defects that are invisible in the time domain. The algorithm's computational efficiency enables real-time spectral analysis on edge hardware, making it essential for condition-based monitoring and automated fault classification systems.

SIGNAL PROCESSING FUNDAMENTALS

Key Characteristics of FFT

The Fast Fourier Transform is the algorithmic backbone of modern vibration analysis, converting raw time-domain waveforms into frequency-domain spectra to isolate specific mechanical fault signatures.

01

Time-to-Frequency Domain Conversion

The FFT algorithm decomposes a complex, noisy vibration signal—a waveform of acceleration over time—into its constituent sinusoidal frequencies. This transformation reveals the amplitude and phase of each frequency component present in the original signal. In predictive maintenance, this is critical because specific mechanical faults generate energy at characteristic frequencies. For example, a bearing defect will produce a distinct frequency peak related to its Ball Pass Frequency Inner Race (BPFI) , which is invisible in the raw time waveform.

02

Computational Efficiency (O(N log N))

The 'Fast' in FFT is its defining advantage over the Discrete Fourier Transform (DFT). A DFT computes frequency components with a computational complexity of O(N²), making it prohibitively slow for real-time, high-sample-rate sensor data. The Cooley-Tukey FFT algorithm reduces this to O(N log N) by recursively breaking down a DFT into smaller DFTs. This efficiency enables edge devices to perform continuous spectral analysis on streaming vibration data without overwhelming limited processing resources.

03

Fault Signature Identification

Once a time-domain signal is converted to a frequency spectrum, distinct failure modes become identifiable as peaks at specific frequencies:

  • Imbalance: High amplitude peak at the shaft's running speed (1x RPM).
  • Misalignment: Peaks at 1x, 2x, and sometimes 3x RPM.
  • Bearing Defects: Non-synchronous peaks at characteristic frequencies (BPFO, BPFI, BSF, FTF) calculated from bearing geometry.
  • Gear Mesh Faults: Peaks at the gear mesh frequency and sidebands spaced at the shaft speed.
04

Spectral Leakage and Windowing

A practical challenge in applying the FFT to finite, real-world signals is spectral leakage. When the sampled signal does not contain an integer number of cycles, energy 'leaks' into adjacent frequency bins, smearing the spectrum. To mitigate this, a window function (e.g., Hanning, Hamming, Blackman) is applied to the time-domain data before the FFT. The window tapers the signal to zero at its boundaries, reducing leakage and improving the accuracy of amplitude measurements at the cost of slightly reduced frequency resolution.

05

Resolution, Bandwidth, and Sampling

The diagnostic power of an FFT is governed by its parameters:

  • Frequency Resolution (Δf): The spacing between frequency bins, determined by Δf = Sample Rate / N. A finer resolution is needed to separate closely spaced fault frequencies.
  • Bandwidth (Fmax): The maximum frequency that can be analyzed, defined by the Nyquist Theorem as half the sample rate. To detect high-frequency bearing tones, a high sample rate is required.
  • Lines of Resolution (LOR): The number of data points in the spectrum (N/2), dictating the detail of the analysis.
06

Envelope Analysis (Demodulation)

For early-stage bearing and gear faults, the low-energy impact signatures are often buried in high-energy, low-frequency noise from shafts and blades. Envelope analysis uses the FFT in a two-stage process: first, a band-pass filter isolates the high-frequency structural resonance excited by the repetitive impacts. The signal is then demodulated (enveloped), and a second FFT is performed on this envelope. This reveals the low-frequency repetition rate of the impacts, making the fault frequency clearly visible.

SIGNAL PROCESSING FUNDAMENTALS

Frequently Asked Questions

Clear, technically precise answers to the most common questions about the Fast Fourier Transform and its critical role in modern predictive maintenance and vibration analysis.

The Fast Fourier Transform (FFT) is an optimized algorithm that efficiently computes the Discrete Fourier Transform (DFT) by decomposing a time-domain signal into its constituent sinusoidal frequency components. Rather than performing the computationally expensive O(N²) operations of a direct DFT calculation, the FFT exploits symmetries and periodicities in the transform matrix to recursively break down the sequence into smaller transforms, achieving O(N log N) complexity. In predictive maintenance, this means a raw vibration waveform sampled at 20 kHz from an accelerometer is converted into a frequency-domain power spectrum, where distinct peaks directly correspond to specific mechanical faults—such as a peak at 1x running speed indicating unbalance, or harmonics of bearing defect frequencies revealing spalling on an inner race.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.