Scribd
Upload
4 views2 pages

Tutorial Sheet2

The document is a tutorial sheet for a Signal Processing course, containing various questions related to Discrete-Time Fourier Transform (DTFT), difference equations, and filter design. It includes tasks such as computing DFT, IDFT, FFT, and properties of DTFT, as well as designing highpass and Chebyshev filters. The references list includes key textbooks on Signals and Systems and Digital Signal Processing.

Uploaded by

jayanieca
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views2 pages

Tutorial Sheet2

The document is a tutorial sheet for a Signal Processing course, containing various questions related to Discrete-Time Fourier Transform (DTFT), difference equations, and filter design. It includes tasks such as computing DFT, IDFT, FFT, and properties of DTFT, as well as designing highpass and Chebyshev filters. The references list includes key textbooks on Signals and Systems and Digital Signal Processing.

Uploaded by

jayanieca
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Tutorial sheet

Subject: Signal Processing

Q1. Find the DTFT of the following sequences:

(i) 𝑎𝑛 𝑢[𝑛]
1 𝑛
(ii) (2) 𝑢[𝑛]
𝑛𝜋
(iii) 𝑐𝑜𝑠 ( 3 ) , −4≤𝑛 ≤4

Q2. Write a difference equation that characterizes a system whose frequency response is

𝟏−𝒆−𝒋𝝎 −𝟑𝒆−𝒋𝟐𝝎
𝑯(𝝎) = 𝟏 𝟏
𝟏+(𝟑)𝒆−𝒋𝝎 +(𝟔)𝒆−𝒋𝟐𝝎

Q3. Prove the following two properties of DTFT:

(i) Differentiation in the frequency domain property


(ii) Time convolution property

Ref. Book: Signals and Systems (Chapter-12)

Author: A. Anand Kumar

Q4. Compute the DFT of the sequence 𝑥[𝑛] = 𝑎𝑛 , 𝑤ℎ𝑒𝑟𝑒 𝑁 = 8 𝑎𝑛𝑑 𝑎 = 2

Q5. Determine the IDFT of 𝑋[𝑘] = (3, 2 + 𝑗, 1, 2 − 𝑗)

Q6. Compute the FFT of the sequence 𝑥[𝑛] = 𝑛 + 2, 𝑤ℎ𝑒𝑟𝑒 𝑁 = 8 𝑢𝑠𝑖𝑛𝑔 𝐷𝐼𝑇 𝑎𝑙𝑔𝑜𝑟𝑖𝑡ℎ𝑚
𝑛𝜋
Q7. Compute the DFTs of the sequence 𝑥[𝑛] = 𝑐𝑜𝑠 ( 2 ), where N=4, using DIF FFT algorithm

Q8. Find the Linear convolution through circular convolution of 𝑥[𝑛] = 𝛿[𝑛] + 𝛿[𝑛 − 1] +
𝛿[𝑛 − 2] and 𝑦[𝑛] = 2𝛿[𝑛] − 𝛿[𝑛 − 1] + 2𝛿[𝑛 − 2]

Q9. Using the bilinear transform, design a highpass filter, monotonic in passband with cutoff
frequency of 1000Hz and down 10 dB at 350 Hz. The sampling frequency is 5000 Hz.

Q10. Design a Chebyshev filter with a maximum passband attenuation of 2.5dB at Ω𝑝 =20rad/sec
and the stopband attenuation of 30 dB at Ω𝑠 =50rad/sec
Q11. Design a digital Butterworth filter that satisfies the following constraint using bilinear
transformation. Assume T=1s.

𝜋
0.9 ≤ |𝐻(𝑒 𝑗𝜔 )| ≤ 1, 0≤𝜔≤
2
3𝜋
|𝐻(𝑒 𝑗𝜔 )| ≤ 0.2, ≤𝜔≤𝜋
4

Hints: Determine order of the filter

(1⁄ 2 − 1)
𝛿2
𝑙𝑜𝑔 {[ ⁄ ]}
(1⁄ 2 − 1)
1 𝛿1
𝑁≥
2 Ω
𝑙𝑜𝑔 (Ω2 )
1

Determine the cutoff frequency

Determine H(s)
2 (𝑧−1)
Determine H(z) by using the relationship s= 𝑇 (𝑍+1)

Q12. An IIR digital Low pass filter is required to meet the following specifications: Acceptable Pass band
ripple : ≤ 0.6dB, Pass band edge frequency : 1.4KHz, Minimum Stop band attenuation : ≥ 30dB, Stop
band edge frequency : 3KHz, Sampling rate : 4KHz Use the design formulae to determine the required
filter order for a digital Chebyshev filter.

Ref. Book: Digital Signal Processing (Chapter-6 and Chapter-8)

Authors: S Salivahanan, A Vallavaraj, and C Gnanapriya

Ref. Book: Digital Signal Processing (Chapter-3, chapter-4 and chapter-5)

Author: P. Ramesh Babu

You might also like