Documente Academic
Documente Profesional
Documente Cultură
Batch 2016-2020
Unit 1
Basic elements of DSP, concepts of frequency in Analog and Digital Signals, sampling theorem, Discrete–time signals, systems, Analysis of discrete
time LTI systems, Z transform, Convolution, Correlation.
Areas :
A1 – DT signals and System A2 – Sampling theorem A-3 - Convolution and Correlation A4 – Z-Transform
Text Books:
1. Oppenheim A. V., Schafer R. W. and Buck J. R., Discrete Time Signal Processing, 3/e, Prentice Hall, 2007.
2. Proakis J. G. and Manolakis D. G., Digital Signal Processing, 4/e, Pearson Education, 2007.
3. A. Nagoor Kani, Digital signal processing, MG. Hill Publications, 209.
Questions Compe-
Serial Bloom’s tence Competitive
Difficulty
No. CO Taxonomy Exam Ques- Area Marks
Level
Level tion Y/N
Remem-
bering
1 What is meant by aliasing? How can it be avoided? 1 BTL1 Low N A2 6
Under-
Give the graphical and mathematical representation of CT standing
2 1 BLT2 Low N A1 6
and DT unit impulse, unit step and unit ramp function.
Evaluating
Under-
standing
4 Classify discrete time signals. 1 BTL 2 Low N A1 6
Under-
16 Give the properties of convolution 1 BTL 2 standing Low N A4 6
Analyzing
17 List the properties of Z-Transform 1 BTL 4 Low N A3 2
Remem-
18 Write down the Z transform pairs 1 BTL 1 bering Low N A4 6
Remem-
19 What is correlation? What are it types? 1 BTL 1 Medium Y A3 9
bering
20 Compute the autocorrelation of the sequence x(n) = {1, 1, - Applying
1 BTL 3 LOW Y A4 6
2, -2}
21 Analyzing
Find the Z transform of
1. x(n) = 2nu(n – 2) Medium Y A3 6
2
2. x(n) = n u(n)
1 BTL 4
22 Compute linear convolution for the sequences Analyzing
x1= {2,3,4,5} 1 BTL 4 Medium N A3 6
x2= {-1,2,5,6}
23 Applying
Compute the normalized autocorrelation of the signal
1 BTL 3 Medium N A4 6
x(n ) = an u(n ),0 < a <1
26 Evaluating
Find the Z-transform of the following sequence:
n n 1 BTL 5 Medium Y A3 6
x(n) (0.3) u(n) +(0.8) u(-n-1)
1 Apply Medium Y A3 9
Using A)Residue method and
B) Convolution method
30 Evaluating
Determine the impulse response for the cascade of two
LTI system having impulse responses 1 BTL 5 Medium Y A4 6
31 Suppose a LTI system with input x(n ) and output y(n ) is charac-
Evaluating
terized by its unit sample response h(n ) = (0.8)nu(n ). Find the re- 1 BTL 5 Medium N A4 6
sponse y(n ) of such a system to the input signal x(n ) = u(n )
32 Remem-
Find the inverse Z – transform of bering
1 BTL 1 HIGH N A3 6
If
(1)ROC: |Z| > 1, (2) ROC: |Z| < 0.5
33 Under-
Outline the expressions to relate Z – transfer and DFT 1 BTL 2 standing HIGH N A3 2
32 Under-
What is zero padding? Why it is needed? 1 BTL 3 standing Medium Y A4 2
36 Under-
standing
Check whether following signals are periodic or not. If yes
find their fundamental time period.
𝑛𝜋 5𝜋𝑛 3𝜋𝑛 𝜋
(i) 𝑥[𝑛] = sin ( 7 ) + sin ( ) + 2cos( + 6)
3 7
(ii) Let x(t) and y(t) be periodic signals with FTP of T1 1 BTL2 Medium N A1 6
and T2 respectively. Under what condition the sum x(t)-
y(t) is periodic, and what is the fundamental period of this
signal if sum is periodic.
37 Analyzing
Draw the signal x[n]={1,-2,3,3,-5,6,6}. Plot the following
signals 1 BTL4 Medium N A1 9
(i) x[2n+1] (ii)x[n]u[n+2]
38 Analyzing
Draw the signal x[n]={1,-2,3,-4,-5,6,6}. Plot the following
signals 1 BTL4 Low N A1 9
(i) x[3n+1] (ii)x[n]u[2-n]
39 Remeber-
Define even signal and odd signal. Show that any signal ing
1 BTL1 Medium N A1 6
can be represented in form of its even part and odd part.
40 Remeber-
Explain various classification of signal with proper exam-
ing
1 BTL1 Low N A1 9
ple.
Unit 2
Introduction to DFT, Properties of DFT, Circular, Convolution , Filtering methods based on DFT, FFT Algorithms, Decimation–in–time Algorithms,
Decimation–in–frequency Algorithms, Use of FFT in Linear Filtering, DCT, Use and Application of DCT.
Areas :
Questions Compe-
Serial Bloom’s tence Competitive
Difficulty
No. CO Taxonomy Exam Ques- Area Marks
Level
Level tion Y/N
1 Under-
Contrast DFT from DTFT. standin
2 N A1 2
BTL 2 Low
2 Remem-
bering
BTL 1 Medium
3 Calculate the computational saving (both complex
multiplication and complex addition) in using N point 2 Low N A2 6
FFT algorithm Apply-
BTL 3 ing
4
Define phase factor?
2 Low N A2 2
Remem-
BTL 1 bering
2
Define Twiddle factor 2 Low N A2 2
Remem-
BTL 1 bering
6
Compare DIT FFT algorithm with DIF FFT algorithm 2 Under- Medium N A2 2
BTL 2 standing
7
Give DFT pair of equation 2 Under- Low N A1 2
BTL 2 standing
8
List any four properties of DFT 2 Remem- Medium N A1 2
BTL 1 bering
9
llustrate the basic butterfly structure of DIT- FFT 2 Under- Low N A2 6
BTL 2 standing
6
llustrate the basic butterfly structure of DIF FFT 2 Under- High N A2 6
BTL 2 standing
11
Evaluate DFT of x(n) = {1, -1, 1, -1} 2 Evaluat- Medium Y A1 6
BTL ing
9
Estimate % saving in computing through radix –
2, DFT algorithm of DFT coefficients. Assume N = 2 Medium Y A1 6
512.
BTL 6 Creating
13
Calculate the value of WNK when N = 8 and K = 2 and 2 Low N A2 6
also k = 3 Apply-
BTL 3 ing
14
Explain and prove Parseval's theorem 2 Evaluat- Medium N A1 9
BTL 5 ing
9 Calculate the DFT of the four point sequence x(n ) = Apply-
2 Low Y A1 2
{0,1,2,3}. BTL 3 ing
16 Under-
Explain the relation between DFT and Z-Transform? 2 Low N A1 2
BTL 2 standing
17
List the uses of FFT in linear filtering? 2 Analyz- Low N A2 2
BTL 4 ing
18
Find the DTFT of x(n)= -bn.u(-n-1). 2 Apply- Low Y A1 6
BTL 3 ing
19 Evaluat- Medium
Determine the IDFT of Y(k)={1,0,1,0}. 2 Y A1 6
BTL 5 ing
Solve the eight point DFT of the given sequence x(n) = Ap-
28 { ½, ½, ½,½, 0, 0, 0, 0} using radix – 2 DIT - DFT al- 2 ply- High N A2 9
gorithm. BTL 3 ing
Un-
der-
stand-
BTL 2 ing
1
Eval-
40 Find Inverse DTFT of 𝐹(𝜔) = (1−𝑎𝑒 −𝑗𝜔 )2 2 uat- High Y A2 6
BTL 5 ing
Unit 3
Structures of IIR, Analog filter design, Analog Low Pass Butterworth Filter, Analog Low Pass Chebyshev Filter, Comparison Between Butterworth
Filter And Chebyshev Filter, Frequency Transformation In Analog Domain, Design Of High Pass, Bandpass And Bandstop Filters, Design Of IIR Filters
From Analog Filters, Approximation Of Derivatives, Design Of IIR Filter Using Impulse Invariance Technique, Design Of IIR Filter Using Bilinear
Transformation, Frequency Transformation In Digital Domain.
A1 – IIR filter basics A2 – Analog filters A3 – BLT method A4 - IIM Method
Questions Compe-
Serial Bloom’s tence Competitive
Difficulty
No. CO Taxonomy Exam Ques- Area Marks
Level
Level tion Y/N
Remem-
11 What are the characteristics of Chebyshev filter? 4 BTL1 LOW N A2 2
bering
Define Phase Delay and Group Delay Remem-
9 4 BTL1 LOW N A1 2
bering
20
What are the properties that are maintained same in the Under-
4 BTL2 LOW N A1 2
transformation of analog to digital filter? standing
21
What are the requirements for an analog filter to be sta- Under-
4 BTL2 LOW N A1 2
ble and causal? standing
22
Sketch the various tolerance limits to approximate an Under-
4 BTL2 MEDIUM N A1 6
ideal lowpass and highpass filter. standing
23
How are analog poles mapped to digital poles in impulse
4 BTL4 Analyzing MEDIUM N A4 6
invariant transformation?
24
How the order of the filter affects the frequency re-
4 BTL4 Analyzing LOW N A2 2
sponse of butterworth filter and chebyshev filter.
22
Sketch the magnitude response of Chebyshev type -1
4 BTL6 Creating LOW N A2 2
and type-2 filter.
27
Under-
List out the Properties of Chebyshev Polynomial 3 BTL2 MEDIUM Y A2 2
standing
28
Write the steps involved in designing a Low Pass But- Remem-
3 BTL1 LOW N A2 2
terworth Filter. bering
31
Design a Butterworth digital IIR lowpass filter using bi-
linear transformation by taking sampling interval T=0.1
second, to satisfy the following specifications :
passband ripple ≤ 4.436 dB 3 BLT6 Creating HIGH N A3 9
Stopband attenuation≥ 20 dB , passband edge fre-
quency=0.35π rad/sample stopband edge fre-
quency=0.7π rad/sample
34
Design an IIR digital low pass butterworth filter to meet
the following requirements: Pass band ripple (peak to
peak): ≤ 0.5dB, Pass band edge: 1.2kHz, Stop band at- 3 BTL6 Creating HIGH N A3 9
tenuation: ≥ 40dB, Stop band edge: 2.0 kHz, Sampling
rate: 8.0 kHz. Use bilinear transformation technique
32 Find the H (z ) corresponding to the impulse invariance
design using a sample rate of 1/T samples/sec for an an-
alog filter H (s) specified as follows : 3 BTL3 Applying MEDIUM N A4 9
36
38
40
The specification of the desired low pass filter is
Unit 4
A1 : Basics of FIR Filter A2: Design of FIR filter using Window Method
Questions
Serial Bloom’s Competitive
Difficulty
No. CO Taxonomy Exam Ques- Topic Area Marks
Level
Level tion Y/N
Remember-
3 What is meant by warping? 4 LOW N FIR A1 2
ing
write down the magnitude and phase function of FIR fil- Remember-
11 4 Medium N FIR A1 2
ter when impulse response is symmetric and N is odd. ing
Remember-
18 Compare Blackman window and hamming window. 4 LOW N FIR A1 2
ing
20 Write the steps involved in FIR filter design using win- Remember-
4 LOW N FIR A1 2
dows. ing
23
Write the magnitude and phase function of FIR filter
4 Applying LOW N FIR A1 2
when impulse response is symmetric and N is even.
24 Remember-
What is Gibbs phenomena? 4 LOW N FIR A1 2
ing
22 Design a linear phase FIR bandpass filter to pass fre-
quencies in the range 0.4 pi to 0.62 pi rad/sample by tak- 4 Creating HIGH Y FIR A1 9
ing 7 samples of hanning window sequence.
29 Remember-
Compare Hamming window and Blackman window 4 MEDIUM N FIR A1 2
ing
30
What is meant by optimum equiripple design creation? Understand-
4 MEDIUM N FIR A1 2
Why it is followed? ing
31 Write down the procedure for FIR filter design by fre- Understand-
4 MEDIUM N FIR A1 2
quency sampling method. ing
33
Remember-
Define ripples in a filter. 4 LOW N FIR A1 2
ing
34 Sketch the various tolerance limits to approximate an
4 Creating MEDIUM N FIR A1 2
ideal lowpass and highpass filter.
32
Determine the coefficients of a linear phase FIR filter of
length N=11 which has a symmetric unit sample response
and a frequency response that satisfies the conditions
4 Evaluating HIGH Y FIR A1 9
H(2kfork
fork
fork
fork
40
Determine the coefficients of a linear phase FIR filter of
length N=15 which has a symmetric unit sample response
and a frequency response that satisfies the conditions
fork
fork
Introduction to programmable DSPs: Multiplier and Multiplier Accumulator (MAC), Modified Bus Structures and Memory Access schemes in DSPs
Multiple access memory, multiport memory, VLSI Architecture, Pipelining, Special addressing modes, On-Chip Peripherals. Architecture of TMS
320C5X- Introduction, Bus Structure, Central Arithmetic Logic Unit, Auxiliary Registrar, Index Registrar, Auxiliary Register Compare Register, Block
Move Address Register, Parallel Logic Unit, Memory mapped registers, program controller, Some flags in the status registers, On- chip registers, On-
chip peripherals
A1- Digital signal Processors A2- DSP Applications
Questions
Serial Bloom’s Competitive
Difficulty
No. CO Taxonomy Exam Ques- Topic Area Marks
Level
Level tion Y/N
Understand-
7 How is fast computation achieved in DSPs? 2 LOW N DSP A2 2
ing
Remember-
8 What is pipelining in DSPs? 2 LOW N DSP A1 2
ing
9 Explain the process of speech coding and decoding. 2 Creating HIGH Y DSP A2 6
Write a short note on musical sound processing for re- Remember-
16 cording. 2 MEDIUM N DSP A2 2
ing
Remember-
19 What are the basic components of RADAR? 2 LOW N DSP A1 2
ing
20 Remember-
Outline the classification of biomedical signals. 2 LOW N DSP A1 2
ing
23
What are guard bits? 2 Applying LOW N DSP A1 2