Solutions for Digital Signal Processing 5th Edition by

Proakis
CLICK HERE TO ACCESS COMPLETE Solutions

Solutions
 CLICK HERE TO ACCESS THE COMPLETE Solutions

SOLUTIONS MANUAL

Ethem Mutlu Sözer

Saroja Srinidhi
Yi Xiang

DIGITAL SIGNAL PROCESSING

Principles, Algorithms, and Applications
5th Edition

John G. Proakis
Northeastern University

Dimitris G. Manolakis
MIT Lincoln Laboratory

Copyright © 2022 Pearson Education, Inc.

CLICK HERE TO ACCESS THE COMPLETE Solutions

2
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

Chapter 1

1.1
(a) One dimensional, multichannel, discrete time, and digital.
(b) Multi dimensional, single channel, continuous-time, analog.
(c) One dimensional, single channel, continuous-time, analog.
(d) One dimensional, single channel, continuous-time, analog.
(e) One dimensional, multichannel, discrete-time, digital.

3
Copyright © 2022 Pearson Education, Inc.
CLICK HERE TO ACCESS THE COMPLETE Solutions

4
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

Chapter 2

2.1
(a)  
1 2
x(n) = . . . 0, , , 1, 1, 1, 1, 0, . . .
3 3 ↑
. Refer to fig 2.1-1.
(b) After folding s(n) we have

1 1 1 1

2/3

1/3

-3 -2 -1 0 1 2 3 4

Figure 2.1-1:

 
2 1
x(−n) = . . . 0, 1, 1, 1, 1, , , 0, . . . .
↑ 3 3

After delaying the folded signal by 4 samples, we have

 
2 1
x(−n + 4) = . . . 0, 0, 1, 1, 1, 1, , , 0, . . . .
↑ 3 3

On the other hand, if we delay x(n) by 4 samples we have

 
1 2
x(n − 4) = . . . 0, 0, , , 1, 1, 1, 1, 0, . . . .
↑ 3 3

Now, if we fold x(n − 4) we have

 
2 1
x(−n − 4) = . . . 0, 1, 1, 1, 1, , , 0, 0, . . .
3 3 ↑

5
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

(c)
 
2 1
x(−n + 4) = . . . 0, 1, 1, 1, 1, , , 0, . . .
↑ 3 3

(d) To obtain x(−n + k), first we fold x(n). This yields x(−n). Then, we shift x(−n) by k
samples to the right if k > 0, or k samples to the left if k < 0.
(e) Yes.
1 2
x(n) = δ(n − 2) + δ(n + 1) + u(n) − u(n − 4)
3 3

2.2
 
1 1
x(n) = . . . 0, 1, 1, 1, 1, , , 0, . . .
↑ 2 2

(a)
 
1 1
x(n − 2) = . . . 0, 0, 1, 1, 1, 1, , , 0, . . .
↑ 2 2

(b) ⎧ ⎫
⎨ 1 1 ⎬
x(4 − n) = . . . 0, , , 1, 1, 1, 1, 0, . . .
⎩ 2 2 ⎭
↑

(see 2.1(d))
(c)
 
1 1
x(n + 2) = . . . 0, 1, 1, 1, 1, , , 0, . . .
↑ 2 2

(d)
 
x(n)u(2 − n) = . . . 0, 1, 1, 1, 1, 0, 0, . . .
↑

(e)
 
x(n − 1)δ(n − 3) = . . . 0, 0, 1, 0, . . .
↑

(f)

x(n2 ) = {. . . 0, x(4), x(1), x(0), x(1), x(4), 0, . . .}

 
1 1
= . . . 0, , 1, 1, 1, , 0, . . .
2 ↑ 2

(g)

x(n) + x(−n)
xe (n) = ,
 2 
1 1
x(−n) = . . . 0, , , 1, 1, 1, 1, 0, . . .
2 2 ↑
 
1 1 1 1 1 1
= . . . 0, , , , 1, 1, 1, , , , 0, . . .
4 4 2 2 4 4

6
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

(h)

x(n) − x(−n)
xo (n) =
 2 
1 1 1 1 1 1
= . . . 0, − , − , − , 0, 0, 0, , , , 0, . . .
4 4 2 2 4 4

2.3
(a)
⎧
⎨ 0, n<0
u(n) − u(n − 1) = δ(n) = 1, n=0
⎩
0, n>0

(b)
n 
0, n<0
δ(k) = u(n) =
1, n≥0
k=−∞

∞ 
0, n<0
δ(n − k) =
1, n≥0
k=0

