Cairo University Discrete-Time Signal Processing

Faculty of Computers & Information Third IT

Information Technology Department First Term
Year 2008 – 2009

Review Sheet
Week 1
Problem No.1 :-

Consider the discrete-time signal shown below, Sketch and label carefully each of the following signals :

(a) x[3-n] (b) x[3n] (c) x[n-3] (d) x[n+4] (e) x[-n] (f) x[-n+2] (g) x[-n-2]
x[n]
2

-3 7
n
-2 -1 0 1 2 3 4 5 6 8

-1

Problem No.2 :-

Determine whether or not each of the following signals is periodic :

3 1
j ( n )
(a) x[n]  3e 5 2
(b) x[n]  1  e j 4n / 7  e j 2n / 5

Problem No.3 :-

For each of the following input-output relationships, determine whether the corresponding system is linear,
time-invariant or both.

(b) y[n] = x²[n-2] (c) y[n] = x[n+1] - x[n-1]

Problem No.4 :-

A system may or may not be memoryless, time invariant, linear, causal and/or stable. Determine which of
these properties hold and which don't hold for each of the following continuous-time systems, Justify your
answers, in each example, y[n] denotes the system output and x[n] is the system input.

 x[n]; n  1

(a) y[n] = x[-n] (b) y[n] = x[n-2] – 2x[n-8] (c) y[n] = nx[n] (d) y[n]  0; n  0
 x[n  1]; n  1


Problem No.5 :-

Let x[n] = δ[n] + 2 δ[n-1]- δ[n-3] and h[n] = 2 δ[n+1]+2 δ[n-1]. Compute and plot each of the
following convolutions:

(a) y1[n] = x[n] * h[n] (b) y2[n] = x[n+2] * h[n] (c) y3[n] = x[n] * h[n+2]

1
Problem No.6 :-

The following are the impulse responses of LTI systems, determine whether each system is causal and/or
stable, Justify your answers.

n n
1 1
(a) h[n]    u[n] (b) h[n]    u[n]
5 2
n n
 1  1
(c) h[n]     u[n]  1.01 u[n  1] (d) h[n]     u[n]  1.01 u[1  n]
n n

 2  2
 
(e) h[n]  n cos n u[n]
4 

Good Luck

2
Cairo University Discrete-Time Signal Processing
Faculty of Computers & Information Third IT
Information Technology Department First Term
Year 2006 – 2007

Sheet No. 2
Discrete-time Fourier Transform
Week (2, 3)
Problem No.1 :-

Use the Fourier transform analysis equation to calculate the Fourier transform of
n −1
⎛1⎞
(a) ⎜ ⎟ u[n − 1] (b) δ [ n − 1] + δ [ n + 1] (c) δ [ n + 2] + δ [ n − 2]
⎝2⎠
sketch and label one period of the magnitude of the Fourier transform.

Problem No.2 :-

Given that x[n] has Fourier transform X (e jw ) , express the Fourier transforms of the following signals in
terms of X (e jw ) , using the Fourier transform properties :

x * [−n] + x[n]
(a) x1 [n] = x[1 − n] + x[−1 − n] (b) x 2 [n] = (c) x3 [ n] = ( n − 1) 2 x[ n]
2

Problem No.3 :-

n n
⎛4⎞ ⎛4⎞
A causal and stable LTI system S has the property that ⎜ ⎟ u[n] ⎯⎯→ n⎜ ⎟ u[ n] , Determine the frequency
⎝5⎠ ⎝5⎠
response H (e ) and the impulse response h[n] for this system S.
jw

Problem No.4 :-

Compute the Fourier transform of each of the following signals:

⎧n.... − 3 ≤ n ≤ 3
| n|
⎛1⎞
(a) x[n] = u[n-2] – u[n-6] (b) x[n] = ⎜ ⎟ u[− n − 2] (c) x[n] = ⎨
⎝3⎠ ⎩0....otherwize
Problem No.5 :-
The following are the Fourier transforms of discrete-time signals, Determine the signal corresponding to each
transform:
⎧ π 3π 1
⎪ 1..... ≤| w |≤ e − jw −
⎪ 4 4 5
(a) X (e jw ) = ⎨ (b) X (e jw ) =
⎪0..... π ≤| w |≤ π ,0 ≤| w |< π 1
1 − e − jw
⎪⎩ 4 4 5

