Table Of Contents


    Last Modified: January 9, 2017

    Computes the inverse fast Fourier transform (IFFT).


    c = ifft(a)
    c = ifft(a, b)
    c = fft(a, b, d)
    c = fft(a, [], d)



    Scalar or array of any dimension.


    Number of rows of a to use. If b is larger than the size of a, a is resized and padded with zeros. b is an integer and is typically a power of 2.


    Dimension of a in which MathScript performs the IFFT. d is an integer.


    Tells MathScript that you want to specify a and d but not b.



    Inverse fast Fourier transform of a. Array with the same size as a, except you define a specific dimension. If you specify d, the size of c is the specified dimension. If a is a vector, c = ifft(a) returns the original inverse discrete Fourier transform (IDFT). If a is a matrix, c = ifft(a) returns the column-wise inverse fast Fourier transforms of all columns of a.

    A = [1 2 3 4; 4 3 2 1]
    C = ifft(A, 8)

    Where This Node Can Run:

    Desktop OS: Windows

    FPGA: Not supported

    Recently Viewed Topics