2.4
Let
1
xe (n) = [x(n) + x(−n)],
2
1
xo (n) = [x(n) − x(−n)].
2
Since
xe (−n) = xe (n)

and
xo (−n) = −xo (n),

it follows that
x(n) = xe (n) + xo (n).

The decomposition is unique. For

 
x(n) = 2, 3, 4, 5, 6 ,
↑

we have  
xe (n) = 4, 4, 4, 4, 4
↑

and  
xo (n) = −2, −1, 0, 1, 2 .
↑

7
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.5
First, we prove that
∞
xe (n)xo (n) = 0
n=−∞

∞ ∞
xe (n)xo (n) = xe (−m)xo (−m)
n=−∞ m=−∞
∞
= − xe (m)xo (m)
m=−∞
∞
= − xe (n)xo (n)
n=−∞
∞
= xe (n)xo (n)
n=−∞
= 0

Then,
∞ ∞
2 2
x (n) = [xe (n) + xo (n)]
n=−∞ n=−∞
∞ ∞ ∞
= x2e (n) + x2o (n) + 2xe (n)xo (n)
n=−∞ n=−∞ n=−∞
= Ee + Eo

2.6
(a) No, the system is time variant. Proof: If

x(n) → y(n) = x(n2 )

2
x(n − k) → y1 (n) = x[(n − k) ]
= x(n2 + k 2 − 2nk)
= y(n − k)

(b) (1)
 
x(n) = 0, 1, 1, 1, 1, 0, . . .
↑

(2)
 
y(n) = x(n2 ) = . . . , 0, 1, 1, 1, 0, . . .
↑

(3)
 
y(n − 2) = . . . , 0, 0, 1, 1, 1, 0, . . .
↑

8
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

(4)  
x(n − 2) = . . . , 0, 0, 1, 1, 1, 1, 0, . . .
↑

(5)  
y2 (n) = T [x(n − 2)] = . . . , 0, 1, 0, 0, 0, 1, 0, . . .
↑

(6)
y2 (n) = y(n − 2) ⇒ system is time variant.

(c) (1)  
x(n) = 1, 1, 1, 1
↑

(2)  
y(n) = 1, 0, 0, 0, 0, −1
↑

(3)  
y(n − 2) = 0, 0, 1, 0, 0, 0, 0, −1
↑

(4)  
x(n − 2) = 0, 0, 1, 1, 1, 1, 1
↑

(5)  
y2 (n) = 0, 0, 1, 0, 0, 0, 0, −1
↑

(6)
y2 (n) = y(n − 2).
The system is time invariant, but this example alone does not constitute a proof.
(d) (1)
y(n) = nx(n),
 
x(n) = . . . , 0, 1, 1, 1, 1, 0, . . .
↑

(2)  
y(n) = . . . , 0, 1, 2, 3, . . .
↑

(3)  
y(n − 2) = . . . , 0, 0, 0, 1, 2, 3, . . .
↑

(4)  
x(n − 2) = . . . , 0, 0, 0, 1, 1, 1, 1, . . .
↑

9
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

(5)
y2 (n) = T [x(n − 2)] = {. . . , 0, 0, 2, 3, 4, 5, . . .}

(6)
y2 (n) = y(n − 2) ⇒ the system is time variant.

2.7
(a) Static, nonlinear, time invariant, causal, stable.
(b) Dynamic, linear, time invariant, noncausal and unstable. The latter is easily proved.
For the bounded input x(k) = u(k), the output becomes
n+1 
0, n < −1
y(n) = u(k) =
n + 2, n ≥ −1
k=−∞

since y(n) → ∞ as n → ∞, the system is unstable.

(c) Static, linear, timevariant, causal, stable.
(d) Dynamic, linear, time invariant, noncausal, stable.
(e) Static, nonlinear, time invariant, causal, stable.
(f) Static, nonlinear, time invariant, causal, stable.

2.8
(a) True. If
v1 (n) = T1 [x1 (n)] and
v2 (n) = T1 [x2 (n)],
then
α1 x1 (n) + α2 x2 (n)
yields
α1 v1 (n) + α2 v2 (n)
by the linearity property of T1 . Similarly, if

y1 (n) = T2 [v1 (n)] and

y2 (n) = T2 [v2 (n)],

then
β1 v1 (n) + β2 v2 (n) → y(n) = β1 y1 (n) + β2 y2 (n)
by the linearity property of T2 . Since

v1 (n) = T1 [x1 (n)] and

v2 (n) = T2 [x2 (n)],

it follows that
A1 x1 (n) + A2 x2 (n)
yields the output
A1 T [x1 (n)] + A2 T [x2 (n)],

