Beruflich Dokumente
Kultur Dokumente
Course Content
Revised
Teaching Bloom’s
Modules
Hours Taxonomy
(RBT)
Level
Module-1 L1,L2,L3
Discrete Fourier Transforms (DFT): Frequency domain sampling
and reconstruction of
discrete time signals. DFT as a linear transformation, its 10 Hours
relationship with other
transforms. Properties of DFT, multiplication of two DFTs- the
circular convolution.
Module-2 L1,L2,L3
Additional DFT properties, use of DFT in linear filtering, overlap-
save and overlap-add
10 Hours
method. Fast-Fourier-Transform (FFT) algorithms: Direct
computation of DFT, need for
efficient computation of the DFT (FFT algorithms).
Module-3 L1,L2,L3
Radix-2 FFT algorithm for the computation of DFT and IDFT–
decimation-in-time and 10 Hours
decimation-in-frequency algorithms. Goertzel algorithm, and
chirp-z transform.
Module-4 L1,L2,L3,L4
Structure for IIR Systems: Direct form, Cascade form, Parallel
form structures.IIR filter design: Characteristics of commonly
used analog filter – Butterworth and 10 Hours
Chebyshev filters, analog to analog frequency transformations.
Design of IIR Filters from analog filter using Butterworth filter:
Impulse invariance, Bilineartransformation.
Module-5 10 Hours L1,L2,L3,L4
Text books:
1. Digital signal processing – Principles Algorithms & Applications, Proakis &
Monalakis, Pearson education, 4th Edition, New Delhi, 2007.
Reference Books:
1.Discrete Time Signal Processing, Oppenheim & Schaffer, PHI, 2003.
2.Digital Signal Processing, S. K. Mitra, Tata Mc-Graw Hill, 3rd Edition, 2010.
3. Digital Signal Processing, Lee Tan: Elsevier publications, 2007
Prerequisites:
1. signals & system course
2. Fourier series
3. Fourier transform
4. Z- transform
Course Description:
Overview of the course
The contents of the course “Digital Signal Processing” is designed by the members of
the Boards of Studies (BoS) constituted by Visveswaraya Technological University (VTU)
Belgaum.
Advances in integrated circuit technology have had a major impact on the technical
areas to which digital signal processing techniques and hardware are being applied. A
thorough understanding of digital signal processing fundamentals and techniques is essential
for anyone whose work is concerned with signal processing applications.
Digital Signal Processing begins with a discussion of the analysis and representation
of discrete-time signal systems, including discrete-time convolution, and the discrete-time
Fourier transform. Emphasis is placed on the similarities and distinctions between discrete-
time. The course proceeds to cover digital filter design and a discussion of the fast Fourier
transform algorithm for computation of the discrete Fourier transform.
Relevance of the course:
The main purpose of studying this subject is to have knowledge of various techniques
used for manufacturing. A signal is a piece of information in binary or digital form. Digital
Signal Processing techniques improve signal quality or extract important information by
removing unwanted parts of the signal. Typical DSP application fields are audio signal
processing, video signal processing, image processing and telecommunications devices. DSP
is the basis of many technologies including mobile phones, personal computers, video
recorders, CD players, hard disc drive controllers and modems.
Application Areas:
•Speech/audio (speech recognition/synthesis, digital audio, equalization, etc.),
•Image/video (enhancement, coding for storage and transmission, robotic vision, animation,
etc.),
•Military/space (radar processing, secure communication, missile guidance, sonar processing,
etc.),
•Biomedical/health care (scanners, ECG analysis, X-ray analysis, EEG brain mappers, etc.)
•Consumer electronics (cellular/mobile phones, digital television, digital camera, Internet
voice/music/video, interactive entertainment systems, etc) and many more.
These applications and products require many interconnected complex steps, such as
collection, processing, transmission, analysis, audio/ display of real-world information in near
real time. DSP technology has made it possible to incorporate these steps into devices that are
innovative, affordable, and of high quality (for example, iPhone from Apple, Inc.). A typical
application to music is now considered as a motivation for the study of DSP.
Bloom’s Taxonomy
Remembering Understanding Applying Analyzing Evaluation Creating
L1 L2 L3 L4 L5 L6
Learning objectives:
1. Frequency domain sampling of the spectrum of a discrete time signal is important in
the processing of digital signals. Therefore this unit covers discrete fourier transforms
which transforms time domain to its equivalent frequency domain representation.
2. To establish the relationship between DFT and other transforms.
Lesson Schedule:
Class No. Portion to be covered per lecture (class) CLO BLT
L1 Introduction to DSP 1 L1
L2 DTFT Basics & Derivation of DFT from DTFT 1 L1,L2
L3 Frequency domain sampling 1 L1,L2,L3
L4 Reconstruction of discrete time signals. 1 L1,L2,L3
L5 DFT as a linear transformation 1 L1,L2,L3
L6 DFT relationship with other transforms. 1 L1,L2,L3
L7 Properties of DFT 1 L1,L2,L3
L8 multiplication of two DFTs- the circular convolution 1 L1,L2,L3
L9 circular convolution problems 1 L1,L2,L3
L10 Problems on DFT 1 L1,L2,L3
Assignment questions:
1. Find the N-point DFT of a sequence x(n) ={1 ,1, 2, 2}
2. Determine the DTFT of the sequence x(n)=an u(n) for a<1
3. Is the DFT of the finite length sequence periodic? If so state the reason.
4. Find the N-point IDFT of a sequence X(k) ={1 ,0 ,0 ,0}
5. What is zero padding? What are its uses?
6. Compute the DFT of x (n) =∂ (n-n0)
7. Find the DFT of the sequence of x (n) = cos (nΠ/4) for 0≤n≤ 3
8. Compute the DFT of the sequence whose values for one period is given by x (n) = {1, 1,-2,-2}.
9. Find the IDFT of Y (k) = {1, 0, 1, 0}
10. Define discrete Fourier series.
11. Distinguish between linear convolution and Circular Convolution
12. Distinguish between DFT and DTFT
13. Write the analysis and synthesis equation of DFT
14. Calculate the DFT of a sequence x(n)=(1/4)^n for N=16
Learning objectives:
To study the properties of DFT, which helps in the application of the DFT to practical
problems.
Lesson Schedule:
Class No. Portion to be covered per lecture (class) CLO BLT
L11 Additional DFT properties of DFT 2 L1,L2,L3
L12 Circular-time shift, Circular frequency shift 2 L1,L2,L3
L13 Multiplication 2 L1,L2,L3
L14 Parseval’s theorem and problems 2 L1,L2,L3
L15 overlap-save method 2 L1,L2,L3
L16 overlap-save problems 2 L1,L2,L3
L17 overlap-add method 2 L1,L2,L3
L18 overlap-add problem 2 L1,L2,L3
Fast-Fourier-Transform(FFT)algorithms:Direct
L19 2 L1,L2,L3
computation of DFT
L20 need for efficient computation of the DFT (FFT algorithms) 2 L1,L2,L3
Assignment questions:
1. List out the properties of DFT
2. Define circular convolution
3. Distinguish between linear convolution and Circular Convolution
4. How the circular convolution is obtained using concentric circle method?
5. State the circular time shifting and circular frequency shifting properties of DFT.
6. State and prove the following properties of DFT (1) Circular convolution 2) Parseval‟s
relation
7. Find the circular convolution of x1(n)={1,2,3,4} x2(n)={4,3,2,1}
8. Find the circular convolution of the two sequences using matrix method X1(n)={1, 2, 3,
4} and x2(n)={1, 1, 1, 1}
9. State and prove Parseval‟s theorem
10. State and prove circular time shift and circular frequency shift properties of DFT
11. State and prove circular convolution and circular conjugate properties of DFT
Learning objectives:
1. To study the application of DFT of long duration sequences. The methods are overlap add
and overlap save. These methods are used for linear filtering at a lower computational cost
2. To study computational complexity of DFT and necessity of FFT
Lesson Schedule:
Class No. Portion to be covered per lecture (class) CLO BLT
L21 Radix-2 FFT algorithm 2 L1,L2,L3
L22 DIT-FFT, Theory & Problem 2 L1,L2,L3
L23 DIT-FFT, Theory & Problem 2 L1,L2,L3
L24 Inverse DIT-FFT, Theory & Problem 2 L1,L2,L3
L25 Inverse DIT-FFT, Theory & Problem 2 L1,L2,L3
L26 Goertzel algorithm 2 L1,L2,L3
L27 Goertzel algorithm Problems 2 L1,L2,L3
L28 Problems 2 L1,L2,L3
L29 Chrip –Z transform 2 L1,L2,L3
L30 problems 2 L1,L2,L3
Assignment questions:
Learning objectives:
1. To study Fast Fourier transform algorithms.
2. To study FFT algorithms for composite value of N
Lesson Schedule:
Class No. Portion to be covered per lecture (class) CLO BLO
L31 Structure of IIR System 3 L2,L3,L4
L32 Direct form & Cascade form 3 L2,L3,L4
L33 Parallel form structures 3 L2,L3,L4
IIR filter design Characteristics of commonly used
L34 3 L2,L3,L4
analog filter
L35 Butterworth approximination 3 L2,L3,L4
Chebyshev filters analog to analog frequency
L36 3 L2,L3,L4
transformations.
Design of IIR Filters from analog filter using
L37 3 L2,L3,L4
Butterworth filter:
L38 Impulse invariance 3 L2,L3,L4
L39 Bilinear transformation. 3 L2,L3,L4
L40 problems 3 L2,L3,L4
Assignment questions:
1. Distinguish between Butterworth and Chebyshev filter.
2. Distinguish between FIR and IIR filters
3. Give any two properties of Butterworth and chebyshev filters.
4. Give the expression for location of poles of normalized butterworth filter
5. Distinguish between the frequency response of Chebyshev Type I & Type II filter.
6 .What is prewarping?
7. Give the bilinear transformation
8. What are the advantages and disadvantages of bilinear transformation?
9. What is warping effect? What is its effect on magnitude and phase response?
10. Mention the advantage of direct and cascade structures
11. Draw the direct form realization of the system y(n)=0.5x(n)+0.9y(n-1)
Assignment questions:
1. Compare analog and digital filters.
2. What are the properties of FIR filters?
3. Compare various windows for design of FIR filters.
4. Explain the design of FIR filters using Kaiser window.
5. What is Gibbs phenomenon?