Not for sale.

1


SOLUTIONS MANUAL
to accompany
Digital Signal Processing:
A Computer-Based Approach
Fourth Edition

Sanjit K. Mitra

Prepared by

Chowdary Adsumilli, John Berger, Marco Carli,
Hsin-Han Ho, Rajeev Gandhi, Martin Gawecki, Chin Kaye Koh,
Luca Lucchese, Mylene Queiroz de Farias, and Travis Smith



Copyright ! 2011 by Sanjit K. Mitra. No part of this publication may
be reproduced or distributed in any form or by any means, or stored in a
database or retrieval system, without the prior written consent of Sanjit
K. Mitra, including, but not limited to, in any network or other electronic
Storage or transmission, or broadcast for distance learning.
Not for sale. 2


Chapter 2

2.1 Using Eq. (2.9), we get:
(a)
!
x
1
1
= 4.2, x
1
2
=13.1495, x
1
"
=10.1
(b)
!
x
2
1
= 4.8, x
2
2
=18.2557, x
2
"
=12.01

2.2 To show this, we start with the definitions from Eq. (2.9) and square them:

!
x
2
2
= x[n]
2
n="#
#
$
% x[n]
n="#
#
$
&
'
(
(
)
*
+
+
2
= x
1
2
.


The middle inequality is a generalization of the triangle inequality. We can take square
roots of both sides of this result, because everything within the equations is positive,
getting:
!
x
2
" x
1
.

2.3 (a)
!
c[n] = x[n + 3] ={2 0 "1 6 "3 2 0}, "6 # n # 0.

(b)
!
d[n] = y[n "2] ={8 2 "7 "3 0 1 1}, " 3 # n # 3.

(c)
!
e[n] = x["n] ={0 2 "3 6 "1 0 2}, " 3 # n # 3.

(d)
!
u[n] = x[n " 3] + y[n + 3] ={8 2 "5 "3 "1 7 "2 2 0}, "2 # n # 6.

(e)
!
v[n] = y[n "2]# w[n] ={3 6}, "2 $ n $ "1.

(f)
!
s[n] = y[n + 4] " w[n " 3] ={"3 "6 1 2 2 "4 "8 "3 0 1 1}, "5 # n # 5.

(g)
!
r[n] = 4.1" y[n] ={32.8 8.2 #28.7 #12.3 0 4.1 4.1}, #5 $ n $1.

2.7 (a) Let s[n] be the signal in the middle of the structure. Then:


!
s[n] = x[n] " d
1
x[n "1] " d
2
x[n "2].

We can see that:
!
y[n] = p
0
s[n] + p
1
s[n "1] + p
2
s[n "2]. Putting these together, we get:

!
y[n] = p
0
x[n] " d
1
x[n "1] " d
2
x[n "2]
( )
+ p
1
x[n "1] " d
1
x[n "2] " d
2
x[n " 3]
( )
+ p
2
x[n "2] " d
1
x[n " 3] " d
2
x[n " 4]
( )
= p
0
x[n] +( p
1
" d
1
)x[n "1] +( p
2
" d
1
" d
2
)x[n "2] "(d
1
+ d
2
)x[n " 3] " d
2
x[n " 4].

(b) Again, if we let s[n] be the signal in the middle of the structure, then:
Not for sale. 3


!
s[n] = p
0
x[n] + p
1
x[n "1] + p
2
x[n "2].
We can see that:
!
y[n] = s[n] " d
1
y[n "1] " d
2
y[n "2].

Combining the above two equations we get:


!
y[n] = p
0
x[n] + p
1
x[n "1] + p
2
x[n "2] " d
1
y[n "1] " d
2
y[n "2].

(c) If we let s[n] and t[n] represent the signals past each feed-forward component, then:


!
s[n] = h[0] x[n] + "
11
x[n #1] + "
21
x[n #2] ( ),

!
t[n] = s[n] + "
12
s[n #1] + "
22
s[n #2],

!
y[n] = t[n] + "
13
t[n #1] + "
23
t[n #2].

Substituting the top two equations into the last equation, we get:

!
y[n] = s[n] + "
12
s[n #1] + "
22
s[n #2] ( ) + "
13
s[n #1] + "
12
s[n #2] + "
22
s[n # 3] ( )

!
+"
23
s[n #2] + "
12
s[n # 3] + "
22
s[n # 4] ( )


!
= h[0] x[n] + "
11
x[n #1] + "
21
x[n #2]
( )
+ "
12
h[0] x[n #1] + "
11
x[n #2] + "
21
x[n # 3]
( )
+"
22
h[0] x[n #2] + "
11
x[n # 3] + "
21
x[n # 4]
( )
+ "
13
h[0] x[n #1] + "
11
x[n #2] + "
21
x[n # 3]
( )
+"
13
"
12
h[0] x[n #2] + "
11
x[n # 3] + "
21
x[n # 4]
( )
+ "
13
"
22
h[0] x[n # 3] + "
11
x[n # 4] + "
21
x[n #5]
( )
+"
23
h[0] x[n #2] + "
11
x[n # 3] + "
21
x[n # 4]
( )
+ "
23
"
12
h[0] x[n # 3] + "
11
x[n # 4] + "
21
x[n #5]
( )
+"
23
"
22
h[0] x[n # 4] + "
11
x[n #5] + "
21
x[n #6]
( )
,

which leads to:

!
y[n] = h[0]x[n] + h[0] "
11
+ "
12
+ "
13
( )x[n #1] + h[0] "
21
+ "
12
"
11
+ "
22
+ "
11
"
13
+ "
12
"
13
( )x[n #2]
+ h[0] "
12
"
21
+ "
11
"
22
+ "
13
"
21
+ "
11
"
12
"
13
+ "
13
"
22
+ "
11
"
23
+ "
12
"
23
( )x[n # 3]
+ h[0] "
22
"
21
+ "
12
"
13
"
21
+ "
11
"
13
"
22
+ "
11
"
12
"
23
+ "
22
"
23
( )x[n # 4]
+ h[0] "
21
"
13
"
22
+ "
21
"
12
"
23
+ "
22
"
23
"
11
( )x[n #5] + h[0]"
21
"
22
"
23
x[n #6]

(d) Let
!
s
0
[n], s
1
[n], and
!
s
2
[n] denote the outputs of the three adders:


!
y[n] = h[0]s
0
[n] + h[1]s
1
[n] + h[2]s
2
[n] + h[3]x[n " 3],

!
s
0
[n] = x[n] + x[n "6],
s
1
[n] = x[n "1] + x[n "5],
s
2
[n] = x[n "2] + x[n " 4].


Not for sale. 4
Combining the above, we get
!
y[n] = h[0] x[n] + x[n "6] ( ) + h[1] x[n "1] + x[n "5] ( ) + h[2] x[n "2] + x[n " 4] ( ) + h[3]x[n " 3]
!
= h[0]x[n] + h[1]x[n "1] + h[2]x[n "2] + h[3]x[n " 3] + h[2]x[n " 4] + h[1]x[n "5] + h[0]x[n].

2.5
!
y[n] = x[n " k]h[k]
k="#
#
$
. Since
!
h[k] is of length and defined for
!
0 " k " M #1, the
convolution sum reduces to
!
y[n] = x[n " k]h[k]
k=0
(M"1)
#
. Thus,
!
y[n] will be nonzero for
all those values of and for which
!
n " k satisfies
!
0 " n # k " N #1. The minimum
value of
!
n " k is 0, and occurs for the lowest at
!
n = 0 and
!
k = 0. The maximum value
of
!
n " k = N "1 and occurs for maximum value of at
!
M "1. Thus
!
n " k = M "1and

!
n = N + M "2. Hence the total number of nonzero samples
!
= N + M "1.

2.6 Let X be the length of the convolution sum of x[n] and y[n], which are of length N and M,
respectively. From Problem 2.5, we know that X The length of the
convolution of x[n] with w[n], is thus
!
X + L "1 or
!
N + M + L "2.

2.7 To show that the two convolutions are equal, we simply evaluate both convolution sums:


2.8 (a)
!
x
1
[k]x
1
[n " k]
k="#
#
$
= 1 "2 3 "2 1
{ }
, "2 % n % 2.
(b)
!
x
2
[k]x
2
[n " k]
k="#
#
$
= 1 2 1 "2 "4 "2 1 2 1
{ }
, 0 % n % 8.
(c)
!
x
3
[k]x
3
[n " k]
k="#
#
$
= 4 0 "12 0 17 0 "12 0 4
{ }
, " 4 % n % 4.

2.9 (a) Given x[n] and y[n] from Problem 2.3, their convolution sum u[n] is given by:


!
u[n] = x[k]y[n " k]
k="#
#
$
= 16 4 "22 40 "5 "27 9 "6 "1 3 "1 2 0
{ }
, "8 % n % 4.


(b) Given x[n] and w[n] from Problem 2.3, their convolution sum v[n] is given by:
!
v[n] = x[k]w[n " k]
k="#
#
$
= 6 12 "5 16 40 "8 23 22 21 0 9 2 0
{ }
, "5 % n % 7.
(c) Given w[n] and y[n] from Problem 2.3, their convolution sum g[n] is given by:
Not for sale. 5

!
g[n] = w[k]y[n " k]
k="#
#
$
= 24 54 "17 "37 41 52 "19 "53 "24 5 12 7 1
{ }
, " 7 % n % 5.


2.10 First, express y[n] as a convolution and then rewrite the convolution of v[n] as a function
of x:
!
y[n] =x
1
[n]O* x
2
[n] = x
1
[n " k]x
2
[k].
k="#
#
$

Now:
!
v[n] =x
1
[n " N
1
]O* x
2
[n " N
2
] = x
1
[n " N
1
" k]x
2
[k " N
2
].
k="#
#
$

Let
!
k " N
2
= m. Then:
!
v[n] = x
1
[n " N
1
" N
2
" m]x
2
[m]
m="#
#
$
= y[n " N
1
" N
2
].

2.11 Using the same steps as in the solution of Problem 2.10, we first express g[n] as a
convolution and then reevaluate h[n] in terms of these convolution sums:


!
g[n] = x
1
[n]O
*
x
2
[n]O
*
x
3
[n] = y[n]O
*
x
3
[n] where
!
y[n] = x
1
[n]O
*
x
2
[n].
Now:
!
v[n] = x
1
[n " N
1
]O
*
x
2
[n " N
2
].
Define
!
h[n] = v[n]O
*
x
3
[n " N
3
]. Then from the solution of Problem 2.10,
!
v[n] = y[n " N
1
" N
2
].

Hence:
!
h[n] = y[n " N
1
" N
2
]O
*
x
3
[n " N
3
].
Therefore, making use of the solution of Problem 2.10 again we get:
!
h[n] = y[n " N
1
" N
2
" N
3
].

2.12 Two results are needed for this problem:

Length of Sequence = Max Min + 1
Length of Convolution =
!
L
1
+L
2
"1.

(a) The sequence
!
y
1
[n], formed from the convolution of h[n] with itself, will have a
length
!
(N + M +1) + (N + M +1) "1, or
!
2N +2M +1. To find the range of indices over
which the convolution will have nonzero values, it is necessary to think about the nature
of the convolved signals. Both of them, since they are the same, have nonzero values on
either side of the origin, which will still be true after one of them is time reversed within
the convolution sum formula. Thus, if the original has values in the range
!
["M, N], then
the time reversed version will have values in the range
!
["N, M]. The first left-shift at
which point these two overlap will occur at (2M), since the time-reversed version must
be shifted left M points to have the negative portions overlap, and then again by M points
to be outside of the range of overlap. A similar principle applies to the right-most region
Not for sale. 6
of overlap. The time-reversed signal must be shifted by N twice to the right to be just
outside of the region of overlap, so that the right-most boundary of the resulting
convolution is (2N). Therefore the convolution is nonzero in the range [2M, 2N].

Note that these boundaries also give the correct length of the resulting signal:
(2N) (2M) + 1 = 2N + 2M + 1.

(b) The sequence y
2
[n], formed from the convolution of g[n] with itself, will have length
Although the signal is no longer on both
sides of the origin, when the time-reversed version is generated, there will be one copy
whose values are in the range [K,N] and another whose values are in the range [N, K].
In order to get the first point of overlap, the time-reversed version must be shifted to the
right by 2K points, giving the left-most boundary of the convolution sum. The right-most
boundary is similarly calculated by noting that the signal must be shifted by 2N points.
Thus, the convolution will be nonzero in the range [2K, 2N].

Note, again, that these boundaries also give the correct length:

2N ( 2K) + 1 = 2N 2K + 1.

(c) The sequence y
3
[n], formed from the convolution of w[n] with itself, will have length
(L R) + (L R) + 1, or 2L 2R + 1. This situation is similar to that in part (b), except
that we are dealing with the mirror image of the signal so that the time reversed part
will be in the range [R,L]. Because of the symmetry of the convolution operation, we will
end up with inverted boundaries but the same length computation the convolution will
be nonzero in the range [ 2L, 2R].

Also, these boundaries will give the correct length:

( 2R) ( 2L) + 1 = 2L 2R + 1.

(d) The sequence y
4
[n], formed from the convolution of h[n] with g[n], will have length
(N + M + 1) + (N K + 1) 1, or 2N + M K + 1. To find the range of indexes, it is again
instructive to think of the time-reversed version of g[n], and the points at which it stops
and starts overlapping with h[n]. The left-most boundary will occur at (M K), while
the right-most boundary will occur at 2N, so that the convolution will be nonzero in the
range [ M + K, 2N].

Again, these boundaries can be used to confirm the length:

2N (M + K) + 1 = 2N + M K + 1.

(e) The sequence y
5
[n], formed from the convolution of h[n] with w[n], will have length
(N + M + 1) + (L R + 1) 1, or N + M + L R + 1. The range of nonzero indexes can be
found similarly to that in (d), by checking the left-most and right-most points of overlap.
The resulting convolution will be nonzero in the range [L M, N R].
Not for sale. 7

And again, this confirms the length calculation:

N R (L M) + 1 = N + M + L R + 1.

2.13
!
{x[n]} = 2, "3, 4, 1 [ ], "1# n # 2 and
!
{h[n]} = "3, 5, "6, 4 [ ], "2 # n #1.
Thus,
!
y["1] = x["1]h[0] + x[0]h["1] + x[1]h["2]
!
= 2 " (#6) +(#3) " 5 + 4 " (#3) = #39.

2.14 Tthe maximum value will occur with the largest overlap during the convolution operation.
Since one sequence is 2 samples shorter than the other, there will be three possible points
where all terms of the shorter sequence overlap with terms of the longer sequence. Thus,
the maximum of y[n] will be at the locations
!
n = N " 3, N "2, N "1 and the maximum
value is
!
N "2.

2.15 The convolution of a sequence of length N and a sequence of length M will produce a sequence
of length L = N + M 1. Thus, the length of x[n] can be computed by rearranging the equation
and evaluating for N = L M + 1. Rearranging the terms of the convolution formula, we can
recursively compute x[n] because successive samples of y[n] are based purely on successive
coefficients of x[n]. For example, since y[0] = x[0]h[0], we can find x[0] = y[0]/h[0]. From here,
we can use the following formula to compute all other terms within x[n]:

!
x[n] =
1
h[0]
y[n] " h[k]x[n " k]
k=0
n"1
#
$
%
&
&
'
(
)
)
.

(a) Using the formula for the length of x[n], we get N = 8 4 + 1 = 4. Using the above
recursive formula for deconvolution, we arrive at .

(b) Using the formula for the length of x[n], we get N = 5 3 + 1 = 3. The length of y[n] in
this problem is effectively 5, because the first term is 0. Using the above recursive formula for
deconvolution, we arrive at .

(c) Using the formula for the length of x[n], we get N = 9 5 + 1 = 5. Using the above
recursive formula for deconvolution, we arrive at .

The above results can be derived using the function deconv in MATLAB.

2.16 We make use of the circular shifting operation given by Eqn. (2.25). The length of {x[n]}
is 9.

(a) Thus,
!
{y[n]} ={"x[n +12]#
9
}. Therefore,
!
y["3] = x[#"3+12$
9
] = x[#9$
9
] = x[0].
Therefore, y[3] = 4

(b) Thus,
!
{z[n]} ={"x[n #15]$
9
}. Therefore,
!
z[2] = x["2 #15$
9
] = x["-13$
9
] = x[#4].
Therefore, z[2] = 5.

Not for sale. 8
2.17 We make use of the circular shifting operation given by Eqn. (2.25). Now,

!
{g[n]} = "3, 0, 4, 9, 2, 0, "2, 5 { }, " 4 # n # 3. The length of {g[n]} is 8.

(a)
!
{h[n]} ={g["n #5$
8
]} = 2, 0, #2, 5, #3, 0, 4, 9 { }, # 4 % n % 3.

(b)
!
{w[n]} ={g["n + 4#
8
]} = 9, 2, 0, $2, 5, $3, 0, 4 { }, $ 4 % n % 3.

2.18 Using the definition of average power (Eqn. (2.37)), the average power of the odd and
even portions of x[n] are thus given by:
P
!
x,even
= lim
K"#
1
2K +1
1
2
x[n] +
1
2
x[$n]
2
n=$K
K
%
and P
Combining the two, we get:
P P

The quantity inside the parentheses is given by

=
+
= =

!
= x
2
[n]
( )
n="K
K
#
= P
!
x
.

2.19 The given signal is
!
x[n] = sin(2"kn / N), 0 # n # N $1.The formula for energy is given by Eqn.
(2.34):
E
!
x
= x[n]
2
n=0
N"1
#
= sin
2
n=0
N"1
#
(2$kn / N)

!
=
1
2
1"cos(4#kn / N) ( )
n=0
N"1
$
=
N
2
"
1
2
cos(4#kn / N)
n=0
N"1
$
.
Not for sale. 9
Let
!
C = cos(4"kn / N)
n=0
N#1
$
and
!
S = sin(4"kn / N)
n=0
N#1
$
.
Then
!
C + jS = e
" j 4#kn / N
n=0
N"1
$
=
1"e
" j 4#kn
1"e
" j 4#k / N
= 0. This implies C = 0
Hence E
!
x
=
N
2
.

2.20 Using Eqn. (2.30), the odd and even parts are determined as follows:
!
x
ev
[n] =
1
2
x[n] + x["n] [ ] and
!
x
od
[n] =
1
2
x[n] " x["n] [ ].

(a)
!
x
ev
[n] = 1 1 "2 6 "2 1 1 { }, " 3 # n # 3,
!
x
od
[n] = 1 "1 1 0 "1 1 "1 { }, " 3 # n # 3.

(b)
!
y
ev
[n] = 4 1 "4 "2 1 1 1 "2 "4 1 4 { }, "5 # n # 5,
!
y
od
[n] = 4 1 "4 "2 "1 0 1 2 4 "1 "4 { }, "5 # n # 5.

(c)
!
w
ev
[n] = 1 3 5 4 "1 4 5 3 1 { }, " 4 # n # 4,
!
w
od
[n] = "1 "3 "2 2 0 "2 2 3 1 { }, " 4 # n # 4.

2.21 Using the formula for conjugate symmetric and conjugate anti-symmetric parts from Eqn.
(2.28), we determine the components as follows:

!
x
cs
[n] =
1
2
x[n] + x *["n] [ ] and
!
x
ca
[n] =
1
2
x[n] " x *["n] [ ].

(a)
!
x
1,cs
[n] = "2 +2 j 3 "6 j 4 3+6 j "2 "2 j { }, "2 # n # 2,
!
x
1,ca
[n] = 1+ k "1" j "5 j 1" j "1+ j { }, "2 # n # 2.

(b) From the formulas for sine and cosine, we have:
!
x
2,cs
[n] =
1
2
e
j 2"n / 5
+e
j"n / 3
( )
+ e
j 2"n / 5
#e
j"n / 3
( )
$
%
&
'
(
)
= cos
2"n
5
*
+
,
-
.
/ +cos
"n
3
*
+
,
-
.
/ ,
!
x
2,ca
[n] =
1
2
e
j 2"n / 5
+e
j"n / 3
( )
# e
j 2"n / 5
#e
j"n / 3
( )
$
%
&
'
(
)
= j sin
2"n
5
*
+
,
-
.
/ + j sin
"n
3
*
+
,
-
.
/ .

(c) From the properties and formulas for sine and cosine:
!
x
3,cs
[n] =
1
2
j cos
2"n
7
#
$
%
&
'
( )sin
2"n
4
#
$
%
&
'
(
#
$
%
&
'
(
+ )j cos
2"n
7
#
$
%
&
'
( +sin
2"n
4
#
$
%
&
'
(
#
$
%
&
'
(
*
+
,
-
.
/
= 0,
Not for sale. 10
!
x
3,ca
[n] =
1
2
j cos
2"n
7
#
$
%
&
'
( )sin
2"n
4
#
$
%
&
'
(
#
$
%
&
'
(
) )j cos
2"n
7
#
$
%
&
'
( +sin
2"n
4
#
$
%
&
'
(
#
$
%
&
'
(
*
+
,
-
.
/
=
1
2
j cos
2"n
7
#
$
%
&
'
( )sin
2"n
4
#
$
%
&
'
( + j cos
2"n
7
#
$
%
&
'
( )sin
2"n
4
#
$
%
&
'
(
*
+
,
-
.
/
= j cos
2"n
7
#
$
%
&
'
( )sin
2"n
4
#
$
%
&
'
( .

2.22 Since x[n] is conjugate symmetric it satisfies the condition
!
x[n] = x *["n] and since y[n]
is conjugate antisymmetric it satisfies the condition
!
y[n] = "y *["n].

(a)
!
g*["n] = x *["n]x *["n] = x[n]x[n] = g[n]. Thus, g[n] is conjugate symmetric.
(b)
!
u*["n] = x *["n]y *["n] = x[n]("y[n]) = "u[n]. Thus, u[n] is conjugate
antisymmetric.
(c)
!
v *["n] = y *["n]y *["n] = ("y[n])("y[n]) = v[n]. Thus, u[n] is conjugate symmetric.

2.23 An absolutely summable sequence {x[n]} satisfies the condition
!
| x[n] |
n="#
#
$
< #.
This implies that for each value of the index n, the sample value x[n] is a finite number.
Hence, the absolute value of each sample is bounded by a finite positive number, which
means that the sequence is bounded.

2.24 (a) Since is causal, Also, From the definition of
an even sequence, we can see that x
ev
[0] = x[0] and
!
x
ev
[n] =
1
2
x[n], n > 0.
Therefore,
Likewise, from the definition for the odd sequence, we have x[0] = 0 and
!
x
od
[n] =
1
2
x[n], n > 0. Therefore,
(b) Since is causal, Also, We can express y[n] in
terms of its real and imaginary parts and , which are and causal sequences,
as follows:
From the definition of an conjugate anti-symmetric sequence:
!
y
ca
[n] =
1
2
(y[n] " y
#
["n]).
Hence,
!
y
ca
[0] =
1
2
(y[0] " y
#
[0]) = jy
im
[0] and
!
y
ca
[n] =
1
2
y[n], n > 0.
Since
!
y
re
[0] is not known,
!
y[n] cannot be fully recovered from
!
y
ca
[n].

Likewise, from the definition of a conjugate symmetric sequence:
!
y
cs
[n] =
1
2
(y[n] + y
"
[#n]).
Hence:
!
y
cs
[0] =
1
2
(y[0] + y
"
[0]) = y
re
[0] and
!
y
cs
[n] =
1
2
y[n], n > 0.

Not for sale. 11
Since is not known, cannot be fully recovered from .

2.25 From Eqn. (2.44), an N-periodic extension of a signal x[n] is obtained as follows:
Therefore:
Substituting we get: Hence, is a periodic
sequence with a period

2.26 (a) Consider the sequence defined by
If n < 0, then k = 0 is not included in the sum and hence, x[n] = 0 for n < 0. On the other
hand, for k = 0 is included in the sum, and as a result, x[n] =1 for Thus:


(b) Since it follows that
Hence,

2.27 (a) Hence,
!
x
1
["n] = ["n " 3]. Therefore,

!
x
1,ev
[n] =
1
2
([n " 3] + ["n " 3]) =
1/2, n # 3,
0, "2 $ n $ 2,
1/2, "3 $ n,
%
&
'
(
'


!
x
1,od
[n] =
1
2
([n " 3] " ["n " 3]) =
1/2, n # 3,
0, "2 $ n $ 2,
"1/2, "3 $ n.
%
&
'
(
'


(b)
!
x
2
[n] = "
n
[n #1]. Hence,
!
x
2
["n] = #
"n
["n "1]. Therefore,

!
x
2,ev
[n] =
1
2
"
n
[n #1] +"
#n
[#n #1]
( )
=
1
2
"
n
, n $2,
0, #1% n %1,
1
2
"
#n
, #2 % n,
&
'
(
(
)
(
(


!
x
2,od
[n] =
1
2
"
n
[n #1] #"
#n
[#n #1]
( )
=
1
2
"
n
, n $2,
0, #1% n %1,
#
1
2
"
#n
, #2 % n.
&
'
(
(
)
(
(


Not for sale. 12
(c)
!
x
3
[n] = n"
n
[n +1]. Hence,
!
x
3
["n] = "n#
"n
["n +1]. Therefore,

!
x
3,ev
[n] =
1
2
n"
n
[n +1] + (#n)"
#n
[#n +1]
( )
=
1
2
n"
n
, n $2,
1
2
a #
1
a
%
&
'
(
)
* , n =1
0, n = 0
+
,
-
-
-
.
-
-
-


!
x
3,od
[n] =
1
2
n"
n
[n +1] #(#n)"
#n
[#n +1]
( )
=
1
2
n"
n
, n $2,
1
2
a +
1
a
%
&
'
(
)
* , n =1
0, n = 0
+
,
-
-
-
.
-
-
-


(d)
!
x
4
[n] = "
n
. Hence,
!
x
4
["n] = #
"n
= #
n
= x
4
[n]. Therefore,

!
x
4,ev
[n] =
1
2
(x
4
[n] + x
4
["n]) =
1
2
(x
4
[n] + x
4
[n]) = x
4
[n] = #
n


!
x
4,od
[n] =
1
2
(x
4
[n] " x
4
["n]) =
1
2
(x
4
[n] " x
4
[n]) = 0.

2.28 (a)
!
x[n] = A"
|n|
where A and " are complex numbers with
!
" < 1. Because
!
n is always a
positive number and
!
" <1, any positive exponential power of ! will be smaller than 1.
Hence, x[n] is a bounded sequence.

(b)
!
h[n] =
1
2
n
[n] is a causal sequence starting with a value h[0] = 1, and for all n > 0,
the amplitude of the sample values is less than 1. Hence, h[n] is a bounded sequence.

(c)
!
y[n] = "
n
[n #1], " <1 is a causal sequence starting with a value y[0] = 0, and for
all n > 0, the amplitude of the sample values is less than 1. Hence, y[n] is a bounded
sequence.

(d)
!
g[n] = 4ne
j"
o
n
[n] is a causal complex-valued sequence. Its amplitude for all n> 0
is 4n and as
!
n "#, the amplitude approaches
!
". Thus g[n] is not bounded.

(e)
!
w[n] = 3cos(("
o
)
2
n) is a two-sided sequence. As
!
cos(("
o
)
2
n) is a sinusoidal
sequence with values between
!
"1 and
!
+1 for all values of n, w[n] is a bounded sequence

(f)
!
v[n] = (1"
1
n
2
)[n "1] is a causal sequence starting with a value v[0] = 0, and for all n
> 0, the amplitude of the sample values is less than 1. Hence, v[n] is a bounded sequence.

Not for sale. 13
2.29
!
x[n] =
("1)
n+1
n
[n "1]. Now
!
x[n]
n="#
#
$
=
("1)
n+1
n
n=1
#
$
=
1
n
n=1
#
$
= #, hence x[n] is not
absolutely summable.

2.30 (a)
!
x
1
[n] = "
n
[n #1]. Now,
!
x
2
[n]
n="#
#
$
= %
n
n=1
#
$
= %
n
n=1
#
$
=
%
1" %
< #, since
Hence,
!
x
1
[n] is absolutely summable.
(b)
!
x
2
[n] = "
n
[n #1]. Here,
!
x
2
[n]
n="#
#
$
= n%
n
n=1
#
$
= n %
n
n=1
#
$
!
=
"
(1# " )
2
< $, since
Hence,
!
x
2
[n] is absolutely summable.
(c)
!
x
3
[n] = n
2
"
n
[n #1]. In this case,
!
x
3
[n]
n="#
#
$
= n
2
%
n
n=1
#
$
= n
2
n=1
#
$
%
n


!
= " +2
2
"
2
+ 3
2
"
3
+ 4
2
"
4
+

!
= ( " + "
2
+ "
3
+ "
4
+) + 3( "
2
+ "
3
+ "
4
+)

!
+ 5( "
3
+ "
4
+ "
5
+) + 7( "
4
+ "
5
+ "
6
+) +...


!
=
"
1# "
+
3"
2
1# "
+
5"
3
1# "
+
7"
4
1# "
+
!
=
1
1" #
(2n "1) #
n
n=1
$
%
&
'
(
(
)
*
+
+
=
1
1" #
2 n #
n
n=1
$
%
" #
n
n=1
$
%
&
'
(
(
)
*
+
+

!
=
1
1" #
2#
(1" # )
2
"
#
1" #
$
%
&
&
'
(
)
)
!
=
" (1+ " )
(1# " )
3
< $.

Hence,
!
x
3
[n] is absolutely summable.

2.31 (a)
!
x
a
[n] =
1
4
n
[n]. Here,
!
x
a
[n]
n="#
#
$
=
1
4
n
n=0
#
$
=
1
4
n
n=0
#
$
=
1
1"
1
4
=
4
3
< #.

Hence,
!
x
a
[n] is absolutely summable.

(b)
!
x
b
[n] =
1
(n +2)(n + 3)
[n]. Here,
!
x
b
[n]
n="#
#
$
=
1
(n +2)(n + 3)
n=0
#
$

!
=
1
n +2
"
1
n + 3
#
$
%
&
'
(
n=0
)
*



!
=
1
2
"
1
3
#
$
%
&
'
( +
1
3
"
1
4
#
$
%
&
'
( +
1
4
"
1
5
#
$
%
&
'
( +
!
=
1
2
< ".

Hence
!
x
b
[n] is absolutely summable.
Not for sale. 14

2.32 First, we show that an absolutely summable sequence has finite energy. A sequence x[n]
is absolutely summable if
!
x[n]
n="#
#
$
< #. Using the Schwartz inequality we can write:

!
x[n]
2
n="#
#
$
% x[n]
n="#
#
$
&
'
(
(
)
*
+
+
x[n]
n="#
#
$
&
'
(
(
)
*
+
+
< #.

Hence, an absolutely summable sequence is square summable and has thus finite energy.

To show that a finite energy sequence may not be absolutely summable, we need to find
only one example of where this is the case. Consider the sequence:
!
x[n] =
1
n
[n "1].

We will demonstrate that this sequence has finite energy, but does not converge. Finite
energy is analogous to being square summable, and we will use the integral test of
sequence convergence to prove both that x[n] is square summable but not absolutely
summable.

The integral test for convergence can be stated as follows: let
!
a
n
= f (x) be a continuous,
positive and decreasing function for all x " 1. Then the series
!
a
n
n=1
"
#
and the integral
!
f (x)dx
1
"
#
either both converge or both diverge.

First, to show that x[n] is square summable, we let
!
a
n
=1/ n
2
, and determine the
convergence of the integral:
!
1
x
2
1
"
#
dx = $
1
x
%
&
'
(
)
*
1
"
= $
1
"
+1 =1.
Hence,
!
1
n
2
n=1
"
#
also converges, and
!
x[n] =
1
n
[n "1] is square-summable.

Second, to show that x[n] is not absolutely summable, we let
!
a
n
= 1/ n and determine the
divergence of the integral:
!
1
x
1
"
#
dx = (ln x)
1
"
= " $0 = ".
As a result,
!
x[n] =
1
n
[n "1] is not absolutely summable.

2.33 The integral test for convergenece is usde to show the divergence of the absolute
summation of
!
x
1
[n]. Let
!
a
n
= 1/ n and determine the divergence of the integral:
!
1
x
1
"
#
dx = (ln x)
1
"
= " $0 = ". This implies that the absolute summation:
Not for sale. 15

!
x[n]
n="#
#
$
=
1
n
n=1
#
$
= #. Therefore,
!
x
1
[n] is not absolutely summable.

2.34 To show square-summability, we evaluate
!
x
2
[n]
2
n="#
#
$
=
cos%
c
n
&n
'
(
)
*
+
,
2
n=1
#
$
-
1
&
2
n
2
n=1
#
$
.
Since
!
1
n
2
n=1
"
#
=
$
2
6
,
!

cos"
c
n
#n
$
%
&
'
(
)
2
n=1
*
+
,
1
6
. Therefore
!
x
2
[n] is square-summable.

Using the integral test for convergence, we can show
!
x
2
[n] is not absolutely summable.
The integral test relates the convergence or divergence of
!
a
n
= f (x), which is defined to
be a continuous, positive and decreasing function for all x " 1. Since
!
x
2
[n] meets these
criterian, we can substitute f(x) into an integral and check for convergence or divergence:
!
cos"
c
x
#x
1
$
%
dx =
1
#
&
cos"
c
x
#x
cos"
c
x
&
cos(t)dt
t
"
c
x
$
%
1
$
which diverges implying the divergence of
!
cos"
c
n
#n
n=1
$
%
. Hence,
!
x
2
[n] is not absolutely summable.
2.35 (a)
!
x
a
[n] = A
"
[n]. Here, E
!
x
a
= x
a
[n]
2
n="#
#
$
= A
2
%
2n
n=0
#
$
=
A
2
1"%
2
.
(b)
!
x
b
[n] =
1
n
2
[n "1]. Here, E
!
x
b
x
b
[n]
2
n="#
#
$
=
1
n
2
n=1
#
$
=
1
n
4
n=1
#
$
!
=
"
4
90
.

2.36 (a) E
!
x
1
= x
1
[n]
2
n="#
#
$
= 1
n="#
#
$
= #.
P
!
x
1
= lim
K"#
1
2K+1
x
1
[n]
2
n=$K
K
%
= lim
K"#
1
2K +1
(2K +1) =1.
(b) E
!
x
2
= x
2
[n]
2
n="#
#
$
= 1
n=0
#
$
= #.
P
!
x
2
= lim
K"#
1
2K +1
x
2
[n]
2
n=$K
K
%
= lim
K"#
1
2K +1
1
n=0
K
%
= lim
K"#
K +1
2K +1
=
1
2
.
(c) E
!
x
3
= x
3
[n]
2
n="#
#
$
= n
2
n=0
#
$
= #.
Not for sale. 16
P
!
x
3
= lim
K"#
1
2K +1
x
3
[n]
2
n=$K
K
%
= lim
K"#
1
2K +1
n
2
n=1
K
%
!
= lim
K"#
K(K +1)(2K +1)
6
= #.
(d) E
!
x
4
= x
4
[n]
2
n="#
#
$
= A
0
e
j%
0
n
2
n="#
#
$
= A
0
2
n="#
#
$
= #.
P
!
x
4
= lim
K"#
1
2K +1
x
4
[n]
2
= lim
K"#
1
2K +1
A
0
e
j$
0
n
2
n=%K
K
&
n=%K
K
&

!
= lim
K"#
1
2K +1
A
0
2
n=$K
K
%
= lim
K"#
1
2K +1
& A
0
2
(2K +1) = A
0
2
.
(e) E
!
x5
= x
5
[n]
2
n="#
#
$
= Acos
2%n
M
+&
'
(
)
*
+
,
2
n="#
#
$
= #.

P
!
x5
=
1
M
x
5
[n]
2
n=0
M"1
#
=
1
M
Acos
2$n
M
+%
&
'
(
)
*
+
2
n=0
M"1
#
=
1
M
,
A
2
2
cos
4$n
M
+2%
&
'
(
)
*
+
+1
&
'
(
)
*
+
n=0
M"1
#
.

Let
!
C = cos
4"n
M
+2#
$
%
&
'
(
)
n=0
M*1
+
and
!
S = sin
4"n
M
+2#
$
%
&
'
(
)
n=0
M*1
+
.
Then
!
C + jS = e
j
4"n
M
+2#
( )
n=0
M$1
%
= e
j 2#
e
j 4"n / M
n=0
M$1
%
= e
j 2#
&
1$e
j 4"
1$e
j 4" / M
= 0.
Therefore P
!
x
5
=
1
M
"
A
2
2
1
n=0
M#1
$
=
A
2
2
.

2.37 In general, for an N-periodic extension of a sequence, we use Eq. (2.44) to generate the
sequence and then determine the period of the new sequence based on the length of the
original and N. If the length is smaller than N, then the sequence has period N. If the
length of the original is greater than N, then the repetitions will force periodicity with a
period of N. Thus any N-periodic extension will be periodic with period N. To find a
sample period of the new sequence, we simply add up neighboring overlapping
components and look at the range of one period.

(a) N = 6, and for each of the sequences, we can write the periodic extension as follows:


!
x
p
[n] = x[n + k6]
n="#
#
$
.
!
y
p
[n] = y[n + k6]
n="#
#
$
.
!
w
p
[n] = w[n + k6]
n="#
#
$
.

The portion of
!
x
p
[n] in the range 0 # n # 5 is given by:
Not for sale. 17

!
x[n "6] + x[n] + x[n +6] ={0 0 0 0 0 0} +{6 "3 2 0 0 0} +{0 0 0 2 0 "1}

Hence, one period of
!
x
p
[n] is given by
!
{6 "3 2 2 0 "1}, 0 # n # 5.

The portion of
!
y
p
[n] in the range 0 # n # 5 is given by:

!
y[n "6] + y[n] + y[n +6] ={0 0 0 0 0 0} +{1 1 0 0 0 0} +{0 8 2 "7 "3 0}.

Hence, one period of is given by

The portion of
!
w
p
[n] in the range 0 # n # 5 is given by:


!
w[n "6] + w[n] + w[n +6]
={0 0 0 0 0 0} +{"1 2 6 6 1 0} +{0 0 0 0 3 6}.


Hence, one period of
!
w
p
[n] is given by
!
{"1 2 6 6 4 6}, 0 # n # 5.

(b) N = 8, and for each of the sequences, we can write the periodic extension as follows:


!
x
p
[n] = x[n + k8]
n="#
#
$
,
!
y
p
[n] = y[n + k8]
n="#
#
$
,
!
w
p
[n] = w[n + k8]
n="#
#
$
.

The portion of
!
x
p
[n] in the range 0 # n # 7 is given by:


!
x[n "8] + x[n] + x[n +8]
={0 0 0 0 0 0 0 0} +{6 "3 2 0 0 0 0 0}
+{0 0 0 0 0 2 0 "1}.


Hence, one period of
!
x
p
[n] is given by
!
{6 "3 2 0 0 2 0 "1}, 0 # n # 7.

The portion of
!
y
p
[n] in the range 0 # n # 7 is given by:


!
y[n "8] + y[n] + y[n +8]
={0 0 0 0 0 0 0 0} +{1 1 0 0 0 0 0 0}
+{0 0 0 8 2 "7 "3 0}.


Hence, one period of
!
y
p
[n] is given by
!
{1 1 0 8 2 "7 "3 0}, 0 # n # 7.

The portion of
!
w
p
[n] in the range 0 # n # 7 is given by:

Not for sale. 18

!
w[n "8] + w[n] + w[n +8]
={0 0 0 0 0 0 0 0} +{"1 2 6 6 1 0 0 0}
+{0 0 0 0 0 0 3 6}.


Hence, one period of
!
w
p
[n] is given by
!
{"1 2 6 6 1 0 3 6}, 0 # n # 7.

2.38 Given
!
x [n] = Asin("
o
n +#).
(a)
!
x [n] ={1 1 "1 "1}. Hence
!
A = 2, "
o
= # / 4, $ = # / 4.
(b)
!
x [n] ={0.5 "0.5 0.5 "0.5}. Hence
!
"
o
= # /2,
!
" = # /2.
(c)
!
x [n] ={0 0.9511 0.5875 "0.5878 "0.9511}. Hence
(d)
!
x [n] ={2 0 "2 0}. Hence
!
A = 2, "
o
= # / 4, $ = # /2.

2.39 The fundamental period of a periodic sequence with an angular frequency $
0
satisfies
Equation (2.53a) with the smallest value of and .

(a) Here, $
0
= 0.25%, so that the equation for fundamental period reduces to 0.25%N = 2%r,
which is satisfied with N = 8, r = 1.

(b) Here, $
0
= 0.6%, so that the equation for fundamental period reduces to 0.6%N = 2%r,
which is satisfied with N = 10, r = 2.

(c) We first determine the fundamental period
!
N
1
of
!
Re{e
j"n /8
} = cos("n /8). In this
case, the equation reduces to
!
0.125"N
1
= 2"r
1
, which is satisfied with
!
N
1
=16 and
!
r
1
= 1. Next, we determine the fundamental period
!
N
2
of
!
Im{e
j"n / 5
= j sin(0.2"n). In
this case, the equation reduces to
!
0.2"N
2
= 2"r
2
, which is satisfied with
!
N
2
=10 and
!
r
2
=1. Hence the fundamental period is given by
!
LCM(N
1
, N
2
) = LCM(10,16) = 80.

(d) We first determine the fundamental period
!
N
1
of
!
sin(0.15"n) In this case, the
equation reduces to
!
0.15"N
1
= 2"r
1
, which is satisfied with
!
N
1
= 40 N
1
= 40 and
!
r
1
= 3.
Next, we determine the fundamental period
!
N
2
of
!
cos(0.12"n #0.1") . In this case, the
equation reduces to
!
0.12"N
2
= 2"r
2
, which is satisfied with
!
N
2
= 50 and
!
r
2
= 3. Hence
the fundamental period is given by
!
LCM(N
1
, N
2
) = LCM(50, 40) = 200.

(e) Again, we start by finding the fundamental period of each sinusoidal component and
then find the least common multiple of the three to determine the overall fundamental
period. The fundamental period
!
N
1
of
!
sin(0.1"n + 0.75") In this case, the equation
reduces to
!
0.1"N
1
= 2"r
1
, which is satisfied with
!
N
1
= 20 and
!
r
1
= 1. Next, we determine
the fundamental period
!
N
2
of
!
cos(0.8"n +0.2"). The equation reduces to
!
0.8"N
2
= 2"r
2
, which is satisfied with
!
N
2
= 5 and
!
r
2
= 2. Lastly, we determine the
fundamental period
!
N
3
of
!
cos(1.3"n) . The equation reduces to
!
1.3"N
3
= 2"r
3
, which is
satisfied with
!
N
3
= 20 and
!
r
3
=13. Hence the fundamental period is given by
!
LCM(N
1
, N
2
, N
3
) = LCM(20,5,20) = 20.

Not for sale. 19
2.40 The fundamental period N of a periodic sequence with an angular frequency $
0
satisfies
Eq. (2.53a) with the smallest value of N and r.

(a) For this problem, $
0
= 0.3%, so the equation reduces to 0.3%N = 2%r, which is satisfied
with N = 20, r = 3.

(b) For this problem, $
0
= 0.48%, so the equation reduces to 0.48%N = 2%r, which is
satisfied with N = 25, r = 6.

(c) For this problem, $
0
= 0.525%, so the equation reduces to 0.525%N = 2%r, which is
satisfied with N = 80, r = 21.

(d) For this problem, $
0
= 0.7%, so the equation reduces to 0.7%N = 2%r, which is satisfied
with N = 20, r = 7.

(e) For this problem, $
0
= 0.75%, so the equation reduces to 0.75%N = 2%r, which is
satisfied with N = 8, r = 3.

2.41 Here $
0
= 0.06%, so that Eq. (2.53a) reduces to 0.06%N = 2%r which is satisfied with N =
100 and r = 3. Other sequences
!
x[n] = sin("
k
) with the same fundamental period will
satisfy
!
100"
k
= 2#r. Choosing r = 1 and r = 2, two possible sequences with the same
fundamental period would have $
2
= 0.02% and $
3
= 0.01%, respectively, resulting in:

!
x
2
[n] = sin(0.01"n) and
!
x
3
[n] = sin(0.02"n).

2.42 In each of the following parts, N is the fundamental period and r is a positive integer. Eqs.
(2.53a) and (2.39) are used the compute the fundamental period and the average power of
the periodic sequences.

(a) For
!
x
1
[n] = 5cos("n / 3), N and r must satisfy the relation (%/3)N = 2%r, which is
satisfied by N = 6 and r = 1, which are the smallest values of N and r. The average
power can be calculated as follows:
P
!
x1
=
1
N
x
1
[n]
2
n=0
N"1
#
=
1
6
5cos
$n
3
%
&
'
(
)
*
n=0
5
#
2
=
25
6
cos
$n
3
%
&
'
(
)
*
2
=
25
2
n=0
5
#
.

(b) For
!
x
2
[n] = 2cos(2"n /5), N and r must satisfy the relation (2%/5)N = 2%r, which is
satisfied by N = 5 and r = 1, which are the smallest values of N and r. The average
power can be calculated as follows:
P
!
x2
=
1
N
x
1
[n]
2
n=0
N"1
#
=
1
5
2cos
2$n
5
%
&
'
(
)
*
n=0
5
#
2
=
4
5
cos
2$n
5
%
&
'
(
)
*
2
= 2
n=0
5
#
.

(c) For
!
x
3
[n] = 2cos(2"n / 7), N and r must satisfy the relation (2%/7)N = 2%r, which is
satisfied by N = 7 and r = 1, which are the smallest values of N and r. The average
power can be calculated as follows:
Not for sale. 20

P
!
x3
=
1
N
x
1
[n]
2
n=0
N"1
#
=
1
7
2cos
2$n
7
%
&
'
(
)
*
n=0
6
#
2
=
4
7
cos
2$n
7
%
&
'
(
)
*
2
= 2
n=0
6
#
.

(d) For
!
x
4
[n] = 3cos(5"n / 7), N and r must satisfy the relation (5%/7)N = 2%r, which is
satisfied by N = 14 and r = 5, which are the smallest values of N and r. The average
power can be calculated as follows:

P
!
x4
=
1
N
x
1
[n]
2
n=0
N"1
#
=
1
14
3cos
5$n
7
%
&
'
(
)
*
n=0
13
#
2
=
9
14
cos
5$n
7
%
&
'
(
)
*
2
= 4.5
n=0
6
#
.

(e) For
!
x
5
[n] = 4cos(2"n /5) + 3cos(3"n /5), the fundamental period will be the least
common multiple of the fundamental periods of each component function. For the
sequence
!
4cos(2"n /5),
!
N
1
and
!
r
1
must satisfy the relation
!
(2" /5)N
1
= 2"r
1
, which is
satisfied by
!
N
1
= 5 and
!
r
1
= 1. For the sequence
!
3cos(3"n /5),
!
N
2
and
!
r
2
must satisfy
the relation
!
(3" /5)N
2
= 2"r
2
, which is satisfied by
!
N
2
=10 and
!
r
2
= 3. The LCM of
these two number is 10, which is the fundamental period of the joint signal. The
average power can be calculated as follows:
P
!
x5
=
1
N
x
1
[n]
2
n=0
N"1
#
=
1
10
4cos
2$n
5
%
&
'
(
)
*
+ 3cos
3$n
5
%
&
'
(
)
*
n=0
9
#
2


!
=
1
10
4cos
2"n
5
#
$
%
&
'
(
n=0
9
)
2
+12cos
2"n
5
#
$
%
&
'
(
cos
3"n
5
#
$
%
&
'
(
+ 3cos
3"n
5
#
$
%
&
'
(
2
=
16
10
cos
2"n
5
#
$
%
&
'
(
n=0
9
)
2
+
12
10
cos
2"n
5
#
$
%
&
'
(
cos
3"n
5
#
$
%
&
'
(
n=0
9
)
+
9
10
cos
3"n
5
#
$
%
&
'
(
2
n=0
9
)
*8 + 4.5 =12.5.


(f) For
!
x
6
[n] = 4cos(5"n / 3) + 3cos(3"n /5), the fundamental period will be the least
common multiple of the fundamental periods of each component function. For the
sequence
!
cos(5"n / 3),
!
N
1
and
!
r
1
must satisfy the relation
!
(5" / 3)N
1
= 2"r
1
, which is
satisfied by
!
N
1
= 6 and
!
r
1
= 5.
!
r
1
= 1. For the sequence
!
3cos(3"n /5),
!
N
2
and
!
r
2

must satisfy the relation
!
(3" /5)N
2
= 2"r
2
, which is satisfied by
!
N
2
=10 and
!
r
2
= 3.
The LCM of these two number is 30, which is the fundamental period of the joint
signal. The average power can be calculated as follows:
P
!
x6
=
1
N
x
1
[n]
2
n=0
N"1
#
=
1
30
4cos
5$n
3
%
&
'
(
)
*
+ 3cos
3$n
5
%
&
'
(
)
*
n=0
29
#
2

!
=
1
30
4cos
5"n
3
#
$
%
&
'
(
n=0
29
)
2
+12cos
5"n
3
#
$
%
&
'
(
cos
3"n
5
#
$
%
&
'
(
+ 3cos
3"n
5
#
$
%
&
'
(
2

Not for sale. 21

!
=
16
30
cos
5"n
3
#
$
%
&
'
(
n=0
29
)
2
+
12
30
cos
5"n
3
#
$
%
&
'
(
cos
3"n
5
#
$
%
&
'
(
n=0
29
)
+
9
30
cos
3"n
5
#
$
%
&
'
(
2
n=0
29
)
*8 + 4.5 =12.5.


2.43 The impulse function and unit step functions are defined by Eqs. (2.45) and (2.46):

(a) Each of the sequences can be expressed as follows:



(b) Each of the sequences can be expressed as shown below. Note that each sequence
constructed in this manner must end with a unit step function after the end of the
signal that renormalizes the remainder of the interval to zero.



2.44 Using the definition of Eq. (2.46), we can express this sequence as follows:

.

2.45 Using the definition of Eq. (2.46), we can express this sequence as follows:

.

2.46 (a)
!
"
n
[n]O
*
[n] = "
k
[k]
k=#$
$
%
[n # k] = "
k
[n # k]
k=0
$
%
=
"
k
,
k=0
n
%
n &0,
0, n < 0,
'
(
)
*
)

!
=
1" #
n+1
1" #
$
%
&
&
'
(
)
)
[n].
(b)
!
n"
n
[n]O
*
[n] = k"
k
[k]
k=#$
$
%
[n # k] = k"
k
[n # k]
k=0
$
%
=
k"
k
,
k=0
n
%
n > 0,
0, n & 0.
'
(
)
*
)


2.47 In this problem we make use of the identity
!
"[n # m]O* "[n # r] ="[n # m # r].
(a)
!
y
1
[n] = x
1
[n]O* h
1
[n]
!
= 2"[n #1] #2"[n +1] ( )O* #"[n #2] #1.5"[n] +"[n + 3] ( )
Not for sale. 22
!
= "2#[n "1]O* #[n "2] " 3#[n "1]O* #[n] +2#[n "1]O
*
#[n + 3]
+2#[n +1]O* #[n "2] + 3#[n +1]O
*
#[n] "2#[n +1]O
*
#[n + 3]
= "2#[n " 3] " 3#[n "1] +2#[n +2] +2#[n "1] + 3#[n +1] "2#[n + 4]
= "2#[n " 3] "#[n "1] + 3#[n +1] +2#[n +2] "2#[n + 4].


(b)
!
y
2
[n] = x
2
[n]O* h
2
[n]
!
= 3"[n #2] #"[n] ( )O* 3"[n # 3] +2"[n #1] #"[n +1] ( )
= 9"[n #2]O* "[n # 3] +6"[n #2]O* "[n #1] # 3"[n #2]O* "[n +1]
# 3"[n]O* "[n # 3] #2"[n]O* "[n #1] +"[n]O* "[n +1]
= 9"[n #5] +6"[n # 3] # 3"[n #1] # 3"[n # 3] #2"[n #1] +"[n +1]
= 9"[n #5] + 3"[n # 3] #5"[n #1] +"[n +1].


(c)
!
y
3
[n] = x
1
[n]O* h
2
[n]
!
= 2"[n #1] #2"[n +1] ( )O* 3"[n # 3] +2"[n #1] #"[n +1] ( )
= 6"[n #1]O* "[n # 3] + 4"[n #1]O* "[n #1] #2"[n #1]O* "[n +1]
#6"[n +1]O* "[n # 3] # 4"[n +1]O* "[n #1] +2"[n +1]O* "[n +1]
= 6"[n # 4] + 4"[n #2] #2"[n] #6"[n #2] # 4"[n] +2"[n +2]
= 6"[n # 4] #2"[n #2] #6"[n] +2"[n +2].


(d)
!
y
4
[n] = x
2
[n]O* h
1
[n]
!
= 3"[n #2] #"[n] ( )O* #"[n #2] #1.5"[n] +"[n + 3] ( )
= #3"[n #2]O* "[n #2] # 4.5"[n #2]O* "[n] + 3"[n #2]O* "[n + 3]
+"[n]O* "[n #2] +1.5"[n]O* "[n] #"[n]O* "[n + 3]
= #3"[n # 4] # 4.5"[n #2] + 3"[n +1] +"[n #2] +1.5"[n] #"[n + 3]
= #3"[n # 4] # 3.5"[n #2] +1.5"[n] + 3"[n +1] #"[n + 3].


2.48 The sequences x[n], h[n], g[n] and w[n] are all fine-length rectangular sequences with
sample values 1 in the ranges of n shown below:

!
x[n] = [n] "[n " N] =
0, n < 0,
1 0 # n # N "1,
0, n $ N.
%
&
'
(
'

Not for sale. 23

!
h[n] = [n] "[n " M] =
0, n < 0,
1 0 # n # M "1,
0, n $ M.
%
&
'
(
'


!
g[n] = [n " M] "[n " N] =
0, n < M,
1 M # n # N "1,
0, n $ N.
%
&
'
(
'


!
w[n] = [n + M] "[n " N] =
0, n < "M,
1 "M # n # N "1,
0, n $ N.
%
&
'
(
'


The location of the largest sample(s) will depend on the peak of the overlap between the
corresponding functions. The convolution sum of two such sequences will be a triangular
or trapezoidal pulse with the maximum(s) determined by the lengths of the rectangular
sequences. If both sequences are of equal length K, then the maximum value will be also
K and its location will depend on the location of first non-zero value of the sequence.
If the two sequences being convolved are of unequal lengths K and L with K > L, then the
maximum value will be L and there will be
!
K " L samples with the maximum value. In
the answers below, the location of the first such maximal value is listed.

(a) The maximum of
!
y
1
[n] will occur at
!
n = N "1 with a maximum value N.
(b) The maximum of
!
y
2
[n] will occur at
!
n = M "1 with a maximum value M.
(c) The maximum of
!
y
3
[n] will occur at
!
n = M + N "1 with a maximum value
!
N " M.
(d) The maximum of will occur at with a value of
(e) The maximum of will occur at with a maximum value
(f) The maximum of will occur at with a value of
(g) The maximum of will occur at with a maximum value


2.49 Each of these uses the definitions of conjugate symmetry and conjugate anti-symmetry
along with the definition of convolution:



(a) We will show that if both of the sequences being convolved are conjugate symmetric,
then the result will also be conjugate symmetric.

First, define y[n] to be the convolution sum:

!
y[n] = h
cs
[n]O* g
cs
[n] = h
cs
[k]g
cs
[n " k]
k="#
#
$
.
Next, check whether this satisfies conjugate symmetry:
Not for sale. 24

!
y *["n] = h *
cs
[k]g*
cs
["n " k]
k="#
#
$
= h *
cs
["k]g*
cs
["n + k]
k="#
#
$

!
= h *
cs
["k]g*
cs
["(n " k)]
k="#
#
$
= h
cs
[k]g
cs
[n " k]
k="#
#
$
= y[n].

(b) We will show that if one of the sequences being convolved isconjugate symmetric,
and the other is conjugate anti-symmetric, then the combination will be conjugate
anti-symmetric:

First, define y[n] to be the convolution sum:

!
y[n] = h
ca
[n]O* g
cs
[n] = h
ca
[k]g
cs
[n " k]
k="#
#
$
.
Next, check whether this satisfies conjugate symmetry:

!
y *["n] = h *
ca
[k]g*
cs
["n " k]
k="#
#
$
= h *
ca
["k]g*
cs
["n + k]
k="#
#
$

!
= h *
ca
["k]g*
cs
["(n " k)]
k="#
#
$
= " h
cs
[k]g
cs
[n " k]
k="#
#
$
= "y[n].

(c) If both of the sequences being convolved are conjugate anti-symmetric, then the
result will also be conjugate anti-symmetric.

First, define y[n] to be the convolution sum:

!
y[n] = h
ca
[n]O* g
ca
[n] = h
ca
[k]g
ca
[n " k]
k="#
#
$
.
Next, check whether this satisfies conjugate symmetry:

!
y *["n] = h *
ca
[k]g*
ca
["n " k]
k="#
#
$
= h *
ca
["k]g*
ca
["n + k]
k="#
#
$

!
= h *
ca
["k]g*
ca
["(n " k)]
k="#
#
$
= ("1)h
ca
[k]("1)g
ca
[n " k]
k="#
#
$
= y[n].

2.50 The three parameters and of the continuous-time signal
!
x
a
(t)can be determined
from
!
x[n] = x
a
(nT) = Acos("
o
nT +#) by setting 3 distinct values of

For example
!
x[0] = Acos" = #,

!
x["1] = Acos("#
o
T +$) = Acos(#
o
T)cos$ + Asin(#
o
T)sin$ = %,

!
x[1] = Acos("
o
T +#) = Acos("
o
T)cos# $ Asin("
o
T)sin# = %.

Substituting the first equation into the last two equations and then adding them yields:
Not for sale. 25

!
cos("
o
T) =
#+$
2%
.
Solving this can be used to determine . From the second equation we have:


!
Asin" = # $ Acos(%
o
T)cos" = # $&cos(%
o
T).

Dividing this equation by the previous result yields
!
tan" =
# $%cos(&
o
T)
%sin(&
o
T
.
This can be solved to determine Finally, A is determined from the first equation.

Given
!
"
T
=
2#
T
= 2"
o
. x[n] = & and x[n+1] = &. Snce all sample values are equal, the
three parameters cannot be determined uniquely.

In the case where
!
"
T
=
2#
T
< 2"
o
.
!
x[n] = Acos("
o
nT +#)
!
= Acos("
o
n +#) implying
!
"
o
= #
o
T > $. A digital sinusoidal sequence with an angular frequency
!
"
o
greater than
assumes the identity of a sinusoidal sequence with an angular frequency in the range
!
0 "# < $.. Hence, cannot be uniquely determined from
!
x[n] = Acos("
o
nT +#).

2.51
!
x[n] = cos("
o
nT). If x[n] is periodic with a period N, then:


!
x[n + N] = cos "
0
nT +"
0
NT ( ) = x[n] = cos("
0
nT).

This implies that
!
"
o
NT = 2#rwith r being any nonzero positive integer. Hence the
sampling rate must satisfy the relation
!
T = 2"r /#
o
N. If
!
"
o
= 30, i.e.,
!
T = " /6, then we
must have 30N(%/6) = 2%r.

The smallest value of and satisfying this relation are N = 2 and r = 5, thus the
fundamental period is N = 2.

2.52 The autocorrelation and cross-correlation sequences are defined by Eqs. (2.69) and (2.67),
respectively:


!
r
xx
[l] = x[k]x[k " l]
k="#
#
$
,
!
r
xy
[l] = y[k]x[k " l]
k="#
#
$
.

(a) The autocorrelations are as follows:

!
r
xx
[l] = 0 4 "6 10 13 "30 54 "30 13 10 "6 4 2 { },
!
r
yy
[l] = 8 10 "5 "34 "65 24 128 24 "65 "34 "5 10 8 { },
!
r
ww
[l] = 3 24 53 38 21 64 123 64 21 38 53 24 3 { }.
Not for sale. 26

(b) The cross-correlations are as follows:

!
r
xy
[l] = 2 2 "1 "1 "11 6 7 "35 19 28 "20 16 0 { },
!
r
xw
[l] = 2 12 11 4 25 30 13 "6 40 "2 3 6 0 { }.

2.53 The autocorrelation sequence is defined by Eq. (2.69):
!
r
xx
[l] = x[k]x[k " l]
k="#
#
$
.

(a) The autocorrelations can be computed as follows:


!
r
x
1
x
1
[!] = x
1
[n]
n="#
#
$
x
1
[n "!] = %
n
n="#
#
$
[n]%
n"!
[n "!]

!
= "
2n#!
n=0
$
%
[n #!] =
"
2n#!
n=0
$
%
, ! < 0,
"
2n#!
n=!
$
%
, ! &0,
'
(
)
*
)

!
=
"
#!
1#"
2
, ! < 0,
"
!
1#"
2
, ! $0.
%
&
'
(
'

Note that for

!
! "0, r
x
1
x
1
[!] =
#
!
1$#
2
, and for

!
! < 0, r
x
1
x
1
[!] =
"
#!
1#"
2
.
Replacing
!
! with
!
"! in the second expression we get:


!
r
x
1
x
1
["!] =
#
"("!)
1"#
2
=
#
!
1"#
2
= r
x
1
x
1
[!].
Hence,

!
r
x
1
x
1
[!] is an even function of
!
!. The maximum value of

!
r
x
1
x
1
[!] occurs at

!
! = 0 since
!
"
!
is a decaying function for increasing n when

(b) The autocorrelations can be computed as follows:

!
r
x
2
x
2
[!] = x
2
[n "!]
n=0
N"1
#
.

Since:

!
x
2
[n "!] =
1, ! # n # N "1+!,
0, otherwise.
$
%
&


Therefore:


!
r
x
2
x
2
[!] =
0, for ! < "(N "1),
N +!, for "(N "1) # ! # 0,
N, for ! = 0,
N "!, for 0 < N "! # N "1,
0, for ! > N "1.
$
%
&
&
&
'
&
&
&


It follows from the above that

!
r
x
2
x
2
[!] is a triangular function of , and hence is an
even function with a maximum value of at
!
! = 0.

Not for sale. 27
M2.1 The sample program is listed below, with cs and ca corresponding to the conjugate
symmetric and conjugate anti-symmetric components, respectively:

cs = 0.5*(x + conj(fliplr(x)));
ca = 0.5*(x - conj(fliplr(x)));

Given the sample input from Example 2.8:
g[n] = {0 1+4j -2+3j 4-2j -5-6j -2j 3}

We get:

cs = {1.5, 0.5 + 3j, -3.5 + 4.5j, 4, -3.5-4.5j, 0.5 - 3j, 1.5}
ca = {-1.5, 0.5 + j, 1.5 1.5j, -2j, -1.5 1.5j, -0.5 + 1.5j}

This verifies the results in Example 2.8.


M2.2 (a) The input data entered during the execution of Program 2_2.m are:

For Figure 2.23
Type in real exponent = -1/12
Type in imaginary exponent = pi/6
Type in gain constant = 1
Type in length of sequence = 41

For Figure 2.24 (a)
Type in real exponent = log(1.2)
Type in imaginary exponent = 0
Type in gain constant = 0.2
Type in length of sequence = 31

For Figure 2.24 (b)
Type in real exponent = log(0.9)
Type in imaginary exponent = 0
Type in gain constant = 20
Type in length of sequence = 31

(b) The input data entered during the execution of Program 2_2.m are:
Type in real exponent = -0.4
Type in imaginary exponent = pi/6
Type in gain constant = -2.7
Type in length of sequence = 8

Not for sale. 28



M2.2 (a)
!
x
a
[n] = e
j 0.25"n
. The plots generated using Program 2_2.m are shown below:

(b) The code fragment used to generate
!
x
b
[n] = cos(0.6"n +0.3") is:

x = cos(0.6*pi*[0:40] + 0.3*pi);

(c) The code fragment used to generate
!
x
c
[n] = Re e
j"n /8
( )
+Im e
j"n / 5
( )
is:

x = real(exp(i*pi*[0:40]/8))+imag(exp(i*pi*[0:40]/5));
Not for sale. 29

(d) The code used to generate
!
x
d
[n] = 6sin(0.15"n) #cos(0.12"n +0.1") is:

x = 6*cos(0.15*pi*[0:40])-cos(0.12*pi*[0:40]+0.1*pi);


(e) The code for
!
x
e
[n] =sin(0.1"n +0.75") # 3cos(0.8"n +0.2") #cos(1.3"n) is:

x = sin(1.5*pi*n+0.75*pi)-3*cos(0.8*pi*[0:40]+0.2*pi)-
cos(1.3*pi*[0:40]);
Not for sale. 30

M2.4 (a) L = input('Desired length = ');
A = input('Amplitude = ');
omega = input('Angular frequency = ');
phi = input('Phase = ');
n = 0:L-1;
x = A*cos(omega*n + phi);
stem(n,x);
xlabel('Time Index'); ylabel('Amplitude');
title(['\omega_{o} = ',num2str(omega/pi),'\pi']);

(b)

Not for sale. 31



M2.5 The code is given below:

n = [0:0.001:1];
g1 = cos(6*pi*n);
g2 = cos(14*pi*n);
g3 = cos(26*pi*n);
gpoints = cos(6*pi*[0:0.1:1]);

plot(n,g1,'k-')
hold on;
plot(n,g2,'k--')
plot(n,g3,'k-.')
plot([0:0.1:1],gpoints,'bo')
hold off;

Not for sale. 32

M2.6 Code for plotting sinusoids is given below:

t = 0:0.001:1;
fo = input('Frequency of sinusoid in Hz = ');
FT = input('Sampling frequency in Hz = ');
g1 = cos(2*pi*fo*t);
plot(t,g1,'-');
xlabel('time'); ylabel('Amplitude'); hold
n = 0:1:FT;
gs = cos(2*pi*fo*n/FT);
plot(n/FT,gs,'o'); hold off

M2.7 Sample code to verify the validity of the expeirment is shown below:

t = 0:0.001:0.85;
g1 = cos(6*pi*t); g2 = cos(14*pi*t); g3 =
cos(26*pi*t);
plot(t/0.85,g1,'-', t/0.85, g2, '--', t/0.85, g3,':');
xlabel('time'); ylabel('Amplitude'); hold
n = 0:1:8; gs = cos(0.6*pi*n); plot(n/8.5,gs,'o');
hold off

M2.8 Sample code for autocorrelation and cross correlation is shown below:

rxx = conv(x,fliplr(x))
Not for sale. 33

Given the sequences in Problem 2.52, the autocorrelations and cross correlations are
given below:

r
xx
= 0 4 -6 10 13 -30 54 -30 13 10 -6 4 0
r
yy
= 8 10 -5 -34 -65 24 128 24 -65 -34 -5 10 8
r
ww
= 3 24 53 38 21 64 123 64 21 38 53 24 3

r
xy
= 2 2 -1 -1 -11 6 7 -35 19 28 -20 16 0
r
xw
= 2 12 11 4 25 30 13 -6 40 -2 3 6 0

M2.9 Sample code is provided below:

N = input('Length of sequence = ');
n = 0:N-1;
x = exp(-0.8*n);
y = rand(1,N)-0.5+x;
n1 = length(x)-1;
r = conv(y,fliplr(y));
k = (-n1):n1;
stem(k,r);
xlabel('Lag_index'); ylabel('Amplitude');





M2.10 The plot of the correlation is shown below:

Not for sale. 34