10
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

where T = T1 T2 . Hence T is linear.

(b) True. For T1 , if
x(n) → v(n) and
x(n − k) → v(n − k),
For T2 , if
v(n) → y(n)
andv(n − k) → y(n − k).
Hence, For T1 T2 , if
x(n) → y(n) and
x(n − k) → y(n − k)
Therefore, T = T1 T2 is time invariant.
(c) True. T1 is causal ⇒ v(n) depends only on x(k) for k ≤ n. T2 is causal ⇒ y(n) depends only on v(k) for k ≤
n. Therefore, y(n) depends only on x(k) for k ≤ n. Hence, T is causal.
(d) True. Combine (a) and (b).
(e) True. This follows from h1 (n) ∗ h2 (n) = h2 (n) ∗ h1 (n)
(f) False. For example, consider
T1 : y(n) = nx(n) and
T2 : y(n) = nx(n + 1).
Then,
T2 [T1 [δ(n)]] = T2 (0) = 0.
T1 [T2 [δ(n)]] = T1 [δ(n + 1)]
= −δ(n + 1)
= 0.

(g) False. For example, consider

T1 : y(n) = x(n) + b and
T2 : y(n) = x(n) − b, where b = 0.
Then,
T [x(n)] = T2 [T1 [x(n)]] = T2 [x(n) + b] = x(n).
Hence T is linear.
(h) True.
T1 is stable ⇒ v(n) is bounded if x(n) is bounded.
T2 is stable ⇒ y(n) is bounded if v(n) is bounded .
Hence, y(n) is bounded if x(n) is bounded ⇒ T = T1 T2 is stable.
(i) Inverse of (c). T1 and for T2 are noncausal ⇒ T is noncausal. Example:
T1 : y(n) = x(n + 1) and
T2 : y(n) = x(n − 2)
⇒ T : y(n) = x(n − 1),
which is causal. Hence, the inverse of (c) is false.
Inverse of (h): T1 and/or T2 is unstable, implies T is unstable. Example:
T1 : y(n) = ex(n) , stable and T2 : y(n) = ln[x(n)], which is unstable.
But T : y(n) = x(n), which is stable. Hence, the inverse of (h) is false.

11
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.9
(a)
n
y(n) = h(k)x(n − k), x(n) = 0, n < 0
k=−∞
n+N n+N
y(n + N ) = h(k)x(n + N − k) = h(k)x(n − k)
k=−∞ k=−∞
n n+N
= h(k)x(n − k) + h(k)x(n − k)
k=−∞ k=n+1
n+N
= y(n) + h(k)x(n − k)
k=n+1

For a BIBO system, limn→∞ |h(n)| = 0. Therefore,

n+N
limn→∞ h(k)x(n − k) = 0 and
k=n+1

limn→∞ y(n + N ) = y(N ).

(b) Let x(n) = xo (n) + au(n), where a is a constant and

xo (n) is a bounded signal with lim xo (n) = 0.

n→∞

Then,
∞ ∞
y(n) = a h(k)u(n − k) + h(k)xo (n − k)
k=0 k=0
n
= a h(k) + yo (n)
k=0

clearly, n x2o (n) < ∞ ⇒ n yo2 (n) < ∞ (from (c) below) Hence,

limn→∞ |yo (n)| = 0.

n
and, thus, limn→∞ y(n) = a k=0 h(k) = constant.
(c)

y(n) = h(k)x(n − k)
k
∞ ∞ 2

y 2 (n) = h(k)x(n − k)
−∞ −∞ k

= h(k)h(l) x(n − k)x(n − l)

k l n

But
x(n − k)x(n − l) ≤ x2 (n) = Ex .
n n

12
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

Therefore,
y 2 (n) ≤ Ex |h(k)| |h(l)|.
n k l
For a BIBO stable system,
|h(k)| < M.
k
Hence,
Ey ≤ M 2 Ex , so that
Ey < 0 if Ex < 0.

2.10
The system is nonlinear. This is evident from observation of the pairs
x3 (n) ↔ y3 (n) and x2 (n) ↔ y2 (n).
If the system were linear, y2 (n) would be of the form
y2 (n) = {3, 6, 3}
because the system is time-invariant. However, this is not the case.

2.11
since
x1 (n) + x2 (n) = δ(n)
and the system is linear, the impulse response of the system is
 
y1 (n) + y2 (n) = 0, 3, −1, 2, 1 .
↑

If the system were time invariant, the response to x3 (n) would be

 
3, 2, 1, 3, 1 .
↑

But this is not the case.

