(more info)

Math for the people, by the people.

Main Menu

sections Encyclopædia
Papers
Books
Expositions

meta Requests (194)
Orphanage
Unclass'd
Unproven (498)
Corrections (25)
Classification

talkback Polls
Forums
Feedback
Bug Reports

downloads Snapshots
PM Book

information News
Docs
Wiki
ChangeLog
TODO List
Legalese
About

discrete Fourier transform

(Definition)

The discrete Fourier transform (DFT) is an invertible transform widely employed in signal processing and analysis. It can be computed using stable efficient algorithms known as Fast Fourier Transform (FFT) algorithms.

Definition

Given a sequence $\{f_n\}_{n=0}^{N-1}$ of complex numbers, the DFT is defined as a sequence $\{F_k\}_{k=0}^{N-1}$ of complex numbers according to the equation

$\displaystyle F_k = \frac{1}{N^{(1-p)/2}} \sum_{n=0}^{N-1} f_n\,W_N^{-k,n}\quad \quad k=0, 1, 2, \dots, N-1$

where $W_N^{k,n}=e^{2\pi i q k n/N}$ are the basis functions, is an arbitrary real number and is either or .

Similarly, we can reconstruct $\{f_n\}_{n=0}^{N-1}$ from $\{F_k\}_{k=0}^{N-1}$ via the inverse discrete Fourier transform (IDFT):

$\displaystyle f_n = \frac{1}{N^{(1+p)/2}} \sum_{k=0}^{N-1} F_k\,W_N^{k,n}\quad \quad n = 0, 1, 2, \dots, N-1$

Explanation

Generically, if we have some vector $\ensuremath{\mathbf{v}} = (v_1, v_2, \dots , v_n)$ that we wish to project on to a set of unit basis vectors ${ \ensuremath{\mathbf{\hat{B}}}_1, \ensuremath{\mathbf{\hat{B}}}_2, \dots , \ensuremath{\mathbf{\hat{B}}}_m }$ , we find that the th component of the projection $\ensuremath{\mathbf{v}}'$ is given by

$\displaystyle v_k' = \langle \ensuremath{\mathbf{v}}, \ensuremath{\mathbf{\hat{B}}}_k \rangle$

where $\langle \ensuremath{\mathbf{u}},\ensuremath{\mathbf{v}} \rangle$ is an inner product. Using the standard dot product of complex vectors, we have

$\displaystyle v_k' = \sum_{j=0}^m v_j\bar{B}_{k,j}$

(where $\bar{z}$ represents the complex conjugate of

We may use a similar procedure to project a function onto basis functions. Here, the components of our vectors are the functions sampled at certain time intervals.

The idea of the Fourier transform is to project our discrete function $\{f_n\}$ onto a basis made up of sinusoidal functions of varying frequency.

We know from Euler's relation that

$\displaystyle e^{ix} = \cos x + i\sin x$

so we can construct a sinusoidal function of any frequency

$\displaystyle W_N^{k,n} = e^{2\pi i q k n/N} = \cos (2\pi i q k n/N) + i\sin(2\pi i q k n/N)$

By Nyquist's theorem, any frequency components of $\{f_n\}$ above the Nyquist frequency $\frac{N}{2}$ will be aliased into lower frequencies, so we will only concern ourselves with the frequency components $\frac{-N}{2} \leq k \leq \frac{N}{2}$ .

Now we substitute these results into the standard formula for projection to reveal that

$\displaystyle F_k = \sum_{n=0}^{N-1} f_n\,W_N^{-k,n}\quad \quad k=0, 1, 2, \dots, N-1$

Group theoretic interpretation and generalization

This procedure may be interpreted in terms of group theory as follows: The basis functions $\chi_k (j) e^{-2\pi \nu_k i j / f}$ are the characters of the irreducible representations of the group $\mathbb{Z}_M$ . The orthogonality relation $\langle \chi_m, \chi_n \rangle = \delta_{mn}$ which was used to obtain the transform as a projection is the orthogonality relation for characters.

Once we view the discrete Fourier transform in this fashion, it is not hard to generalize it by replacing $\mathbb{Z}_M$ with any discrete group . As it turns out, there are two versions of the generalization which turn out to coincide exactly in the case of commutative groups (such as $\mathbb{Z}_M$ ).

First generalization: Let $f \colon G \to \mathbb{C}$ be conjugation invariant, which means that, for every $y \in G$ , it is the case that $f(yxy^{-1}) = f(x)$ . Then one has

$\displaystyle f(x) = \sum_k \frac{1}{d_k} \langle f, \chi_k \rangle \chi_k (x)$

where the index runs over all irreducible representations and is the dimension of the representation . The inner product on vectors is the usual one:

$\displaystyle \langle \ensuremath{\mathbf{u}}, \ensuremath{\mathbf{v}} \rangle = \sum_{g \in G} \ensuremath{\mathbf{u}} (g) \bar{\ensuremath{\mathbf{v}}} (g)$

The justification for this comes from the fact that the set of irreducible characters spans the space of conjugation invariant functions and the orthogonality of these characters.

Second generalization: If $f \colon G \to \mathbb{C}$ is any function on a group (not necessarily conjugation invariant), then we have the transform

$\displaystyle f(x) = \sum_k \sum_{i,j = 1}^{d_k} \langle f, \rho^{k}_{mn} \rangle \rho^{k}_{mn} (x)$

where and are as before and $\rho^k_{mn}$ are the matrix elements of the representation . The justification for this comes from the fact that the set of matrix elements of representations spans the space of functions on the group and the orthogonality relation for matrix elements.