Scribd
Upload
86 views

Selective Problems For Practice

This document contains 20 selective questions from various chapters on digital signal processing. The questions cover topics such as periodicity of signals, sampling rate and Nyquist rate, convolution, z-transforms, Fourier transforms, discrete Fourier transforms, and fast Fourier transform algorithms. Students are asked to solve problems, determine transforms, compute convolutions, and explain relationships between different transforms.

Uploaded by

Bethlehem Abiy
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
86 views

Selective Problems For Practice

This document contains 20 selective questions from various chapters on digital signal processing. The questions cover topics such as periodicity of signals, sampling rate and Nyquist rate, convolution, z-transforms, Fourier transforms, discrete Fourier transforms, and fast Fourier transform algorithms. Students are asked to solve problems, determine transforms, compute convolutions, and explain relationships between different transforms.

Uploaded by

Bethlehem Abiy
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/ 5

Addis Ababa Science and Technology University

Electrical and Mechanical Engineering College


Department of Electrical & Computer Engineering
Digital Signal Processing (EEEg-3151)
Selective questions from all Chapters

I. Solve the following selective problems and check for their answers from
provided sheet.

1. Determine whether or not each of the following signals is periodic. In case a signal is
periodic, specify its fundamental period.
a. （t）=3cos(5t+
x  /6)
b. （n）=3cos(5n+
x  /6)
c. （n）=2exp[j(n/6-
x  )]
d. （n）=cos
x (n / 8)cos( n / 8)
e. （n）=cos
x ( n / 2)  sin( n / 8)  3cos( n / 4   / 3)
2. An analog electrocardiogram (ECG) signal contains useful frequencies up to 100 Hz.
a. What is the Nyquist rate for this signal?
b. Suppose that we sample this signal at rate of 250 samples/s. what is the
highest frequency that can be represented uniquely at this sampling rate?

3. Consider the simple signal processing system shown in Fig. 1. The sampling periods of
the A/D and D/A converters are T=5ms and T’=1ms, respectively. Determine the output
ya (t ) of the system, if the input is
xa (t )  3cos100 t  2sin 250 t (t in sec onds)

The postfilter removes any frequency component above Fs / 2 .

Fig.1
4. The discrete-time signal x(n)  6.35cos( /10)n is quantized with a resolution (a)
  0.1 or (b)   0.02 . How many bits are required in the A/D converter in each
case?

5. A discrete-time signal x ( n) is defined as

 n
1  3 , 3  n  1

x(n)   1, 0  n  3
 0, elsewhere


a. Determine its values and sketch the signal x ( n) .
b. Sketch the signals that result if we:
i. First fold x ( n) and then delay the resulting signal by four samples.
ii. First delay x ( n) by four samples and then fold the resulting signal.
c. Sketch the signal x(n  4) .
d. Compare the results in parts (b) and (c) and drive a rule for obtaining the signal
x (  n  k ) from x ( n) .
e. Can you express the signal x ( n) in terms of signals  ( n) and u ( n) .

  x     n  x(n) .

6. (a) If y (n)  x(n) * h(n) , show that y h
, where x

(b) Compute the convolution y (n)  x(n) * h(n) of the following signals and check the
correctness of the results by using the test in (a).
7. Determine the particular solution of the difference equation
5 1
y ( n)  y (n  1)  y (n  2)  x(n)
6 6
When the forcing function is x(n)  2n u (n) .

(1/ 2) n , 0  n  4
8. Consider a system with impulse response h(n)  
 0, elsewhere
Determine the input x ( n) for 0  n  8 that will generate the output sequence

9. Determine the z-transforms of and sketch the ROC of the following signals.
 1 n
 ( 3 ) , n  0
a. x1 ( n)  
( 1 )  n , n  0
 2

10. Explain the relationships between z-transform and DFT and Fourier transform.
11. Determine and sketch the Fourier transforms X 1 ( ) , X 2 ( ) , and X 3 ( ) of the
following signals.
12. Compute the eight-point circular convolution for the following sequences.
a. x1 (n)  {1,1,1,1, 0, 0, 0, 0}
3
x2 (n)  sin n 0n7
8
b.

13. Use the four-point DFT and IDFT to determine the sequence

Where

14. Determine the N-point circular convolution for the sequences

2 2
x1 (n)  cos n x2 (n)  sin n 0  n  N 1
N N

15. Consider the sequences

and their 5-point DFTs.


a. Determine a sequence y ( n) so that Y (k )  X 1 (k ) X 2 (k ) .
16. Compute the N-point DFTs of the signals.
17. Consider the finite-duration signal x(n)  {1, 2,3,1}
a. Compute its four-point DFT by solving the 4-by-4 system of linear equations
defined by the inverse DFT formula.
b. Check the answer in part (a) by computing the four-point DFT, using its
definition.
18. (a) Determine the Fourier transform X ( ) of the signal

(b) Compute the 6-point DFT V ( k ) of the signal

(c) Is there any relation between X ( ) and V ( k ) ? Explain.


19. Compute the eight-point DFT of the sequence
 1, 0  n  7
x ( n)  
0, otherwise
by using the decimation-in-frequency FFT algorithm described in the text.

20. Compute the eight-point of the sequence


1 1 1 1 
x(n)   , , , , 0, 0, 0, 0 
2 2 2 2 
using the in-place radix-2 decimation-in-time and radix-2 decimation-in-frequency
algorithms. Follow exactly the corresponding signal flow graphs and keep track of all the
intermediate quantities by putting them on the diagrams.

You might also like