2.12
(a) Any weighted linear combination of the signals xi (n), i = 1, 2, . . . , N .
(b) Any xi (n − k), where k is any integer and i = 1, 2, . . . , N .

2.13
A system is BIBO stable if and only if a bounded input produces a bounded output.

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

|y(n)| ≤ |h(k)||x(n − k)|

k

≤ Mx |h(k)|
k

13
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

where |x(n − k)| ≤ Mx . Therefore, |y(n)| < ∞ for all n, if and only if

|h(k)| < ∞.
k

2.14
(a) A system is causal ⇔ the output becomes nonzero after the input becomes non-zero. Hence,

x(n) = 0 for n < no ⇒ y(n) = 0 for n < no .

(b)
n
y(n) = h(k)x(n − k), where x(n) = 0 for n < 0.
−∞

If h(k) = 0 for k < 0, then

n
y(n) = h(k)x(n − k), and hence, y(n) = 0 for n < 0.
0

On the other hand, if y(n) = 0 for n < 0, then

n
h(k)x(n − k) ⇒ h(k) = 0, k < 0.
−∞

2.15
(a)

N
For a = 1, an = N −M +1
n=M
N
for a = 1, an = aM + aM +1 + . . . + aN
n=M
N
(1 − a) an = aM + aM +1 − aM +1 + . . . + aN − aN − aN +1
n=M
= aM − aN +1

(b) For M = 0, |a| < 1, and N → ∞,

∞
1
an = , |a| < 1.
n=0
1−a

14
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.16
(a)

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

(b) (1)
y(n) = h(n) ∗ x(n) = {1, 3, 7, 7, 7, 6, 4}

y(n) = 35, h(k) = 5, x(k) = 7

n k k

(2)
y(n) = {1, 4, 2, −4, 1}

y(n) = 4, h(k) = 2, x(k) = 2

n k k

(3)
 
1 1 3 5
y(n) = 0, , − , , −2, 0, − , −2
2 2 2 2

y(n) = −5, h(n) = 2.5, x(n) = −2

n n n

(4)
y(n) = {1, 2, 3, 4, 5}

y(n) = 15, h(n) = 1, x(n) = 15

n n n

(5)
y(n) = {0, 0, 1, −1, 2, 2, 1, 3}

y(n) = 8, h(n) = 4, x(n) = 2

n n n

15
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.17
(a)
 
x(n) = 1, 1, 1, 1
↑
 
h(n) = 6, 5, 4, 3, 2, 1
↑
n
y(n) = x(k)h(n − k)
k=0
y(0) = x(0)h(0) = 6,
y(1) = x(0)h(1) + x(1)h(0) = 11
y(2) = x(0)h(2) + x(1)h(1) + x(2)h(0) = 15
y(3) = x(0)h(3) + x(1)h(2) + x(2)h(1) + x(3)h(0) = 18
y(4) = x(0)h(4) + x(1)h(3) + x(2)h(2) + x(3)h(1) + x(4)h(0) = 14
y(5) = x(0)h(5) + x(1)h(4) + x(2)h(3) + x(3)h(2) + x(4)h(1) + x(5)h(0) = 10
y(6) = x(1)h(5) + x(2)h(4) + x(3)h(2) = 6
y(7) = x(2)h(5) + x(3)h(4) = 3
y(8) = x(3)h(5) = 1
y(n) = 0, n ≥ 9
 
y(n) = 6, 11, 15, 18, 14, 10, 6, 3, 1
↑

(b) By following the same procedure as in (a), we obtain

 
y(n) = 6, 11, 15, 18, 14, 10, 6, 3, 1
↑

(c) By following the same procedure as in (a), we obtain

 
y(n) = 1, 2, 2, 2, 1
↑

(d) By following the same procedure as in (a), we obtain

 
y(n) = 1, 2, 2, 2, 1
↑

2.18
(a)
 
1 2 4 5
x(n) = 0, , , 1, , , 2
↑ 3 3 3 3
 
h(n) = 1, 1, 1, 1, 1
↑
y(n) = x(n) ∗ h(n)
 
1 10 20 11
= , 1, 2, , 5, , 6, 5, , 2
3 ↑ 3 3 3

16
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

(b)
1
x(n) =n[u(n) − u(n − 7)],
3
h(n) = u(n + 2) − u(n − 3)
y(n) = x(n) ∗ h(n)
1
= n[u(n) − u(n − 7)] ∗ [u(n + 2) − u(n − 3)]
3
1
= n[u(n) ∗ u(n + 2) − u(n) ∗ u(n − 3) − u(n − 7) ∗ u(n + 2) + u(n − 7) ∗ u(n − 3)]
3
1 10 20
y(n) = δ(n + 1) + δ(n) + 2δ(n − 1) + δ(n − 2) + 5δ(n − 3) + δ(n − 4) + 6δ(n − 5)
3 3 3
11
+5δ(n − 6) + 5δ(n − 6) + δ(n − 7) + δ(n − 8)
3

