Scribd
Upload
36 views

DSP Assignment

This document contains instructions for a digital signal processing assignment involving various tasks: 1) Convolving two sequences graphically and determining their z-transform 2) Finding the z-transform and region of convergence for various signals 3) Computing the z-transform of the convolution of two sequences using the convolution property 4) Finding the inverse z-transform of various functions 5) Determining the impulse response and system response of a system described by a differential equation 6) Computing the discrete Fourier transform of a sequence using different algorithms 7) Evaluating the discrete Fourier transform of another sequence 8) Computing the inverse discrete Fourier transform using decimation-in-frequency

Uploaded by

samuelyosef834
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
36 views

DSP Assignment

This document contains instructions for a digital signal processing assignment involving various tasks: 1) Convolving two sequences graphically and determining their z-transform 2) Finding the z-transform and region of convergence for various signals 3) Computing the z-transform of the convolution of two sequences using the convolution property 4) Finding the inverse z-transform of various functions 5) Determining the impulse response and system response of a system described by a differential equation 6) Computing the discrete Fourier transform of a sequence using different algorithms 7) Evaluating the discrete Fourier transform of another sequence 8) Computing the inverse discrete Fourier transform using decimation-in-frequency

Uploaded by

samuelyosef834
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/ 2

Wollo University

Kombolcha Institute of Technology


School of Electrical and Computer Engineering

Digital signal processing Worksheet and Assignment

Instructions

 Do as an Assignment ( 1, 2a , 2b, 4b, 4c, 5a, 6 ,8 )


 Submission date: on final exam of the course
 Group: two groups per section
 Direct copy paste and late submission results in nullification.
===========================================================================

1) Using the following sequence definitions


−𝟐, 𝒌 = 𝟎, 𝟏, 𝟐 𝟐, 𝒌 = 𝟎,
𝒙(𝒌) = 𝟏, 𝒌 = 𝟑, 𝟒 and ( )
𝒉 𝒌 = −𝟏, 𝒌 = 𝟏, 𝟐
𝟎 𝒆𝒍𝒔𝒆𝒘𝒉𝒆𝒓𝒆 𝟎 𝒆𝒍𝒔𝒆𝒘𝒉𝒆𝒓𝒆

Evaluate the digital convolution

𝒚 ( 𝒏) = 𝒙(𝒌)𝒉(𝒏 − 𝒌)
𝒌

a) using the graphical method;

2) Determine the z-transform and corresponding region of convergence for the following signals.

a) 𝑥(𝑛) = −(0.8) 𝑢(−𝑛 − 1) − (1.25) 𝑢(−𝑛 − 1)


b) 𝑥(𝑛) = 2(0.8) cos 𝜋𝑛 2 𝑢(𝑛)
c) 𝑥(𝑛) = (0.2) 𝑢(𝑛)−(−2) 𝑢(−𝑛 − 1)
d) 𝑥(𝑛) = 5𝑒 ( ) 𝑢(𝑛 − 3

3) Given two sequences


𝑥 (𝑛) = 5 𝛿 (𝑛) − 2 𝛿 (𝑛 − 2)
𝑥 (𝑛 ) = 3 𝛿 (𝑛 − 3)
Determine the z-transform of convolution of the two sequences using the convolution property of
the z-transform,
𝑋(𝑧) = 𝑋 (𝑧)𝑋 (𝑧)

Prepared by Jemal H. 1
4) Find the inverse z-transform for each of the following functions,

a) X(z) =4− −
.
b) X(z) =
( )
+( )
+(
. )

c) X(z) =
( )( . )

d) X(z) =
( ) ( . )

5) A DSP system is described by the following differential equation with the input-output
relationship of a certain initially relaxed system with all initial conditions are zero,

𝑦(𝑛 ) + 0.1𝑦(𝑛 − 1) − 0.2𝑦(𝑛 − 2) = 𝑥(𝑛 ) + 𝑥 (𝑛 − 1)

a) Determine the impulse response sequence 𝑦(𝑛)due to the impulse sequence 𝑥 (𝑛) = 𝛿(𝑛);
b) Determine the system response of the system when the unit step function 𝑢(𝑛) is applied.

6) An 8-point sequence is given by 𝑥(𝑛) = ( 2, 1, 2, 1, 1, 2, 1, 2 ). Compute 8-point DFT of 𝑥(𝑛) by


a) Radix-2 DIT-FFT and b) Radix-2 DIF-FFT
7) Given a sequence 𝑥(𝑛) for 0 ≤ 𝑛 ≤ 3, where 𝑥(0) = 0.8 , 𝑥(1) = 0.6 , 𝑥 (2) = 0.4, and 𝑥(3) =
0.2. Evaluate its DFT 𝑋(𝑘 ),
8) Compute the eight-point inverse DFT of the sequence made up of DFT coefficients 𝑋 (𝑘) as
𝑋(0) = 4, 𝑋(1) = 1 − 𝑗 1 + √2 , 𝑋(2) = 0, 𝑋(3) = 1 − 𝑗 1 − √2 ,

𝑋(4) = 0, 𝑋 (5) = 1 + 𝑗 1 − √2 , 𝑋(6) = 0, X(7) = 1 + 𝑗 1 + √2 ,


Using the decimation-in-frequency FFT method

Good Luck

Prepared by Jemal H. 2

You might also like