0% found this document useful (0 votes)
37 views2 pages

X (N) (1,2,1) H (N) (1, - 2,2)

The document is an internal assessment test for a Discrete-Time Signal Processing course. It contains 3 parts - Part A with 10 multiple choice questions worth 2 marks each, Part B with 2 questions worth 10 or 30 marks total, and Part C with 1 question worth 10 marks. The questions cover topics like DFT, IDFT, FFT algorithms, phase factors, time-frequency transformations, filtering properties and designs using impulse invariance. Part B involves computing DFTs and inverse DFTs, and circular convolutions. Part C involves designing digital filters to meet certain frequency response specifications. A pie chart also shows the distribution of Bloom's taxonomy levels - with majority under Applying and Analyzing levels, followed by

Uploaded by

mugaao8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
37 views2 pages

X (N) (1,2,1) H (N) (1, - 2,2)

The document is an internal assessment test for a Discrete-Time Signal Processing course. It contains 3 parts - Part A with 10 multiple choice questions worth 2 marks each, Part B with 2 questions worth 10 or 30 marks total, and Part C with 1 question worth 10 marks. The questions cover topics like DFT, IDFT, FFT algorithms, phase factors, time-frequency transformations, filtering properties and designs using impulse invariance. Part B involves computing DFTs and inverse DFTs, and circular convolutions. Part C involves designing digital filters to meet certain frequency response specifications. A pie chart also shows the distribution of Bloom's taxonomy levels - with majority under Applying and Analyzing levels, followed by

Uploaded by

mugaao8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

THENI KAMMAVAR SANGAM COLLEGE OF TECHNOLOGY

KODUVILARPATTI, THENI – 625 534


DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
INTERNAL ASSESSMENT I
Branch/Year/Sem/Sec : ECE/III/V Date : 16.08.19
Subject Code/Name : EC8553/ Discrete-Time Signal Processing
Time : 1.30 Hrs Max. Marks : 50
Answer All Questions
PART – A (10×2=20) BT CO
Level
1. Draw the basic butterfly diagram of DIT and DIF algorithm. 4 1
2. How many multiplications and additions are required to compute N-point 4 1
DFT using radix-2 FFT and DFT?
3. What is phase factor? 2 1
4. What is relationship between DFT and DTFT? 4 1
5. Write the DFT and IDFT for an N-point sequence. 1 1
6. Compute the DFT of the sequence x(n)={1,1,0,0}. 3 1
7. What is warping effect? What is its effect on magnitude and phase response? 1 2
8. List the properties of Butterworth and Chebyshev filter. 1 2
9. Given that, H(s)=1/(s+1). By impulse invariant method obtain the digital 3 2
filter function
10. Sketch the frequency response of an odd and even order Chebyshev filter. 4 2
PART – B (3X10= 30)
11. (a) (i) Compute the 8 point DFT for the following sequences using (8) 3 1
DIT – FFT algorithm x(n)={ 1/3 ; 0 < n < 2
0 ; else.
(ii) Obtain the circular convolution of the following sequences (2) 3 1
x(n) = {1,2,1}; h(n) ={1, -2,2}
(OR)
(b) Compute IDFT of the sequence X(K) ={7, -0.707- (10) 3 1
j0.707, -j , 0.707-j0.707, 1, 0.707+j0.707, j, - 0.707+j0.707}
using DIF algorithm.

12. (a) (i) Explain the IIR design using impulse invariant techniques (5) 2 2
(ii) State and Prove any two properties of DFT (5) 1 1
(OR)
(b) Compute find the circular convolution of the following two (10) 3 1
sequences using DFT and IDFT. X 1(n) ={1,1,2,1}and X2(n)
={1,2,3,4}.
PART – C (1×10= 10)
13. (a) Design Butterworth digital filter using impulse invariant (10) 3
transformation that satisfy the following specification 2
0.707 < |H(w)| < 1.0; 0 < w < π/2
|H(w)| < 0.2; 3π/4 < w < π
(OR)
(b) The specification of the desired low pass filter is (10) 3 2
0.8 < |H(w)| < 1.0; 0 < w < 0.2π
|H(w)| < 0.2; 0.6π < w < π
Design Chebyshev digital filter using bilinear
Transformation.
----------------------------------------------
Bloom's Taxonomy Level Wise Mark Distribution
6

47
L1
L2
L3
L4
81 L5
L6

44

BT Level: 1- Remembering, 2- Understanding, 3- Applying, 4- Analyzing

CO Wise Mark Ditribution


50
45
40
35
30
Marks

25
20
15
10
5
0
CO1 CO2 CO3 CO4
Course Outcome

STAFF IN-CHARGE HOD

You might also like