2.19
4
y(n) = h(k)x(n − k),
k=0
 
−3 −2 −1 5
x(n) = α ,α ,α , 1, α, . . . , α
↑
 
h(n) = 1, 1, 1, 1, 1
↑
4
y(n) = x(n − k), −3 ≤ n ≤ 9
k=0
= 0, otherwise.
Therefore,
y(−3) = α−3 ,
y(−2) = x(−3) + x(−2) = α−3 + α−2 ,
y(−1) = α−3 + α−2 + α−1 ,
y(0) = α−3 + α−2 + α−1 + 1
y(1) = α−3 + α−2 + α−1 + 1 + α,
y(2) = α−3 + α−2 + α−1 + 1 + α + α2
y(3) = α−1 + 1 + α + α2 + α3 ,
y(4) = α4 + α3 + α2 + α + 1
y(5) = α + α2 + α 3 + α 4 + α 5 ,
y(6) = α2 + α3 + α4 + α5
y(7) = α3 + α4 + α5 ,
y(8) = α4 + α5 ,
y(9) = α5

2.20
(a) 131 x 122 = 15982
(b) {1↑ , 3, 1} ∗ {1↑ , 2, 2} = {1, 5, 9, 8, 2}

17
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

(c) (1 + 3z + z 2 )(1 + 2z + 2z 2 ) = 1 + 5z + 9z 2 + 8z 3 + 2z 4
(d) 1.31 x 12.2 = 15.982.
(e) These are different ways to perform convolution.

2.21
(a)
n n
y(n) = ak u(k)bn−k u(n − k) = bn (ab−1 )k
k=0 k=0

 bn+1 −an+1
u(n), a = b
y(n) = n
b−a
b (n + 1)u(n), a=b

(b)

 
x(n) =
1, 2, 1, 1
↑
 
h(n) = 1, −1, 0, 0, 1, 1
↑
 
y(n) = 1, 1, − 1, 0, 0, 3, 3, 2, 1
↑

(c)

 
x(n) = 1, 1, 1, 1, 1, 0, −1 ,
↑
 
h(n) = 1, 2, 3, 2, 1
↑
 
y(n) = 1, 3, 6, 8, 9, 8, 5, 1, −2, −2, −1
↑

(d)

 
x(n) = 1, 1, 1, 1, 1 ,
↑
 
h (n) = 0, 0, 1, 1, 1, 1, 1, 1
↑

h(n) = h (n) + h (n − 9),

y(n) = y  (n) + y  (n − 9), where
 
y  (n) = 0, 0, 1, 2, 3, 4, 5, 5, 4, 3, 2, 1
↑

18
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.22
(a)

yi (n) = x(n) ∗ hi (n)

y1 (n) = x(n) + x(n − 1)
= {1, 5, 6, 5, 8, 8, 6, 7, 9, 12, 12, 15, 9} , similarly
y2 (n) = {1, 6, 11, 11, 13, 16, 14, 13, 15, 21, 25, 28, 24, 9}
y3 (n) = {0.5, 2.5, 3, 2.5, 4, 4, 3, 3.5, 4.5, 6, 6, 7.5, 4.5}
y4 (n) = {0.25, 1.5, 2.75, 2.75, 3.25, 4, 3.5, 3.25, 3.75, 5.25, 6.25, 7, 6, 2.25}
y5 (n) = {0.25, 0.5, −1.25, 0.75, 0.25, −1, 0.5, 0.25, 0, 0.25, −0.75, 1, −3, −2.25}

(b)

1
y3 (n) = y1 (n), because
2
1
h3 (n) = h1 (n)
2
1
y4 (n) = y2 (n), because
4
1
h4 (n) = h2 (n)
4

(c) y2 (n) and y4 (n) are smoother than y1 (n), but y4 (n) will appear even smoother because of the
smaller scale factor.
(d) System 4 results in a smoother output. The negative value of h5 (0) is responsible for the
non-smooth characteristics of y5 (n)
(e)
 
1 3 1 1 1 1 3 9
y6 (n) = , , −1, , 1, −1, 0, , , 1, − , , −
2 2 2 2 2 2 2 2

y2 (n) is smoother than y6 (n).

