ifft
Inverse fast Fourier transform of Galois field vector
Syntax
Description
Examples
Input Arguments
Output Arguments
Limitations
The Galois field, GF(2m), over which this function works must have 256 or fewer elements. In other words, m must be an integer in the range [1, 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
. If x
is a row vector, the order of the matrix multiplication is reversed.
Version History
Introduced before R2006a