Calculates the inverse two-dimensional discrete Fourier transform of A using a Fast Fourier Transform algorithm.
ifft2 (A, m, n) ifft2 (A)
input matrix
number of rows of A to be used
number of columns of A to be used
This is an Octave function. It performs inverse two-dimensional FFT on the matrix A. m and n may be used specify the number of rows and columns of A to use. If either of these is larger than the size of A, A is resized and padded with zeros. If A is a multi-dimensional matrix, each two-dimensional sub-matrix of A is treated separately.
x = [1 2 3; 4 5 6; 7 8 9] m = 4 n = 4 ifft2 (A, m, n) ans = 2.81250 + 0.00000i -0.37500 + 0.93750i 0.93750 + 0.00000i -0.37500 - 0.93750i -1.12500 + 0.93750i -0.31250 - 0.50000i -0.37500 + 0.31250i 0.31250 + 0.25000i 0.93750 + 0.00000i -0.12500 + 0.31250i 0.31250 + 0.00000i -0.12500 - 0.31250i -1.12500 - 0.93750i 0.31250 - 0.25000i -0.37500 - 0.31250i -0.31250 + 0.50000i |  |  |