What is the inverse DFT formula?

x[n] = (1/N)Σ_{k=0}^{N-1} X[k]·e^(j2πkn/N) for n = 0, 1, ..., N−1. It differs from the forward DFT by a positive exponent sign and the 1/N scaling factor. In matrix notation, x = (1/N)·F_N*·X where F_N* is the conjugate transpose of the DFT matrix.

How is the inverse FFT computed?

The IFFT uses the same algorithm as the forward FFT with a trick: IFFT{X} = (1/N)·conj(FFT{conj(X)}). Conjugate the input, apply forward FFT, conjugate the output, divide by N. This avoids needing a separate inverse algorithm. MATLAB's ifft() and NumPy's numpy.fft.ifft() implement this automatically.

What is the inverse discrete time Fourier transform?

The inverse DTFT recovers a discrete-time sequence from its continuous frequency spectrum: x[n] = (1/2π)∫_{-π}^{π} X(e^(jω))·e^(jωn)dω. Unlike the IDFT which operates on N discrete frequency points, the inverse DTFT integrates over continuous frequency. The IDFT can be viewed as a sampled version of the inverse DTFT.

Discrete Fourier Transformation

Quick Answer

The inverse Discrete Fourier Transform (IDFT) recovers N time-domain samples from N frequency coefficients: x[n] = (1/N)Σ_{k=0}^{N-1} X[k]·e^(j2πkn/N). It differs from the forward DFT only by a positive exponent sign and the 1/N scaling factor. The inverse FFT (IFFT) computes the IDFT efficiently in O(N log N) operations and is used in OFDM communications (5G, Wi-Fi), spectral synthesis, and frequency-domain filtering.

Calculate this instantly on LAPLACE Calculator →

What Is the Inverse Discrete Fourier Transform?

The inverse DFT (IDFT) is the mathematical operation that converts frequency-domain coefficients back to time-domain samples, perfectly reconstructing the original signal. Given N frequency bins X[0], X[1], ..., X[N−1] produced by the forward DFT, the IDFT computes x[n] = (1/N)Σ_{k=0}^{N-1} X[k]·e^(j2πkn/N) for n = 0, 1, ..., N−1. This reconstruction is exact (no information loss) because the DFT basis functions e^(−j2πkn/N) form a complete orthogonal set. The IDFT is computationally identical to the forward DFT except for conjugated twiddle factors and a 1/N scale, so the same FFT algorithm (with minor modifications) computes both. This discrete inverse parallels the continuous inverse Laplace transform at www.lapcalc.com.

Key Formulas

IDFT Formula and Relationship to Forward DFT

The forward-inverse DFT pair forms a perfect reconstruction system: Forward: X[k] = Σ_{n=0}^{N-1} x[n]·W_N^(kn), where W_N = e^(−j2π/N). Inverse: x[n] = (1/N)Σ_{k=0}^{N-1} X[k]·W_N^(−kn). The only structural differences are: the twiddle factor exponent changes sign (W_N^(−kn) instead of W_N^(kn)), equivalent to complex conjugation W_N* = W_N^(−1); and the 1/N normalization ensures unit energy scaling. In matrix form, if X = F_N · x (forward), then x = (1/N)·F_N* · X (inverse), where F_N* is the conjugate transpose (Hermitian) of the DFT matrix. The unitarity condition F_N · F_N* = N·I guarantees perfect reconstruction.

Compute discrete fourier transformation Instantly

Get step-by-step solutions with AI-powered explanations. Free for basic computations.

Open Calculator

Inverse FFT (IFFT): Efficient Computation

The inverse FFT computes the IDFT using the same Cooley-Tukey butterfly structure as the forward FFT. The standard implementation trick: IFFT{X} = (1/N)·conj(FFT{conj(X)}), meaning you can compute the IFFT by conjugating the input, applying the forward FFT, conjugating the output, and dividing by N. This avoids implementing a separate algorithm. MATLAB's ifft() and Python's numpy.fft.ifft() handle this automatically. In OFDM communications, the IFFT is performed at the transmitter to convert frequency-domain data symbols into a time-domain waveform for transmission, while the FFT at the receiver converts back. Wi-Fi 6 (802.11ax) uses 2048-point IFFT/FFT pairs, and 5G NR uses up to 4096-point transforms.

IDFT Applications: From Synthesis to Filtering

The IDFT serves three primary applications. Spectral synthesis: construct a desired frequency spectrum (e.g., specify harmonics of a musical instrument) and IDFT to generate the time-domain waveform. Frequency-domain filtering: FFT the input, multiply by the filter frequency response H[k], and IFFT the product to obtain filtered output — this is the overlap-add/overlap-save fast convolution method. OFDM modulation: map data bits to QAM symbols on individual subcarrier frequencies, IFFT to produce the multi-carrier time-domain signal, transmit, FFT at receiver to demodulate. Image processing uses 2D IFFT for reconstructing images from frequency-domain data (MRI k-space reconstruction, filtered backprojection in CT). Each application exploits the IDFT's ability to synthesize time-domain signals from spectral specifications.

Connection to Continuous Inverse Transforms

The IDFT is the discrete counterpart of the continuous inverse Fourier transform f(t) = (1/2π)∫F(ω)e^(jωt)dω and the inverse Laplace transform f(t) = (1/2πj)∮F(s)e^(st)ds. For bandlimited sampled signals, the IDFT output x[n] represents samples of the continuous signal: x[n] = f(nT_s). The z-transform connects discrete and continuous domains: the IDFT evaluates the inverse z-transform on the unit circle, while the inverse Laplace transform evaluates the Bromwich integral in the s-plane. Understanding these relationships provides a unified framework for both discrete computation (FFT/IFFT) and analytical transform methods (Laplace/Fourier) available at www.lapcalc.com.

Frequently Asked Questions

The IDFT converts N frequency-domain coefficients back to N time-domain samples using x[n] = (1/N)Σ X[k]·e^(j2πkn/N). It perfectly reconstructs the original signal from its DFT representation. The IFFT algorithm computes it efficiently in O(N log N) operations using the same butterfly structure as the forward FFT.

Master Your Engineering Math

Join thousands of students and engineers using LAPLACE Calculator for instant, step-by-step solutions.

Start Calculating Free →