Performing inverse DFT after taking conjugate of the result of DFT

1. How do you implement inverse FFT?
2. What is conjugate in DFT?
3. What is DFT and inverse DFT?

How do you implement inverse FFT?

X = ifft( Y ) computes the inverse discrete Fourier transform of Y using a fast Fourier transform algorithm. X is the same size as Y . If Y is a vector, then ifft(Y) returns the inverse transform of the vector. If Y is a matrix, then ifft(Y) returns the inverse transform of each column of the matrix.

What is conjugate in DFT?

Theorem 6.2 (DFT conjugate symmetry) Let be a real-valued signal with samples. Then the DFT series X [ 0 ] , X [ 1 ] , … , X [ N − 1 ] has conjugate symmetry: X [ m ] = X [ N − m ] ― .

What is DFT and inverse DFT?

The discrete Fourier transform is an invertible, linear transformation. with denoting the set of complex numbers. Its inverse is known as Inverse Discrete Fourier Transform (IDFT). In other words, for any , an N-dimensional complex vector has a DFT and an IDFT which are in turn. -dimensional complex vectors.