Enchant.
Tools / Audio Concepts / 3. Signal Processing (Continuous to Discrete)
3. Signal Processing (Continuous to Discrete) · Concept 2 of 11

Fast Fourier Transform

It is just a clever shortcut that does a Fourier Transform incredibly fast, so it can run live.

Fast Fourier Transform: sound in → frequencies out Mixed sound (time) block of N samples (power of 2) FFT divide & conquer N·log₂N ops (slow way = N²) Frequency bars (out) low → high Hz (each bar = one bin) Why it is fast (N = 1024 samples) Slow DFT: N² ≈ 1,048,576 ops Fast FFT: N·log₂N ≈ 10,240 ops → about 100x faster Bin width (Hz) = sample rate ÷ FFT size e.g. 48000 ÷ 4096 = 11.7 Hz per bar  •  bigger FFT = finer detail but slower & more lag Nyquist = rate ÷ 2

Same answer as the slow Fourier Transform, computed in a fraction of the operations, so the bars can update live while the band plays.

What it is

A clever shortcut that computes a Fourier Transform in a tiny fraction of the time, fast enough to run live.

Key facts

How it works

  1. Audio is chopped into a block of samples whose length is a power of 2 (e.g. 4096).
  2. A window (Hann) is multiplied over the block to taper the edges to zero.
  3. FFT splits the block in half again and again, reusing shared sums (the divide-and-conquer trick) instead of testing every frequency separately.
  4. Out comes a magnitude (and phase) value for each frequency bin.
  5. Magnitudes are converted to dB and drawn as the bars/curve on your analyser.
  6. The next overlapping block is grabbed and the whole thing repeats many times per second, giving smooth live movement.

Real examples

How it helps in live sound

Everyday analogy

Sorting a huge jar of mixed coins: instead of checking every coin one by one, you tip them through a sorting tray that groups them in seconds, same count, far quicker.

Watch out

Myth: the FFT is a different or less accurate transform. Truth: it gives the identical result to the slow DFT, it is only an algorithm shortcut, the trade-offs come from your chosen FFT size and window, not from the FFT itself.

Fun fact

Without the 1965 Cooley-Tukey FFT a real-time analyser would need roughly 100-4000x more computing power, your phone literally could not draw a live spectrum, the maths was simply too slow before the shortcut.

Key takeaways

  • FFT = a fast algorithm, not a new transform: same answer as the slow DFT.
  • Cost drops from N squared to N log2 N, roughly 100x faster at N=1024.
  • Bin width (Hz) = sample rate / FFT size; bigger FFT = finer detail but more lag.
  • FFT size must be a power of 2; you only get FFT size / 2 useful bins up to Nyquist.
  • Always window the block first (Hann) to kill spectral leakage.
  • It is what makes every live spectrum analyser, tuner and feedback-finder possible.
← Previous
Fourier Transform
☰ All 123 concepts

Need the gear and a crew who know this stuff?

Enchant Entertainment hires and operates sound, lighting and staging across Perth and regional WA.

Get a quoteAll concepts