Problem No.6 :-
1
Let X (e jw ) denote the Fourier transform of the signal x[n] shown below, perform the following calculations
without explicitly evaluating X (e jw ) :

(a) Evaluate X (e j 0 ) x[n]

2
(b) Find ∠X (e jw )
π
1
(c) Evaluate ∫ X (e )dw
jw

−π
-3 7
(d) Find X (e jπ ) n
-2 -1 0 1 2 3 4 5 6 8

-1

Problem No.7 :-

Consider the signal shown below , Let the Fourier transform of this signal be written in the rectangular form
as X (e jw ) = A( w) + jB( w) , Sketch the function of time corresponding to the transform
Y (e jw ) = B( w) + A( w)e jw .

x[n]

-1
n
-3 -2 0 1 2 3 4 5 6

-1 -1

-2
Problem No.8 :-
n
⎛1⎞
Consider a discrete-time LTI system with impulse response h[ n] = ⎜ ⎟ u[ n] , Use Fourier transforms to
⎝2⎠
determine the response to each of the following input signals :
n n
⎛3⎞ ⎛1⎞
(a) x[ n] = ⎜ ⎟ u[n] (b) x[n] = (n + 1)⎜ ⎟ u[n]
⎝4⎠ ⎝4⎠
Good Luck

2
Cairo University Discrete-Time Signal Processing
Faculty of Computers & Information Third IT
Information Technology Department First Term
Year 2006 – 2007

Sheet No. 3
Z-Transform
Week (4, 5)

Problem No.1:-
Determine the constraint on r = |z| for each of the following sums to converge:
n 1
 
  |n|
1 1
(a)    z n
(b)    cos n  z n
1  2    2  4 

Problem No.2:-

n
1
Consider the signal x[n]    u[n  3] , use the z-transform equation to evaluate the z-transform of this
5
signal , and specify the corresponding region of convergence .

Problem No.3:-

 1  n  
  cos n .....n  0
Consider the signal x[n]   3  4  , Determine the poles and ROC of X(z)
0.......... .......... ....... n  0


Problem No.4:-

Let x[n] be an absolutely summable signal with rational z-transform X(z) , if X(z) is known to have a pole at z
= 1/2 , Could x[n] be :

(a) a finite-duration signal ?

(b) a left-sided signal ?
(c) a right-sided signal ?
(d) a two-sided signal ?

Problem No.5:-

n
1
Let x[n] be a signal whose rational z-transform X(z) contains a pole at z = 1/2 , Given that x1[n]    x[n]
4
n
1
is absolutely summable and x2 [n]    x[n] is not absolutely summable , Determine whether x[n] is left-
8
sided , right-sided or two-sided signal .

1
Problem No.6:-

1
Using partial-fraction expansion and the fact that a n u[n] 
Z
, | z || a | , find the inverse transform
1  az 1
1 1
1 z
of X ( z )  3 , | z | 2 .
(1  z 1 )(1  2 z 1 )

Problem No.7:-

 
1 1024  z 10 
Find the inverse z-transform of X ( z )   , | z | 0 .
1024  1 1 
1 z
 2 

Problem No.8:-

1.......... 0  n  5
Consider the rectangular signal x[n]   , Let g[n] = x[n]-x[n-1] , find the signal g[n] and
0.......... .otherwize
directly evaluate its z-transform .

Problem No.9:-

Consider the following system functions for stable LTI systems , Without utilizing the inverse z-transform ,
determine in each case whether or not the corresponding system is causal :

4 1 1  2
1 z  z
(a) 3 2
 1  1 
z 1 1  z 1 1  z 1 
 2  3 
1
z
(b) 2
1 3
z  z
2

2 16
z 1
(c)
4 1 2
z   z  2  z 3
3 2 3

Problem No.10:-

Determine the z-transform for each of the following sequences , sketch the pole-zero plot and indicate the
ROC , Indicate whether or not the Fourier transform of the sequence exists :

