Matrices.org

Discrete Fourier Transform Matrix Generator

Generate complex-valued Fourier matrices for digital signal processing, numerical analysis and engineering. Choose the matrix size, inspect individual entries, and explore the inverse and normalized DFT matrices.

Generate a DFT Matrix

Choose the number of samples and the output format. The generator calculates the forward DFT matrix and its inverse.

DFT convention: This generator uses the negative exponential sign for the forward transform and the positive exponential sign for the inverse transform. The inverse matrix includes the factor 1/N.
Generate a square N × N Fourier matrix. Supported sizes: 2 to 32.
Controls how complex matrix entries are displayed.
Select the matrix representation you want to inspect.
Choose how each complex matrix element is displayed.

Generated Fourier Matrix

Matrix dimensions —
Selected representation —
Complex matrix entries —

Matrix Output

Fourier Matrix Properties

Forward matrix definition —
Inverse matrix definition —
Orthogonality property —
Unitary normalization —

What Is a Discrete Fourier Transform Matrix?

The Discrete Fourier Transform (DFT) converts a finite sequence of samples from the time domain into its frequency-domain representation. It is widely used in digital signal processing, communications, image processing, audio analysis and scientific computing.

The DFT can be represented as multiplication by a complex-valued square matrix. For a sequence containing N samples, the DFT matrix has N rows and N columns.

DFT Matrix Formula

The forward DFT matrix is defined using complex roots of unity:

F[k,n] = exp(-i 2πkn / N)

where:

  • N is the number of samples.
  • k is the frequency index, from 0 to N − 1.
  • n is the sample index, from 0 to N − 1.
  • i is the imaginary unit, where i² = −1.

The matrix can be written in terms of the complex root of unity WN:

WN = exp(-i 2π / N)
F[k,n] = WNkn

If x is the input signal vector, the DFT coefficient vector X is obtained by:

X = F x

Inverse Discrete Fourier Transform Matrix

The inverse DFT converts frequency-domain coefficients back into the original sequence. Its matrix uses the positive exponential sign and a normalization factor of 1/N.

F⁻¹[k,n] = (1/N) exp(i 2πkn / N)

The inverse transformation is:

x = F⁻¹ X

The forward and inverse matrices satisfy:

F⁻¹ F = I

Unitary Fourier Matrix

A unitary DFT matrix is obtained by scaling the forward DFT matrix by 1/√N. This produces a matrix whose conjugate transpose is its inverse.

U = F / √N
Uᴴ U = I

Here, Uᴴ represents the conjugate transpose of U. The unitary representation is useful in mathematical analysis because it preserves vector norms and energy.

Applications of DFT Matrices

  • Digital signal processing: Frequency analysis of sampled signals.
  • Audio processing: Spectral analysis and audio filtering.
  • Image processing: Frequency-domain image analysis and filtering.
  • Wireless communications: Multicarrier modulation and OFDM systems.
  • Engineering: Analysis of periodic signals and system responses.
  • Scientific computing: Numerical methods and spectral analysis.

DFT Matrix vs. Inverse DFT Matrix

Feature Forward DFT Inverse DFT
Exponential sign Negative Positive
Normalization No 1/N factor Includes 1/N
Purpose Time to frequency domain Frequency to time domain
Matrix dimensions N × N N × N

Frequently Asked Questions

1. What is a DFT matrix?

A DFT matrix is a complex-valued square matrix that represents the discrete Fourier transform as a matrix multiplication.

2. What is the size of a DFT matrix?

For N input samples, the DFT matrix has N rows and N columns. For example, four input samples produce a 4 × 4 DFT matrix.

3. Why does the DFT matrix contain complex numbers?

Complex exponential functions represent both the magnitude and phase of frequency components. This makes complex numbers a natural representation for Fourier transformations.

4. What is the difference between a standard and unitary DFT matrix?

The standard forward DFT matrix is not normalized. The unitary version is divided by the square root of N, making its conjugate transpose equal to its inverse.

5. Can I download the generated matrix?

Yes. Use the download button to export the currently displayed matrix as a CSV file. The complex entries are represented as separate real and imaginary components.

Related Matrix Tools

Explore more matrix calculators and numerical tools: