Any signal is a sum of frequencies. Compose one from a few tones and some noise, and the Fourier transform pulls those exact frequencies back out.
Fourier Transform (FFT)Live
decompose a signal into frequencies
Controls
Build a signal from a few sine tones plus noise, and the discrete Fourier transform recovers exactly which frequencies are present — the foundation of all signal processing.
Reading this result: The FFT splits this 2-tone signal into bins: each input sinusoid at 4, 9 appears as a distinct spike, and with noise at 0 the baseline between them stays clean.
Runs locally in your browser — free forever. Scale to the cloud when reality gets heavy.
★ Sign in to save this setupSave your tuned setup, or drop this simulation into your own site, docs, or course page.
How it works
The discrete Fourier transform converts a time-domain signal into its frequency spectrum, revealing which sinusoids it contains. It underpins audio, image, and radio processing, data compression, and nearly all of modern signal analysis.
✦
Ask the AI about this model
The math, the assumptions, real-world uses, or a code translation — explained for this exact simulation.
Yes. Fourier Transform (FFT) runs entirely in your browser using your device's own compute, so local use is free forever. You only pay Compute Tokens if you scale a job to the cloud.
Do I need to install anything?▾
No. Everything runs client-side in a modern browser — no downloads, no license, no account required to start.
Can I save or share my simulation?▾
Create a free account to save projects, and use a shareable embed or minted DOI to publish a live, interactive version anywhere.
How accurate are the results?▾
The solver uses established numerical methods, but results are for research and educational purposes and should be validated against experiment or professional review before you rely on them.