As part of the next practical, Discrete Fourier Transform(DFT) had to be implemented on both a PC and DSP. Using C programming and the in-built mathematical operations(primarily sine and cosine) the DFT output can be observed in the form of 2 arrays(A[k] real and B[k] imaginary) for displaying complex numbers. By using both the above mentioned hardware, a fast response was observed. DFT is preferred only for smaller length inputs. For high length inputs , the computations involved are very high and hence DFT is not preferred. Also the complex computations are more.
Why do we use dFT?
ReplyDeleteDFT is a generalized algorithm used for frequency analysis of discrete time signals. However,FFT has replaced DFT.
Deletewell written
ReplyDeleteThanks.
DeleteDFT helps us to perform frequency domain analysis of Discrete time signal
ReplyDeleteNowadays, FFT is used.
DeleteDFT is frequency sampling of DTFT which produces periodic results that can be stored in DSP processor memory and can be processed further.
ReplyDeleteThis is one of the advantages of DFT.
DeleteDFT is practically implementable
ReplyDeleteIts slower though.
DeleteDFT is slower than FFT
ReplyDeleteHence, it is not used much.
DeleteThe DFT is also used to efficiently solve partial differential equations, and to perform other operations such as convolutions or multiplying large integers
ReplyDeleteYes. It is also used in small length signal processing.
DeleteDFT was originally used for frequency domain analysis. Using a few properties of sinusoidal signals, FFT was developed
ReplyDeleteYes. You can refer to this link:www.earlevel.com/main/2002/08/31/a-gentle-introduction-to-the-fft/
DeleteDFT is only used for frequency domain analysis of small length signals.
ReplyDeleteYes.
DeleteDFT is said to be a frequency domain representation of the original input sequence
ReplyDeleteYes.
Delete