This document contains the syllabus for the course "Digital Signal Processing" taught by Professor V. Rajendra Chary at SNIST. The syllabus covers 3 units: 1) Introduction to digital signals and systems, 2) Discrete Fourier Transform, and 3) Fast Fourier Transforms. Unit 1 introduces discrete-time signals and linear systems. Unit 2 covers the Discrete Fourier Transform and its properties as well as applications like spectral analysis. Unit 3 discusses fast Fourier transform algorithms like Decimation-In-Time and Decimation-In-Frequency and their applications in reducing computation complexity compared to the direct DFT. The document provides examples and practice problems for each unit to help students understand the concepts covered.

1. DIGITAL SIGNAL PROCESSING
(DSP-8CC09)
VSQs on Units- 1,2,3
VSQs on Units- 1,2,3
Faculty: V.RAJENDRA CHARY(VRC),
Assistant Professor,ECE,SNIST
Class: III B.Tech,I Semester, ECE

2. SYLLABUS
UNIT-
1. INTRODUCTION
2. DISCRETE FOURIER TRANSFORM
3. FAST FOURIER TRANSFORMS
3. FAST FOURIER TRANSFORMS
…..mid 1
4. DIGITAL IIR FILTERS
5. DIGITAL FIR FILTERS
6. MULTIRATE DIGITAL SIGNAL PROCESSING
…..mid 2
RAJENDRA CHARY 2

3. UNIT-I INTRODUCTION
• Introduction to Digital Signal Processing: Discrete time signals &
sequences, Periodicity, linear shift invariant systems, stability, and
causality, Linear constant coefficient difference equations, Block
diagram representation of linear constant-coefficient difference
diagram representation of linear constant-coefficient difference
equations, Frequency domain representation of discrete time
signals and systems.
• Applications: Contents form the foundation for DSP.
RAJENDRA CHARY 3

4. UNIT- II DISCRETE FOURIER
TRANSFORM
• Discrete Fourier series representation of periodic sequences,
Discrete-Time Fourier Transform(DTFT), Discrete Fourier
transform (DFT): Properties of DFT, Relation between Z-transform
and DFT, Convolution: Linear and circular convolutions, Overlap
and DFT, Convolution: Linear and circular convolutions, Overlap
add and Overlap save methods, Computation of DFT.
• Applications: Analysis of DT signals-Periodic and Aperiodic.
RAJENDRA CHARY 4

5. UNIT-III FAST FOURIER TRANSFORMS
• Fast Fourier transforms (FFT) - Radix-2 decimation in time and
decimation in frequency FFT Algorithms, Inverse FFT.
• Applications: Design of spectrally efficient system such as
OFDM system.
OFDM system.
RAJENDRA CHARY 5

6. REFERENCE TEXTBOOKS(R1,R2,R3)
RAJENDRA CHARY 6

7. 7
V.RAJENDRA CHARY

8. 1)State sampling theorem for low pass signals and sketch the
spectrum of sampled signal for fs=2fm, fs>2fm , fs<2fm where fs is
sampling frequency and fm is highest frequency component of
message signal . (A17 Reg,Dec2019)
2)y(n)=2x(n)+4, check this system for linearity? (A14
supply,Nov2017)
supply,Nov2017)
3)Define the Energy & Power of a discrete time signals.(A14supply
Nov2017)
4) Determine if the following systems are Time invariant and Linear
i) y(n)=x2(n) ii) y(n)=x(n2) (A14supply Nov2017)
RAJENDRA CHARY 8

9. 5)Test if the following systems are linear or not.
i.y[n]=ax[n]+bx[n-1] ii. y[n]=x[n] cosωn (A12 Reg,Dec2014)
6) Check whether the given systems are causal or non causal.
i) y[n] = x[n2] ii) y[n] = x[-n] (A12 supply,Dec2015)
7)Explain the term stability of the system with one example. (A12
7)Explain the term stability of the system with one example. (A12
supply,Dec2015)
8)What are the basic elements used to construct the block diagram of
a discrete time system. (R3,2.4)
RAJENDRA CHARY 9

10. 9)What are the different types of representing discrete time
signal.(R2,unit1,Q4)
10)What are the basic operations on discrete time signals.
(R2,unit1,Q13)
11) Distinguish between energy and power signal.(R2,unit1,Q22)
11) Distinguish between energy and power signal.(R2,unit1,Q22)
RAJENDRA CHARY 10

11. UNIT-II
UNIT-II
DISCRETE FOURIER
TRANSFORM
11
V.RAJENDRA CHARY

12. 1)Distinguish between DTFT and DFT. (A17 Reg,Dec2019)
2)The first five points of 8-point DFT of a real valued sequence are
(0.24, 0.5-j0.3, 0, 0.5, j0.86). Find the remaining three points.
(A17 Reg,Dec2019)
3)How DFT and DTFT are related? (A14 supply,Nov2017)
3)How DFT and DTFT are related?
4)Define discrete Fourier series. (A14 supply,Nov2017)
5) Compute discrete Fourier Transform of the sequence
x(n ) = {1, -2, 3, 4}
RAJENDRA CHARY 12

13. 6)Distinguish between Fourier series and Fourier Transform. (A12
supply,May 2017)
7)State circular convolution property of DFT. (A12 Reg,Dec2014)
8) Find the DFT of δ[n-n0] using time shifting property. (A12
supply,Dec2015)
supply,Dec2015)
9)What are the properties of convolution? (A10 Reg,Dec2012)
10)State the differences between Overlap-save method and Overlap-
add method. (A10 Reg,Dec2012)
RAJENDRA CHARY 13

14. 11)What is zero padding?why is it needed?(R3,2.8)
12)What are the methods to find circular convolution.(R2,unit2,Q12)
RAJENDRA CHARY 14

15. UNIT-III
UNIT-III
FAST FOURIER
TRANSFORM
15
V.RAJENDRA CHARY

16. 1)Compute the number of complex additions and multiplications
needed to compute 64-Point DFT using direct DFT and FFT and
calculate the speed improvement factor. (A17 Reg,Dec2019)
2)What are the properties of the twiddle factor? (A14
supply,Nov2017)
3)What is decimation in time algorithm? (A14 supply,Nov2017)
3)What is decimation in time algorithm? (A14 supply,Nov2017)
4)What is Decimation in frequency Algorithm?(A12 supply,May
2017)
5)What is ‘Bit-reversal’ and ‘in-place computation’? (A12
Reg,Dec2014)
RAJENDRA CHARY 16

17. 6)What is the need for FFT algorithms and give any two applications
of FFT? (A12 supply,Dec2015)
7)Compare the DIT and DIF radix-2 FFT (R3,5.7)
8)What is twiddle factor. (R2,unit7 ,Q10)
9)For DIT FFT,what is the order of the input and output sequences.
9)For DIT FFT,what is the order of the input and output sequences.
(R2,unit7,Q24)
10)For DIF FFT,what is the order of the input and output sequences.
(R2,unit7,Q27)
RAJENDRA CHARY 17

18. Thank you
For Your Attention !
For Your Attention !
Any Questions
RAJENDRA CHARY 18