EEE 2429/EEE 2330: DIGITAL SIGNAL PROCESSING

ISSUED: 27/03/2023 DUE 06/04/2023

INSRUCTIONS
1. Do the assignments in Groups of 8.
2. Show how the workload has been shared.
3. Marks will be lost for resembling/copied work

ASSIGNMENT I
1a) Briefly discuss the Discrete Fourier Transform (DFT) and derive its pair back and forth
defining equations.
b) Perform the circular and linear convolution of the following sequences using the DFT
techniques.
X 1 ( n )= { 2, 1 ,3 , 4 }
X 2 ( n ) ={ 3 , 4 , 5 , 6 }

2. An analogue filter has the transfer function, given by:

5 (s +1)
T ( s) =
(s +4 )(s +5)
Convert this to its discrete equivalent by using the impulse-invariant transform. The sampling
frequency is15 Hz .
0. 5(1−z−2 )
H ( z)=
3. Given a second-order transfer function 1+1. 3 z−1 +0 .3 z −2 . Perform the filter
realizations and write the difference equations using the cascade form via the first-order sections.

4. Let the rectangular pulse x (n)=u(n )−u(n−10) be an input to an LTI system with impulse
n
response h(n)=(0.9) u(n) , determine the output y(n).
5. Find the convolution of the following two sequences:

x(n)={¿ ¿ ¿¿1 n=0,1,2 ¿ ¿ h(n)={¿1 n=1,2 ¿ ¿ 0 n=0 ¿ ¿

0 otherwise ¿ ¿ 0 otherwise ¿ ¿
and
i. Using the direct evaluation method
ii. Using tabular and graphical methods.
6. Obtain the solution to the difference equation y (n )=0 .25 y(n−2)+x(n) .

ASSIGNMENT II
1. Given a sequence x(n) for 0≤n≤3, where x(0)=1, x(1)=2, x(2)=3, and x(3)=4. Evaluate its DFT
X (k ) using.
i. Basic method
ii. The decimation-in-frequency FFT method

1
 iii. The decimation-in-time FFT method
iv. Determine the number of complex multiplications
2. Find the z-transform for each of the following sequences:
i. x(n)=10 sin (0.25πn)u(n)
ii. x(n)=e-0.1n cos (0.25πn)u(n)
3. a) Describe the steps of designing digital filters.
b) Determine and sketch the frequency response of the digital system y(n )=0.5 x(n )+0.5 x(n−1 ) with
a sampling rate of 8,000 Hz. Comment on the sketch.
4. Using the definition of Fourier Transform (FT) of discrete-time signals,

i. Show that the Fourier Transform (FT) of { x (n) } , is periodic in ω .

ii. Show that if { h (n) } , is a real-valued, even sequence, its Fourier Transform (FT), H (e jω ),
is purely real.
iii. Determine the z-transform of x ( n )=r n sin ω 0 n u( n) .

5. Given the Fourier transform of sequences { x (n) } and { h (n) } are { X (e jω ) } and, { H (e jω )}
respectively, derive the Fourier transform of:
i. the delayed sequence { X k (n) } in terms of { X (e jω )} , where X k ( n )=x (n−k )
ii. the sequence { y ( n) } in terms of X (e jω ) and H ( e jω )where y ( n )=h ( n )∗x (n)
iii. the sequence { w(n) } in terms of X ( e jω ) and H ( e jω )where w ( n )=h ( n ) x (n)

END