This is documentation for Mathematica 4, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.2)



FilledSmallSquareInverseFourier[list] finds the discrete inverse Fourier transform of a list of complex numbers.

FilledSmallSquare The inverse Fourier transform of a list of length is defined to be .

FilledSmallSquare Note that the zero frequency term must appear at position 1 in the input list.

FilledSmallSquare Other definitions are used in some scientific and technical fields.

FilledSmallSquare Different choices of definitions can be specified using the option FourierParameters.

FilledSmallSquare With the setting FourierParameters -> a, b the discrete Fourier transform computed by Fourier is .

FilledSmallSquare Some common choices for a, b are {0, 1} (default), {-1, 1} (data analysis), {1, -1} (signal processing).

FilledSmallSquare The setting effectively corresponds to reversing both input and output lists.

FilledSmallSquare To ensure a unique discrete Fourier transform, must be relatively prime to .

FilledSmallSquare The list of data need not have a length equal to a power of two.

FilledSmallSquare The list given in InverseFourier[list] can be nested to represent an array of data in any number of dimensions.

FilledSmallSquare The array of data must be rectangular.

FilledSmallSquare If the elements of list are exact numbers, InverseFourier begins by applying N to them.

FilledSmallSquare See The Mathematica Book: Section 1.6.6 and Section 3.8.3.

FilledSmallSquare See also: Fourier, InverseFourierTransform.

Further Examples