Digital Signal Processing (18EC52)

Note These are the frequently asked and most expected questions in VTU exams. From VTU exam
point of view, you are strongly advised to learn to answer these questions first and only later take
up other questions.

Module-1
S.No. Topic Assignment Question
No. No.
1 Frequency domain sampling and reconstruction of discrete time signals. 1 1
Derivation of DFT and IDFT formula
2 Derivation of Parseval’s theorem 1 6
3 Nature of DFT when 𝑥(𝑛) is real 1 7
4 Finding DFT using formula and plotting magnitude and phase spectrum 1 8,9
5 Finding IDFT using formula 1 10
6 DFT as linear transformation – finding DFT using Matrix Method 1 11,12
7 IDFT as linear transformation – finding IDFT using Matrix Method 1 14,15
8 Evaluation of some expressions without explicitly computing DFT 1 16,17
9 Evaluation of DFT using formula for ∑𝑁−1
𝑛=0 𝛼
𝑛 1 18,20
10 Evaluation of DFT of complex exponential, 𝑠𝑖𝑛(), 𝑐𝑜𝑠() 1 22,23,24
11 Proof of periodicity property of DFT 1 31
12 Proof of linearity property of DFT 1 32
13 Proof of symmetry properties of DFT 1 33
14 Derivation of circular convolution formula 1 35
15 Computation of circular convolution using different methods 1 36,38
16 Finding linear convolution using circular convolution 1 39
17 Derivation of circular time shift property 2 1

18 Derivation of circular frequency shift property (Modulation Property) 2 2

19 Derivation of time reversal property 2 3

20 Derivation of complex conjugate property 2 4

21 DFT[DFT[x[n]]] and DFT[DFT[DFT[DFT[x[n]]]]] 2 6,7

Module-2
S.No. Topic Assignment Question
No. No.
 1 Overlap add method - theory 2 22
2 Overlap save method – theory 2 23
3 Overlap save method - problem 2 24,25
4 Overlap add method – problem 2 26,27
5 Computational complexity of direct computation of DFT 2 35,36
6 Symmetry property and periodicity property of twiddle factor 2 37
7 Derivation of radix-2 DIT-FFT for 𝑁 = 8 2 38
8 Derivation of radix-2 DIT-FFT for 𝑁 = 8 2 39
9 Memory requirement and in-place computation related to FFT 2 40
10 Computational complexity of FFT algorithms 2 41,42
11 Comparison of DIT-FFT and DIF-FFT 2 43
12 Problems on DIT-FFT 2 44,45
13 Problems on DIF-FFT 2 46,47
14 Problems on DIF-IFFT 2 50,51
15 Problems on DIT-IFFT 2 52,53
16 Circular convolution using FFT 2 54,55

Module-3
S.No. Topic Assignment Question
No. No.
1 Comparison of FIR and IIR filters 3 1
2 Different window sequences 3 7
3 Type I, II, III, IV filters 3 10
4 Design of FIR filters using windows 3 12 to 16
5 Frequency sampling method of FIR filter design 3 21, 22
6 Direct form realization of FIR filter 3 23
7 Lattice structure 3 25,26
8 Magnitude response of different windows 3 27

Module-4
S.No. Topic Assignment Question
No. No.
1 Conditions to be satisfied while converting 𝐻(𝑠) to 𝐻(𝑧) 4 1
2 Derivation of bilinear transformation 4 2
3 Problem on bilinear transformation 4 3
4 Analog to analog frequency transformation 4 4,5
5 Derivation of order, cut-off frequency and pole locations of Butterworth 4 6
 filter
6 Design of analog Butterworth filter 4 7,8,10,11
12, 14
7 Design of digital Butterworth filter 4 9,13,15
32
8 Direct form I, II realizations 4 16,17, 31
9 Cascade realization 4 18, 21
10 Frequency response of analog filters 4 28
11 Flow chart of filter design using bilinear transformation 4 29
12 S-plane to Z-plane mapping using bilinear transformation 4 30

Module-5
S.No. Topic Assignment Page No.
No.
1 Von Neumann Architecture 5 4
2 Harvard Architecture 5 8
3 Digital Signal Processor (DSP) Hardware Units - Multiplier and 5 14
Accumulator (MAC), Shifter, Address Generator
4 2’s complement number representation 5 25
5 Q-2 format 5 34
6 Q-15 format 5 42
7 Problem on Q-15 format 5 43, 45,
46, 47
8 Floating point format 5 51
9 Problem on floating point format 5 54, 56
10 IEEE single precision format 5 67, 68
11 IEEE double precision format 5 69, 70
12 Architecture of TMS320C54x family 5 72
13 Architecture of TMS320C3x family 5 79
14 FIR filter implementation in Q format 5 88
15 IIR filter implementation in Q format 5 93
 Some Useful Formulas
1 𝑒 𝑗𝜃 = cos(𝜃) + 𝑗 sin(𝜃)

2 𝑒 −𝑗𝜃 = cos(𝜃) − 𝑗 sin(𝜃)

3 𝑒 𝑗𝜃 + 𝑒 −𝑗𝜃 = 2 cos(𝜃)

4 𝑒 𝑗𝜃 − 𝑒 −𝑗𝜃 = 2𝑗 sin(𝜃)

2𝜋
−𝑗 𝑘𝑛
5 DFT : 𝑋(𝑘) = ∑𝑁−1
𝑛=0 𝑥(𝑛)𝑒 𝑁 ,0 ≤ 𝑘 ≤ 𝑁 − 1

2𝜋
1 𝑗 𝑘𝑛
6 IDFT : 𝑥(𝑛) = ∑𝑁−1
𝑘=0 𝑋(𝑘)𝑒 𝑁 ,0 ≤ 𝑛 ≤ 𝑁 −1
𝑁

𝑁−1 1 − 𝛼𝑁
7 ∑ 𝛼𝑛 = { 1 − 𝛼 𝑓𝑜𝑟 𝛼 ≠ 1
𝑛=0 𝑁 𝑓𝑜𝑟 𝛼 = 1

2𝜋
−𝑗
8 Twiddle Factor : 𝑊𝑁 = 𝑒 𝑁

2𝜋
9 𝑊𝑁𝑘 = 𝑒 −𝑗 𝑁 𝑘

Frequency Response = DTFT of Impulse Response

10 𝑁−1

𝐻(𝜔) = ∑ ℎ(𝑛)𝑒 −𝑗𝜔𝑛

Impulse Response = Inverse DTFT of Frequency Response

11
1 𝜋
ℎ(𝑛) = ∫ 𝐻(𝜔)𝑒 𝑗𝜔𝑛 𝑑𝜔
2𝜋 −𝜋