Fourier Transform Calculator - Signal Processing

Fourier Transform Calculator

Calculate F{f(t)} for signal processing

f(t)

Rectangular Examples:

Common Fourier Transform Pairs:

f(t)F(ω)
δ(t)1
12πδ(ω)
u(t)πδ(ω) + 1/(jω)
e^(-at)u(t)1/(a + jω)
rect(t)sinc(ω/2)
tri(t)sinc²(ω/2)
e^(-at²)√(π/a)·e^(-ω²/4a)
cos(ω₀t)π[δ(ω-ω₀) + δ(ω+ω₀)]
sgn(t)2/(jω)

Click any row to compute it. These are the most commonly used transform pairs in signal processing and engineering.

Fourier Transform Properties:

• Linearity: F{af(t) + bg(t)} = aF(ω) + bG(ω)

• Time shift: F{f(t-t₀)} = F(ω)e^(-jωt₀)

• Frequency shift: F{f(t)e^(jω₀t)} = F(ω-ω₀)

• Differentiation: F{f'(t)} = jωF(ω)

• Scaling: F{f(at)} = (1/|a|)F(ω/a)

• Convolution: F{f*g} = F(ω)G(ω)

• Parseval's: ∫|f(t)|²dt = (1/2π)∫|F(ω)|²dω

• Duality: If F{f(t)} = F(ω), then F{F(t)} = 2πf(-ω)

Share this calculator

Help others solve their calculations

Found this calculator helpful? Share it with your friends, students, or colleagues who might need it!

Fourier Transform Calculator Online — Step-by-Step Guide

📅 Published:
Fourier Transform Calculator with symbolic and FFT modes converting time-domain signals to frequency spectra step by step.

The Fourier Transform Calculator converts time-domain signals into their frequency-domain representation, revealing which frequencies are present and how strong each one is. Whether you need to compute a continuous Fourier transform symbolically or run a Fast Fourier Transform (FFT) on discrete data, this tool delivers step-by-step solutions with magnitude and phase spectra.

I first relied on a Fourier transform calculator when analyzing complex audio signals for a Unity-based multiplayer project. The raw time-domain waveform looked chaotic, but transforming it to the frequency domain immediately exposed specific frequency conflicts — 60 Hz power-line hum and aliasing artifacts above the Nyquist frequency. Debugging that would have taken days without frequency analysis.

This online Fourier transform calculator is built for engineers, physics students, data scientists, and anyone working with signals. It handles the mathematical heavy lifting — from setting up the integral F(ω) = ∫f(t)e-jωtdt to computing |F(ω)| and ∠F(ω) — so you can focus on interpreting the results.

How to Use the Fourier Transform Calculator Step by Step

Our Fourier transform calculator operates in two modes, each designed for different use cases:

Symbolic (Continuous) Mode

  1. Select a function type — choose Rectangular, Exponential, Sinusoidal, or Special (delta, unit step, signum, sinc).
  2. Enter your function f(t) — type it directly or click an example button. For instance, enter e^(-2t) for an exponential decay or rect(t/4) for a 4-unit-wide pulse.
  3. Click "Calculate F{f(t)}" — the calculator shows F(ω) with a complete step-by-step derivation, plus magnitude |F(ω)| and phase ∠F(ω) spectra.
  4. Adjust settings — change precision (0–12 decimals), rounding mode, or phase units (radians/degrees).

Discrete FFT Mode

  1. Enter sample values — paste or type comma/space-separated numbers (up to 16,384 samples).
  2. Set the sample rate in Hz — this determines the frequency axis scaling.
  3. Run FFT — the calculator performs a radix-2 Cooley-Tukey FFT, displays a magnitude spectrum bar chart, and lists each frequency bin with its magnitude and phase.

Non-power-of-two sample counts are automatically zero-padded if auto-pad is enabled.

Fourier Transform Calculator Worked Examples

Below are three common Fourier transform examples you can verify with our calculator. Click "Try it" in the calculator above to compute each one instantly.

Example 1: Rectangular Pulse — rect(t)

The rectangular pulse is defined as rect(t) = 1 for |t| ≤ ½ and 0 otherwise. Its Fourier transform is the well-known sinc function:

f(t) = rect(t)

F(ω) = sinc(ω/2) = sin(ω/2) / (ω/2)

|F(ω)| = |sinc(ω/2)|, with zeros at ω = 2nπ (n ≠ 0)

This pair is fundamental in communications: a time-limited pulse has infinite bandwidth, illustrating the uncertainty principle.

Example 2: Exponential Decay — e-atu(t)

The one-sided exponential decay (causal signal) with decay rate a > 0 has a simple rational transform:

f(t) = e^(-2t)·u(t), where a = 2

F(ω) = 1/(2 + jω)

|F(ω)| = 1/√(4 + ω²)

∠F(ω) = -arctan(ω/2)

Faster decay (larger a) produces a wider, flatter frequency spectrum — the signal contains more high-frequency content.

Example 3: Gaussian Function — e-t²

The Gaussian is the only function (up to scaling) that is its own Fourier transform — a uniquely self-similar property:

f(t) = e^(-t²)

F(ω) = √π · e^(-ω²/4)

This self-similarity makes Gaussians fundamental in quantum mechanics (wave packets), optics (beam profiles), and statistics (normal distributions).

What Is the Fourier Transform? Formula and Definition

The Fourier transform decomposes any integrable function f(t) into a continuous spectrum of frequencies. The forward (analysis) formula is:

F(ω) = ∫-∞ f(t) · e-jωt dt

The inverse (synthesis) formula reconstructs the original signal from its spectrum:

f(t) = (1/2π) ∫-∞ F(ω) · ejωt

Together, these two equations form a Fourier transform pair. The forward transform reveals which frequencies are present in a signal and how much energy each frequency carries. The inverse transform reconstructs the original waveform from its frequency components.

Fourier Transform vs. FFT vs. Fourier Series — Key Differences

These three concepts are closely related but serve different purposes. Understanding when to use each is essential for choosing the right mode in our calculator:

FeatureFourier TransformFFT (Fast Fourier Transform)Fourier Series
Input signalContinuous, non-periodicDiscrete samples (digital)Continuous, periodic
OutputContinuous spectrum F(ω)Discrete frequency bins X[k]Discrete coefficients aₙ, bₙ
ComputationAnalytical (integral)O(N log N) algorithmAnalytical (integral over period)
Calculator modeSymbolic modeDiscrete FFT modeFourier Series Calculator

The FFT is the most widely used in practice because real-world signals are sampled digitally. Our Discrete FFT mode implements the Cooley-Tukey radix-2 algorithm, which reduces the O(N²) DFT computation to O(N log N) — making it feasible to analyze thousands of samples in milliseconds.

Applications of the Fourier Transform in Engineering and Science

Fourier Transform Calculator in Signal Processing and Audio Analysis

The Fourier transform is the foundation of modern signal processing. Audio engineers use it to identify frequency content in recordings — revealing unwanted 50/60 Hz hum, isolating voice bands (300–3400 Hz for telephony), or detecting ultrasonic artifacts. Our Fourier transform calculator helps you quickly verify these transforms. For analyzing the sinusoidal building blocks of signals, our sin calculator provides complementary trigonometric computations.

Image Processing and Computer Vision

The 2D Fourier transform extends frequency analysis to images. JPEG compression uses the closely related Discrete Cosine Transform (DCT) to discard high-frequency detail the human eye cannot perceive. Edge detection, denoising, and MRI reconstruction all rely on frequency-domain processing.

Electrical Engineering and Control Systems

Circuit analysis, filter design, and control system stability all depend on frequency-domain methods. The transfer function H(ω) of a linear system is its Fourier transform response — Bode plots, Nyquist diagrams, and gain margins are all frequency-domain tools. For related Laplace-domain analysis, our inverse Laplace transform calculator bridges the gap between time and s-domain.

Physics and Quantum Mechanics

In quantum mechanics, position and momentum wavefunctions are Fourier transform pairs — Heisenberg's uncertainty principle is a direct consequence. In optics, diffraction patterns are the Fourier transform of aperture shapes. X-ray crystallography uses Fourier transforms to determine molecular structures from diffraction data.

Essential Fourier Transform Properties

Understanding these properties lets you compute complex transforms by combining simpler ones — the calculator uses them internally for step-by-step derivations:

  • Linearity: F{af(t) + bg(t)} = aF(ω) + bG(ω). The transform of a sum equals the sum of transforms.
  • Time Shifting: F{f(t-t₀)} = F(ω)·e-jωt₀. A delay in time adds a linear phase — the magnitude spectrum is unchanged.
  • Frequency Shifting (Modulation): F{f(t)·ejω₀t} = F(ω-ω₀). Multiplying by a complex exponential shifts the spectrum — the basis of AM/FM radio.
  • Convolution Theorem: F{f*g} = F(ω)·G(ω). Convolution in time becomes multiplication in frequency — this is why filters are designed in the frequency domain.
  • Parseval's Theorem: ∫|f(t)|²dt = (1/2π)∫|F(ω)|²dω. Total energy is the same in both domains — energy is conserved across the transform.
  • Duality: If F{f(t)} = F(ω), then F{F(t)} = 2πf(-ω). Time and frequency are interchangeable, explaining why rect ↔ sinc works in both directions.

About the Author

Marko Šinko - Co-Founder & Lead Developer

Marko Šinko

Co-Founder & Lead Developer, AI Math Calculator

Lepoglava, Croatia
Advanced Algorithm Expert

Croatian developer with a Computer Science degree from University of Zagreb and expertise in advanced algorithms. Co-founder of award-winning projects, ensuring precise mathematical computations and reliable calculator tools.

Why Choose This Fourier Transform Calculator?

Our free online Fourier transform calculator combines symbolic computation with a discrete FFT engine in a single tool — most competitors offer only one or the other. Key advantages:

  • Step-by-step solutions — see every line of the derivation, from integral setup to final result, not just the answer.
  • Dual mode — symbolic for closed-form transforms, FFT for numerical analysis of real data samples.
  • Interactive transform table — click any common pair (rect, delta, exponential, Gaussian, sgn, sinc) to instantly compute it.
  • Spectrum visualization — magnitude bar chart for FFT results makes it easy to identify dominant frequencies at a glance.
  • Copy results — export transforms or FFT data to clipboard for use in reports, MATLAB, or Python scripts.

Whether you are an engineering student verifying homework, a researcher analyzing experimental data, or a professional designing filters, this Fourier transform calculator delivers accurate results with complete mathematical transparency.

Frequently Asked Questions

Still Have Questions?

The detailed content on this page provides comprehensive explanations and examples to help you understand better.