Practical signals have infinite numbers of samples which is practically impossible to sample hence the Discrete Fourier Transform gives the approximate magnitude spectrum of the signal.DFT of the signals was calculated by the formula derived from original formula of DFT , because C programs does not have the concept of imaginary numbers so the separate array for real and imaginary part was created.Length of the output was found to be same as input.Approximation error was decreased by zero padding.
DFT results obtained are periodic you see...the reason would be due to multiplication of twiddle factor..which is periodic.
ReplyDeleteInput signal is also assumed to be periodic.
DeleteYes it assume to be periodic
DeleteDFT is computationally slow.
ReplyDeleteYes, FFT is faster
DeleteYes because it processes more samples
DeleteThese mathematical tools can be used for implementation for real time applications!
ReplyDeleteIt is used
DeleteWell explained !
ReplyDeleteDft is most basic transform of dsp
ReplyDeleteYes kind off
DeleteInput is assumed to be periodic
ReplyDeleteHence output is periodic
DeleteDFT is slower than FFT
ReplyDeleteThanks
ReplyDeleteFFT is also used
ReplyDelete