Discrete Fourier Transform Calculator
The discrete Fourier transform of a real sequence, printed as frequency, magnitude and phase per bin.
Discrete Fourier Transform Calculator
The discrete Fourier transform of a real sequence, printed as frequency, magnitude and phase per bin.
What the page prints, and what it refuses
Every figure is printed with the rule or formula that produced it, and any numerical tolerance is stated on the result rather than implied. The page refuses an input the formula does not define and names the value it read; it prints no answer it cannot support.
The calculation runs entirely in this browser tab; nothing is uploaded.
The page computes the discrete Fourier transform of a real sequence: for each bin k it prints the frequency k/N cycles per sample, the magnitude |X| and the phase in degrees. The four samples 1, 0, 0, 0 have one unit of magnitude in every bin, which is the transform of an impulse.
The input is data, not a formula, so this needs no expression parser: it is the defining sum evaluated directly, in double precision. The page prints the lowest 16 bins of the N/2 + 1 real-signal bins and counts the rest.
Why there is no integral here
For N samples, X[k] = Σ x[t]·e^(−2πikt/N). The page evaluates that sum for every k from 0 to N/2, the bins a real signal actually distinguishes, and prints the magnitude and phase of each.
This is a discrete transform, not the continuous Fourier transform and not a symbolic one. No function is differentiated or integrated, and the page never claims a closed form for a signal.
How to use Discrete Fourier Transform Calculator
Paste or type the samples, one per line or comma-separated, up to 512 values, then press Run.
The result prints N, the number of bins, then one line per bin with its frequency, magnitude and phase.
What to Expect
Best for
- Inspecting the frequency content of a sampled signal
- Checking a DFT by hand on a short sequence
- Seeing the phase of a bin, not just its magnitude
Not ideal for
- A continuous Fourier transform
- More than 512 samples in one run
- An inverse transform, which is a different sum
What this tool keeps
- Every sample and its order
What may need cleanup
- Nothing: the bins are final doubles
Common errors
- A non-numeric sample is refused by name
- An empty sequence is refused
Example use cases
- Transform a four-sample impulse
- Find the frequency of a sampled sine
- Check the DC bin is the mean
Sample input
1, 0, 0, 0
Sample output
N = 4, with |X| = 1 in every bin and phase 0°
Who this is for
- Signals students
- Engineers checking a DFT by hand
Frequently asked questions
Is this an FFT?
It is the same transform, evaluated by the direct sum rather than the fast algorithm. At 512 samples the direct sum is instant, and it is easier to check against the definition.
Why only half the bins?
A real signal's spectrum is conjugate-symmetric, so bins above N/2 repeat the ones below. The page prints the non-redundant half and says so.
What does the DC bin mean?
The k = 0 bin is the sum of the samples, so its magnitude divided by N is the mean. The page prints the unnormalised magnitude and the definition, so the scaling is not a guess.
Build custom tools for your store
Join the SDK program to create useful ecommerce utilities for your store.