NOTE: please use the FFT tag instead. The FFT is a type of algorithm for quickly computing the Inverse Discrete Fourier Transform.
The IFFT is an FFT algorithm with some different initial permutation of data samples, and often an additional normalization, such that the algorithm computes the IDFT rather than the DFT. The FFT and IFFT are always implemented by the same code.
Related topics include dft, fft, signal-processing, convolution.
More information on the IFFT can be found in the Wikipedia article on the FFT