Warning

This is currently a stub page

Contents

Fourier analysis is fundamentally a method for expressing a function as a sum of periodic components, and for recovering the signal from those components. When both the function and its Fourier transform are replaced with discretized counterparts, it is called the discrete Fourier transform (DFT). The DFT has become a mainstay of numerical computing in part because of a very fast algorithm for computing it, called the Fast Fourier Transform (FFT), which was known to Gauss (1805) and was brought to light in its current form by Cooley and Tukey [CT]. Press et al. [NR] provide an accessible introduction to Fourier analysis and its applications.

fft, ifft, rfft, irfft

fft in more than one dimension

Return the Discrete Cosine Transform [Mak] of arbitrary type sequence `x`.

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

There are theoretically 8 types of the DCT [WP], 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`):

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`):

If `norm='ortho'`, is multiplied by a scaling factor *f*:

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

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

or, for `norm='ortho'`:

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.

[CT] | Cooley, James W., and John W. Tukey, 1965, “An algorithm for the
machine calculation of complex Fourier series,” Math. Comput.
19: 297-301. |

[NR] | Press, W., Teukolsky, S., Vetterline, W.T., and Flannery, B.P.,
2007, Numerical Recipes: The Art of Scientific Computing, ch.
12-13. Cambridge Univ. Press, Cambridge, UK. |

[Mak] | J. Makhoul, 1980, ‘A Fast Cosine Transform in One and Two Dimensions’,
IEEE Transactions on acoustics, speech and signal processing
vol. 28(1), pp. 27-34, http://dx.doi.org/10.1109/TASSP.1980.1163351 |

[WP] | http://en.wikipedia.org/wiki/Discrete_cosine_transform |

scipy.fftpack.convolve performs a convolution of two one-dimensional arrays in frequency domain.