2.23
We can express the unit sample in terms of the unit step function as δ(n) = u(n) − u(n − 1).
Then,

h(n) = h(n) ∗ δ(n)

= h(n) ∗ (u(n) − u(n − 1)
= h(n) ∗ u(n) − h(n) ∗ u(n − 1)
= s(n) − s(n − 1)

Using this definition of h(n)

y(n) = h(n) ∗ x(n)

= (s(n) − s(n − 1)) ∗ x(n)
= s(n) ∗ x(n) − s(n − 1) ∗ x(n)

19
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.24
If
y1 (n) = ny1 (n − 1) + x1 (n) and
y2 (n) = ny2 (n − 1) + x2 (n) then
x(n) = ax1 (n) + bx2 (n)
produces the output
y(n) = ny(n − 1) + x(n), where
y(n) = ay1 (n) + by2 (n).
Hence, the system is linear. If the input is x(n − 1), we have
y(n − 1) = (n − 1)y(n − 2) + x(n − 1). But
y(n − 1) = ny(n − 2) + x(n − 1).
Hence, the system is time variant. If x(n) = u(n), then |x(n)| ≤ 1. But for this bounded input,
the output is
y(0) = 1, y(1) = 1 + 1 = 2, y(2) = 2x2 + 1 = 5, . . .
which is unbounded. Hence, the system is unstable.

2.25
(a)
δ(n) = γ(n) − aγ(n − 1) and,
δ(n − k) = γ(n − k) − aγ(n − k − 1). Then,
∞
x(n) = x(k)δ(n − k)
k=−∞
∞
= x(k)[γ(n − k) − aγ(n − k − 1)]
k=−∞
∞ ∞
x(n) = x(k)γ(n − k) − a x(k)γ(n − k − 1)
k=−∞ k=−∞
∞ ∞
x(n) = x(k)γ(n − k) − a x(k − 1)γ(n − k)
k=−∞ k=−∞
∞
= [x(k) − ax(k − 1)]γ(n − k)
k=−∞
Thus, ck = x(k) − ax(k − 1)
(b)
y(n) = T [x(n)]
∞
= T[ ck γ(n − k)]
k=−∞
∞
= ck T [γ(n − k)]
k=−∞
∞
= ck g(n − k)
k=−∞

20
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

(c)

h(n) = T [δ(n)]
= T [γ(n) − aγ(n − 1)]
= g(n) − ag(n − 1)

2.26
With x(n) = 0, we have

4
y(n − 1) + y(n − 1) = 0
3
4
y(−1) = − y(−2)
3
4
y(0) = (− )2 y(−2)
3
4
y(1) = (− )3 y(−2)
3
..
.
4
y(k) = (− )k+2 y(−2) ← zero-input response.
3

2.27

h(n) = h1 (n) ∗ h2 (n)

∞
= ak [u(k) − u(k − N )][u(n − k) − u(n − k − M )]
k=−∞
∞ ∞
= ak u(k)u(n − k) − ak u(k)u(n − k − M )
k=−∞ k=−∞
∞ ∞
− ak u(k − N )u(n − k) + ak u(k − N )u(n − k − M )
k=−∞ k=−∞
 n n−M
  n n−M

= ak − ak − ak − ak
k=0 k=0 k=N k=N
= 0

2.28
(a) L1 = N1 + M1 and L2 = N2 + M2
(b) Partial overlap from left:

low N1 + M1 high N1 + M2 − 1

Full overlap: low N1 + M2 high N2 + M1

Partial overlap from right:

low N2 + M1 + 1 high N2 + M2

21
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

(c)
 
x(n) = 1, 1, 1, 1, 1, 1, 1
↑
 
h(n) = 2, 2, 2, 2
↑
N1 = −2,
N2 = 4,
M1 = −1,
M2 = 2,

Partial overlap from left: n = −3 n = −1 L1 = −3

Full overlap: n = 0 n=3
Partial overlap from right:n = 4 n=6 L2 = 6

2.29
(a)
y(n) − 0.6y(n − 1) + 0.08y(n − 2) = x(n).
The characteristic equation is
λ2 − 0.6λ + 0.08 = 0.
λ = 0.2, 0.4 Hence,
1n 2n
yh (n) = c1 + c2 .
5 5
With x(n) = δ(n), the initial conditions are

y(0) = 1,
y(1) − 0.6y(0) = 0 ⇒ y(1) = 0.6.
Hence,c1 + c2 = 1 and
1 2
c1 + = 0.6 ⇒ c1 = −1, c2 = 3.
5 5  
1 n 2 n
Therefore h(n) = −( ) + 2( ) u(n)
5 5
The step response is
n
s(n) = h(n − k), n ≥ 0
k=0
n  
2 1
= 2( )n−k − ( )n−k
5 5
k=0
  n+1   n+1 
1 2 1 1
= ( −1 − ( − 1 u(n)
0.12 5 0.16 5

(b)
y(n) − 0.7y(n − 1) + 0.1y(n − 2) = 2x(n) − x(n − 2).
The characteristic equation is
λ2 − 0.7λ + 0.1 = 0.

22
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

λ = 12 , 15 Hence,

1n 1n
yh (n) = c1 + c2 .
2 5

With x(n) = δ(n), we have

y(0) = 2,
y(1) − 0.7y(0) = 0 ⇒ y(1) = 1.4.
Hence,c1 + c2 = 2 and
1 1 7
c1 + = 1.4 =
2 5 5
2 14
⇒ c1 + c2 = .
5 5
These equations yield
10 4
c1 = , c2 = − .
3 3  
10 1 n 4 1 n
h(n) = ( ) − ( ) u(n)
3 2 3 5

The step response is

n
s(n) = h(n − k),
k=0
n n
10 1 4 1
= ( )n−k − ( )n−k
3 2 3 5
k=0 k=0
n n
10 1 n 4 1
= ( ) 2k − ( )n 5k
3 2 3 5
k=0 k=0
10 1 n n+1 1 1n
= ( (2 − 1)u(n) − ( (5n+1 − 1)u(n)
3 2 3 5

2.30

 
1 1 1 1
h(n) = 1, , , ,
↑ 2 4 8 16
 
y(n) = 1, 2, 2.5, 3, 3, 3, 2, 1, 0
↑
x(0)h(0) = y(0) ⇒ x(0) = 1
1 3
x(0) + x(1) = y(1) ⇒ x(1) =
2 2

By continuing this process, we obtain

 
3 3 7 3
x(n) = 1, , , , , . . .
2 2 4 2

23
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.31
(a) h(n) = h1 (n) ∗ [h2 (n) − h3 (n) ∗ h4 (n)]
(b)

h3 (n) ∗ h4 (n) = (n − 1)u(n − 2)

h2 (n) − h3 (n) ∗ h4 (n) = 2u(n) − δ(n)
1 1 1
h1 (n) = δ(n) + δ(n − 1) + δ(n − 2)
2
 4 2 
1 1 1
Hence h(n) = δ(n) + δ(n − 1) + δ(n − 2) ∗ [2u(n) − δ(n)]
2 4 2
1 5 5
= δ(n) + δ(n − 1) + 2δ(n − 2) + u(n − 3)
2 4 2

(c)
 
x(n) = 1, 0, 0, 3, 0, −4
↑
 
1 5 25 13
y(n) = , , 2, , , 5, 2, 0, 0, . . .
2 4 ↑ 4 2

2.32
First, we determine

s(n) = u(n) ∗ h(n)

∞
s(n) = u(k)h(n − k)
k=0
n
= h(n − k)
k=0
∞
= an−k
k=0
an+1
−1
= ,n ≥ 0
a−1

For x(n) = u(n + 5) − u(n − 10), we have the response

an+6 − 1 an−9 − 1
s(n + 5) − s(n − 10) = u(n + 5) − u(n − 10)
a−1 a−1

From figure P2.33,

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

an+6 − 1 an−9 − 1
Hence, y(n) = u(n + 5) − u(n − 10)
a−1 a−1
an+4 − 1 an−11 − 1
− u(n + 3) + u(n − 12)
a−1 a−1

24
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.33

h(n) = [u(n) − u(n − M )] /M

∞
s(n) = u(k)h(n − k)
k=−∞
n  n+1
= h(n − k) = M , n<M
1, n≥M
k=0

2.34

∞ ∞
|h(n)| = |a|n
n=−∞ n=0,neven
∞
= |a|
2n

n=0
1
=
1 − |a|2

Stable if |a| < 1

2.35
h(n) = an u(n). The response to u(n) is

∞
y1 (n) = u(k)h(n − k)
k=0
n
= an−k
k=0
n
= an a−k
k=0
1 − an+1
= u(n)
1−a
Then, y(n) = y1 (n) − y1 (n − 10)
1  
= (1 − an+1 )u(n) − (1 − an−9 )u(n − 10)
1−a

2.36
We may use the result in problem 2.32 with a = 12 . Thus,
   
1 1
y(n) = 2 1 − ( )n+1 u(n) − 2 1 − ( )n−9 u(n − 10)
2 2

25
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.37
(a)
∞
y(n) = h(k)x(n − k)
k=−∞
n
1
= ( )k 2n−k
2
k=0
n
1
= 2n ( )k
4
k=0
 
1 n+1 4
= 2 1−( )
n
( )
4 3
 
2 n+1 1 n+1
= 2 −( ) u(n)
3 2

(b)
∞
y(n) = h(k)x(n − k)
k=−∞
∞
= h(k)
k=0
∞
1
= ( )k = 2, n < 0
2
k=0
∞
y(n) = h(k)
k=n
∞
1
= ( )k
2
k=n
∞ n−1
1 1
= ( )k − ( )k
2 2
k=0 k=0
1 − ( 12 )n
= 2−( 1 )
2
1
= 2( )n , n ≥ 0.
2

2.38
(a)

he (n) = h1 (n) ∗ h2 (n) ∗ h3 (n)

= [δ(n) − δ(n − 1)] ∗ u(n) ∗ h(n)
= [u(n) − u(n − 1)] ∗ h(n)
= δ(n) ∗ h(n)
= h(n)

(b) No.

26
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.39
(a) x(n)δ(n − n0 ) = x(n0 ). Thus, only the value of x(n) at n = n0 is of interest.
x(n) ∗ δ(n − n0 ) = x(n − n0 ). Thus, we obtain the shifted version of the sequence x(n).
(b)
∞
y(n) = h(k)x(n − k)
k=−∞
= h(n) ∗ x(n)
Linearity:x1 (n) → y1 (n) = h(n) ∗ x1 (n)
x2 (n) → y2 (n) = h(n) ∗ x2 (n)
Then x(n) = αx1 (n) + βx2 (n) → y(n) = h(n) ∗ x(n)
y(n) = h(n) ∗ [αx1 (n) + βx2 (n)]
= αh(n) ∗ x1 (n) + βh(n) ∗ x2 (n)
= αy1 (n) + βy2 (n)
Time Invariance:
x(n) → y(n) = h(n) ∗ x(n)
x(n − n0 ) → y1 (n) = h(n) ∗ x(n − n0 )
= h(k)x(n − n0 − k)
k
= y(n − n0 )

(c) h(n) = δ(n − n0 ).

2.40
(a) s(n) = −a1 s(n − 1) − a2 s(n − 2) − . . . − aN s(n − N ) + b0 v(n). Refer to fig 2.40-1.
(b) v(n) = b10 [s(n) + a1 s(n − 1) + a2 s(n − 2) + . . . + aN s(n − N )] . Refer to fig 2.40-2

27
Copyright © 2022 Pearson Education, Inc.
CLICK HERE TO ACCESS THE COMPLETE Solutions

v(n) s(n)
b0 +

z-1

+ -a 1

z-1

+ -a 2

+
z -1

-a
N

Figure 2.40-1:
s(n) v(n)
+ 1/b0

z -1

a1 +

z -1

a2 +

z-1

aN

Figure 2.40-2:

28
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

2.41

1
y(n) =− y(n − 1) + x(n) + 2x(n − 2)
2
1
y(−2) = − y(−3) + x(−2) + 2x(−4) = 1
2
1 3
y(−1) = − y(−2) + x(−1) + 2x(−3) =
2 2
1 17
y(0) = − y(−1) + 2x(−2) + x(0) =
2 4
1 47
y(1) = − y(0) + x(1) + 2x(−1) = , etc
2 8

2.42

(a) Refer to fig 2.42-1

(b) Refer to fig 2.42-2

x(n) y(n)
+ 1/2 +

z-1

+ -1/2

z-1

z -1

z -1

z -1

3/2

Figure 2.42-1:

29
Copyright © 2022 Pearson Education, Inc.
 CLICK HERE TO ACCESS THE COMPLETE Solutions

x(n) y(n)
+ 1/2 +

z-1

+ -1/2

z-1

z -1

z -1

z -1

3/2

Figure 2.42-2:

2.43

(a)

 
x(n) = 1, 0, 0, . . .
↑
1
y(n) =y(n − 1) + x(n) + x(n − 1)
2
y(0) = x(0) = 1,
1 3
y(1) = y(0) + x(1) + x(0) =
2 2
1 3
y(2) = y(1) + x(2) + x(1) = . Thus, we obtain
2
 4
3 3 3 3 3
y(n) = 1, , , , , , . . .
2 4 8 16 32

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

(c) As in part(a), we obtain

 
5 13 29 61
y(n) = 1, , , , , . . .
2 4 8 16

30
Copyright © 2022 Pearson Education, Inc.