In general the DFT is discrete time but continuous
frequency. When the DFT frequency variable is discretized it is usually
still called the DFT.
The FFT is an efficient means of computing the DFT with discrete frequencies.
cheers...
Added after 11 minutes:
hi again,
some more detail for the topic...
The fast Fourier transform (FFT) is simply a class of special algorithms which implement the discrete Fourier transform with considerable savings in computational time. It must be pointed out that the FFT is not a different transform from the DFT, but rather just a means of computing the DFT with a considerable reduction in the number of calculations required.
please checkout this link for the detailed information about the DFT: **broken link removed**
the best website for the examples in matlab is mathworks site itself. i am pasting the same. just it explains the FFT with some example.. checkout this link: **broken link removed**
if i get any more info abou this i'll be posting those here...
hi
In answering mehtesham, I think that in the case that M != N u cannot find a expression to relate X and Y. the onl way that may help u is reading upsampling and downsampling cocepts in descrete-time domain. ( a detailed info is saied in DSP by Oppenheim---> is available in EDAboard). read rhe concepts and conclude.
cheers