Second lab of DSPP was about discrete fourier transform i.e DFT and IDFT which are the computational method for frequency analysis of signal . DFT gives periodic result with period equal to N(length of i/p signal). DFT is practical implementation of DTFT .Spectrum of DFT is in the frequency range of 0 to 2π .N-point DFT values csn be computed in a total of N^2 Complex multiplication and N(N-1) complex addition.
Tuesday, 14 March 2017
DFT
Subscribe to:
Post Comments (Atom)
Why DFT is preferred over DTFS needs to be emphasized.
ReplyDeleteDisadvantage of DFT is that it maps real sequences into complex.
Hence we go for DCT
DTFS is taken for periodic discrete signals and DFT is taken when these samples are to be fed to the computer for calculation.Actually the DTFS of a signal will be periodic discrete in nature, so this periodic signals is further sampled over a period so that the values can be used by computer.
DeleteEasy to understand!
ReplyDeleteNicely explained!
ReplyDelete