DSP Ece-303 Unit-3

Download as pdf or txt
Download as pdf or txt
You are on page 1of 48

Institute of Engineering and Technology, Deen Dayal Upadhyaya Gorakhpur University, Gorakhpur

Digital Signal Processing

Subject Code: ECE303


Credits: 4+0

Unit-3: DFT & FFT

By
Dr. Narendra Yadava
Assistant Professor
Department of Electronics and Communication
Engineering
Syllabus
U-1 Introduction to Digital Signal Processing: Basic elements of digital signal processing,
advantages and disadvantages of digital signal processing, Technology used for DSP.
Realization of Digital Systems: Introduction, direct form realization of IIR systems,
cascade realization of an IIR systems, parallel form realization of an IIR systems, Ladder
structures: continued fraction expansion of H(z), example of continued fraction,
realization of a ladder structure, example of a ladder realization.
U-2 Infinite Impulse Response Digital (IIR) Filter Design: Introduction to Filters, Impulse
Invariant Transformation, Bi-Linear Transformation, All- Pole Analog Filters:
Butterworth and Chebyshev, Design of Digital Butterworth and Chebyshev Filters,
Frequency Transformations.
Finite Impulse Response Filter (FIR) Design: Windowing and the Rectangular
Window, Gibb’s phenomenon, Other Commonly Used Windows (Hamming, Hanning,
Bartlett, Blackmann, Kaiser), Examples of Filter Designs Using Windows.
U-3 Discrete Fourier Transforms: Definitions, Properties of the DFT, Circular Convolution,
Linear Convolution.
Fast Fourier Transform Algorithms: Introduction, Decimation in Time (DIT)
Algorithm, Computational Efficiency, Decimation in Frequency (DIF) Algorithm.
U-4 Finite Word length effects in digital filters: Coefficient quantization error, Quantization
noise – truncation and rounding, Limit cycle oscillations-dead band effects.
Multirate Digital Signal Processing: Introduction, Decimation, Interpolation, Sampling
rate conversion: Single and Multistage, applications of MDSP- Subband Coding of
Speech signals, Quadrature mirror filters, Advantages of MDSP.
Fast Fourier Transform (FFT)

• Introduction
• Decimation in Time (DIT) Algorithm
• Computational Efficiency
• Decimation in Frequency (DIF) Algorithm
Introduction
Radix-2 FFT Algorithm
Properties of WN
Properties of WN
Properties of WN
Properties of WN
Radix-2 Decimation in Time (DIT)
Algorithm (DIT FFT)
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Radix-2 DIT FFT
Computational Complexity
Computational Complexity
Computational Complexity
Computational Complexity
Computational Complexity
Radix-2 Decimation in Frequency (DIF)
Algorithm (DIF FFT)
Gate Questions
Gate Questions
End
ECE303
Unit-3(FFT)

You might also like