n n2
1 1
(a)  [n  5] (b) (1) u[n]
n
(c)   u[3  n] (d)   u[n  2]
4  3

2
Problem No.11:-

1  2 z 1
Using partial fractions ,find the inverse z-transform of X ( z )  , and x[n] is absolutely
5 1 2
1 z  z
2
summable .

Problem No.12:-

Determine the z-transform of x[n]   [n]  0.95 [n  6] , and sketch the pole-zero pattern for this
sequence.

Problem No.13:-

a n .......... ...n  0
Consider an LTI system with impulse response h[n]   and input
0.......... ..... n  0
1.......... ... 0  n  N  1
x[n]   :
0.......... ...otherwize

(a) Determine the output y[n] by explicitly evaluating the discrete convolution of x[n] and h[n] .

(b) Determine the output y[n] by computing the inverse z-transform of the product of the z-transforms of
the input and the unit sample response.

Good Luck

3
Cairo University Discrete-Time Signal Processing
Faculty of Computers & Information Third IT
Information Technology Department First Term
Year 2006 – 2007

Sheet No. 4
Discrete Fourier Transform
Week (6)

Problem No. 1:-

Compute the DFT of each of the following finite-length sequences considered to be of length N, where N is
even:
(a) x[n] =  [n]
(b) x[n] =  [n   ] 0    N 1
1........ n..even 0  n  N  1
(c) x[n]  
0,....... n..odd. 0  n  N  1
1 0  n  N / 2  1
(d) x[n]  
0 N / 2  n  N 1
a n 0  n  N 1
(e) x[n]  
0 Otherwise

Problem No. 2:-

Suppose we have two four-point sequences x[n] and h[n] as follows:
 
x[n]  cos n  , n = 0,1,2,3
2 
h[n]  2 n , n = 0,1,2,3

(a) Calculate the four-point DFT X [k ]

(b) Calculate the four-point DFT H [k ]
(c) Calculate y[n]  x[n]  h[n] by doing the circular convolution directly.
(d) Calculate y[n] of part(c) by multiplying the DFTs of x[n] and h[n] and perform an inverse DTF

Problem No. 3:-

Two finite-length signals, x1[n] and x 2 [n] , are sketched in figure 1. Assume that x1[n] and x 2 [n] are
zero outside of the region shown in the figure. Let x3 [n] be the eight-point circular convolution of x1[n]
with x 2 [n] : i.e. x3 [n] = x1[n]  x 2 [n] Determine x3 [2]

1
 Figure 1

Problem No. 4:-

Figure 2 shows a six-point discrete-time sequence x[n] . Assume that x[n] = 0 outside the interval shown.
The value x[4] is not known and is represented as b. Note that the sample shown for b in the figure is not
necessarily to scale. Let X (e i ) be the DTFT of x[n] and X 1[k ] be a sample of every  /2
X 1[k ] = X (ei ) |   ( / 2)k 0k 3
The four-point sequence x1[n] that results from taking the four point inverse DFT of X 1[k ] is shown in
figure 3. Based on this figure, can you determine b uniquely? If so, give the value for b.

Figure 2

Figure 3

2
Problem No. 5:-
x1 (n) and x2 (n) are two finite length sequences. What is the smallest N such that the N-point circular
convolution of the 2 sequences is equal to their linear convolution, i.e. x1 (n) x2 (n)  x1 (n)  x2 (n) .
1 at n  0
 2  2 at n  1
 at n  1 
x1 (n)   , x2 (n)   1 at n  4
1 at n  2  1 at n  5
 3 at n  3 

Problem No. 6:-

~
x1 (n) and ~
x2 (n) are two periodic sequences with period N=7. Find a sequence ~
y1 (n) whose DFS is
~ ~ ~
equal to the product of the DFS of ~
x1 (n) and the DFS of ~
x2 (n) ; i.e. Y1 (k )  X 1 (k ).X 2 (k ) .

Problem No. 7:-

j
Consider a real finite sequence x[n] with fourier transform X (e ) and DFT X[k].
If Im{X[k]} =0. k=0, 1…, N-1
Can we conclude that:
j
Im { X (e ) } =0    ?
State your reasoning if your answer is yes. Give a counter example if your answer is no.

