This is mostly distilled from Stephen Martucci’s paper (pdf).

The Discrete Fourier Transform and its inverse are linear operators that map periodic signals to periodic signals

Any signal with period can be defined in terms of a finite vector of length using the periodic extension operator defined . Whereas is the infinite transform, which maps periodic signals to periodic signals, let denote the finite transform (matrix), which maps vectors to vectors. These are related through the periodic extension operator

since for all .

The DCT-1

Similarly to the DFT, the Discrete Trigonometric Transforms are linear operators that map real and symmetric periodic signals to real and symmetric periodic signals. If is a periodic signal that is real and symmetric and has even period , then its Fourier transform

is also real and symmetric periodic . This is, in fact, the definition of the DCT-1. Whereas the DFT is defined for complex periodic signals, the DCT-1 is only defined for real and symmetric periodic signals.

Let be a matrix that maps an arbitrary vector to one period of a symmetric periodic signal

such that

and let be the linear operator that maps an arbitrary vector to a symmetric periodic signal. The reason for the “WSWS” subscript will become evident later on. Any symmetric periodic signal can be defined in terms of a finite vector . Since the DCT-1 is equal to the DFT for symmetric periodic signals, the two transforms are related

Finite Transform

If is real and symmetric periodic, then its transform is also real and symmetric periodic. Therefore there exist vectors and such that and . The finite DCT-1 transform is defined as the matrix that relates the unique elements of these two signals . The infinite and finite DCT-1 operators are therefore related

The finite DCT-1 is related to the finite DFT

since and .

To obtain an explicit expression for in terms of , let denote a matrix that is the left inverse of such that

This is an matrix that extracts the unique elements from one period of a symmetric periodic signal. Using the left inverse yields

Convolution

The relationship with the Fourier transform can be used to obtain a convolution theorem for symmetric signals. The convolution of two symmetric periodic signals is a symmetric periodic signal

whose unique elements are related by the finite transform

Proof

Let . Its Fourier transform is

using the Fourier convolution theorem and the properties of the DCT-1. Since the product of two symmetric signals is symmetric, this can be expressed

Since the Fourier transform of is real and symmetric, itself must be real and symmetric , and the elements of must satisfy

q.e.d.

Orthogonality

The finite DFT is orthogonal , which gives Parseval’s theorem . The finite DCT-1 is not orthogonal, although it does satisfy

due to the orthogonality of the Fourier transform. Substitute with diagonal and invertible to give

Therefore, while is not orthogonal, is. This is known as the orthogonal form of the DCT-1. The diagonal matrix counts the number of times each unique element appears in the symmetric periodic extension

More general symmetry

This section will introduce the DST-1, DCT-2 and DST-2 and generalise the above results.

Even more general symmetry

There are a total of sixteen DTTs, of which only four have been discussed so far. To compute the convolution of signals that are anti-periodic, i.e. that have one symmetric and one anti-symmetric reflection, it is necessary to introduce the DCT- and DST-3 and -4. To handle signals that have mixed whole and half symmetry, and therefore odd period, it is necessary to introduce the -odd variant of every transform. For the gritty details, refer to Stephen Martucci’s paper and PhD thesis.