Scribd
Upload
162 views7 pages

Tutorial(s) 1-7 DSP

This document provides questions and solutions for a tutorial on digital signal processing and applications. Question 1 asks about determining the Nyquist rate and sampled signal for a given analog signal. Question 2 evaluates whether several systems are causal, linear, stable, time-invariant, and passive. Question 3 finds the response of systems to specific input signals. The remaining questions involve computing the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) for various sequences, including using a Radix-2 decimation-in-time fast Fourier transform algorithm.

Uploaded by

yukta
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
162 views7 pages

Tutorial(s) 1-7 DSP

This document provides questions and solutions for a tutorial on digital signal processing and applications. Question 1 asks about determining the Nyquist rate and sampled signal for a given analog signal. Question 2 evaluates whether several systems are causal, linear, stable, time-invariant, and passive. Question 3 finds the response of systems to specific input signals. The remaining questions involve computing the discrete Fourier transform (DFT) and inverse discrete Fourier transform (IDFT) for various sequences, including using a Radix-2 decimation-in-time fast Fourier transform algorithm.

Uploaded by

yukta
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
You are on page 1/ 7

Scanned by CamScanner

TUTORIAL 2

UEE607: Digital Signal Processing and Applications

Q.1 Let the analog signal be represented as x(t ) = 3 cos(50π t ) + 2 sin(300π t ) − 4 cos(100π t ).

What is the Nyquist rate for this signal? If the signal is sampled with sampling frequency of

200Hz, what will be the DT signal obtained after sampling? What will be the recovered signal?

Q.2 Find if the following system are causal, linear, stable , time invariant and passive:

a) y (n) = (n + 1) x(n)

n +1
b) y (n) = ∑ x(k )
k = −∞

c) y (n) = x(3n)

d) y (n) = x(n) − x(n − 1)

e) y (n) = x(1 − n)

f) y ( n) = x ( n 2 )

g) y (n) = x 3 (n)

h) y (n) = x(−n)

Q.3 Find the response of the following systems to the signals:

1 − 2 ≤ n ≤ 2
x ( n) = 
0 elsewhere

a) y (n) = x(n − 1)

b) y (n) = x(n + 1)

x(n) + x(n + 1)
c) y (n) =
2

1
Scanned by CamScanner
Tutorial Sheet-4

Subject: Digital Signal Processing and Applications (UEI-607)

1) Compute the N -point DFT of the following finite length sequence given as,

1 n even 0 ≤ n ≤ N −1
(a) x(n) = e − n ;0 ≤ n ≤ 4 (b) x(n) = 
0 otherwise

1 n even 0 ≤ n ≤ N − 1 a n 0 ≤ n ≤ N −1
(c) x(n) =  (d) x(n) = 
0 n odd 0 ≤ n ≤ N − 1 0 otherwise

2) Compute the 4-point DFT of causal three sample sequence given by,

1
 ; 0≤n≤2
x ( n) =  3
 0; else.

3) Compute the DFT of the sequence x(n)={ 0, 1, 2, 3}. Sketch the magnitude and phase spectrum.
4) consider a complex sequence

e jω0 n ; 0 ≤ n ≤ N − 1
x ( n) = 
 0 otherwise
(a) Find the Fourier transform X (ω )

(b) Find the N-point DFT

5) Consider a finite length sequence


x(n) = 2δ (n) + δ (n − 1) + δ (n − 3)
We perform the following equation on the following sequence,
(i) We first compute 5-point DFT X (k )

(ii) We compute 5-point IDFT of Y (k ) = {X (k )} to obtain a sequence y (n)


2

Determine the sequence y (n) for n=0, 1, 2 ,3, 4.


Tutorial Sheet-5

Subject: Digital Signal Processing and Applications (UEI-607)


Q. 1

Q.2

Q.3

Q.4

Use the 8-point Radix-2 DIT-FFT Algorithm to find the DFT of the sequence
x(n)={0.707,1,0.707,0, -0.707,-1,-0.707,-0}
Scanned by CamScanner
Scanned by CamScanner

You might also like