Digital Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis

www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e

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.

This Book is Available on YakiBooki.com

 Digital Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis

www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e

2
Copyright © 2022 Pearson Education, Inc.

This Book is Available on YakiBooki.com

 Digital Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis

Chapter 1
www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e

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.

This Book is Available on YakiBooki.com

 Digital Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis

www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e

4
Copyright © 2022 Pearson Education, Inc.

This Book is Available on YakiBooki.com

 Digital Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis

Chapter 2
www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e

2.1
(a)  
1 2
x(n) = . . . 0, , , 1, 1, 1, 1, 0, . . .
3 3 ↑
. Refer to fig 2.1-1. Also, visit Library Genesis (forum.mhut.org, libgen.is) for more manuals.
(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.

This Book is Available on YakiBooki.com

 Digital Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis
(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.
www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e
(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.

This Book is Available on YakiBooki.com

 Digital (h)
Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis
x(n) − x(−n)
xo (n) =
 2 
1 1 1 1 1 1
= . . . 0, − , − , − , 0, 0, 0, , , , 0, . . .
4 4 2 2 4 4

www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e
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.

This Book is Available on YakiBooki.com

 2.5
Digital Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis
First, we prove that
∞
xe (n)xo (n) = 0
n=−∞

www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e
∞ ∞
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.

This Book is Available on YakiBooki.com

 Digital Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis
(4)  
x(n − 2) = . . . , 0, 0, 1, 1, 1, 1, 0, . . .
↑

(5)  
y (n) = T [x(n − 2)] = . . . , 0, 1, 0, 0, 0, 1, 0, . . .
www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e
2
↑

(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.

This Book is Available on YakiBooki.com

 Digital Signal Processing (Principles, Algorithms and Applications) (5th Edition) Proakis
(5)
y2 (n) = T [x(n − 2)] = {. . . , 0, 0, 2, 3, 4, 5, . . .}

(6)
y2 (n) = y(n − 2) ⇒ the system is time variant.
www.yakibooki.com/download/digital-signal-processing-principles-algorithms-and-applications-5th-e
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.

This Book is Available on YakiBooki.com