scipy.fftpack.dct(x, type=2, n=None, axis=-1, norm=None, overwrite_x=0)

Return the Discrete Cosine Transform of arbitrary type sequence x.

Parameters :

x : array_like

The input array.

type : {1, 2, 3}, optional

Type of the DCT (see Notes). Default type is 2.

n : int, optional

Length of the transform.

axis : int, optional

Axis over which to compute the transform.

norm : {None, ‘ortho’}, optional

Normalization mode (see Notes). Default is None.

overwrite_x : bool, optional

If True the contents of x can be destroyed. (default=False)

Returns :

y : ndarray of real

The transformed input array.

See also



For a single dimension array x, dct(x, norm='ortho') is equal to MATLAB dct(x).

There are theoretically 8 types of the DCT, only the first 3 types are implemented in scipy. ‘The’ DCT generally refers to DCT type 2, and ‘the’ Inverse DCT generally refers to DCT type 3.

There are several definitions of the DCT-I; we use the following (for norm=None):

y[k] = x[0] + (-1)**k x[N-1] + 2 * sum x[n]*cos(pi*k*n/(N-1))

Only None is supported as normalization mode for DCT-I. Note also that the DCT-I is only supported for input size > 1

There are several definitions of the DCT-II; we use the following (for norm=None):

y[k] = 2* sum x[n]*cos(pi*k*(2n+1)/(2*N)), 0 <= k < N.

If norm='ortho', y[k] is multiplied by a scaling factor f:

f = sqrt(1/(4*N)) if k = 0,
f = sqrt(1/(2*N)) otherwise.

Which makes the corresponding matrix of coefficients orthonormal (OO' = Id).

There are several definitions, we use the following (for norm=None):

y[k] = x[0] + 2 * sum x[n]*cos(pi*(k+0.5)*n/N), 0 <= k < N.

or, for norm='ortho' and 0 <= k < N:

y[k] = x[0] / sqrt(N) + sqrt(1/N) * sum x[n]*cos(pi*(k+0.5)*n/N)

The (unnormalized) DCT-III is the inverse of the (unnormalized) DCT-II, up to a factor 2N. The orthonormalized DCT-III is exactly the inverse of the orthonormalized DCT-II.


‘A Fast Cosine Transform in One and Two Dimensions’, by J. Makhoul, IEEE Transactions on acoustics, speech and signal processing vol. 28(1), pp. 27-34, (1980).

Previous topic


Next topic


This Page