Documentation Center

  • Trials
  • Product Updates

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(2m), the length of x must be 2m-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(2m), where m is an integer between 1 and 8.

More About

expand all

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

|

Was this topic helpful?