— Loadable Function: y = fifft (x)

Radix-4 ifft in fixed point for vectors of length 4^n, where. n is an integer. The variable x can be a either a row of column vector, in which case a single ifft is carried out over the vector of length 4^n. If x is a matrix, the ifft is carried on each column of x and the matrix must contain 4^n rows.

The radix-4 ifft is implemented in a manner that attempts to approximate how it will be implemented in hardware, rather than use a generic butterfly. The radix-4 algorithm is faster and more precise than the equivalent radix-2 algorithm, and thus is preferred for hardware implementation.

See also: ffft