MODULE 1
Discrete Fourier Transform (DFT)
Discrete Fourier Transform (DFT)
• Many applications demand the processing of signals in frequency
domain.
• The analysis of signal frequency, periodicity, energy and power
spectrums can be analyzed
• in frequency domain.
• Frequency analysis of discrete time signals is usually and most
conveniently performed on
• a digital signal processor.
Applications of DFT:
• Spectral analysis
• Convolution of signals
• Partial differential equations
• Multiplication of large integers
• Data compression
Frequency Domain Sampling
Periodicity of WN and its values
Circular shift of a sequence
Circular Convolution
Circular Convolution
Circular Convolution
Circular Convolution
Circular Convolution
Problem : Perform the circular convolution of the following sequences using DFT
and IDFT methods x1(n)={1,1,2,1} and x2 (n)={1,2,3,4}