2-D inverse fast Fourier transform
Y = ifft2(X)
Y = ifft2(X,m,n)
y = ifft2(..., 'symmetric')
y = ifft2(..., 'nonsymmetric')
ifft2 tests X to see whether it is conjugate symmetric. If so, the computation is faster and the output is real. An M-by-N matrix X is conjugate symmetric if X(i,j) = conj(X(mod(M-i+1, M) + 1, mod(N-j+1, N) + 1)) for each element of X.
For any X, ifft2(fft2(X)) equals X to within roundoff error.
ifft2 supports inputs of data types double and single. If you call ifft2 with the syntax y = ifft2(X, ...), the output y has the same data type as the input X.
The algorithm for ifft2(X) is the same as the algorithm for fft2(X), except for a sign change and scale factors of [m,n] = size(X). The execution time for ifft2 depends on the length of the transform. It is fastest for powers of two. It is almost as fast for lengths that have only small prime factors. It is typically several times slower for lengths that are prime or which have large prime factors.
Note You might be able to increase the speed of ifft2 using the utility function fftw, which controls how MATLAB® software optimizes the algorithm used to compute an FFT of a particular size and dimension.