Communications Toolbox

ifft

Inverse discrete Fourier transform

Syntax

ifft(x)

Description

ifft(x) is the inverse discrete Fourier transform (DFT) of the Galois vector x. If x is in the Galois field GF(2^m), then the length of x must be 2^m-1.

Examples

For an example using ifft, see the reference page for fft.

Limitations

The Galois field over which this function works must have 256 or fewer elements. In other words, x must be in the Galois field GF(2^m), where m is an integer between 1 and 8.

Algorithm

If x is a column vector, then ifft applies dftmtx to the multiplicative inverse of the primitive element of the Galois field and multiplies the resulting matrix by x.

See Also

fft, dftmtx, Signal Processing Operations in Galois Fields

huffmanenco

intdump

© 1994-2005 The MathWorks, Inc.