Problem No. 8:-

Two finite length sequences x1 (n) and x2 (n) can be expressed as follows:
1, 0  n  99 1, 0  n  9
x1 (n) =  , x 2 ( n) = 
0, o.w. 0, o.w.
(a) Determine and sketch the linear convolution, x1 (n)  x2 (n) .
(b) Determine and sketch the 100-point circular convolution, x1 (n) x 2 ( n) .
(c) Determine and sketch the 110-point circular convolution, x1 (n) x 2 ( n) .
Good Luck

3
 ! " #
$

" % &'
" "

# ( % &)*!

# ( % &*!

!" #! $ %& '

1 1
y[n] − y[ n − 2] = x[ n − 2] − x[ n]
4 4
(( (

# ( % &+*!

) " ( *
+
#& , -
#&

)
# ( % &,*!

. ( /
(1 − 2 z −1 )(1 − 4 z −1 )
H ( z) =
1
z (1 − z −1 )
2
#& (( /
#& #&

# ( % &'*!

(( (

7 −1 1 − 2
1− z + z
H ( z) = 6 6
1
1 + z −1 + z − 2
2

# ( % &*!

. %'
#&
# &. #& 0#1&

# ( % &*!

. (
8
2 − z −1 − 2 z − 2
H ( z) = 3
1 −1 2
(1 − z )(1 + z −1 )
3 3
"
((

# ( % &-*!

. 2
#& 1"
# &3
#& " 2,
2

4 5
Cairo University Discrete-Time Signal Processing
Faculty of Computers & Information Third IT
Information Technology Department First Term
Year 2006 – 2007

Sheet No. 6
SAMPLING OF CONTINUOUS-TIME SIGNAL
Week (9,10)

Problem No. 1:-

The continuous-time signal:
x c t   sin20t   cos40t 
Is sampled with a sampling period  to obtain the discrete-time signal
 n   2n 
x[n] = sin   cos 
 5   5 
(a) Determine a choice for  consistent with this information.
(b) Is your choice for  in Part (a) unique? If so, explain why. If not, specify another choice of 
consistent with the information given.

Problem No. 2:-

Consider the system of the figure below, with the discrete-time system an ideal low pass filter with cutoff

frequency radians/s
8

(a) If x c t  is band limited to 5 kHz, what is the maximum value of  that will avoid aliasing in the
C/D converter?
1
(b) If = 10 khz, what will the cutoff frequency of the effective continuous-time filter be?

1
(c) Repeat Part (b) for = 20 khz


Problem No. 3:-

Each of the following continuous-time signals x c t  is used as the input for an ideal C/D converter as shown
in the figure below, with the sampling period  specified. In each case find the resulting discrete-time signal
x[n]

1
 (a) x c t   cos2 (1000)t ,   (1/ 3000) sec
(b) x c t   sin2 (1000)t ,   (1/1500) sec
(c) x c t   sin2 (1000)t /(t ),   (1/ 5000) sec

Problem No. 4:-

Which of the following signals can be down sampled by a factor of 2 using the system in the figure below,
without any loss of information?

(a) x[n]   [n  n0 ], For n0 some unknown integer

(b) x[n]  cosn / 4
(c) x[n]  cosn / 4  cos3n / 4

Problem No. 5:-

Consider the system shown in the figure below. For each of the following input signals x[n] indicates
weather the output xr [n]  x[n]

(a) x[n]  cosn / 4

(b) x[n]  cosn / 2
 sin(n / 8) 
2

(c) x[n]   
 n
Hint: Use the modulation property of the Fourier Transform to find  
x  j

Problem No. 6:-

 
In the system of the figure below, X c  j and H  j are as shown. Sketch and label the Fourier Transform
of yc (t ) for each of the flowing cases:
(a) 1/ 1  1/ 2  104
(b) 1/ 1  1/ 2  2 104
(c) 1/ 1  2 104 , 1/ 2  104
(d) 1/ 1  104 , 1/ 2  2 104

2
 Good Luck