ifft - Inverse discrete Fourier transform

Syntax

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), 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.

Algorithms

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

See Also

dftmtx | fft

How To

• Signal Processing Operations in Galois Fields

© 1984-2012- The MathWorks, Inc.    -   Site Help   -   Patents   -   Trademarks   -   Privacy Policy   -   Preventing Piracy   -   RSS