(Solutions Manual) Oppenheim, Discrete Time Signal Processing Text

1
Solutions - Chapter 2
Discrete-Time Signals and Systems

3
2.1. (a) T(z[n]) = g(n]z[n]

• Stable: Let lz[n]I $ M then IT[z[n]I $ lg[n]IM. So, it is stable if lg[n]I is bounded.
• Causal: 11,[n] = g(n]z 1 (n] and 112(n] = g(n]z2[n], so if zi[n] = z2(n] for all n < no, then
=
11,[n] 112(n] for all n < no, and the system is causal.
• Linear:
T(az 1 [n] + bz2[n]) = g[n](=, [n] + b:z:2[n]

= ag(n]z 1 (n] + bg(n]z2[n]
= aT(z1 [n]) + bT(z2(n])
So this is linear.
• Not time-invariant:
T(z[n - no]) = g(n]z[n - no]

;f 11[n - no] = g[n - no]z(n - no]
which is not Tl.

• Memoryless: 11(n] = T(z[n]) depends only on the n th value of z, so it is memoryless.
(b) T(z[n]) = r;;..... z[k]
• Not Stable: lz(n]I:;; M-+ IT(z[n])I $ E:=,.,
lz[k]I $ In - nolM. M- n-+ oo, T-+ oo, so not
stable.
• Not Causal: T(z[n]) depends on tbe future values of z[n] when n < no, so this is not causal.
• Linear:
T(az 1[n] + b:z:2[n]l = L• az 1 [k] + bz 2 [k]

l.=no
• n
= L a :z: 1 (n] +b L z2[n]

A:=no .t=no
= aT(zi[n]) + bT(z2(n])
•
The system is linear.
• Not Tl:
-....
n
T(z(n -no]) = L z[k-no]
n -n,
= L z[k]
•-fto
'F 11(n - no] = L z[I:]
.......
The system is not Tl.
• Not Memoryless: Values of y(n) depend on past values for n > no, 10 tbis is not memoryless.
(c) T(z[n]) r:::~... z(k]
• Stable: IT(z[n])I $ r;::n~...
lz(k)I $ I;;!,.~ ... z(k]M $ l2no + llM for lz[n]I $ M, so it is
stable.
• Not Causal: T(z[n]) depends on future values of z(n], so it is not causal.
4
• Linear:
n+no
T(az,[n] + bz2[n]) = L az1[k] + bz2[k]
n+no n+no
= a L :t1[k] + b L :t2[k] = aT(z,[n]) + bT(:t2[n])
This is linear.
• TI:
n+no
T(:1:[n - no] = I:
.t=n-ne
:1:[k - nol
ft
= I:
t=n-no
:t[k]
= 11[n - no]
This is TI.
• Not memoryless: The values of 11[n] depend on 2no other values of :t, not memoryless.
(d) T(:t[n]) = :1:[n - no]
• Stable: IT(:1:[n])I = l:1:[n - no]!$ M if [:1:[n] $ M, so stable.
• Causality: If no ~ 0, this is causal, otherwise it is not causal.
• Linear:
T(azt[n] + bz2[n]) = azt[n - no]+ b:t2[n - no]
= aT(:tt[n]) + bT(x2 [n])
This is linear.
• TI: T(:t[n - n•J = :1:[n - no - n•J = 11[n - n•I• This is TI.
• Not memoryless: Unless no = 0, this is not memoryless.
(e) T(:t[n]) = e•l•l
• Stable: lz[n]I $ M, IT(x[n])I = [e•l•lj $ ,1•1•11 $ eM, this is stable.
• Causal: It doesn't use future values of :1:[n], so it causal.
• Not linear:
T(az,[n] + b:t2[n]) = ,u,{nJ+1,z,{n)
= eAZ1(n)eb2[n]
# aT(:t1(n]) + bT(z2[n])
This is not linear.
= =
• TI: T(:t[n - no]) e•l•-nol 11[n - no], so this is TI.
• Memoryless: 11[n] depends on the n••
value of :t only, so it is memoryless.
=
(f) T(:t[n]) az[n] + b
• Stable: IT(z[n])I = !az[n] + bl $ c>[MI + !bl, which is stable for finite a and b.
• Causal: This doesn't use future values of z[n], so it is causal.
• Not linear:
T(e:t1[n] + d:t2[n]) = ae:t1[n] + c>d:t2[n] + b
# cT(:t1[n]) +dT(:1:2[n])
This is not linear.
5
• Tl: T(:z:(n - no)) = a:r(n - no] + b = 11(n - no]. It is Tl.

• Memoryless: 11(n] depends on the n th value of :z:(n] only, so it is memoryless.
(g) T(:z:(n]) = :z:(-n]
• Stable: IT(:z:(n])I $ i:z:(-n]I $ M, so it is stable.
• Not causal: For n < 0, it depends on the future value of :z:(n], so it is not causal.
• Linear:
T(az 1 (n] + b:r 2(n]) = a:ri[-n] + b:r2:z:(-n]

= aT(:z: 1 (n]) + bT(:z:2(n])
This is linear.
• Not Tl:
T(:z:(n - no)) = :z:[-n - no]

# 11(n - no] = :z:(-n + no]
This is not Tl.
• Not memoryless: For n 'F 0, it depends on a value of :z: other than the n th value, so it is not
memoryless.
(h) T(:z:[n]) = :z:[n] + u(n + l]

• Stable: IT(:z:[n])I $ M + 3 for n 2: -1 and IT(:z:(n])I $ M for n < -1, so it is stable.
• Causal: Since it doesn't use future values of :z:(n], it is causal.
• Not linear:
T(a:z:,(n] + b:z:2(n]) = a:r,(n] + b:z:2(n] + 3u[n + 1]

'F aT(:z: 1 [n]) + bT(r2[n])
This is not linear.
• Not Tl:
T(:r[n - no] = :r[n - no]+ 3u(n + 1]

= y[n-no]
= r[n - no]+ 3u[n - no+ 1]
This is not TI.
• Memoryless: y(n] depends on the n th value of :r only, so this is memoryless.
2.2. For an LTI system, the output is obtained from the convolution of the input with the impulse response
of the system:
00
11(n] = L h(k]:z:[n - k]
1--oo
(a) Since h[k] 'F 0, for (No $ n $ N1 ),

N,
11(n] = L h[k]:z:(n - k]
l=No
The input, r(n] 'F 0, for (N2 $ n $ N3), so

r[n - k] 'F 0, for N2 $ (n - k) :, N3
6
Note that the minimum value of (n - l:) is N2 • Thus, the lower bound on n, which occurs for
=
k No is
Using a similar argument,
Therefore, the output is nonzero for
(No +N2) $ n $ (N, + N3).
(b) H :r[n] # 0, for some n 0 $ n $ (n0 + N - 1), and h[n] # 0, for some n, $ n $ (n, +M -1), the
results of part (a) imply that the output is nonzero for:
(n0 + n 1 ) $ n $ (n0 + n 1 + M + N - 2)
So the output sequence is M + N - 1 samples long. This is an important quality of the convolution
for finite length sequences as we shall see in Chapter 8.
2.3. We desire the step response to a system whose impulse response is
h[n] =.,-nu[-n], for 0 < 4 < 1.
The convolution sum: 00
y[n] = }: h[k]:r[n - k]
The step response results when the input is the unit step:
forne:0
:r[n] = u[n) = { 0,l, for n < 0
Substitution into the convolution sum yields

00
y[n) = }: .,-•u[-k]u[n - k]
b-00
Forn$0:
I: . -•
00
y[n] =
1=-CX)
00
= I: ...
c=-n
a-n
= 1-4
Forn>0:
•
y[n] = I: . -•
.. i=-m
= r; ..•
bO
1
= 1-a
7
2.4. The difference equation:

3 1
y(n] - 4Yln - l] + sy[n - 2] = 2z(n - l]
To solve, we take the Fourier transform of both sides.
The system function is given by:
The impulse response (for :r[n] = 6[n]) is the inverse Fourier transform of H(eiw).
H(eiw) _ -8 + 8
- 1 + le-J'"' I - le-Jw
• 2
Thus,
2.5. (a) The homogeneous difference equation:
y[n] - 5y[n - l] + 6y[n - 2] =0

Taking the Z-transform,
l-5z-l +6z- 2 =0
(1 - 2z- 1 )(1 - 3,- 1 ) = 0.
The homogeneous solution is of the form
!lh[n] = Ai (2)" + A2(3)".

(b) We take the z-transform of both sides:
Y(z)[l - sz- 1 + 6z- 2 ] = 2,- 1 X(z)

Thus, the system function is
Y(z)
H(z) = X(z)
= l - Sz- 1 + 6z- 2
-2 2
= 1 - 2z- 1 + I - 3z-l'
where the region of convergence is outside the outermost pole, because the system is causal. Hence
the ROC is jz I > 3. Taking the inverse z-transform, the impulse response is
h(n] = -2(2)"u(n] + 2(3)"u(n].

8
(c) Let :i:[n] = u[n] (unit step), then

l
X (z) = -1---z---,
and
Y(z) = X(z) • H(z)

2z-l
= (1- z- 1 )(1-2z-')(l -3z- 1).
Partial fraction expansion yields
l 4 3
Y(z) = ~---,.1 - -::---=---,-1 + --~.
1
l - z- l - 2z- l - 3z-
The inverse transform yields:
11[n] = u[n] - 4(2)"u[n] + 3{3)"u[n].
2.6. (ar The difference equation:

l
11[n] -
211[n - l] = :i:[n] + 2:i:[n - l] + z[n - 2)
Taking the Fourier transform of both sides,
Y(eiw)[l - !e-jw]
2
= X(eiw)[l + 2e-)w + .-;:a..,].
Hence, the frequency response is
l + 2e-;.., + •-;:a..,
= 1- ½e-jw
(b) A system with frequency response:
cross multiplying,
Y(eiw)[l + ½•-;w + ~.-,-....] = X(,;w)[l - ½•-;w + •-;:a..,],
and the inverse transform gives

l 3 l
11[n] + 11[n - l] + 11[n - 2] = z[n] - l] + :,;[n - 3).
2 4 2z[n -
2.7. :i:[n] is periodic with period N if z[n] = z[n + NJ for some integer N.
(a) z[n] is periodic with period 12:
,;< fn) = ,;< f )(n+N) =,;< fn+. .k)
,r .
~ 2,rk = N,for mtegers k,N
6
Making k = l and N = 12 shows that z[n] has period 12.
9
(b) :r[n] is periodic with period 8:
eJ( 'l-n) = eJ( 'l-Hn+N) = eJ( 'tn+2d)

= 2,rk =
3,,.
4
.
N,for mtegers k,N
= N = ~k,for integers k,N

The smallest k for which both k and N are integers are is 3, resulting in the period N being 8.
(c) :r[n] = [sin(..n/5)]/(.-n) is not periodic because the denominator term is linear inn.
(d) We will show that z[n] is not periodic. Suppose that z[n] is periodic for some period N:
=e"(;r,)(n+N) =e'"(7,n+2••J
e'"(7,n)
= 2.-k = ,/2N,for
" .mtegers k,N
= N = 2V2k, for some.integers k, N

Tbere is no integer k for which N is an integer. Hence :r[n] is not periodic.
2.8. We take the Fourier transform of both h[n] and z[n], and then use the fact that convolution in the time
domain is the same as multiplication in the frequency domain.
5
H(e'W) = I+ 2
le-i""'
Y(e'W) = H(e'w)X(e'w)
5 1
= 1 + le-iw
2 1 - le-i""
3
3 2
= 1 + le-Jw + 1 - le-Jw
2 3
l 1
y[n] = 2(3)nu[n] + 3(-2ru[n]
2.9. (a) First the frequency response:
Y(e'w) _ ~,-iwY(e'w) + ! 0 -2;wY(e'w) = !,-2;w X(e'w)

6 6 3
Y(eJW)
H(e'w) = X(eiw)
le-2;...,
= 1 - !e-Jw
3
+ le-2Jw
• •
Now we take the ;,;...,rse Fourier transform to find the impulse response:
H(eP") =
h[n]
10
For the step response s[n]:

00
s[n] = L h[k]u[n - k]
l=-oo
= L• h(k]
l:=-00
1 - (1/3)•+• 1 - (l/2)n+ 1
= -2 1 - 1/3 u[n] + 2 1 - 1/2 u[n]
1 1
= (1 + ( )"-2( )")u[n]
3 2
(b) The homogeneous solution ll>[n] solves the difference equation when :i:[n] = O. It is in the form
ll•ln] = E A(cr' where the e's solve the quadrMic equation
5 1
c2--c+-=0
6 6
So for c = 1/2 and c = 1/3, the general form for the homogeneous solution is:
1/h[n] =A,(~)•+ A2(½)"

(c) The total solution is the sum of the homogeneous and particular solutions, with the particular
solution being the impulse response found in part (a):
11[n] = !l>(n] + 11,(n]
1 1 1 1
= A,(
2)" + A,( )• + -2( )"u[n] + 2( )"u[n]
3 3 2
Now we use the constraint y[O] =y[l] =1 to solve for A, and A2:
y(O] = A, + A2 - 2 + 2 = 1
y[l] = A,/2 + A2 /3 - 2/3 + 1 = 1
A,+ A2 = 1
Ai/2 + A2/3 = 2/3
With A, = 2 and A2 = -1 solving the simultaneous equations, we find that the impulse response
is
2.10. (a)
y[n] = h(n] • z[n]
= L
lt~.
a•u[-k - l]u[n - k]
lo=-oo
n $-1
lo=-oo
= -I
:E ..., n>-1
l=-oo
a•
nS-1
= { 1-1/a'
1/a
1- 1/a'
n > -1
11
(b) First, let us define u(n] = 2nu(-n - l]. Tben, from part (a), we know that
2n+l n < -1
w(n] = u(n] • v(n] ={ l, ' n ; _1
Now,
y[n] = u(n - 4] • u(n]

= w(n -4]
{ 2n-3 n$3
= 1,
0
n>3
(c) Given the same definitions for u(n] and w(n] from part(b), we use the fact that h(n] = 2n- 1 u[-(n-
l) - l] = u[n -1] to reduce our work:
y[n] = r[n] • h[n]
= r[n] • u[n - l]
= w[n-1]
{ 2n, n$0
= 1, n>0
(d) Again, we use u[n] and w[n] to help us.
y[n] = r[n] • h[n]

= (u[n] - u[n - 10]) • u[n]
= w[n] - w[n - 10]
= (2n+lu[-(n + l)] + u[n]) - (2n-•u[-(n - 9)] + u(n - 10])
2(n+l) - 2<n-1), n $ -2
= {
l -2(n-l), -1 $ n $ 8
0, n:?::9
2.11. First we re-write :r[n] as a sum of complex erponentials:
Since compleii: exponentials are eigenfunctions of LTI systems,

H(,!•l•)•;-•n/< _ H(,-i•l•J,-;rn/4
y[n] = 2j
Evaluating the frequency response at w = ±-rr/4:
We get:
2,J2e-;•/•,j•n/< - 2,,T2,1•l•e-i•n/<
y[n] =
2j
= 2J2sin(=/4 - -rr/4).
12
2.12. The difference equation:

11[n] = n11[n - l] + :(n]
Since the system is causal and satisfies initial-rest conditions, we may recursively find the response to
any input.
(a) Suppose z(n] = 6(n]:

11[n] = 0, for n < 0
11(0] = 1
11(1] =1
11(2] = 2
11[3] = 6
y(4] = 24
y[n] = h[n] = n!ujn]
(b) To determine if the system is linear, consider the input:
z[n] = ao[n] + bo[n]

performing the recursion,
y[n] = 0, for n < 0
y(0] =a+ b
y[l] =a+ b
y[2] = 2(a + b)
11(3] = 6(a + b)
11[4] = 24(a + b)
•
Because the output of the superposition of two input signals is equivalent to the superposition of
the individual outputs, the system is LINEAR.
(c) To determine if the system is time-invariant, consider the input:
:(n] = 6[n - l]
the recursion yields
11[n] = 0, for n < 0
y(0] =0
11(1] = 1
11(2] =2
11(3] =6
11[4] = 24
Using h[n] from part (a),
h(n - l] = (n - l)!u(n - 1] -# y(nJl,[n]=l{n-1]

Conclude: NOT TIME INVARIANT.
13
2.13. Eigenfunctions of LTI systems are of the form an, so functions (a), (b), and (e) are eigenfunctions.
Notice that part (d), cos(wt,n) = .S(ei"'•n + e-;..,n) is a sum of two a" functions, and is therefore not
an eigenfunction itself.
2.14. (a) The information given shows that the system satisfies the eigenfunction property of exponential
sequences for LTI systems for one particular eigenfunction input. However, we do not know the
system response for any other eigenfunction. Hence, - can say that the system may be LT!, but
we cannot uniquely determine it. ==> (iv).
(b) If the system were LTI, the output should be in the form of A(l/2)", since (1/2)" would have been
an eigenfunction of the system. Since this is not true, the system cannot be LTI. ==> (i).
(c) Given the information, the system may be LTI, but does not have to be. For example, for any
input other than the given one, the system may output 0, making this system non-LTI. ==> (iii).
If it were LTI, its system function can be found by using the DTIT:
Y(ei"')
H(ei"') = X(e;"')
1
= 1 - le-;1o1
2
h(n] = (21 )"u(n]
2.15. (a) No. Consider the following input/outputs:
1
2:,(n] = o(n] ==> y,(n] = ( )"u(n]
.
4
1
>:2(n] = 6[n - l] ==> 112(n] = ( )"- 1 u(n]
4
Even though 2:2[n] = 2:,(n - l], 112[n] "# 11,[n - l] = (¾)"- u[n - l] 1
(b) No. Consider the input/output pair ,:2 (n] and 112[n] above. 2:2(n] = 0 for n < 1, but 112(0]-# 0.
(c) Yes. Since h[n] is stable and multiplication with u[n] will not cause any sequences to become
unbounded, the entire system is stable.
t.16. (a) The homogeneous solution y,[n] solves the difference equation when ,:(n] = 0. It is in the form
Y•(n] = L A(c)", where the e's solve the quadratic equation
l 1
c2- -c+
4
- =0
8
So for c = 1/2 and c = -1/4, the general form for the homogeneous solution is:
y,(n] =A,(.!)"+ A2(-.! )"
2 4
(b) Ta.king the z-transform of both sides, we find that
Y(z)(l - .!z- 1 - .!,- 2) = 3X(z)

4 8
and therefore
Y(z)
H(z) = X(z)
3
= 1 - l/4z-1 - l/Sz-2
3
= (1 + l/4z-l)(l - l/2z-l)
l 2
= ::--:-:-,--,- + -...,...-,-~
l + 1/4z-1 l - l/2z-'
14
The causal impulse response corresponds to assuming that the region ri convergence extends outside
the outermost pole, making
hc(n] = ((-1/4)" + 2(1/2)")u[n]
The anti-causal impulse response corresponds to assuming that the regiOn of convergence is inside
the innermost pole, making
(c) he(n] is absolutely summable, while h...,(n] grows without bounds.

(d)
Y(z) = X(z)H(z)
1 1
= 1- ½z-1 · (1 + ¼z-1)(1- ½z-')
1/3 2 2/3
= l + 1/4z- 1 + 1 -1/2z-l + l - 1/2z-l
1 1 1 2 l
y(n] = ( )"u[n] + 4(n + 1)( 2)"+>u[n + 1] + 3(2)"u[n]
34
2.17. (a) We have
for0$n$M
r[n] = { ~'. otherwise
Taking the Fourier transform

.,
R(ei") = 1:e-;.,•
n=O
1- ,-_;.,(M+l)
(b) We have
- { ½(1 + co&(1r;), for O $ n $ M
[ l-
wn 0, othenose
.
We note that, 1 2,m

w(n] = r[n] · [1 + 001( M )].
2
Thus,
= R(eJw) • f:
n=-00
i(l + i,;'ff + ;,-;'if),-;.,
1 1 2,rl 2.-
= R(ei")•(i(w)+:i6(w+ M)+:i6(w- M))
15
(c)
IR(eiro )I
It (I)
-Jt
2.18. h[n] is causal if h[n] =0 for n < 0. Hence, (a) and (b) are causal, while (c), (d), and (e) are not.
2.19. h[n] is stable if it is absolutely summable.
(a) Not stable because h[n] goes to oo as n goes to oo.
(b) Stable, because h[n] is non-zero only for O $ n $ 9.
(c) Stable.
_, 00
L Jh[n]I = L 3" =L(l/3)" = 1/2 < oo

n n=-oo n=l
(d) Not stable. Notice that

•
LI sin(.-n/3)1 = 2v'3
n=O
• and summing lh[n]I over all positive n therefore grows to oo.
(e) Stable. Notice that Jh[n]J is upperbounded by (3/4)1nl, which is absolutely summable.
(f) Stable.
So I: lh[n]I = 15.
2.20. (a) Taking the difference equation y[n] = (1/a)y[n - l] + :i:[n - l] and assuming h(O] = 0 for n < 0:
h(O] = 0
h[l] = 1
h(2] = 1/4
h[3] = (l/a) 2
h[nj = (l/a)"- 1 u(n - l]
(b) h[n] is absolutely summable if Jl/aJ < 1 or if Jal> 1

16
2.21. For an arbitrary linear system, we have
y[n] = T{x[n]},
Let x[n] = 0 for all n.
11[n] = T{x[n]}
For some arbitrary x 1 [n], we have
11,[n] = T{x1 [n]}
Using the linearity of the system:
T{x[n] + x 1 [nl} = T{x{n]} + T{x,{n]}

= 11[n] + 11,[n]
Since x[n] is zero for all n,

T{x[n] + x,[nl} = T{x,[n]} =11,[n]
Hence, y[n] must also be zero for all n.
2.22. We use the graphical approach to compute the convolution:
y[n] = :t[n] • h[n]

00
= L x[k]h[n - k]
k=-oo
(a) y[n] = x[n] • h[n]

y[n] = o[n - 1) • h[n] = h[n - l]
• • • I2 Tl ••n
0 2 3
(h) y[n] = x[n] • h[n]

5
0 2 n
-1
~2
(c) y[n] =:t[n] • h[n]
5 5 5 s
4
4 4 4
3 3 3
3
2 2 2
2
O I 2 3 4 5 6 7 8 9 10 II 12 13 14 15 16 17 18 19 20 n
(d) y[n] = :r[n] • h[n]
17
-2 -1 0 I 2 3 4 5 6 n
-1
2.23. The ideal delay system:

s,[n] = T{z[nl} = 2:[n - n0 ]
Using the definition of linearity:
T{a2:1[n] + bo:2[n]} = a2: 1[n - n 0 ] + bo:2[n - no]
= 011,[n] + bl,12[n]
So, the ideal delay system is LINEAR.
The moving average system:
1 ,.,,
y[n] = Tz[n] = M
l +
M
2
L
+ 1 i=--M1
2:[n - k]
by linearity:
1 ,.,,
T{az,[n] + b:z:,[n]} = M, + M, + 1 L
lt=-M1
(a2:,[n] + b,:2[n])
l lrl2 l M2
= M, + M2 + 1
~-~
L a2:,[n] + M, + M, + 1 L
k=-M1
bx,[n]
= oy, [n] + by,[n]
Conclude, the moving average is LINEAR
2.24. The response of the system to a delayed step:

s,[n] = 2:[n]00 • h[n]
L 2:[k]h[n -
= 1=-00 k]
00
= L 1=-oo
u[k - 4]h[n - k]
00
y[n] = L h[n - k]
t=4
Evaluating the above summation:
Forn<4: y(n]=O
For n = 4: 11[n] = h[O] = 1
For n = 5: 11[n] = h[l] + h[O] 2 =
For-n = 6: 11[n] = h{2] + h[l] + h[O] = 3
For n = 7: 11[n] = h[3] + h[2] + h[l] + h[O] = 4
For n = 8: y[n] = h[4] + h[3] + h{2] + h[l] + h[O] = 2
For n? 9: y[n] = h[5] + h[4] + h[3] + h[2] + h[l] + h[O] =0
18
2.25. The output is obtained from the convolution sum:
11[n] = o:[n] • h[n]

00
L o:[k]h[n -
= A:=-co k]
00
= L 1:=-CIO
o:[k]u[n-k]
The convolution may be broken into five regions over the range of n:
11[n] = O,for n < 0
11[n]
,.,,
11lnJ = I;a•
k=O
} _ 4 (N1+l)
= c__::__ _ '
1-a
for N 1 < n < N2
N, n
y[n] = L a.1i: + ~ a<'=-N2)
k=O l:=N2
J_ 4 (N1+l) 1_ 4 (n+l)
= 1-a + 1-a
2 - 4(N1+l) - a<n+l)
= l-a , for N2 $n $ (N, +N2)
N1 N1+N2
y[n] = I;a• + L a<•-N,l
b:::O k=-N2
,.,,
= I:a• + L N,a"'
2.26. Recall that an eigenfunction of a system is an input signal which appears at the output of the syste,
sea.led by a complex constant.
19
00
11[n) = 1: h(k)z[n-k)
t=-oo
00
= L h[k)5(n-•lu[n - k)
t=-oo
n
= 5• L h[kJ5-•
t=-oo
Becuase the summation depends on n, z[n] is NOT AN EIGENFUNCTION.

(b) z[n] = .,...,.,
00
h[ k]e':Z..(•-•l
y[n) = 1:
t=-oo
00
ei2..,n h(k]e-;:z..•
= 1:
.t=-oo
= .,,...,•. H(e':z.,)
YES, EIGENFUNCTION.
(c) ejwn + ,,;:z..n,
00 00
y[n] = L h(k]e'w(n-•) + L h[k]e':Z.,(n-•l

lt=-00
= ,,;wn L 00
h(k],-jwt + .,...,. L 00
h[k]e-j:Z.,t
Since the input cannot be extracted from the above expression, the sum of complex exponentials
is NOT AN EIGENFUNCTION. (Although, separately the inputs are eigenfunctions. In general,
complex exponential signals are always eigenfunctions of LTI systems.)
(d) z[n) = 5":
00
y(n] =
t=-oo
1: h[kJ5<•-•l
00
= 5• L h(k]5-•
k=-00
YES, EIGENFUNCTION.
(e) z[n] = 5"e'...,":
L
00
11[n) = h(kJ5<•-•l.,i:Z..(n-t)
=
k=-oo
5•,,i:Z..n L
.. h(k)5-•,-,2w•
t=-00
YES, EIGENFUNCTION.
20
2.27. • System A:
1
:i:[nl = C2l"
This input is an eigenfunction of an LT! system. That is, if the system is linear, the output will
be a replica of the input, scaled by a complex constant.
Since 11(n] =(¾)",System A is NOT Ln
• System B:
:i:(n] = e,i•l•u[n]
The Fourier transform of :i:(n] is
L
00
X(e-iw) = e,i-f8 u(n]e-;wn

n=-00
00
= Le-j(w-l)n
n=O
1
= 1- ,-;(w-l:J"
The output is y[n] = 2:z:(n], thus

Y(eiw) = 1- ,-;(w-f)
2 .
Therefore, the frequency response of the system is
Hence, the system is a linear amplliier. We conclude that System B is LTI, and unique.
• System C: Since :i:(n] = ,i•I• is an eigenfunction of an LTI system, we would expect the output to
be given by
where -y is some complex constant, if System C were indeed LTI. The given output, y[n] =2ei•I•,
indicates that this is so.
Hence, System C is LTI. However, it is not unique, since the only constraint is that
2.28. z[n] is periodic with period N if :i:(n] = :i:[n + NJ for some integer N.
(a) :i:(n] is periodic with period 5:
e,i<'f•l = ,i<'fH•+JVJ = ,;<'f•+•••l
= 2.-k =
2..
5
.
N,for mtegers k,N
Making k = 1 and N = 5 shows that :i:(n] has period 5.

(b) :i:(n] is periodic with period 38. Since the sin function has period of 2,r:
z[n + 38] = sin(.-(n + 38)/19} = sin(.-n/19 + 2,r) = z[n]

21
(c) This is not periodic because the linear term n is not periodic.
(d) This is again not periodic. ,;w is periodic over period 2.-, so we have to find k, N such that
:i:[n + NJ = ,;(n+N) = ,;<n+2d}

Since we can make k and N integers a.t the same time, :,;(n] is not periodic.
2.29.
(a)
(b)
(c)
(d)
(e)
••••
2.30. (a) Since cos(.-n) only takes on values of +l or -1, this transformation outputs the current value of
:r[n] multiplied by eitber ±1. T(:i:[n]) = (-l)n:r:[n].
• Hence, it is stable, because it doesn't change the magnitude of :r:[n] and hence satisfies bounded-
in /bounded-<>ut stability.
• It is causal, because each output depends only on the current value of :r:[n].
• It is linear. Let 11,[n] = T(:r: 1 [n]) = cos(.-n):r: 1 [n], and y2[n] = T(:r: 2[n]) = cos(,m):r:2[n]. Now
T(a:r:,[n] + b:r:2[n]) =cos(.-n)(a:r:,[n] + b:r:2[n]) = ay1 [n] + !,y,[n]

• It is not time-in-variant. If11[n] = T(:i:[n)) = (-l)n:r:[n], then T(:r:[n-1)) = (-l)n:r:[n -1] f.
y[n - 1].
(b) This transformation simply "samples" :i:[n] at location which can be expressed as k2.
• The system is stable., since if :,;{n] is bounded, :,;[n2] is also bounded.
• It is not caasal. For example, T:{4] ,:[16]. =
= =
• It is linear. Let 11,[n] T(:,[n)) :i:,[n2], and 112[n] = T(:r:2[n)) =,:
2[n2]. Now
T(a:r:,[n] + b:r:2[n]) =a:r:,[n2] + b:r:2[n2)) =ay1[n] + i>y,[n]
• It is not time-invariant. If y[n] = T(:r:[n]) = :r:[n 2], then T(:i:[n - I])= :i:[n 2 - 1] f. y[n - 1].
22
(c) First notice that

00
Lo[n-k] =u[n]
>=O
So T(:r[n]) = :z:[n]u[n]. This transformation is therefore stable, causal, linear, but not time-
invariant.
To see that it is not time invariant, notice that T(o[n]) = o[n], but T(o[n + l]) = O.
(d) T(:r(n]) = I;:.,._, :r(k]
• This is not stable. For example, T(u[n]) = oo for all n i. 1.
• Ii is not causal, since it sums /OMJJard in time.
• It is linear, since
00 00 00
L o:r 1 [k] + b:r 2(k] = a L :z:i(k] + b L :z:2(k]

k=n-1 .l:=n-1 l:=n-1
• It is time-invariant. Let
00
y[n] = T(:r(n]) = L :r[k],

.t=n-1
then
00
T(:r(n - no]) = L :r(k] = y(n - no]

i:=n-no-1
2.31. (a) The homogeneous solution y,[n] solves the difference equation when :r(n] = 0. It is in the form
y,(n] = I; A(c)", where the e's solve the quadratic equation
1 2
c2+-c-
15
-5 =0
So for c = 1/3 and c = -2/5, the general form for the homogeneous solution is:
y,[n] =A 1 (~)" + A,(-~)"

(b) We use the z-transform, and use different ROCs to generate the causal and anti-causal impulses
responses:
H z _ I = 5/11 + 6/11
( ) - (1- jZ-1)(1 + fz- 1) 1- ½z- 1 1+ iz- 1
h.[n] = .!.(!)"u[n]+
113
.!.c-!ru[n]
11 5
h [n] = _.!.(!)"u[-n-1]- .!.(-~)"u[-n -1]
""113 115
(c) Since h,{n] is causal, and the two exponential bases in hc[n] are both less than !, it is absolutely
summable. hoc[n] grows without bounds as n approaches -oo.
(d)
Y(z) =
X(z)B(z)
1 1
=
1-fz-1 {l-tz-1)(1 + fz-')
-25/44 55/12 27 /20
= 1 - 11az-1 + 1 + 2/sz- 1 + 1 - 3/sz-•
55 27
y(n] = ~(!)"u(n]+ (-!)"u[n]+ (~)"u[n]
44 3 12 5 20 5
23
2.32. We first re-write the system function H(e'w):
Let y1 [n] =.:[n] • g[n], then

.:[n]
111 [n]
Evaluating the frequency response at w = :!:7r /2:
G(,-ii)
Therefore,
and
y[n] = .,.,.y,[n] = w•t• cos(~n-
2
~)
2
2.33. Since H(,-iw) = H"(eN), we can apply the results of Example 2.13 from the text,
To find H(ei'f), we use the fact that H(eiw) is periodic over 2,r, so
Therefore,
3,, ~ 2,r 3,, 11,r
11[n] = cos(-n + - + -) = cos(-n + - )
2 4 3 2 12
2.34. (a) Notice that
r[n] =:to[n - 2] + 2.:o [n - 4] + :to[n - 6]
Since the system is LTI,
11[n] = YQ(n - 2] + 2YQ(n - 4] + YQ[n - 6],

and we get sequence shown here:
2
I
ll 5 6 7
-2
24
(bl Since
!lo[n] = -1:1:o[n + 1] + zo[n -1] = 3:o[n] • (-o[n + 1] + o[n - !]),
h[n] = -6[n + !] + 6[n - 1]
2.35. (a) Notice that zi[n] = z 2[n] + z 3[n + 4], so if T{-} is lillear,
T{z [n]} = T{:i:2[n]} + T{z3[n + 41}
1
= 112[n] + y3[n + 4]
From Fig P2.4, the above equality is not true. Hence, the system is NOT LINEAR.
(b) To find the impulse response of the system, we note that
6[n] = ,:3[n + 4]
Therefore,
T{6[n]} = y3 [n+4]
= 36[n + 6].+ 26[n + 5]
( c) Since the system is known to be time-invariant and not linear, we cannot use choices such as:
6[n] = :i: 1 [n] - :r 2 [n]
and l
6[n] = :r,[n + !]
2
to determine the in,pulse response. With the given information, we can only use shifted inputs.
2.36. (a) Suppose we form the in,pulse:
Since the system is linear,
A •shifted in,pulse results when:

1 1
o[n - l] = --:r
2 1
[n] + -:r2[n]
2
The response to the shifted in,pulse
l l
L{o[n - 11} = --y1 [n] + -y2[n]
2 2
Since,
L{o[n)} 'F L{o[n -1]}
The system is NOT TIME INVARIANT.
(b) An in,pulse may be formed:
since the system is linear,
L{o[n)} = 2l 11,[n] - 21 112[n] + 11s[n]

= h[n]
25
from the figure,

111(n] = -6[n + 1] + U[n] + U[n - l] + 6[n - 3]
112[n] = -6[n + l] + 6[n] - U[n -1]-6[n ~ 3]
11,[n] = U[n + 2] + 6[n + 1] - U[n] + U[n - 2]
Combining:
. h[n] = U[n + 2] + 6(n + I] - U[n] + U[n - 1]
+U[n-2] +6{n-3]
3
2
2
-2 -1 0 I 2 n
-2
2.37. For an LTI system, we use the convolution equation to obtain the output:
00
11[n] = L :r[n - k]h(k]

k=-00
Let n = m+ N:
00
11[m + NJ = L :r[m + N - k]h[k]

00
= L :r[(m - k) + NJh[k]
t=-oo
Since :r[n] is periodic, :r[n] = :r[n + r NJ for any integer r. Hence,

00
11[m + NJ = L :r[m - k]h[k]
= y[m]
So, the output must also be periodic with period N.
2.38. (a) The homogeneous solution to the second order difference equation,
3 l
11[n] - l] + 11[n - 2] = 2:r[n - l],
411[n - 8
is obtained by setting the input (forcing term) to zero.
11(n]- !y[n-1] + !.y[n-2] = 0

4 8
Solving,
1- ~,-, + !,-, =0
4 8 '
26
(1- ~z- 1 )(1- ~z- 1 ) = 0,
2 4
and the homogeneous solution takes the form
ll•{n] = A1(i)" +A2(¼)",

for the constants A1 and A2-
(b) Substituting the intial conditions,
11•{-l] = A,(!)- 1 + A2(!)- 1 = 1,
2 4
and
11•{0] = A, + A2 = 0.
We have
2A 1 +4A2 = 1
A, +A2 = 0
. Solving,
and
A2 = 1/2.
(c) Homogeneous equation:
1
y[n] - y(n - 1] + -y(n - 2]
4
=0
Solving,
1- z-• + !z-
4
2
=0'
(l - iz- 1
)(1- iz- 1
) = 0,
and the homogeneous solution takes the form
ll•fn] = A,(½)" -
Invoking the intial conditions, we have
ll•l-1] = 2A1 =1
ll•I0] =A,= 0
Evident from the above contradiction, the initial conditions cannot be met.
(d) The homogeneous difference equation:
1
y(n] - y(n - 1] + y[n - 2]
4 =0
Suppose the homogeneous solution is of the form
ll•ln] = A1(i )" + nB1(½)",

substituting into the difference equation:
1
l/h(n] - y.{n - l] + 11.(n - 2]
4 =0
1
A,(!)"+ nB1(!)" - A,(!)•-• - (n - l)B1(!)"-
2 2 2 2
!A 1(!)"- 2 +!(n-2)B1(!t-•
4 2 4 2
= 0.
27
(e) Using the solution from part (d):
and the initial conditions

11•[-1] = 1
and
we solve for A, and B1:

A,= 0
B 1 = -1/2.
2.39. (a) For z,[n] = 6[n],

11,[0] = 1
11,ll] = ay[0] = a
For :r2[n] = 6[n - l],

112[0] = 1
112[1] = ay[0] + :r2[l] = a+ 1 # yi[O]
Even though z 2[n] = z 1 [n - !], 112[n] # 112[n - l]. Hence the system is NOT TIME INVARIANT.
(b) A linear system has the property that
T{az 1 [n] + bz 2[nl} = aT{:r.[nl} + bT{2:2[n]}}
Hence, if the input is doubled, the output must also double at each value of n.
Because y[0] = 1, always, the system is NOT LINEAR.
(c) Let :r3 = a:r.[n] + ,8:r2[n].
For n?: o,
ll>[n] = 2:3[n] + ay3[n - l]
• = a:r 1 [n] + ,8:r2[n] + a(:r3[n - 1] + 11,[n - 2])
n-1 n-1
= 0 I:>•:r,[n - k] + ,8 L a•2:2[n - k]
•=O 1=0
= o(h[n] • :r1 [n]) + ,8(h[n] • :r2[n))
= 01/l[n] + ,8112[n].
For n < 0:
113[n] =
=
a- 1 (113[n + l] - 2:3[n])
-Q L
.
a•:r,[n - k] - ,8 L
. a•z,[n - k]
•=-1 ~-1
= 011,(n] + .8112[n].
Forn=0:
113(n] = 1/l[n] = l/2[n] = o.
Conclude,
113[n] = 011,ln] + .81/2[n], for all n.
Therefore, the system is LINEAR. The system is nill NOT TIME INVARlANT.
28
2.40. For the input
:t[n] = cos(.-n)u(nJ
= (-l)"u{n],
the output is
"'
y[n] L (j /2)•u[k](-1J<"-•>u[n -
= f:=-oo k)
"
1-1r Lu12>•1-1i-•
= .....,
"
= 1-1>" Lc-;12>1
= (-l)
n c-
I,${)
(-j /2)(n+l))
l+j/2
For large n, (-j/2)1"+ 1 >--+ o. Thus, the steady-state response becomes

(-1 )"
y[n] = 1 +j/2
cos(,m)
= 1 + j/2.
2.41- The input sequence, "'

:t[n] =L o{n + 16k),
1=-oo
has the Fourier representation
X(e'w) = "' }:
}: "' cl[n + 16k]e-iw"
fto;;::.-00 lt=-00
1 "' 2,rk
= 16 L
,k::;:-00
0<w + T6 >·
Therefore, the frequency representation of the illput is also a periodic impulse train. There are
fr"')uency impulses in the range $ w $ 1r.
-,r
We sketch the magnitudes of X(e'w) and H(e'w):
IX ,jw )I
29
From the sketch, we observe that the LTI system is a lowpass filter which removes all but three of tbe
frequency impulses. To these, it multiplies a phase factor ,-,...,.
The Fourier transform of the output is
Thus the output sequence is
2.42. (a) From the figure,
y(n] = (:i:[n] + :i:(n] • h1(n]) • h2(n]

= (:i:[n] • (.S(n] + h1(n])) • h2(n].
Let h[n] be the impulse response of the overall system,
y(n] = :i:(n] • h[n].

Comparing with the above expression,
h(n] = (6[n] + h1[n]) • h,(n]

= h2[n] + hi[n] • h2[n]
= a"u[n] + p<•-•>u[n - 1].
(b) Ta.king the Fourier transform of h(n] from part (a),

00
H(e'w) = L h[nJ,-;wn
n=-oc
00 00
= :E a"u(n]e-:Jwn +p :E a<•- 1>u[n - 11,-;wn
n=-oo n=-00
00 00
= Lane-;"""+ tfL o<t-l)e-;'"'t'
n=O ,~
where we have used t = (n - 1) in the second sum.
Note that the Fourier transform of a"u[n] is well known, and t.he second term of h[n] (see part (a))
is just a scaled and shifted version of a"u[n]. So, we could have used the properties of the Fourier
transform to reduce the algebra.
(c) We have
30
cross multiplying,
Y(.,;-,)[l - a,-;"']= X(ei"')[l + 13,-;"']
taking the inverse Fourier transform, we have

11{n] - ay{n - 1] = :[n] + j3:i:(n - 1).
(d) From part (a):

h[n] =0, for n < 0.
This implies that the system is CAUSAL.
U the system is stable, its Fourier transform exists- Therefore, the condition for stability is the
same as the condition imposed on the frequency response of part (b). That is, STABLE, if !al < 1.
2.43. For (-1 <a< 0), we have

X(.,;-,) = 1- oe-jw
l
(a) real part of X(ei"'):

= !2 .1x<ei"'J + x·cei"'ll
1- acos(w)
= 1- 2acos(w) + a 2
(b) imaginary part:
= l - 2acos(w) + a2
(c) magnitude:
IX(e'"')I = [X(ei"')X"(ei"'JJ½
= (1-2a~(w)+a2 )½
(d) phase:
LX(ei"') = arctan ( l -asin(w)
- acos(w)
)
2.44. (a) X(ei"')j.,=0 = __L..00
:i:[n)•-;"'"l..=0
= L
.. :1n1
=
(b) X(.,;-,)1.,=• =
6
..
L :i:(nJ•-;•n
00
= L
n=-oo
:r1n1c-1>"
= 2
31
(c) Because z[n] is symmetric about n = 2 this signal has linear phase.
X(.,;"') = A(w),-;:i.,
A(w) is a zero phase (real) function of w. Hence,
LX(_,;"') = -2w, _., $ w $ .,

(d)
forn=O:
1_: X(_,;"')dw =2.-z(0] =4.-
(e) Let y[n] be the unknown sequence. Then
Y(e-i"') = xc,-;.. l
= L z[n]e-i"'"
n
= L z[-n],-;..
n
n
= I:;11[n],-;..n
n
Hence y[n) = z[-n].

2
•• l • T T• I o I
-1
-4
I I
(f) We have determined that:
XR(_,;..) = 1'.{X(e-i"')}
= A(w) cos(2w)
= !A(w) (e-i:i., + ,-;:i.,)
2
Taking the inverse transform, we have

I 1 1 1
2a[n + 21 + 2a[n - 21 = 2z[n + 4] + r•lnl
2
• •
-1/2
• -4
I
• T0 I • • I T ••••
I
4
1/2
.:J/2
32
2.45. Let 2:{n) = •In), then X(e'"') =1
The output of the ideal lowpass filter:
W(e'"') = X(e'"')H(e'"') = H(e'"')
The multiplier:
causes a shih in the frequency domain:
The overall output: 11[nJ =,-;•nw[nJ + w[nJ

Y(e'"') = H(e' 1"'-•>J + H(e'"')
Noting that:
Y(&"') = 1, thus y[n] = o[n].

2.46. (a) We lirst perform a partial-fraction expansion of X(e'"'}:
l -a2
X(e'"') = (1 - ..,-i"')(l - "''"')
=
1
. + 1 ae'"'
1 - M-1 111
.
- ae,J"'
= anu[nj + a-nu[-n - l]
= aln\
(b)
1·
1,, -• X (e'"'} cos(w)dw = -
1 1• ;w
X(e'"')' +e
-jw
dw
2,r -• 2
2
= ! ( 2-
2 211' -·
1• X(e"")e""dw+ 1-_ 1•
271' -•
X(e'"')e-'"'tk>)
l (2:[n - 1) + z[n + ll)

= 2
= !(aln-1\
2
+ aln+ll)
2.47. (a)
zln] + 2zln - l) + :i:{n - 2)
11[n) =
=
zlnJ • h[n]
:i:[nl • (6{n] + 26[n - l] + o[n - 2!)
=
hln] = 6\nJ + 'loin - l) + .S[n - 2j
33
(c)
H(e'w) = + 2e-Jw + 0 -2jw
l
= 2e-Jw(,!_e'w + l + ,!_ 0 -Jw)
2 2
= 2,-,w(cos(w) + 1)
(d)
IH(e'w)I = 2(cos(w) + 1)
LH(e'w) = -w
Magnitude
-lt lt (I)
-TC
-TC lt (I)
(e)
h 1 (n] = _.!._ 1 Hi{e'W),'w dw

2,r <2ir>
= ...!...1
2,r <2r>
H(e'(w+•)e'w"dw
= _.!._ 1 H(e'(w)e'(w-•l•tJw
2,r <2•>
= .-,,n_.!._ 1 H(e'(w)e'w"dw
2,r 
= -l"h(n]
= 6(n] - 26[n - l] + 6[n - 2]

s[n] =l
+ cos(,m) = l + (-1)"
S(e'w) = 2,r 6(w - h) L
•
s[n]
..'1 ,1 JJ.
0 2 4 6
(b) Since y(n] = z[n]s[n],
34
= 2-1•
2,r -,r
S(d1 )X{d(w-l))dw
= X(d"') + X(ei<w-•l)
Y(&"') contains copies of X(&"') replicated at intervals of.-.

(c) Since w[n] = y[n] + (l/2)(y[n + l] + 11[n - l]),
W(d"') = Y(ei"') + .!. (d"'Y(d"') + •-;"'Y(d"'))

2
= Y(d"')(l + cos(w))
(d) The following figure shows X(&"'), Y(&"'), and W(&"') for a< 2 and a> 2. Notice that
X(d"') = { 1, lwl $ w/a,

•O, w/a $ lwl 2::"
So, for a > 2, Y(e;"') contains two noIH>verlapping replications of X(&"'), whereas for a < 2,
"aliasing" occurs. When there is aliasing, W(&"') is not at all close to X(d"'). Hence, a must be
greater than 2 for w[n] to be "close" to :r[n].
X. Y. and W lo< a<2 X. Y,andWfora:>2

2 6,------------,
1.5
0.5
0 oL---'--------''---
-2 0 2 -2 0 2
3 " "
5,--------------,
2.5
{ 2
2::
1.5 f -
oL--~'------'u...---"
6
-2
.
0 2 -2
.
0 2
~·
10
2:2
0
-2
.,0 2
2.49. (a) We start by interpreting each clue.

(i) The system is causal implies
h[n] = 0 for n $ O.
(ii) The Fourier transform is conjugate symmetric implies h[n] is real.
(iii) The DTFT of the sequence h(n + l] is real implies h(n + l] is even.
From the above observations, we deduce that h(n] has length 3, therefore it has finite duration.
35
(b) From part (a) we know that h[n] is length 3 with even symmetry around h[l]. Let h[0] = h[2] = a
and h[l] = b, from (iv) and using Parseval's theorem, we have
242 +b2 = 2.
From (v), we also have
2a-b= 0.
Solving the above equations, we get
1
h[0] = v'3
2
h[l] = v'3
1
h[2] = v'3
or
l·
h[0] = - v'3
2
h[l] = - v'3
1
h[2] = - v13·
2.50. (a) Carrying out the convolution sum, we get the following sequence q[n]:
4 4
3 3 3 3
q[n]
1 1 1 1
n
012345678910
(b) Again carrying out the convolution sum, we get the following sequence r[n]:
444444 r[n]
3 3
1 1
_ __,.,__.__.___._..._......____._.._......__.__._..,..........__,,-..,........,..-to--n
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
-4
-8
-12
-16
-20
36
(c) Let a[n] = v[-n] and b[n] = w[-n], then:

+oo
a[n] • b[n] = L a[.l:]b[n - .I:]
~-00
+oo
= L v[-k]w[k - n]
+oo
= L v[r]w[-n - r] where r = -k
= q[-n].
We thus conclude that q[-n] = v[-n] • w[-n].

2.51. For (-1 <a< 0), we have
X(e!"') - l
- 1 - a,,e-Jw
(a) real part of X(ei"'):
= !2 · [X(ei"') + X 0
(el"')]
l - acos(w)
= l - 2a cos(w) + a2
(b) imaginary part:
X,(ei"') = ;i - [X(e'"') - X"(ei"')]

-asin(w)
= l - 2a cos(w) + a2
(c) m~tude:
IX(ei"')I = [X(ei"')X"(ei"'JJ½
= (1 - 2aco!(w) + a2) ½
(d) phase:
LX(ei"') = arctan ( -asin(w) )
1- acos(w)
2.52. :r[n] can be rewritten as:
5,m
:r[n] = 2 )
cos(
= cos( 2,m )
ei'i- .-;y
= -2-+-2-·
We now use the fact that complex exponentials are eigenfunctions of LTI systems, we get:
. 37
11(n]
2.53. First z[n] goes through a 1owpass filter with cutoff frequency 0.5.-. Since the cosine bas a frequency of
0.6,r, it will be filtered out. The delayed impulse will be filtered to a delayed sine and the constant will
remain unchanged. We thus get:
- nn(0.5,r(n - 5))
wInl - 3 --'--'---""- + 2.
r(n - 5)
y[n] is then given by:

y(n] = 3 nn(0.5.-(n -5)) _ 3 nn(0.5,r(n - 6)) _
.-(n - 5) .-(n - 6)
2.54.
cos(l5,rn _ ~)
z(n] = 4 3
,rn ,r
= cos(-- - -)
4 3
,rn ..
= cos(-+-)
4 3
eiiei¥ e-ife-J·.....
= 2
+
2
Using the fact that complex exponentials are eigenfunctions of LTI systems, we get:
2.55. Since system l is memoryless, it is time invariant. The input, z[n] is periodic in w, therefore w[n] will
also be periodic in w. Al!. a consequence, y[n] is periodic in w and so is A.
2.56. (a)
11[n] = h[n] • (•-;.,.nz[n])

+oo
= L •-;...•z[k]h(n - k] .
.t=-oc
38
Let :r[n] = a:t1[n] + b:t2[n], then:
11[n] = h[n] • (,-;won(a:r,[n] + b:t2[n]))

+co
= L .,-;-•(a:r,[k] + b:t2[k]lh[n - k]
1:~-00
+co +co
.,-;w••:r,[k]h[n - k] + b
= "E
.t=-oo
E
k=-oo
,-;wo•:r,[k]h[n - k]
= a11, [n] + by,[n]
where 11,[n] and 112[n] are the responses to :r 1 [n] and :r2[n] respectively. We thus conclude that
system S is linear.
(b) Let :r 2[n] =:r[n - no], then:
112[n] = h[n]
+co
• (,-;w,n:t2[n]l
= L ,-;wo(n-•>:r,[n - k]h[k]
••-oo
+co
L ,-;wo(n-•>:r[n - no - k]h[k]
= >=-co
"F 11[n - no].
We thus conclude that system S is not time in'Vllriant.

(c) Since the magnitude of ,-;won is always bounded by 1 and h[n] is stable, a bounded input :r[n]
will always produce a bounded input to the stable LTI system and therefore the output y[n] will
be bounded. We thus conclude that system S is stable.
(d) We can rewrite y[n] as:
11[n] = h[n]
+co
• (,-;wonz[n])
L .,-;wo(n-•>:r[n -
= k=-oo k]h[k]
+co
= L k=-oo
.,-;won_,jwo•z[n - k]h(k]
+co
= e-;won
E
l:=-oo
_,;...•x[n - k]h[k].
System C should therefore be a multiplication by ,-;won.
2.57. (a) H 1 (eiw) corresponds to a &equency shifted version of H(eiw), spec:iDcally:
H,(_,iw) = H(_,i(w-•>J.
We thus have:
39
This is a bighpass filter.
_.__ __._ _ ___._ _ ___._ __._.. w
-.- -o.s.- 0 0.8,r 1t
(b) H2(e;w) corresponds to a frequency modulated version of H(eiw), speciJically:
H 2(eiw) = H(eiw) • (o(w - 0.5w) + o(w + 0.5,r))

We thus have:
Jwl < o.3ir
o.3ir $ Jwl $ 0.1..
0.1.. < Jwl $ "·
This is a bandpass filter.

• H2(eiw)
w
• _,, -0. 7.- -0.3,r O 0.3.- o. 7,r .-
(c) H 3 (e'w) corresponds to a periodic convolution of H,,(dw) with another lowpass filter, specifically:
where H(eiw) is given by:

H(eiw) ={ 1 ,
,
lwl < 0.1 ...
0.1.- $ lwl $ .-
0
Canying out the convolution, - get:
0.1 , lwl < O.l,r
-1;,! + 0.1s , o.i.- $ lwl $ 0.3,,
o 0.3w < lwl $ .-.
40
2.58. Note that X(ei"') is real, and Y(ei"') is given by:
Y(ei"') = { -jX(~) O<w<,r

+jX(e'"') -,r<w<O.
w[n] = z[n] + jy[n], therefore:

W(&w) = X(eiw) + jY(eiw).
Using the above, we get:
"Y(·;w) { X(&W) O<w<1r

) ... = -X(eiW) -.- < w < 0.
We thus conclude:
O<w<1r
-,r < w < o.
------~-~-----w 0
"
2.59. (a) Using the change of variable: r = -k, we can rewrite /4[n] as:
00
/4[n] =L :r"[-r]:r[n - r] =:r"[-n] • :r[n].

r=-oo
We therefore have:
g[n] = z"[-n].
(b) The Fourier transform of z"[-n] is X"(~). therefore:
]4(ei"') = X"(eiw)X(eiw) = IX(ei"')l 2 -
2.60. (a) Note that z 2 [n] = - I:!~ :r[n - k]. Since the system is LTI, we haw:
v,[n] = -
....L k] .
..., y[n -
41
(b) By carrying out the convolution, we get:
-1, n = O,n = 2
h[n] = -~ , n =I
{ o.w.
2.61. The system is not stable, any bounded inpnt that excites the zero input response will result in an
unbounded output.
The solution to the difference equation is given by:
y[n] = y,,,[n] + y,.,.[n]

where y,,,[n] is the zero input response and y,.,.[n] is the zero state response, the response to zero initial
conditions:
= a(~ t where a is a constant determined by the initial condition.
y,.,.[n] = (2l )nu[n] • z[n].
AI!. example of a bounded input that results in an unbounded output is:
z[n] = cl[n + l].

The output is unbounded and given by:
l l l
y[n] = (-t+1 u[n+ l]- -(-t.
2 2 2
2.62. The definition of causality implies that the output of a causal LTI system may only be derived from
past and present inputs.
The convolution sum:
00
y[n] = 'E h!l:)z[n - 1:)

k:-ao
-1 oo
= 'E h{k)z[n - k) + 'E h[k)z[n - k}
Note that the first summation represents a weighted sum of future values of the input. Thus, if the
system is causal, _,
'E h{k)z[n - k) = 0.
This can only be guaranteed if h[k)= 0 for n < O.
Using reverse logic, we can show that if h(n) = 0 for n < 0,
-
00
y[n) = 'E h!l:)z[n - k).

Since the convolution sum specifies that the input is formed from past and present input values, the
system is, by delinition, causal.
42
2.63. The system could be LTI. A possible impulse response is:
h[n]
2.64. Let the input be z(n) = o[n - 1), if the system is causal then the output, r,[n), should be zero for n < 1.
Let's naluate y[O):
r,[O) = 2~ 1-:• Y(~)dw
= _!_ 1+•
271' -•
e-;i.1e-J1,1/2 dw
2
= -3,.
-# o.
This proves that the system is not causal.

2.65. z,[n] is even-symmetric around n = 1.5, furthermore since I;:i:1[n] < 0 and we want A1(0) ~ 0, we
need to include a .- factor in the phase. An appropriate choice for 81 (w) is therefore:
81(w)
.
•2
w
0
-j
-,r
z2(n] is odd-symmetric around n = 3, therefore:

,r
8,(w) =-3w + 2 lwl < "·
43
"
0
-j
-,r
2.66. (a)
E(ei"') = H,(ei"')X(ei"')
F(ei"') = E(e-;"')
= H,<,-i"')X(,-;"')
G(ei"') = H 1 (ei"' )F(ei"')
= H, (ei"')H, (,-;"')X(,-;"')
Y(e'"') = G(,-'"')
= H, (,-1"')H1 (e'"')X(ei"').
(b) Since:
We get:
(c) Taking the inverse transform of H (e'"'), we get:
h[n] = hi[-n] • h [n].

1
2.67. (a) Using the properties of the Fourier transform and the fact that (-1)" = e''", we get:
V(ei"') = X(ei<.,+<>)
W(ei"') = H 1 (ei"')V(ei"')
= Hi(e'"')X(ei<.,+•)
Y(ei"') = W(e'<w-•>)
= H1 (ei<w-•l)X (ei")
H(e'"') is thus given by:
(b)
44
With the given choice of H1 (e'"'),
H(e'"')
w
0
2.68. If z, [n] =_z2{n], 1111 [n] and w,{n] will not he necessarily equal.
w,[n] = 2:1{-n - 2]
w,{n] = 2:2{-n + 2]
'F 2:2{-n - 2]
A simple counterexample is z 1 [n] = z 2 {n] =o{n]. Then:
w,[n] = o{n + 2)
w,{n] = o[n - 2)-
2.69. (a) The overall system is not guar~ to he an LTI system. A simple counterexample is:
y,[n] = z[n]
112[n] = z(n]
y[n] = lit [n]112[n] = z 2(n]
which is not a. linear system, therefore the system is not LTI.

(b)
Y,(,;-,) =
H,(e""')X(,;-,)
Y2 (el"') = H,(,;-,)X(e""')
Y(ei"') = Y,(ei"') • Y,(,;-,).
Using the above relatio11Ships, we get:
Y(ei"') = { w,specmed , o < lwl < o.6"

0 o.s.- ~ lwl ~ .-.
2. 70. The first dilference:
y[n] = V(z[n]) = z[n] - z(n - l].
!
(a) To determine if the system is linear:
V(az,[n) + lr.r2[n]) = azi[n) + lr.r2[n] - a: 1[n - l] - lr.r2[n - 1)

= a(:r1 (n] - :r1 [n - 11) + b(z2[n) - z2[n - l])
= V(a:1[n]) + V(az2[n]).
Therefore, the system is LINEAR
To determine if the first difference is time invariant:
V(:r 1 [n -1]) = :r[n -1] - :r[n - 2)

= y[n -1).
The system is TIME INVARIANT.

(b) The impulse response is obtained by setting the input to :r[n) = 6[n),
y[n) = h[n] = 6[n] - 6[n - I)
(c) Ta.king the Fourier transform of the result of part (b ), we find that the system function is
H(e'w) =1- ,-iw_
Thus the magnitude of the frequency response is
IH(e'w)I = ✓(I - e-iw)(J - e-,w)

= ✓2 - 2cos(w).
We calculate the phase of the frequency response:
H(e'w) = (I - cos(w)) + j sin(w)
Thus,
LH(e'w) = arctan ( sin(w) )
. 1 - cos(w)
46
---......-----1----"----
0 ..
w
(d) In general,
V(z[n]) = z[n] • (o[n] - o[n - 1])
= z[n] - z[n - 1].
So, for z[n] = /[n] • g[n],

V(z[n]) = /[n] • g[n] • (o[n] - o[n - l])
= /[n] • V(g[n])
= V(/[n]) • g[n].
Where we have used the commutivity of the convolution operator to obtain the last two equalities.
(e) We desire the inverse system, h;[n], such that
h;[n] • V(z[n]) = :r[n]
The inverse system must satisfy:

h;[n] • h[n] = o[n],
in the frequency domain,
Recall from part (c),
So,
and
h.[n] = u[n].
Hence, the unit step is the inverse system for the first difference.
2. 71. For impulse response h[n], the frequency response of an LTI system is given by
H(eiw) = L00
h[n]e-;wn
-=-oo
(a) Suppose the impulse response is h•[n],
= (J 00
h(n]eiwn) •
47
(b) We have
H•(,,;-,) = (=too h[n]e-;wn) •

00
= L h•[n]ei=.
n=-oo
If h[n] is real,
00
H"(ei"') = L h[n]ei"'n
Hence, the frequency response is conjugate symmetric.
2. 72. The analysis equation for the Fourier transform:

00
X(ei"') = L z[n],-iwn
n=-00
(a) The Fourier transform of z"[n],
n=-00
(b) The Fourier transform of z"[-n],

00
L = :E
00
z"[-n],-jwn .,·[1Jei"''
n=-00 l=-ao
= (t.. z(I]•-;"'').
2.73. From property 1: 00
x·c,-.... >= :E .,. In1•-;"'"

ns-oo
for z(n] real, z[n] = z•[n], so
00
x·c,-;"'> = :E z[n1,-,.. n
= xc,,;-,i.
Thus, the Fourier tr~orm of a real input is conjugate symmetric.
X(ei"') = XR(ei"') + jXr(~"')
X•(,-i"') = XR(•-;"') - jX,(e;"')
48
From property 7, X(ei"') =X"(e-i"') for :[n] real. Thus,

XR(ei"') + iX1(e'"') = XR(•-;"') - iX1(•-;"').
We may infer
property 8: XR(e'"') = XR(e-i"')
property 9: X1(ei"') = -X1(e-i"')
X(ei"')= iX(e'"')le'LX(<'")
X"(e-;"') = IX(•-'"')1,-;Lx(,-;.l
From property 7:
So,
property 10: IX(ei"')I = IX(e-'"')I
property 11: LX(e'"') = -LX(e-1"').
2. 7 4. Theorem 1:
L L
00 00
00
L (cu,[n] + b:r2[n])e-'"'" =
n=-00
a.,:,[n]e-;wn +
n.=-00
b:r2[n],-;wn
n=-00
Theorem 2:
= 00
:,:[l),-jw(t-n,)
I:
n.=-00
:,:[n - n•J•-;wn = :E
l=-00
00
= ~"1ft4
I:
l=-oo
x[l]e- 1"''
= e'"'"' X(e'"')
Theorem 3:
L00
z[n]e'"'O"'e-jwn = L00
:t[n],-;(w-w,)n
n.=-00 n.=-00
Theorem 4:
00
L :,:[-n]e-;wn =
Theorem 5:
L00
n:&[n]e-;wn
n.=-00
49
2. 75. The output of an LTI system is obtained by the convolution sum,

00
y[n] = L z[kjh[n - k].

l=-oo
Taking the Fourier transform,
Y(.,;") = =f;, (j:

00
•-i=
00
z[k]h[n - k])
= j: (=f;, kj,-1"")
00
z[k]
00
-h[n-
= Joo (Joo
z[k],-iw> h[n - k]e-iw(n->))
Hence,
2. 76. The Modulation theorem:
the time-domain representation,
v[n] = -.!..., {' d8 {' dw X (.,;')W(e-><w-•>)e'""

(2,r) }_, 1-.
= 2._ {' d8 X(e'')w[n]e''"
2,r )_,.
= z[n]w[n]
2. 77. (a) The Fourier transform of 11•[-n] is Y"(e-'"), and X(e'")Y(e-'") forms a transform pair with z[n] •
y[n]. So
and
g[n] = z[n] • 11"[-n]
form a transform pair.
(b)
00
L (z[n] • 11•[-n]) •-jwn
00 00
= L L z[k]y"[k - n]e-i""
a=-cob-00
forn=O:
50
(c) Using the result from part (b):

sin(,m/4)
:(n] = 2,m
sin(,m/6)
11°(n] = 511'11
We recognize eacli sequence to be a pulse in the frequency domain:
.--+----. ½
-+-----'---'---'------w
• 0 ••
-,r
_z. ,r
Y(d"')
l
•
-,r
I
_ _ _ _ __JL-.l.......L---------"'
-i 0 i
Substituting into Eq. (P2.77-l):
00
I:
n=-oo
:[n]y" [n] = 2.._
211"
1•
-,r
X(e-i"')Y" (e-i"')dw
= 2... [<!)(!)(2")]
2.- 2 5 6
1
= 60
2.78. X(e-'"') is given by:
nL -,r O ,r
• w
(a)
,(n] { :[n), n even
11 = 0, nodd
= ~ (1 + e'"') :[n)
!
51
which transforms to
i
Y,(d"') = [x(d"') + X(d<..,+•>J]
-.-
[''~'
_ _,~<--'--~'----""'-.,-C.-""'----'--•
0 ..
w
(b)
Y•ln] =:r[2n]
Y.(d"') = i [x(d't) + X(d<'t+->i]
= Y,(d't)
(c)
• [ l-_{ :r[n/2], n even

y,n 0, nodd
2.79. (a)
00
*,(-N,-w) = L :r(n-N):r'[n+N]d"'n.
n=-oo
00
+;(N,w) = (L :r[n + N):r'[n-N]e-,"'n)"

=-oo
52
=
..
L (:,:(n + N]:r*(n - N],-;wn)*
=
..
L :,:*(n + N]:r(n - N]e.iwn
n=-oo
= +.(-N,-w).
(b)
+.(N,w) = L
.. Aan+Nu[n + N]Aan-Nu[n-NJ•-;wn
=
n=-oo
L ..
A2
_,, 0 2ne-jvln
=
..
A· L (a•,-;wr
n=N
= A2 (a•,-;w)N
l - a2e-Jw
= 0 2Ne-iwN
A 2 ..:..__;;___
1 - c 2 e-iwJ ·
(c)
X(e.i<•+(w/2))) =
..
L :r(n],-j(v+w/2)n.
..
n=-00
I:
x•c,;<•-<w121>i =
,.,._ .. :r·1n1,;<•-w/2)n_
Let S = ..L
21f
f'
-11
X(e;Cv+(w/2ll)X*(ei<•-Cw/ 2ll),i2•1' dv ' tben·.
s = -2l 1• L
"' -• n=-oo
oo :,:(n],-;c,+w/2)n
k=-oo
L"" :r*(k]e.i<•-w/2)•,_;2,N dv
= l
2.- Lco Lco :r(n]:r*(k]e-;•I•.♦'' 1• ,;c•-n+2N) dv
n=-oo.t=-oo -r
= 2_ f: f: :r(n]:r*(k]e-;-';+" 2sin(r(k - n + 2N))

k - n + 2N
=
2,r
L
..n=-oo >=-co
z(n]:r*(n - 2N],-;-'..;"''
= L
.. :r(n + N):r*(n - N],-;wn
We thus conclude that:

+,(N,w) = 1
2
1•
" -•
X(eiC•+Cw/2l>)X*(ei<•-Cw/2l>),i2•N dv.
53
2.80.
w(n] = :i:[n] + 11(n]

The mean of w(n]:
m,, = E{ w(n]}
= E{:i:[n] + 11(n]}
= E{:i:(n]} + E{y(n]}
= m.+m,
The variance of w[n]:
a!, = E{(w(n] - m,,) 2 }
= E{ w2[n]} - m!
= E{(:i:[n] + y(n])2 } - m!
= E{:i:2(n]} + 2E{:i:(n]ll[n]} + E{y'[n]} - m! - 2m,m, - m!
If :r[n] and y[n] are uncorrelated:
a!, = E{:i:2 (n]} - m! + E{y2 [n]} - m!
= "!+cr;
2.81. Let e[n] be a white noise sequence and E{s(n]e(m]} = 0 for all n and m.
E{y[n]y(n + ml} = E{s[n]e[n]s[n + m]e(n + ml}
= E{ s[n]s[n + m]e[n]e(n + ml}
Since s[n] is uncorrelated with e(n]:
E{y(n]y[n + ml} = E{ s(n]s(n + ml} E{ e(n]e[n + ml}
= cr!a;o[m]
2.82. (a)
t/>.,(m] = E(:i:(n]:i:[n + ml)
= E((s(n] + e(n])(s(n + m] + e[n + ml))
= E(s[n]s(n +ml)+ E(e[n]e[n +ml)+ E(s(n]e(n +ml)+ E(e[n]s[n + ml)
= t/>,.[m] + ,i,.,[m] + 2E(e[n])E(s[n]) since s(n] and e(n] are independent and stationary.
= ,p,.(m] + ,i,.,[m] where we assumed e[n] has zero mean.
Taking the Fourier transform of the above equation, we get:
••• (.,;"') = ••• (.,;"') + ••• (.,;"').

(b)
t/>,,[m] = E(:i:[n]e(n + ml)
= E((s(n] + e(n])e[n + ml)
= E(s[n])E(e[n]) + t/>ca(m] siDce s[n] and e(n] are independent and stationary.
= t/>.,_(m] where - assumed e(n] has zero mean.
Taking the Fourier transform of the above equation, - get:
••• (e'i"') = +,.(e'i"').

54
(c)
</>,,[m] = E(:z:[n]s[n + ml)
= E((s[n] + e[n]ls[n + m]l
= <J,.,[m] + E(e[n])E(s[n]) since s(n] and e[n] are independent and stationary.
= <J,.,[m] where we assumed e(n] has zero mean.
Taking the Fourier transform of the above equation, we get:
••• (.,-"') = +,.(.,-"').
2.83. (Throughout this problem, we will assume lol < 1.)
(a)
••lm] = h[m] • h[-m].
Taking the Fourier transform, we get:
+.. (.,-"') = B(.,-W)H(e-'"')

1 1
Taking the Inverse Fourier transform, we get:

0 1nl
<J,..[m]=-1
-o•·
(b) Using part (a), we get:
IB(.,-"')12 = H(.,;"')B'(e'"')
= H(.,;"')H(e-i"') since h[n] is real
= ••• (.,-"')
1 1
(c) Using Parseval's theorem:
-L
n=-oc
lh[n]l2
=
+oc
= :E<101 2 in
n=O
1
= 1- 1012.
2.84. The first-had:ward-dilference system is given by:
11[n] = z[n] - z[n - l].

(a)
t/>n(m] = E(11[n]11[n + ml)

= E((z[n] - z[n - l])(z[n + m] - z(n + m - l]))
= E(z(n]z[n + ml) - E(z[n]z[n + m - l]) - E(z[n - l]z[n + ml)
+E(z(n- l]z(n +m-1])
= t/>,,[m] - t/>,,[m - l] - t/>,,[m + lj + t/>,,[m]
= 21/>,,[m] - t/>,,[m - l] - t/>,,[m + l]
= 2<T;o[m] - cr;o[m - l] - ~•Im+ l].
---,~---=----r-:--m
-1 0 1
To get the power spectrum, we take the Fourier transform of the autocorrelation function:
• .. <eiW) = ~ _ u;,-jw _~e'W

= 2a! - 2a'!cos(w)
= ~(l - cos(w)).
·-
(b) The average power of the output of the system is given by tl>.. [O]:
tl>.. (o] = 2<1;.

(c) The noise power increased by going through the first.backwar~erence system. This tells us
that the first backward difference amplmes the noise of a signal.
56
2.85. (a)
..E
E{z(n]y(nl} = E{z(n]
..,_.., h[n]z(n - kl}
=
..
L h(k]E{z(n]z(n - kl}
=
..
i:=-00
L h(k]t/>.. [k]
>=-co
Because z[n] is a real, stationa,y white noise process:
</>•• [n] = o!o(n].
Therefore,
E{z[n]y(n]}
..
= a! L h[k]o[k]
t=-oo
= o!h[O].
(b) The variance of the output:
o-; = E{(y[n] - "'1,) 2 }
= E{y2 [n]} - m;.
When a zero-mean random process is input to a determistic LTI system, the output is also zero-
mean:
y(n] =
=
..
z[n] • h[n]
L :,;[k]h[n - k].
1=-00
Taking the expected value of both sides:
"'1, = L
.. E{z[n]}h[n - k]
ts-oc
m, = 0, ifm. = o.
So,
o-; = E{y2 [n]}
= E {J.. h[m]z(n - m] J.. h(k]z[n - k]}
=
..E L.. h[m]h[k]E{z[n - m]z[n - kl}
= a! E
.. ..
,as:-ooi=-oo
L h[m]h(k]o[m - k]
.. m=-005=-oo
,,.• = a! E "'lmJ.
• ffl,a:-00
!
57
2.86. Using the solution to problem 2.85:

(a)
this statement is TRUE, becal1se o:[n] is a white noise sequence.

(b) Since y[n] is not a white noise sequence, this statement is FALSE.
(c) Let
h 1 (n] = anu[n]
h2[n] = bnu[n].
These systems are cascaded:
=
.(1 ~~a{:;~;')
bn
n
Ea•bn-•,
..,
n?O
u[n]
w[n] = o:[n] • h(n].
Since o:[n] is zero-mean, mw = 0 also.
o-~ = E{w2 [n]}
2.87. (a) x[n] is a stationary white noise process.

00
y[n] = L h(k]x[n - k], n?O

b-oo
E{y[n]} = {.too E h[k]o:[n - k]} , n ;;::o
= L h[k]E{z[n - kl}
=
{m,o, ~~-oo
11:=-00
h[k], n ;;::o
n<O
(b)
t/>,.[n1, n2] = E{11[n1]11(n2]}.
= E {J 00
h{A:]z[n, - k] J.., h(m]z[n2 - m]} , n ;;:: O
= 1: :E
A:s-00 m=-oo
h[A:]h[m]E{z[n, - A:]o:[n2 - ml}
L L
111 n2
= h[k]h(m]t/>,.(n1 - l:,n2 - m].

t=-oom=-00
58
(c)
co
= m, L h[k]
lim
n1,n2-oo
~
L-1 ~
L-1 h[k]h[m]t/>.,[n 1 - k, n 2 - m] =~
~
~
L.J h[k]h[m]4>.. [k, m].
t=-oo m=-oo i=-oo m--00
(d)
h[n] =anu[n]
co
E{y[n]} = m, L anu[n]
m,
= 1-a
2.88. (a) No, the system is not linear. In the expression of y[n], we have nonlinear terms such as :r2 [n] and
divisions by :r[n], :r[n - l] and :r[n + l].
(b) Yes, the system is shift inv.aria.nt. If we shift the input by no, m,[n] shifts by no as well as ~[n]
and c,;[n], therefore 11[n] shifts by no and the system is thus shift invariant.
(c) If :r[n] is bounded, m.[n] is bounded so is u!(n] and <>;[n]. ~ a result, y(n] is bounded and
therefore the system is stable.
(d) No, the system is not causal. Values of the output at time n depend on values of the input at time
n + I (through u!(n] and m,(n]). Since present values of the ouput depend of future values of the
input, the system cannot be causal.
(e) Wben U:,(n] is very large, u;[n] is zero, therefore:
11[n] = m,[n]
l n+1
= 3 L
i:=n-l
:r(k]
which is the average of the previous, present and next value of the input.
When a:,(n] is very small (approximately zero), then:
y(n] = :r(n].
y(n] makes sense for these extreme cases, because in very small noise power, the ouput is equal to
the input since the noise is negligible. On the other hand, in very large noise power, the input is
too noisy and so the output is an average of the input.
2.89. (a)
E{ :r[n]:r[n]} = q,.,(O].
(b)
+.,(ei"') = X(ei"')X.(elw)
= W(elw)H(elwJw·(elWJH·(elw)
= +_(ei")IH(e"')I'
= ~ 1
• 1 - cos(w) + 1/4 ·
59
(c)
t/>u(n] = t/>-(n] • h[n] • h[-n]
= er! ( G) •u[n) • G)-• u[-n])

= cr!t,,[n].
2.90. (a)
t/>,,[n] = E{y[k]z(k - n]}
= E {=too h[r]z[k - r) J 00
h(m)v[k - n - m)}
Note that t/>,,[n] = E{z(p)v(p- t]}, therefore:

00 00
t/>,,(n] = L L h[r)h[m]E.{z[p)v[p- (n + t - s)]}

r=-oo m=-oo
= h[-n) • h[n) • tf>,.[n].
+,,(eiw) = JH(e'w)l'+,,(e'w).
(b) No, consider z[n] white and
v(n) = -z[n)
t/>,,[n) = -~6[n]
+,,(e'w) = -(1;.
Noting that JH(eiw)l2 is positive,
Hence, the cross power spectrum can be negative.
2.91. (a) Since fin] = e[n] - e[n - 1],
+11(eiw) = H1(e'w)H1(e-iw)+.,(e'w)
= (1 - e-iw)(l - e'w)cr:
= cr:(2 - ,1w - e-iw)
= ~(2 - 2 cos(w)).
60
(b) <P11{m] is the inverse Fourier transform of +11(e;.,)_ Using part (a), we get:
<P11[m] =.-:(2o[m] - o[m + l] - o[m - l]l.

(c)
+.,(ei"') = H2(ei"')H2(•-;"')+11(ei"')
= { ,r,(2 - 2cos(w)) , lwl < We
o , w, < lwl s .-.
(d)
•
61
The z-Transform
63
3.1. (a)
= ~ (l)n
2 z-ft = ~ 2z1)n = 1 - 1
00
00 1
Z [( 2
l)ft
u[n]
] (
½z-1 l•I > 2
(b)
= - L
-1 (l)n oo
2 z-ft = - L(2z)"
n=-oo n=l
2z 1 1
= -1-
- -2z= 1- 1 ,- 1 l•I < 2
2
(c)
Z [ (~) n u[-nJ] = J,., (2z)" = 1 ~ 2, l•I < 2

I
(d)
Z[c5[n]] = ,o = 1 all z
(e)
Z[c5[n - ll] = ,- 1 l•I > 0
(f)
Z[c5[n + ll] = z+' o:,; lzl < oo
(g)
•
Z [ (D ft (u[n] - u[n - 10])] = t( 1
2,) ft
1 - (2zJ- 10
1- (2zJ-•
l•I > o
3.2.
:r[n] = { nJV, 0<n<N-1
N-$ n- =n u[n]- (n - N)u[n - NJ
d d 1
n :r[n] ~ -zdzX(z)=:-nu[n]~-zdzl-z-l 1•1 > 1
,-1
n u[n)
-N-1
:r[n - no] ~ X(z) · z-... =:, (n - N)u[n - NJ~ (1z_ ,-1)2 lzl > I
therefore
64
3.3. (a)
0 < lal < l
-1 00
x.cz> = L a-"z-n + La"z-n

n=-00 n=O
00 00
= La"z" + Lo"z-"
a=l n=O
az l z(l - a 2 ) l
= - - + - - -
l - az 1- az-1 = --'-----'-'
(l - az)(z - a) lal < lzl < lal
(b)
l, 0$ n$ N- l N-1 l _ z-N zN _ l
%11 ={ 0,
<
N <n
n 0
· ~ X,(z) L z-n = .,,---,-
= n=O l - z-1
= _.:.__:.._
zN-l(z - l)
z;<O
0,
(c)
x<(n] = z,[n -1] • z,[n] ~ X,(z) = z- 1X,(z) · X,(z)
z i 0,1
pole zero
---41}---~~-..fi;._:,,,,,.-=- cancel
65
3.4. The pole-zero plot of X(z) appears below.
X(z}
unit circle
-1 1/3 2 3
(a) For the Fourier transform of :z:(n] to exist, the z-transform of :z:(n] must have an ROC which includes
the unit circle, therefore, l½I < lzl < 121-
Since this ROC lies outside ½, this pole contributes a right-sided sequence. Since the ROC lies
inside 2 and 3, these poles contribute left-sided sequences. The overall :z:(n] is therefore two-sided.
(b) Two-sided sequences have ROC's which look like washers. There are two possibilities. The ROC's
corresponding to these are: l½I < lzl < 121 and 121 < lzl < 131.
(c) The ROC must be a connected region. For stability, the ROC must contain the unit circle. For
causality the ROC must be outside the outermost pole. These conditions cannot be met by any of
the possible RO C's oft his pole-zero plot.
3.5.
X(z) = (1 + 2z)(l + 3,- 1 )(! - z- 1 )

= 2z + S - 4z- 1 - 3,-2
00
= L :z:(n]z-n
--00
Therefore,
3.6. (a)
I l
X (z) = -1-+~l-z--~, l•I >
2
2
Partial fractions: one pole ➔ inspection, :z:[n] = (-½)nu[n]

Long division:
1 - ½z-1 + ¼z- 2 + ...
l+½z- 1 l
l + ½z- 1
_ lz-t
•
_ 1,-1
2
+ J'
1 -•
= :z:(n] = (-½) n u(n]

66
(b)
1 1
X (z) = _l_+_l~z---, izl <2
2
Partial Fractions: one pole ➔ inspection, :i:[n) = -(-½inu[-n-1]
Long division:
2z -4z2 +8z3 + ...
½z- 1
+1 I
1 + 2z
- 2z
-2z -4z2
+ 4z2
+4z2 +8z3
=>:i:[n)=-(-½)" u[-n-1)
(c)
I
izl >2
Partial Fractions:
-3 1
X(z) lzl >
2
:i:[n) =
Long division:
+ ...
(-¾-½Jz-• - iz-2
(-J- ½Jz-• + ¾(-J - ½Jz-•
(d)
I - lz- 1 I
2
X(z) -- 1- lz-2 izl >2
•
Partial Fractions:
I
X(z) l•I> 2
z[n]
67
Long division: see part (i) above.
(e)
Partial Fractions:
X(z) = -a - a-'(l - a•)
1- a-lz-1
lzl > la- 11
:(n] = -a6[n] - (1 - a2 )a-<n+ilu[n]

Long division:
•-'-•)
- ( --;y-z -• + ...
1
1 - a.z-1
(a- 1 - a)z- 1
=- :i:[n] = -a6[n] - (1- a 2)a-(n+l)u[n]
3.7. (a)
:i:[n] = u[-n- l] + (~r u[n]
-1 1 1
X (z) = -1---z-_..,., + -1-_-lrz--"'",
2
2 < izl < 1
Now to find H(z) we simply use H(z) =Y(z)/X(z); i.e.,
H(z)
Y(z)
= -X(z) -- - - ~-½z--
1
- - · (1- z- 1 )(1- ½z- 1 )
---~~-- 1- ,- 1
- -1
(1 - ½z-1)(1 + z-1) -½z-' - 1 + z-
H(z) causal~ ROC lzl > 1.
(b) Since one of the poles of X(z), which limited the ROC of X(z) to be less than 1, is cancelled by
the zero of H(z), the ROC of Y(z) is the region in the z-plane that satisfi.. the remaining two
constraints lzl > ½and lzl > 1. Hence Y(z) converg.. on lzl > 1.
(c)
1 I
Y(z) = 1 - --
lz- 1
+ 3 1
1 + z-
lzl >1
2
Therefore,
y[n] = --31 (l)n
-2 u[n] + -(-ltu[n]
1
3
3.8. The causal system has system function
1- ,-,
H(z)- --.--:-
- l+ l,-1
•
and the input is :[n] = {lt u[n] + u[-n - 1). Therefore the z-transform of the input is
1 1 _ 1 -Jz- 1
X(z) = 1- lz-l
3
1
1 - z- - (1-"- ½z-1)(! - z-1) 3 < l•I < 1
68
(a) h[n] causal =o-
(b)
3
Y(z}
4 < lzl
Therefore tbe output is

y[n] = -138(l)n 8(-43)n u[n]
3 u[n] + 13
(c) For h[n] to be causal the ROC of H(z} must be¾< l•I which includes the unit circle. Therefore,
· h[n] absolutely summable.
3.9.
1
1 +_
H(z) - _ _..:...,c .-_ _ _ - 2 -
-- 1
- (1- ½z- 1)(1 + ¼z- 1 ) - (1-½z-') (1 + ¼z-•)
(a) h[n] causal =o- ROC outside lzl = ½=o- l•I > ½-
(b) ROC includes lzl = l =o- stable.
(c)
-1 i
Y(z) = l + lz-
3 + 3
1 1- 2z- 1
• l + z- 1 1
=
(1 + ¼z- 1 )(1- 2z- 1 ) 4 < 1•1 < 2
Y(z) (1- lz- 1)
X(z) = --=
H(z)
2
(1- 2z-1) 1•1 < 2
z[n] = -(2)nu[-n - 1] + !(2)n-1u[-n]
2
(d)
h[n] = 2 (½) n u[n] - (-~) n u[n]
3.10. (a)
The last term is finite length and converges everywhere except at z = 0.

Therefore, ROC outside largest pole ¾ < lzl.
69
(bl
z[n] = { 1, -10 :S _n :S 10
0, otherwJSe
Finite length but has positive and negative powers at z in its X (z ). Therefore the ROC is O <
l•I < oo.
(c)
z[n] = 2"u[-n] = (1)-•

2 u[-n]
z[-n] ... X(l/z)
1
(~) • u[n] => ROC is izl > 2
(1)-•
2 u[-n] => ROCis izl < 2
(d)
z[n] = [(¾) •+< - (e''/ 3 )•] u[n - 1)
z[n) is right-sided, so its ROC extends outward from the outermost pole eJ•/ 3 _ But since it is
non-zero at n = -1, the ROC does not include oo. So the ROC is 1 < izl < oo.
(e)
::i:[n) = u[n + 10) - u[n + 5)

= { 1, -10 5 n 5 -6
01 otherwise
z[n) is finite-length and has only positive powers of z in its X(z). So the ROC is izl < oo.
(f)
z[n] = (2l)n-l u[n) + (2 + 3j)"-2 u[-A - 1)
z[n) is two-sided, with two poles. Its ROC is the ring between the two poles: ½< lzl < j2)3; j, or
½ < lzl < *,-
3.11.
00
z[n] causal => X (z) = L z[n)z-•

n=O
· which means this summation will include no positive powers of z. This means that the closed form of
= =
X(z) must converge at z oo, i.e., z oo must be in the ROC of X(z), or lim,~00 X(z) -I oo.
(a)
could be causal
70
(b)
could not be causal
(c)
(z ')•
lim -• =O could be causal
•-+oo(z - ½)•
(d)
(z - ')'
lim i = 00 could J>Ot be causal
•-+co (z - ½)•
3.12. (a)
1- lz-1
2
X 1 (z) -
- l +2z- 1
The pole is at -2, and the zero is at 1/2.
(b)
1 - lz-1
X2(z) = (l + ½z-')(l- jz-')
The poles are at -1/2 and 2/3, and the zero is at 1/3. Since :r2 [n] is causal, the ROC is extends
from the outermost pole: l•I > 2/3.
1/2
(c)
1 + z- 1 -2z- 2
X3(z) = 1- llz-1 + z-2
•
The poles are at 3/2 a.od 2/3, a.od the zeros are at 1 and -2. Since :rs[n] is absolutely summable,
the ROC must include the unit circle: 2/3 < izl < 3/2.
3/2
71
3.13.
g[ll] is simply the coefficient in front of ,-11 in this power series expansion of G(z):
3.14.
1
B(z) =
1 .
Taking the inverse z. Transform:

1 1 I 1
h[n]= -(-ru[n]+-(--)"u/n]
2 2 2 2
So,
1 1
A1 = 2; 02 =--;
2
3.15. Using long division, we get
1 -10
I - 1014z
B(z) = l - ~:-l
=•
= I;c!i••-•
n=O 2
Taking the inverse z.transform,
h[n] = { (½t, n = 0,1,2, ... ,9

0, otherwise
Since h[n] is O for n < 0, the system is causal.

3.16. (a) To determine H(z), we first find X(z) and Y(z):
1 1
X(z) = 1- 2z-l
l
3 < l•I < 2
72
5 5
Y(z) = l -½z-1 1- lz-1
3
-Jz-1 2
= (1 - ½z-1)(1 - }z-1)'
lzl >
3
Now
Y(z)
H(z) = X(z)
1 - 2z-l 2
lzl >
3
The pole-zero plot of H(z) is plotted below.
H(z)
2/3 2
(b) Taking the inverse z..transform of H(z), we get
h[n]
(c) Since
1
H(z) = Y(z) = 1 - 2z- ,
• X(z) 1- Jz- 1
we can write
Y(z)(l - ~z- 1) = X(z)(l - 2z- 1),
whose inverse z-transform leads to
2
y[n] - -y[n - I]
3
=:t[n] - 2:t[n - I]
(d) The system is stable because the ROC includes the unit circle. It is also causal since the impulse
response h[n] = 0 for n < 0.
3.17. We solve this problem by finding the system function H(z) of the system, and tben"loolcing at the
different impulse responses which can result &om our choice of the ROC.
Taking the z..transform of the difference eqnation, we get
Y(z)(I - ~z- 1 + z- 2 ) = X(z)(l - z- 1 ),
and thus
Y(z) 1- z- 1
H(z)
= X(z) = 1- !z-1 + z- 2
73
= (1- 2z- 1 )(1- ½z- 1 )

= 2/3 + 1/3
l-2z- 1 l-½z- 1
lithe ROCis
(a) l•I < ½:
(b) ½< l•I < 2:
(cl l•I > 2:

h[n] = 32 2nu[n] + 31 (21 ru[n]
= h[O] = l.
(d) l•I > 2 or izl < ½:
3.18. (a)
+ 2'-1 + ,-2
l
H(z) = (1 + ½z-')(1- z- 1 )
-,' !
= -2+ lT
'
.!z- 1
+ --"-~
1- z- 1
2
Taking the inverse 7rtransform:

1 1 8
h[n] = -2o[n]+
3(- 2)nu[n] + 3u[n].
(b) We use the eigenfunction property of the input:
y[n] = H(~•l>Jz[n],
where
1 '
= -2+ !
1 + fe-J•/ 2
+ l
1- e-i•/2
l 1
= -2+-1--1
1-+-Ll.
- 2J +J
-2;
=~-
2+½
Putting it together,
74
3.19. The ROC(Y(z)) includes the intersection of ROC(H(z)) and ROC(X(z)).

(a)
1
Y(z) = (1 + ½z- 1 )(1- ¼z- 1 )
The intersection of ROCs of H(z) and X(z) is izl > ½- So the ROC of Y(z) is lzl > ½-
(b) The ROC of Y(z) is exactly the intersection of ROCs of H(z) and X(z): ½< l•I < 2.
(c)
The ROC is izl > i·

3.20. In both cases, the ROC of H(z) has to be chosen such that ROC(Y(z)) includes the intersection of
ROC(H(z)) and ROC(X(z)).
(a)
The ROC is l•I > l

(b)
1
H(z) = 1 - 1,-1
•
3 _21 _ (a) The ROC is l•I > t·
y[n] = 0 n <0
n n l_ a-{n+l}
1_ 0
n+l
y[n] = I;:r[k}h[n - k) = L"n-• = a" 1
_ _
4 1
=
1
_
4
0 :,; n < N - 1
A:=O .b:O
N-1 N-1 1 -N 1 -N
11[n] = L :r[kjh[n - k] = Lan-• =a" 1 =-:-, =a"H
.t:=O .t:=O
: ~1 , n ~N
(b)
H(z)
..
= La"z-"= 1 - 1 lzl > lal
az-l
n=O
N-1 1-z-N
X(z) = I;,-n -
- 1- z- 1 lzl > o
n=O
Therefore,
lzl > lal

Now,
1 r¼-r 1 l~• 1 ( 1 ) ( 1 Cl )
(1-az- 1 )(1-z- 1) = l-az- + l-z- = ~ 1-z- 1 -1-aZ- 1
!
So
y[n] = (1: a) [u[n] - a•+ 1 u[n] - u[n - NJ - a•-N+•u[n - NJ) l

1- Qn+l 1 _ 4 n-N+l
= 1- a [n] - 1- a u[n - NJ
0 n <0
J-a•+l
11[n] = ·-•
3.22. (a)
~
11[n] = L h[k]:r[n - k]
i=-00
(b)
Y(z) = H(z)X(z)
3 1
= 1 + l,-1 1 - z-1
3
• l !
= 1 + ½z-' + 1- •z-1
y[n] = -3 ( - -l)" u[n] + -u[n]

9
4 3 4
= ~ ( 1 + ~ ( - ~) ") u[n]
1
9 ( 1- ( - 1)•+ ) u[n]
= 4 3
3.23. (a)
2
1- lz-2
H(z) = (1- ½z-')(1- ¼z-1)
5+ lz-1
= -4+ 1-lz-l + lz-2
2
• •
7
= -4- 1- lz-1 + 1 _ l,-1
2 •
h[n] = -4o[n]-2 G:) •u[n] + 7 (~) • u[n]

76
(b)
3 l l
y(n] - -11[n - l] + -11(n - 2]
4 8
= z(n] - -z(n - 2]
2
3.24. The plots of the sequences are shown below.
(a) Let
co
a(n] = L 6(n - 4k],
•=-00
Then
co
A(z) =L z-•n
l=-oo
(b)
b(n]
B(z)
l•I > l
. .
' .
... ...
.•
•
• "
,.
c
z-
o.sL • ••
• _,. . . . . •
l
• • •
i I
r·
n "
3.25.
z• z2
X(z) = -(z___a_)(_z b) = -z•-_-(_a_+_b_)z_+_ab_
___
Obtain a proper fraction:

77
1
z 2
- (a+ b)z + ab z2
z2 - (c + b)z + ab
(c+ b)z - ab
X(z)
z(n]
3.26. (a) :r(n] is right-sided and

1 - !.z- 1
X(z) - 3
- 1+ ½z-'
Long division:
1 + ...
Therefore, z(n] = 2(-½)nu[n] - o(n]

(b)
3 3z-• 4 4
X(z) =z - ¼- 1 z- 1 = (1- l2 z- 1 ) (1 + 41 z- ') = 1 - 11 z- 1 - 1- ,z-
1 1
Poles at ½,and-¼. :r(n] stable, => !zl > ½ => causal.

Therefore,
:r(n] = 4 (~) n u(n] - 4 (-¾) n u(n]
(c)
1
X(z) = ln(l -4z) izl < 4
Therefore,
78
(d)
1
X(z) = 1-,z-
' • [z[ > (3)-l => causal
By long division:
1 + ½z- 3 + lz-• + ...
3
1- ½z- 1
1 - ½z-3
+ !z-3
3
+ ½z-3 - iz-6
+ lz-•
•
n = 0,3,6, ...
z(n]= {
otherwise
3.27. (a)
1 1
X(z) =
(I+ ½z- 1 ) 2 (1 - 2z- 1 )(I - 3z- 1) 2 < [z[ < 2
Therefore,
z[n] = ~1 (n+l) (-1)"+1 u(n+l]+ ( S8)2 (-1)" u[n]+ (3S)

1568 (2)"u[-n-l]- (2700
S) (3)"u[-n-l]
5 2 35 2 2 3 2
(h)
Therefore, z(n] = n!1 u[n].

(c)
z3 -2z 2 2
X(z)=~=z +2z+ 1 _2z-• [z[ < 2
Therefore,
z(n] = o[n + 2] + U(n + l] - 2(2)"u[-n - l]
3.28. (a)
d
nz[n] ~ -z dz X(z)
z[n - no]~ z-no X(z)
X(z) = (1-3z-•
¼z-1)2 = 12z
-2 [ d ( 1
-z dz 1- ¼z-'
)]
z(n] is left-sided. Therefore, X(z) corresponds to:
:r[n] = -12(n - 2) (4l)n-2 u[-n + l]

79
(b)
X(z) °"
00 (-1)•
=sin(z) = {;;:, _,_..::.,.__z2l+l
(2k+ l)!
ROC includes \zl = l
Therefore,
Which is stable.
(c)
z 27 - l
X(z) = 1- z- 7 =z
7
- 1- z- 7 izl > l
00
X(z) = z7 - L z- n 7
n=O
Therefore, 00
:i:[n] = o[n + 7} - L o[n - 7k}

n=O
3.29.
X(z) = e' +e11' z el 0
X(z) L 1l z" + n=<>n.

=n=on.
00
L--;l (l)n00
Lo (-ln.)'z-n + n=On.
-z =a=-oo l ==> :i:[n] =-1lI'+ o[n]
L ,z-• n.
00
3.30.
l
X(z) = log2 (l2- - z) lzl < 2
(a.)
-l (I)'
-2 z_'
I
=- °"--. °" = °"

00
(2z)' -Il
X(z) =log(l - 2z) LJ • =- -(2z)-'
LJ-l LJt
s=l t=-oo t=-oo
Therefore,
:i:[n] = ;; l (l)n
2 u[-n - l]
(bl
n:i:[n] _,. -z ! log(l - 2z) = -z ( 1 ~ 2z) (-2) = z- 1 C_-t.-•) , 1

\zl < 2
n:i:[n] = ( D \,[-n -1]
:i:[n] = l (l)n
;;
2 u[-n - l]
80
3.31. (a)
:z:(n] = cnu(n] + bnu(n] + enu(-n - l] !cl < lbl < lei

l l 1
X(z) = +
l - cz- 1 1 - bz-• 1- cz- 1
lbl < izl < tel
1
1 - 2ez- + (be+ cc - cb)z-•
X(z) = (l - cz- 1)(1 - bz- 1)(1 - cz-1)
lbl < tzl < lei
Poles: a, b, c 1
Zeros: z1, z2, ex> where z1 and z2 are roots of numerator quadratic.
pole-zero pl t (a) pole-zero plot (b)
~~er~
~
(b)
:z:(n] = n 2 cnu(n]
l
a:,(n] = anu(n].,; X1(z) = 1- az-1 izl > a
1
a: 2 (n] =na:,(n] = d
nanu(n] ..,; X2(z) = -z dz X, (z) = (l _az-
az-• )• lzl >"
2 n [ ] d ( d ( cz-• )
a:[n] = na:,(n] = n" un.,; -z dzX2 z) = -z dz (l -cz-1)2 lzl > a
-az- 1(1 + iu- 1)
X(z) = (1- az- 1)3 lzl >"
(c)
:z:(n] = •n•(cos;;n)u(n]-en'(cos ~n)u[n-l]

1
= •n• {cos~ n) (u[n] - u[n - l]) =6[n]
Therefore, X(z) = 1 for all lzl.
3.32. From the pole-zero diagram
z 3
X(z) = (z2 - z+ ½Hz+¾) lzt >4
y[n] = :z:(-n + 3] = :z:[-(n - 3)]
!
81
Poles at 0, -f 1 l ± j zeros at oo
1
:,;[n] causal::, z[-n + 3] is left-sided::, ROC is O < jzj < 4/3.
3.33. From pole-zero diagram

X(z)=z•+,l
z-2
(a)
y[n] = (-2l)n :,;[n]::, Y(z) = X(2z) = -

4z2 + 1
-
2z- 1
2
zeros
poles
Y(z)
(b)
poles at ±½i
zeros at ±1
82
Y(z)
3.34.
3-7z- 1 +sz- 2 I 3
H(z) = -'------'c_:.:- =5+---1
1 - f z- + z-
1 2 1 - 2z-
h[n] stable => h[n] = Sa[n] - 2nu[-n- l] - 3 G) n u[n]
(a)
n
y[n] = h[n] • z[n] = L h[l:]
n
-L 2• = -2n+I n<O
t-=-oo
{b)
1 1 1 1 1
Y(z) = 1- z-1 H(z) = -21 - z-1 + 21- 2z-l + 31 - !z-1 ,
2
2 < izl < 2
y[n] = -2u[n] - 2(2ru[-n - l] + 3 G) n u[n]
3.35.
H(z) = 1 - z•
---z
1- z• -
-1
- -
1- ,-•
c-,-•) lzl > 1
1 z
u[n] ~ =
1-z-l z-1 - - 1•1 > 1
z- 1 - z-4
U(z)H(z) = (1- z-<)(1 - z- 1 )
.-• .--
u[n] • h[n]
=
..
1- z- 1 -1-z-<
= u[n - 1] - °E6[n - 4 - 41:]

1•1 > 1
bO
83
3.36.
1
z[n] = u[n] ¢> X(z) = 1-z-1 l•I > 1
(2l)n-1 u(n + I] = 4 (l)n+l 4z 1

11[n] = u[n + l] ¢> Y(z) = 1 _ ½z-' l•I > 2
2
(a)
1
1•1 > 2
~
(b)
4z 4 1
H(z) = 1 - lz-l I - lz-1 lzl > 2
2 2
h(n] = 4 Gr+• u[n + l]-4 Gr u(n]
= 4o[n + 1] - 2 ( D n u[n]
(c) The ROC of H (z) includes lz I = 1 => stable.

(d) From part (b) we see that h[n] starts at n = -1 => not causal
3.37.
l !.
X(z) -- 1 - 3lz- 1 + 1 - 42z- 1
2
=
bas poles at z ½and z 2. =
Since the unit circle is in the region of oonvergence X(z) and z[n] have both a causal and an anticausal
part. The causal part is "outside" the pole at ½- The anticausal part is "inside" the pole at 2, therefore,
z[O] is the sum of the two parts
1 lz 1 1
z(O]= lim +lim_!.::_=- +0=-
&-+OO t- 21 z-l z-Oz-2 3 3
3.38.
l•I > 1
84
Therefore using a contour C that lies outside of jzj = l we get
y[l] = l J 2(z + l)z"dz

2,rj le (z- ½Hz+ ½Hz - l)
2(½ + l)(½) 2(-½ + 1)(-½) 2(1 + 1)(1)
= (½+½H½-1) + (-½-½><-½-1) + (1-½)(l+½)
18 2
= -5- 5 +6=2
3.39. (a)
zlO
X (z) = .,--,-,-----.,,=-,-=-....-,-,,-,----.-,...,.-.........-:-
(z - ½Hz - j)' 0 (z + J) 2 (z +!Hz+ f)
Stable => ROC includes izl = l. Therefore, the ROC is ½ < izl < j.
(b) :r[-8] = E[residues of X(z)z-• inside C], where C is contour in ROC (say the unit circle).
:r[S] = E [residues of (z - 1
;Hz - 23
)
10 (z
z 3 )2 (
+ 2 z + 25 )(z +;7
) inside unit circle]
First order pole at z = ½is only one inside the unit circle. Therefore
3.40. (a) After writing the following equalities:
V(z) = X(z) - W(z)

W(z) = V(z)H(z) + E(z)
we solve for W(z):

• H(z) l
W(z) = l + H(z) X(z) + l + H(z) E(z)
(b)
,-,
H(z) r=,=-r -1
H1(z) = l +
H()=
z
,-,
l + 1 _,_ 1
=z
H2 (z) = l ,-, = 1- z-1

l + l-.r1
(c) H(z) is not stable due to its pole at z =l, but H,(z) and H2{z) are.
3.41. (a) Yes, h{n] is BIBO stable if its ROC includes the unit circle. Hence, tbe system is stable if rm,n < l
and Tm.cz > 1.
(b) Let's consider the system step by step.
=
(i) First, v[n] o-•x[n]. By t.aking the z-trausform of both sides, V{z) = X(oz).
=
(ii) Second, v[nJ is filtered to get w(n]. So W(z) H(z)V(z) H(z)X(oz). =
=
(iii) Finally, y(n] o"w(n]. In the z-trausform domain, Y(z) = W(z/o) = H(z/o)X(z).
In conclusion, the system is LTI, with system function G(z) = H(z/o) and g(n] = o"h[n].
(c) The ROC of G(z) is or,.,.< l•I < ar...,. We want r,.,. < 1/a and'=• > 1/a for the system
to he stable. -
3.42. (a) h(n] is the response of the system when z(n] = <l(n]. Hence,
10
h(n] + L a1h[n - .I:]= <l(n] + tl<l[n - l],
l<=l
Further, since the system is causal, h(n] = 0 for n < 0. Therefore,

10
h(0] + L a1h[-k) .= h(0] = <l[0] = I.
k=l
(b) Atn=l,
h(l) + a,h(0) = o{l] + Po(0]
(c) How can we extend h(n) for n > 10 and still have it compatible with the difference equation for S?
Note that tbe difference equation can describe systems up to order 10. If we choose
.
h(n] = (0.9)" cos( n)u[n],
4
we only need a second order difference equation:
The z-transform of h(n] can be found from the z-transform table:

l o.o
H(z) - - 7,
- (l - 0.9ei•/<z-l)(l - 0.9,-1•!•,-1)
H(z)
,
,,
'
3.43. (a)
l l
X(z)=1-!,-1
2
1-2z-1• 2 < 1•1 < 2
6 6 3
Y(z) = 1- !,-1 -1- !,-1• l•I > 4
2 •
H(z)
86
~-olH(zt
u
...
l
~
t... 2
_,
.u _,
... -. ...
0 1 u 2
(b)
h(n] = (43)n u[n] - 2 (3)n-l

4 u(n - 1]
(c)
3
y[n] - I] = :i:[n] - 2:i:[n - 1]
4y(n -
(d) The system is stable because the ROC includes the unit circle. It is also causal since h[nj = 0 for
n < 0.
3.44. (a)
The ROC is ½ < lzl < 2.

(b) The following figure shows the pole-zero plot of Y(z). Since X(z) has poles at 0.5 and 2, the poles
at 1 and -0.5 are due to H(z). Since H(z) is causal, its ROC is lzl > I. The ROC of Y(z) must
contain the intersection of the ROC of X(z) and the ROC of H(z). Hence the ROC of Y(z) is
l < lzl < 2.
,.,,----...-------,
_,
(c)
-u,c_,-
1 0
Y(z)
05
--
---:,--!,---,,,....-,,--,,,.,--=',
1
H(z)
= X(z)
(1-z-l)(l+ ,.-i)(1-2z-i)
= (l-l2z-l)(1
l
2z-l)
87
Taking the inverse z-transform, we find
h[nj =6[nj + 32 u[n] - 32 (- 2l )"u[n]

(d) Since H(z) has a pole on the unit circle, the system is not stable.
S.45. (a)
=
ny[nj z[n]
dY(z)
-•~ = X(z)
Y(z) = -f z-• X(z)dz
(b) To apply the results of part (a), we Jet z[n] = u[n - l], and w[n] = y[n].
W(z) /
= - ,-1 I -,-•z-' dz
= - / z(z l- I) dz
= - 1-l
- + - -l d z
z z-1
= ln(z) - ln(z - I)
3.46. (a) Since y[n] is stable, its ROC contains the unit-circle. Hence, Y(z) converges for ½< l•I < 2.
• (b) Since the ROC is a ring on the z-plane, y[n] is a two-sided sequence.
(c) z[n] is stable, so its ROC contains the unit-circle. Also, it has a zero at ex, so the ROC includes
oo. ROC: lzl > ¾-
(d) Since the ROC of z[n] includes oo, X(z) contains no positive powers of z, and so z[n] = 0 for
n < 0. Therefore z[n] is causal.
(e)
z[0] = X(z)I,=~
¼z- 1 )
A(l -
= (I+ ¾z-1 )(1- ½z- 1 ) 1•=~
= 0
(f) H(z) has zeros at -.75 and 0, and poles at 2 and co. Its ROC is izl < 2.
88
ROC:ldc2
_,
-...
-u,,_. ,-.._.~-,._-.,--,
. -,s~-',
(g) Since the ROC of h[n] includes 0, H(z) contains no negative powers of z, which implies that
=
h[n] 0 for n > 0. Therefore h[n] is anti-causal.
3.47. (a)
00
X(z) = I:;z[n]z-n
n=()
00
X(oo) = lim 't"" z[n],-n

a➔oo L-
= z(O]
n=O
Therefore, X(oo) =
z[O] # 0 and finite by assumption. Thus, X(z) has neither a pole nor a :zero
=
at z oo.
(b) Suppose X(z) has finite numbers of poles and zeros in the finite z-plane. Then the most general
form for X(z) is
,,, ·
00 nc,-c.)
X(z) = I:;z(n]z-n = KzL.=•=;.:..'---
n=O IT (z - d•)
Kzl
where K is a constant and M and N are finite positive integen and Lis a finite positive or negative
integer representing the net number of poles (L < 0) or zeros (L > 0) at z =
O. Clearly, since
=
X{oo) z[O] # 0 and < oo we must have L + M = N; i.e., the total number of :zeros in the finite
z-plane must equal the total number of poles in the finite z-plane.
3.48.
X( z )
= P(z)
Q(z)
where P(z) and Q(z) are polynomials in z. Sequence is absolutely summable=> ROC contains jzj = 1
and roots of Q(z) inside l•I 1. =
These conditions do not necessarily imply that z[n] is causal. A shift of a causal sequence would only
=
add more zeros at z 0 to P(z ). For example, consider
.. 1
X(z) = --,
z-2
l•l>-2
z 1
= --1
z- i
=z• l
1- 2z-l
=> z[n] = (D n+I u(n + l] => right-sided but non-caosal.

89
3.49.
zln] = o[n) + ao(n - N) !al < 1

X(z) = 1 + az-N
a2 z-2N 4 3 z-3N
X(z) = logX(z)=log(l+az-N)=az-N--- + - ...
2 3
Therefore,
• ~ (-1)"+'
:i:[n] = L.., k •o[n - kN]
r.:l
3.50. (a)
:i:[n] = :i:[-n] => X(z) = X (;)
Therefore,
i.e., 1/zo is also a zero of X(z).

(b)
:i:[n] real=> :i:[n] = :i:"[n] => X(z) = X"(z")

Therefore
X(Zo} = 0 = X(z0)
i.e., z.; is also a zero and by part (a} so is 1/z;,.
3.51. (a}
Z[:i:"ln]] = =~
00
X"[n],-n = (
n~
00
:i:[n](z"}-n) " = X"(z"}
00 00
(b}
00 00
Z[:t[-n]] = L :t[-n]z-n = L :i:(n](z- 1 )-n = X(z- 1 )

n=-oo n.=-00
(c}
Z["R.c{:i:[n]}] = Z [ z[n] ~ :i:"(n)] = ~ [X(z) + X"(z"))

(d)
Z[Im{:i:[n]}l = Z [ z[n] ;/"[n]] = ;j [X(z) - X"(z"}]
3.52.
00
z,(n) = (-lt:t(n) ~ X,(z) = L (-1r:i:(n),-n = X(-z)

--oo
The poles and zeros are rotated 180 degrees about the origin.
90
N-1
3.53. (a) . -1::i:(n]sin(nw)
8• (w) = tan
_, (Zm{X(e'w}))
7u{X(eiw)} = ( ) -'===<>"----
tan 8, w = N-1
1::i:(n] cos(nw}
n=O
N-1 N-1
tan8,(w) L :i:(n]cos(wn) = - L :i:(n]sin(nw}
...,.
N-1
tan8,(w):i:(O] + L :i:[n](tan 8,(w) cos(nw) + sin(nw)) =0
l N-1
1
L
tan8,(w,) + -zO] _ :i:(n](tan8,(wt) cos(nwt) + sin(nw•)) =0
1
for N - 1 values of w• in the range O < w, < ,r.

(b) :i:(n] =6(n] + U(n -1] + 36[n - 2] = X(z} = l + 2z- 1 + 3z-2
8 (w) = tan-• ( -2sin(w) - 3sin(2w) )
• l + 2 cos(w) + 3 cos(2w)
Consider the values B: ( J) = 5

: and 9s ( 23Jf) = 5G, which give the equations
tane.(i) + :i:;oi[:i:[1J(tane.(i)cosi+sini)
+ :i:121( tane. (i) cos .. + sin,,.) J = o

tan 8, (2;) + :
0
2 2 2
[:i:[l] ( tan8. ( ; ) cos ; +sin ; )
+
2
:i:(2] ( tan 8. ( ; ) cos•;+ sin 4;)] = 0
l
l + :i:[O] (:i:[l] · l + :i:(2] · -1) = 0
-l + :r~O] ( :r[l] + 2~ + : ) + :i:[ 2] ( 2~ - : ) = O
:i:[O] + :i:[l] - :i:(2]
-:i:(O] + 2:i:[l] - :i:(2]

=
= 0
0 } = ! :i:(l]
:i:(2]
= 2:r[O]
= 3:i:(O]
Therefore
:i:[n] = :r(0](6(n] + U[n - l] + 3o[n - 2]}
where :r(O] is undetermined.
3.54. :r(n] = 0 for n < 0 implies:

. 91
For the case :r:[n] = 0 for n > 0,

O m
lim X(z)
a....0
=a-0
lim '°'
"'-11
:r:(n]z-" =:r:(0] + lim '°'
L.J
:r:(-njz" = :r:(0]
a-.0
-=-~ n=l
a.ss. (a)
m m
Cs,(n] = L :r:[A:J:r:(n + A:] = L
.__m
:r:(-i;]:r:(n - A:] =:r:[-n] • :r:[n]
X(z) has ROC: r1t < lzl < r, and therefore X(z- 1) has ROC: ri; 1 < lzl < rji 1 • Therefore C,,(z)
has ROC: maz{ri; 1 ,r1t) < lzl < miD[rji 1,r,)
(b) :r:[n] = a"u[n) is st&ble if lol < 1. In this case
1 1
X(z)
1- oz-1
lol < lzl and X(z- 1 ) = -1-az-
Therefore
1 1
c•• (z) =
~
= 1 - az- 1 - l - o- 1 z- 1
This implies th&t
c.,[n] = :
42
(a"u[n] + ,.-"u(-n - 11)
1
Thus, in summ&ry, the poles &re &ta and ,.- 1 ; the zeros &re &t O and 00; and tbe ROC of c•• (z)
is lal < lzl < 1a- J.
1
(c) Cleuly, :i:1[n) = :i:[-n) will have the same autocorrelation functi011. For ex.ample,
l
X,(z)=-- lzl < ,..-,, ~ c.,•• (z) = l l l l -I
-a.z
=c•• (z)
1-oz -GZ
(d) Also, any delayed wnioll of :i:[nj will have the same autoconela.tion functi011; e.g., :t2(n) = :[n- m)
implies
z-• z•
lol < l•I ~ c...,(z) = l -az
-I
1-oz =c•• (z)
92
S.56. In order to be a z-transform, X(z) must be analytic in some aDDular region afthe z-plane. To determine
=
if X(z) z• is ~alytic we examine the existence oI X'(z) by the Canchy Riemann conditions. If
X(z) =X(:r +ill)= u(.,,v) + ju(2',I/)

then for the derivative to aist at z, we must have
In our cue,
and thus,
8u a,,
B:r =l 'F 8,, = -1
unless"' and I/ are zero. Thus, X'(z) exists only at z = 0. X(z) is not aulytic anywhere. Therefore,
2'(n] = ~; f X(z)z•- 1dz does not exist.
S.57. If X(z) has a pole at z = Zo then A(z) can be expressed as a Taylor's series about z = zo.
00
A(z) = A(Zo) + } :A•(zo)

-n.1
-(z - ZoJ-
n-=1
where A(zo) = 0. Thus
Res [X(z) at z = zo]
B(Zo)
= A'(Zo)
!
93
Sampling of Continuous-Time Signals

9
z[n] = z,(nT)
= sin ( 21r(l00)11 :io)
= sin (in)
4.2. The discrete-time sequeiice ,rn

z(n] = cos( 4)
results by sampling the COIIWIUOWl-time signal
z,(t) = ms(o.,tj.
Since w = OT and T = 1/1000 seconds, the signal &equeiicy could be:
.
0., = - - 1000 =
4
25(),r
or possibly:
,r
I n. = (21r + 4). 1000 = 2250,r.
4.3. (a) Since :r[n] = :r,(nT),
.-n
3 = 40()/)r,nT
l
T = 12000
(b) No. For example, since
T can be 7/12000.
4.4. (a) Letting T = 1/100 gives
:r{n] = :z:,(nT)
= sin (20.-n ~) + cos ( 40.-n 1~)
1
= sin('";) +cns(
2
;')
(b) No, anotber choice is T = 11/100:

z(n] = z,(nT)
= m(20.-n;!)+C01(40,rn1~)
= m(11;")+ms(22;")
= m('";)+cos( 2;')
4.5. A plot of H(e'w) appears below.
96
• •(I)
(a)
z.(t) = 0,
, 1n12: 2.- · 5000
The Nyquist rate is 2 times the highest frequency. ,. T = ,o.:..O sec. This avoids all aliasing in
the C/D convener.
(b)
1
= lOkHz
T..,
.
8
= TO
1
= w,ooii{l<
n. = 2.- · 625rad/sec
le = 625Hz
(c)
1
T..,= 20kHz
= TO
,r 1
8
= 20,000°'
n. = 2" • 1250rad/sec
le = 1250Hz
4.6. (a) The Fourier transform of the filter impulse response
• H.(jn) = L 11.(t)e-;n, dt
= f."° a-a.ie-;nt dt
1
= a+ ;n
So, we take the magnitude
llfcUOll
l/a
0
97
(b) Sampling the filter impulse response in (a), the cliscrete-time &I.er la described by
h4(n] = T•-•"T u[n]
H4(eiw) =
..
L Te-•"T.-jwn
....,
Taking the magnitude of this response
. T
IH4(e'w)I = (1- 2e-aT cos(w) + e-2oT)i.
Note that the frequency response of the discrete-time filter is periodic, with period 2.-.
'%(• jCD)I
-47t -2,c 0 2,c 47t 0)
(c) The minimum occurs at w = .-. The corresponding value of the frequency response magnitude is
T
(1 + 2e-•T + e-••T) ½
T
=
'%(e jO>)I
T -----------------------
1/2
1/a 2/a 3/a
4. 7. The continuous-time signal contains an attenuated replica of the original signal with a delay of,,.•.
Zc(t) =Sc(t) + asc(t - 'rd)
(a) Talling the Fourier transform of the analog signal:
Xc(;O) =Sc(;O) · (1 + ae-;,•n)
Note that Xc(j!l) is zero for 101 > .-JT. Sampling the continuous-time signal yields the discrel<
time sequence, z(n]. The Fourier transform of the sequence is
1 ~ ;w + 1-y)
X(~) = T
..
L, Sc(T
,,._
.hr
98
(b) Tbe desired respoue:

HUO) ={ l + ae-;,.n, for 101 _5 f
0, · othennse
Using w =OT, we obtain a discrete-time system which simulates the above respoue:
H(ei"') = l + ae-;!f<
(e) We need to take the inverse FoDrier traurorm of the discrete-time impulse respoue of part (b).
h[n] = 2~ L: B(ei"')ei-' d,.i
== 1.1•
2,r -•
(l + ...-;!'.f').,;- d,.i
(i) Consider the ease when T• = T:

h[n] = 1.1•
2,r -•
(ei..,. +aeiw(n-1)),J,.i
siD(rn) asin[.-(n -1))

= -,m
-+ .-(n-1)
= 6[n) + a6[n - l]
(ii) For T• = T /2:
h[n] = .!.
211' -•
J" (eiw" + aei"'(n-l l) dw
sin(,m) asin[.-(n - ½l)
= -,m
-+ .-(n - ½)
= .S[n] + a sin[.. (n - ½)]
.-(n- ½l
4.8. A plot of X,UO) appears below.
-2xx10 4
(a) For :,(1) to be recoverable from :{n], the transform of the disaete signal must ha.,., no aliasing.
When sampling, the radian frequency is rewed to the analog frequency by
w = OT.
No aliasing will occur if the sampling iDtenal sat.is&es the Nyquist Criterion. Tbus, for the band-
limited signal, :,(I), we should select T aa: ·
l
T:S2x1o<·
!
99
(b) Assuming that the system is linear and time-invariant, tbe convolution 111111 describes the input-
output relationship.
11[n) = L
.. :r[k]hjn - k)
We are given
---..
.
11(n) = T 'E :,;(l:)
..
•=-ao
T
..
= ...L_ :r[l:]u(n - l:)
Hence, ft may infer that the impube resp0111e of the system

hjn) =T •u[n).
(c) We,... tbe expression for 11(n] as given and examine tbe limit
.
lim y[n] = 1im T · ~ z(k]
•-oc
= T·
n-ao
L
.. £...
t-=-ao
:,;[k]
ts-oo
Recall the analysis equation for the Fourier transform:
X(~w) =
..
L :,;[n]e-jwn
n.=-co
Hence,
(d) We,... the result from part (c). Noting tlw

•
X(~w) = f f:r=-oo
X,(;; + ;~,rr ).
Thus, we· have
From the given information, ft seek a -.alue of T such that:
L..
---co
;2,rr
X,(T) = [
-co
z.(t) cit
= x.(;ll)ln..o
For the &nal equality to be true, there mast be 110 contribution &om tbe t.erms for which r f, O.
That is, ft require IIO aliasing at (l =
0. Since ft are only imereRed in preserving the spectral
component at ll = 0, f t may sample at a rate which is lower than the Nyquist rate. Tbe maximum
-.alue ol T to satisfy ~ Clllllditiom is
l
T<-.
- l x 10"
100
4.9. (a) Since X(.,i") = X(.,i<w-•>), X(ei-'} is periodic with period ,r.
(b) Using the in'nl?le DTFT,
z(n] = 2.-
1
..!._
(h)
X(.-i"')ei-"'dw
= 2...1
2.- (h)
X(.-i<w-•IJ.-i""'dw
= 2...1
20' (h)
X(.-i"'}.,i(w+s)ndw
= ..!...,;•n
2,r (h)
1
X(.-i"').-iwndw
= (-1rz[n].
All odd samples of z[n] =0, because ~[n] =-z[n]. Heoce z[3] =0.
(c) Yes, y[n] cootains all even samples of z[n], aod all odd samples of z[n] are 0.
z[n] = { 11[n/2], n° even.

0, othennse
4.10. Use :z:[n] = Zc(nT), aud simplify:

(a) z[n] = cos(2rn/3).
(b) :z:[n] = sin(4.-n/3) = - sin(2.-n/3)
(c) :r[n] = ";~~~I
4.11. (a) Pick T such that
:z:[n] =Zc(nT} =sin(lOrnT) =sin(O"n/4) => T = l/40
There are other choices. For example, by realizing that sin(O"n/4) = sin(9'm/4), we find T. = 9/40.
(b) Choose T = l/20 to mab, :z:[n] = zc(nT). This is Wlique.
4.12. (a) Notice fint that H(.,i"') =l0jw, -r :, w < .-.

(i) After sampling,
3.,
= cos( Sn),
z[n]
y[n] = IH(.,i't)icos(~; n + LH(ei'f))

3.. ..
= 6,rcos(-n+
5
-)
2
3
= -6'rsin(
5
.. n)
llc(t) = -6.- sin(&,rt).
(ii) After sampling, z[n] =cos('; n) =cos('fn), 10 again, 1/c(t) = -6,rsin(&,rt).

(b) 1/c(t) is what you wowd expect &om a dillereatiator in the lint case but not in the second caae.
This is because 'lliasing has occurred in the NCODd case.
101
4.13. (a)
:i:,(t) = sin(;t)
11,(t) = sin( .!.(t - 5))
=
20
. .
sin(-t - -)
20 4
.-n ..
11[nJ = sin(- - -)
2 4
(b) We get the same result as before:
:i:,(t) = sin(;0 1J
11,(t) = sin( :0 (t - 2.5))
= sin(-t
10
. .
- -)
4
. .-n 1(
11[n] = sm(- - -)
2 4
(c) The samplillg period Tis not limited by the continuous time system h,(t).
4.14. There is no loss of information if X(,.;-,1 2 ) and X(,i!w/Z-•l) do not overlap. Tbis is true for (b), (d),
(e).
4.15. The output :i:,[n] = :i:[n] if nn aliasing -:,ccun as result of dowmampling. That is, X(e'w) = 0 for
,r/3 ~ ,..,, ~ ...
(a) r[n] = cos(.-n/4). X(eiw) has impulses 81 w = ±.-/4, so there is DO aliasi.Dg. r,[n] = r[n].
(b) r[n] = cos(.-n/2). X(eiw} has impulses 81"' = ±r/2, so there is aliasi.Dg. r,[n] # r[n].
(c) A sketch of X(eiw) is shown below. Clearly there will be no aliasi.Dg and r,[n] = r[n].
X(ej<il )
-1t/4 !t/4
4.16. (a) In the frequency domai.D,..., haTIO
•
,r;"• ~ . , r·;~· .
-lt/3 lt/3 • 0> --""'S-:f-al-:-6::---'--s""JCl'-:6-::--0>
Tbis is UDique.
102
(b) One choice is
M 1t/2 2
r:;=3.,;4=3
However, this is DOt llllique. We can also write i 4 [n] = eos('fn), 10 another choice is
4.l'T. (a) ID the frequency domain,

xc.,;,,,i _ { 1, ,..,, < 2r/3
- o, 2.-/3 < lwl <"
After the sampling rate change,
which leads to
:z:[n] = ~ sin(ffR/2)
3 .-n
(b) Upsampling by 3 and low-pass filtering :z:[n] = sin(3.-n/4) results ill sill(.-n/4). Downsampling by
= =
5 gives us i4[n] sin(51tR/4) -sin(3=/4).
4.18. For the condition to be satisfied, we have to ensure that Wo/L S mm(1t/L,1t/M), so that the lowpass
filtering does 110t cut out part of the spectrum.
(a) Wo/2 S ,r/3 = Wo..... = 2,r/3.

(h) Wo/3 $ .-/5 ===> Wo ...... =31t/5.
( c) Since L > M, there is 110 cbance of aliasing. Hence "'°·""" = ".
4.19. The nyquist sampling property must be satisfied: T S "/0,,.
4.20. (a) The Nyquist sampling property must be satisfied: TS 1t/O,, = F, 2: 2000.
(b) We'd have to sample 10 that X(.,;"') lies between lwl < 1t/2. So F, 2: 4000.
4.21. (a) Keeping ill mmd that after sampling, w = OT, the Fourier transform of :r[n] is
(b) A straight-forward application of the Nyquist criteri011 would lead to an incorrect conclusion that
the sampling rate is at least twice the mazimum frequency of :z:,(I), or 202 • However, since the
spectrum is bandpass, we only need to ensure that the replicatiOIIS ill frequency which occur as a
result of sampling do not overlap with the origillal. (See the following figure of X,(;O).) I'herdoR,
we only need to ensure
2,r
n2 - -T < n, T < -.0.0 = 2ff
i03
(c) The block diagram along with the frequency response of h(t) is shOWD here:
x(n] convert bandpass x(t)

sequeftC:C filter
to impulse h(t)
lrlllD
4.22. (a)
• lD 'h
w == !lT,
i ~
-It
~
(b) To recover simply filter out the undesired parts of X(e'w).
I,
It CD
x(n) Bandpass x..(t)

Filter
(c)
. -2xrr
I -ltff
I rI 1fl
I
21tff -zi
T<~
- !lo
4.23. In tbe frequency domain, we have
104
Zc(I) = 0, 101 ~ ;,
Therefore, since we ue sampling this s.(t) at the Nyqum frequency s(n) will be full band and uu•li•eed
s(n) = z 0 (nT1)
1/c(I) is a band-limned iuterpolatiou of z[n] at a di!'erent period. Since no aliasing occun at z[n), the
spectrum of 110 (1) will be a frequency axissc.aling of the spectrum of Zc(I) for T, > T2 or T, < T2. As
we show iD the ficu,e,
11.(1) = ~: ... (~:i)

4.24. The Fourier transform of 11.{!) is sketched below for each case.
105
(a)
Q)
-lt X 5 X 1<>3
(b)
I
Q)
-2 lt X 5 X 1<>3 21< X 5 X 1<>3 {l
(c)
II XS X l<f {l
(d)
-1t Q)
-2 ,. • s. 103 211 • s. ,o3 °
4.25. (a) z,(I) = :1:c(l)s(t) ~ X,UO) • •Ull)
0
106
(b) Since H,(e'"') is an ideal lowpass filter with"'• = i• we don't care about any signal aliasing that
occurs in the regi011 f !', .., !', 11. We require:
211 1l
- - 211 · 10000 ,!:
T 4T
1 8
,!: - -10000
"f 7
T 7 X 10-•MC
!', ·-
8
Abo, 011ce all of the signal lies in the range lwl !', f, the filter will he inelfective, i.e., f :$ T(211xl04).
So, T :!: 12.5,-:.
(c)
8nx10 4 1rr
4.26. First we show that X,(ei"') is just a sum of shifted versio11S of X(e'"'):
n = Mk, =0, ±1, ±2

= { :r{n), k
r
:r,[n]
0, otherwise
= (! ei(2de/M)) :r[n)
X,(e'"') =
00 1 Jl-1
= L M L :r[n]eil...,./M)•-;.,.
-=-oo '-0
= ! L .--oo
M'-1
L
l:=-0
oo
:r{n)e-,l.,-(2d/Mll•
1 Jl-1
= M ~ X (ei1.,-(2d/Jtll)
X,(e"") = ___
....
Additionally, X4 (e'"') is simply X,(e"") with the &equency am expanded by a factor of M:
L X,(Mn)•-;,.,•
=
..
L :r,(l]e-J(w/Jl)l
,__
107
(a) (i) X.{ei'-) u,d X,(ei'-) are sketched below for M = 3, WR= r/2.
Xs(•jw }
1/3
'' ,, ''
.,
,, ''
K (I)
,, '
' ,, ''
<
,, ''
-21t --1t 1t 21t (I)
{ii) X.(.,;"') and X,(ei'-) are sketched below for M =3, WH = "/4.
X 5 (eiW )
1/3
It (I)
(I)
(b) From the definition of X,(ei"'), we see that there will be no aliasing if the signal is bandlimited to
1r / M. In this problem, M = 3. Thus the maximum value of "'H is 1r /3.
4.27. Parseval's Theorem:
When we upsample, the added samples are zeros, so the apsampled signal z.[n] has the same energy as
the original z(n]:
..L Jz(n]l 2
..
=L 1:r.(n]l2 ,
-=-oo --00
and by Paneval's theorem:
Hence the amplitude of the Fourier trillllform does DOt c:lw,ge.

When we downsample, the downsampled sigDal :r,[n] has less energy than the original :r[n] because some
samples are discarded. Bence the amplitude of the Fourier transform will change after downsampling.
108
4.28. (a) Yes, the l}'flelll is liDear because ea.ch of the subblocks is liDear. The C/D step is defined by
z[n] = z.(nT), which is clearly linear. The DT system is an LTI l)'SUm. The D/C atep consistS
of converting the aequeace to impttlsa and of CT LTI filtering, both of which are linear.
(b) No, the system is not time-iD...-iaat.
For exu>ple, suppooe that h[n] = 6{n], T = 5 and z,(t) = 1 for -1 !, t ~ 1. Such a sysUm would
=
rault in z[n] 6[n] and 11c(t) = linc(r/5). Now suppose we delay the input to be z,(t - 2). Now
z[n] = 0 and 11,(I) = 0.
4.29. We can analyze the system in the frequency domain:
X(e jm) X(eZj!II ) x,.2;m 1H, (e j(,> > Y1 (e j(,> )

t2 H1(ej(,> ) ,2
Y,(.;,,) is X(e2i")H1 (ei-') d0WDS&D1pled by 2:
Y,(ei") = ½{X(e2;..f2)H, (ei"'') + X(el 2i(.,-2'l/ 2)B1 (ei<"-••>I•)}

= ½{X(ei")H1(ei"'2) + X(ei1"-••>JH1 (ei 1't-•l)}
= ½{H1 (ei"'2) + H1 (eiC'f-•lJ} X(ei")
= H2(ei")X(ei")
H2(e'") = ½{H1 (ei"'') + H,(eiCt-•l)}
4.30.
X,(jO) = 0 101 ~ 4000,r
Y(jO) = IOIX,(jO), 1000,, ~IOI!> 2000,r
Since only half the frequency band of X,(jO) is needed, we can alias everything past O = 2000,r. Hence,
T =1/3000 s.
Now that T is set, figure out H (ei") band edges.
w1 =O1T ~ w, =2,r · 500· .a\,.

w, =O,T ~ w, = 2,r · 1000· ~
X,(jO) = 0, 101 > f

.
. = 1
11,(t) =
1-~ z,(r)dr H,(jO) = 11
,
In discrete-time, we want
109
IH(e jm )I
-:zx 1t 211: (I)
arg(H(e jO> ))
(I)
-:ZX 1t 211:
-lt
4.32. (a) The highest frequency is 1t/T = 1t x 10000.

.i
r:
0
I:..,_, . ~· ..
... ... ...__... ..._..,.,.__1,
0
.
••
.
,.
I:
i ..,
(b)
_..,_,
... ... .... __ • .
... -..cy,..,.__,,~· .. ...
(c) To filter the 60Hz out,
1 31t
"'°=T!l=---2.--60=-
10,000 250
4.33.
11(n] = r(n)
Y(ei"'J = X(~) • X(ei"'J
therefore, Y(~) will occupy twice the frequency bud thai X(~) does if rn aliasing occurs.
U Y(e'"') 'I 0, -1t < w < 1t, then X(~) 'I 0, -j < w < j and so X(jSl) = 0, (!ll ~ 21t(IOOO).
Sincew=,OT,
11'
2 ~ T · 21t(lOOO)
1
T :5
4000
110
4.S4. (a) Since there is no aliasing involved in this process,"" may choose T to be any value. Choose T = l
for simplicitf· X,UO) = 0,101 2: 1t/T. Since Y,(jO) = H,(jO)X,(jO), Y,(jO) = 0,101 2: 1t/T.
Therefore, there trill be no aliasing problems in going &om 11,(t) to 11[n].
Recall the relationship"'= OT. We can simply use this in our system oonversion:
H(el"') =
__,.,,.
H(jO) = .-;art•
= ,,-;n;2, T=l
Note that the choice of T and therefore H(jO) is not unique.

{b)
5
cos ( ; n - i) = ½[ei<'fn-t) + .-j('fn-t>]
= !.-l(•/4)e-f(../2)n + !e-f(•/4) 0-;(.. /2)n
2 2
Since H(ei-') is an LTI syste,n, ""can find the respoDSe to each oftbe two eigenfunctions separately.
!l(n] = ½•-1(•/•l H ( e-f<••/21) .;< .. /2)n + ½ei<•l•l H ( 0-;<••/21) 0-;<••/2Jn
Since H(e'"') is defined for O 5 lwl 5 " we must evaluate the frequency at the baseband, i.e.,
=
5,r /2 => 51' /2 - 2,r ,r /2. Therefore,
y[n] = ½•-i(•/41 H (ei<••/21) eJ("/2)n + ½ei<•l•l H (•-;<••/21) 0-;(••l•I•

= ½ (ei1<••/2)n-(•/2)] +•-;(("/2)n-(•/2)])'
= cos (5ft2 n - ~)
2 ·
.
y[n)
0 n
.(
4.35. The frequency respoDSe H(e'"') = H,(jO/T). Finding that
H,(jO) = (j0) 2 + !uni + 3'
1
H(ei"') = (10jw) 2 + 4{10jw) +3
1
= -loo...'+ 3 + 40jw
4.36. (a) Since OT =w, (21t · lOO)T = J => T = .i.,
!
111
(b) The downsampler bas M = 2. Since 2:[n) is bandlimited to Ti, there will be 110 aliasing. The
frequency axis simply expands by a fador of 2.
*
For 11.(1) = 2:.(1) Y.(;O) = Xc(;O).
Therefore OT' ~ 2,r · lOOT' ~ T' = •·
4.37. In both systems, the speech was fihered first 10 that the subsequent sampling results ill 110 aliasillg.
Therefore, going •In) to ,i[n) basically requitt< ch•ngi11& the sampling rate by a factor of 3kHz/5kllz =
3/5. This is clone with the followiDg syatem:
1----,.,""'. cutoff
Igain,.3
LPFI
Digital=1tl3 I
1 - -- • . . ,
.
~S
4.38. x.c;n) is drawn below.
•
::tc{I) is sampled at sampling period T, so there is 1>n aliasing ill ::t[n).
.A -Jt
A'A. rr
•
Inserting L - l zeros between samples compresses the frequency axis.
(a)
The
~- -w/L wJL
filter H(ei"') removes frequency components between ,r / L and ,r.
. IO
. I\ -s/ L
&T /\
-~-;-)
wJL ct
The multiplie&ti011 by ( -1 )• shifts the center of the frequency band from 0 to ., .
• _,. " /. IO
112
The D/C conversion maps the range-.- to.- to the range -.-JT to .-JT.
4.S9. (a)
..... 0
h[n] = o, lnl > (RL-1)

Therefore, for causal system delay by RL - 1 samples.
(b) General interpolator condition:
11(0] = 1
h{kL] = 0, k =:!:1, :!:2, ...
(c)
(RL-11 AL-1
y(n] = L h(k]v(n - k] = h(O]v[n] + L h(n](v[n - k] + v[n + kj)
t=-(RL-1) ksl
This requires only RL-1 multiplies, (assuming h[O] = 1.)

(d)
n+(l<L-1)
y[n] = L v[k]h(n - k]
k,sn-(l<L-1)
If n = mL (m an integer), then w,, don't bave any multiplications since h[O] = 1 and the other
non-zero samples of v[A:] hit at tbe zero,; h[n]. Otbenrise the impulse response spans 2RL - 1
samples of v{n], but OA!y 2R of tb- are DOD-zero. Tberefott, there a... 2R multiplies.
4.40. Split H(eJw) into a lowpasg and a delay.
x, (I)
CID
x[n)
I
tL - Hu,<i"' )
Ideal Upsamplcr with gain

w(n]
I
e
-j., v[n)
♦ L ..!...i
I)
of I instead of L
Then we analyze the system as follows:

:i:[n] = :r.,(nT) DO aliasing assumed
1 T
tu{n] = i/<<nr) rate change
v(n] = -,[n - I] = I"'< T - IT) ,

1 ( nr delay at higher rate
y(n] = v(nL] = L"'< (nT - i)

113
4.41. (a) See figures below.

(b) Flom part(a), - see that
Y,(jO) = X0 (j(O - ~)) + X.(j(O + ~))

Therefore,
wvfNv
-Slt/4 -311:14 -11:14 11:/4
YJei"'J
311:/4 511:/4 o,
4/T
(I)
4.42. (a) The Nyquist criterion states that :r0 (t) can be ncooaed,.. long as
2.- 1
T ~ 2 x 2.-(250) ~ T :S 500·
In this case, T = 1/500, so the Nyquist crneriOD is satisfied, and :r0 (t) can be recovered.
(b) Yes. A delay ill t.ime does llOt c:bange the bandwidth ol the signal. Hence, 11.(t) has the sam
bandwidth and same Nyqwst sampling rate as :r0 (t).
(c) Consider first the follcrwing a::preaiolll far X(ei"') and Y(ei"'):
X(ei"') = ½x.c;o) Inc, = s!ox.c;soo..,J

Y(ei"') = ½Y.(jO) Ina, = ½•-•111u• x.(jO) Ins,
= _1_.-;..,2 x.c;soo.,)
500
= •-;..12 X(ei"')
114
Hence, we let
B(ei") = { 2eo, -;.. • lwl < j
otherwise
Then, iD the following figure,
""' < j
otherwise
x[n] y[n)
H
(d) Yes, &om our analysis abow,
4.43. (a) Notice first that
F.(jO)IH..,(jOJl•-;n', IOI :S 400,r

X.(jO) ={ E.(jO)IB..,(jO)l•-;n•, 400,r :S 101 :S 800,r
0, otherwise
For the given T = 1/800, there is no aliasing &om the C/D conversion. Hence, the equivalent CT
transfer function H.(jO) can be written as
H (jO) = { H(ei"Jl..,=nT, IOI :S 1r/T

c O, otherwise
Fllrthermore, since Y.(jO) = B.(jO)X.(jO), the desired tranfer function is

H.(jO) = { ,;n' • l!ll :S 400,r
0, otherwise
Combining the two previous equations, we find
H(ei"') = { e;<ooo..)', lwl :S "/2

o, 1r/2 :s lwl :s .-
(b) Some aliasing will occur if 21r /T < 1600,r. Howewr, this is fine as 1011g as the aliasing affects only
E,(jO) and not F.(jO), as we show below:
,
' ''
, ,, ' ' ,,
,
'
,, '
'I
I I
I ,.
, '
''
21t
115
ID order for the aliasing to DOt affect F,(;O), ft require
2...
-
T - 800,t >
- 400,r = -T >-
2..-
1200,t
The minimum 1,l ii 12001t. Far dlis choice, f t get
H(ei") = { t<,....>' • ~/i !..-Ci :S •

4.'4. (a) See the following figure:
X(c ID)
II)
(b) For this to be true, H(ei"') needs to filter out X(ei"') for ..-/3 :S lwl :Sr. Hence let wo = r/3.
Furthermore, we want
•/2
T =2..-(1000) =- T2 = 1/6000
2
(c) Matching the following figure of S(ei"') with the figure for R.,(;O), and remembering that O = w/T,
we get T3 = =
(2r/3)/(2000r) 1/3000.
II)
4.45. Notice fint I.hat since :r.(t) ii time-limited,
A= £ 10
#ic(t)dt = J: :r.(t)dt = X,(;O)Jo-o.
To estimak X,U · O) by DT pro •sing. "" need to sample only fast enollgh so that X.(; · 0) is not
aliued. Hence, f t pick
116
The resulting spectrum satisfies
Further,
X(ei"') =
..l:: z(n].
--oo
=
Therefore, - pick h(n] Tu(n], whicb males the system an accumul&tor. Our es\illlate A is the output
11(n] at n = 10/(10--<) =
lo", when all rJ the noa-zero Ample& of z(n] haft heeD added-up. This is
an C4Ct estimate giftD out aasumptiaa al both band- and time-limitedness. Since the aasumptiou c:an
nner he exactly satisfied, however, this method only giYeS an approximale estimate for actual signals.
The overall system is as follows:
X,. (I) • y[n] ).;;____A= y[ 100000)

CID h[n) = Tu(n)
T
f
= 1/10000
11o[n] = z[3nJ
111 [n] = z(3n + 1]
112(n] = z[3n + 2],
and therefore,
11o[n/3], n = 3k
z[n] ={ w,[(n -1)/3], n = 3k + 1
112[(n - 2)/3], n = 3k + 2
(b) Yes. Since the bandwidth of the tilters are 2,r /3, there is no aliasing introduced by down.sampling.
H;nce to reconstruct z[n], - need the system shown in the following figure:
YnlnJ., f3 •I E 0 z>I l
YJ [n].,, t 3 I
1----'• E 1(2)~~1
Y7[nJ.,, t 3 1-----'•I Ejz)I t

(c) Yes, z[n] c:an he reconstructed from 113[n] and w,[n] as demonstrated by the following figure:
x[n] wJnl y. (nl •• [n) •InJ

H 3 (z) i2 f2
w .[nl y, (nl •· [n] s(n]
H 4 (z) 12 f2 H4 (z)
117
In the following discussion, let "'• [n] denote the even samples of :r[n], and :r.(n] denote the odd
samples ot :i:(n]:
= { 0,:i:(n], ne-.en
n odd
n even
= { ~in], nodd
In the fignre, .,[n] =:i:(2n], and hence,

_ { :i:[n), n e-.en
- 0, nodd
= :i:.(n]
Furthermore, it can be verified using the IDFT that the impulse respoll.Se '4(n] corresponding to
H,(ei"') is
"4(n] = { -2/(jrn), n odd .
0, othennse
Notice in particular that every otner sample of the impulse respoll.Se '4[n] is zero. Also, from the
form of H 4 (&"'), it is clear that H 4 (e'"')H4 (e'"') = l a.nd hence h,[n] • '4[n] 6[nj. =
Therefore,
{ 11,(n/2], n even
11,(n] = 0, n odd
{ w 4 (n), n even
= 0, n odd
{ (:r • h.)[n], n even
= 0, nodd
= :i:0 [n] • "4[n]
where the last equali~ follows from the fact that h.[n] is non-zero only in the odd samples.
Now, s[n] = 114 {n]•"4(n] = :i:0 (n]•h.(n]•"4(n] = .rrlnl. and since :r[n] = :r,[n]+:r0 [n], •ln]+113{n] =
:r[n].
4.47. Sampling random processes
¢ •••• (r) = E(:i:,(t):i:;(1 + r)).,. P, ••• (n) = L: ¢,.,.(r),-;o, dT
(a)
¢ •• [m) = E(:r[n]:i:"[n +ml)= E(:i:,(nT):r;(nT + mT))

= ¢ •••• (mT), i.e., sampled antocovariance
(b) Since ¢ .. (m] is a sampled ¢ •••• (T)
1 ~
P..(w)=T L.J P•••• ("'
T+T2rk)
K=-oo
(c) If
P•••• =o, for lwl 2: r
then
118
-t.48. {a)
._,•• (.-) = E(z,(t)z,(t + .-)

•••Im) = E(z(n]z(n + m)l = E(z,(nT)z,(nT + mT))
= ••,.,(mT)
(b)
2,rr)
Therefore, we require that f
P..(w)=T1 LP,,.,
~ Clc,.
... ("'
T+T
--
(c) For the spectrum of F"ig P3.&-2 it is dear \hat if T = ii; then the discrete-time power spectrum
will be wbi1e, as shown ill the figure above.
pxx ( m)
I I I
I
I \
'' I
I
'' I '' I '' I ''
I
I
>
I
'
I
V
\
I
' 4>,,[m] = 0, m-# 0 but 4>,,[m] 4>,,,.(mT). Therefore, any =
analog signal whose autocorrelation func:t.ion bas zeros equally spaced at intervals of T will yield a
white discrete-time sequence is sampled with sampling period T. For example, for Fig P3.&-l:
sill Clc,T Clc,mT
4>...,(.-) =-y;- * 4>.,(m) = sillrmT
sill,rm
ifT= ~ 4>.,[m] = rm/n. = o, m-#0
4.49. (a) Coasider the following plots.
'b
Sysran I: Sy11e1112:
-
- ~.
/K.
;:vK%\.
•
-
-&fm
m) m "b •
119
=
l,11(t) 112(!): Convolution is a linear process. Aliasing is a linear process. Periodic convolution is
equivalent to convolution followed by aliasing.
¥1(t) 'F r(t): System 2 at Siep l shows X;UO). This is clearly not Y1UO). Y,(jO) is an aliased
version of X,(jO)
(b) Now,
15(211) 15(211) 'b
' 1t 0 30(2,1) 12 -l0(2Jr) 0 10(2Jr) Q
(c)
:(t) = A cos(30,rt)
3 l
4Acos(30.-t) + 4Acos(3. 30,-t),
:3(t) =
v[n] = ~A cos (~.-n) + ¾A cos(¾=)

v[n] = :3[n]
11[n] = z(n]
We can see here that sometimes aliasing won't be destructive. When aliased sections do not overlap
they can be reconstrucied.
(d) This is the inverse to part (c). Sin~ multiplication in time corresponds to convolution in frequency,
a signal : 2 (t) has at most two times tbe bandwidth of :(t). Therefore, :,;112 will have at least ½the
bandwidth of z(t). If we nm our signal through a box that will raise it to the 1/M power, then
the sampling rate can be decreased by a factor of M.
4.50. (a)
:,[n) = :.[n) • h,oh[n]

huh(n] = { l, O~n~L-1
0, else
Ii H
-
(ei") = sin(wL/2) -i!L-t,._/2
sin(w/2) e
(b) The impu!,e response h,;,. (n] com!SpODds to tbe eo11volution of two rectaDgular sequences, as shown
below.
• -L
A' L •n
= 1/L.
• _j,d
2
II
J,d
2
1
*
•n •
- J,d
2
II
J,d
2
I
•n
120
2
H (ei") _ .! (siD(wL/2))
Im - L sill(w/2)
(c) The frequency response of-...orcier-hold is llatter ill the region [-.,/L,.,/L], but achieves less
out.<lf-balld attenuation.
4.51.
,p.. (n] = ,:(n] • ,:[-n]

+.u(ei"') = X(e'"') • X"(ei"')
Tb• bandwidth of +,.(ei"') i.s no larger than the bandwidth of X(ei"). Therefore, the outputs of the
sys\ems will be the same if H2(ei") is an ideal lowpau 6her with a cutoff offr/L.
4.52. The idea here i.s to aploit the fact that every other sample supplied to h(n] ill Fig 3.27-1 is zero. That
is,
11, (n] = h[n] • w[n] =

..
L w[n - k]h[k]
= lltu(n] + bw(n - 1] + cw(n - 2] + dw(n -3] + ew[n - 4)

={ az(n/2] + <=((n/2) - 1] + e((n/2) - 2), n even
bo:((n/2) - (1/2)) + cu((n/2) - (3/2)), n odd
w 1 (n]
= { hi(n/2) • ,:(n/2], n ewn
0, n odd
= { h [0),:(n/2] + h1(1],:{(n/2) -1) + h (2J,:((n/2) -
1 1 2), newn
0, n odd
h,(n/2) • ,:{n/2), n eftD

w,(n) = { 0, n odd
= { h2(0],:[n/2) + h2[1):i:[(n/2) - 1] + h,[2]:i:[(n/2) - 2), neven
0, nodd
121
Comparing w,[n], tui(n) with ,i[n) above:

=
w[n) tall give even samples if h 1 [0) a, h 1 [1] =c,h,[2] =e. Similacly, w,(n] tall give the odd samples
if h,(n] deLays tui(n] by one sample, i.e., h 3 (0) =O,h3 (1) =O,h,[2) =O. Thus
tui(n) = { h,(O)z((n - 1)/2) + hz[l]z((n - 1)/2 - 1) + hz(2]z((n - 1)/2 - 2), n even
~ n~
hz(O) =b, h,(1] =d, h,[2) =0
4.53. Sketches appear below.

(a) Yust, X(ei"') is plotted.
The lowpass filter cuts otr at j.
• -1C/2 rt/2 I Cl)
The down.sampler expands the frequency axis. Since Ro(e'"') is bandlimited to i;, no aliasing
occurs.
y[y -lt lt Cl)
The upsampler compresses the frequency axis by a factor of 2.
The lowpass Jilter cuts otr at j ~ Yo(ei"') = Ro(ei"') as setched above.

(b) Go(e'"') = ½(X(e"')Bo(ei"') + X(ei<"'+•l)H (ei<w+•l))
0
122
(c)
Yo(.,;,,) = ½Ho(.,;,,) (X(.,;w)Bo(.,;w) + X(eA-tµ,.{.,;r,-+"'l})
Yi(.,;,,)
-
½s,c.,;wi (xc.,;,,JH,<.,;-,1 + X(~)Jr.~l)
Y(.,;w) = Yo(.,;,,) - Y,(.,;w)
= ½xc.,;-,1 [S:<.,;,,1-a:c.,;-,11
+ ½X (ei<-l) [s.,(.,;w )Ho(ei<__,, _ .....)Bi{~)]
..,
n,,. 1li1sing terms always C111cei. Y(ei-') is proportkmal•X(«>");fi14<e""'}-JP.(.,-..X is a
amstaDt.
=
xc.,;w) o, ... /3 :S lwl :S .... :r:[n] cu be tlioagbt <i M aa Ci ,ilal...,L De -.,,nwh is to
delermine whether no is odd or ewn, ti.m sample ., u,ai no is - IA, • • : • • ilur; alter.
Thii reco,ers a.[no].
4.54. (a) In the cue where no is not lmcwn, we "-mine whether ii • - s oliii a ~
i[n] = :r:[n] - M[s - ...,J

X(ei°'l = X(e'"'l-•--
xc.,;wi1... , = I: .,1..1c-,-,-
n
X(ei<•t2>1 = -A(-j)""
If the result is real, no is even. If the rsult ;. imaginary, no a oU

(b) If no is even, sample i[n) so that the even-numbered sequeme- ...... are.-. a...,,. ll' ni,; iis odd,
sample so the odd-numbered samples are oet to zero
(c) Filter the sampled sequence with a lowpass filter with cutoff mot t -./l. am v-r '- Tiis lir an
exact procedure if ideal filters are used.
4.55. (a)
s.e.-en
u,(n] = { :r::r1 [n/2],
2 ((n - 1)/2], ir.....W
:r, [n] = u,(2n]
:r,(n] = w[2n + 1]
~2 tp]
w[n]
~n+I]
The system is linear, time-..a,ying (due to clcwnAmpling), ..w-- rf (._ to I(&+ ID, ad llla!lle.
(b)
T =ON... =2,r x...5000 =lv.....--. TLwi =2r,r ..,-

.,..
!
123
To avoid aliasing in Jlc(I):

L1r
T
2(),r
"" = T
= Loe
L=22,
(c) The Fourier transforms ""' sketched below.
_',,/&/. .vfv.
-lt II (I) -a: 11 (I)
--KIL
~ 11 IL
'"' "
i~ -1t1L 11 IL
O
"'
AhrLPF
•' Ar ' , tk
-11 -KIL II IL II (I) -r. -xlL "IL
LB/2T
"
I •
(I)
After cosine
modulalion
.. /\i'.A .. .. Ll 1Ll ..
-II -(I) I "' I a: "' -It ~ "'2
LB/2T
1t "'
AhrHPF
.,;J
-a --(1)1
i:h.'
"' I 11 "'
,./l-It ~
1 [\,_
"'2 1t "'
I l:ur.
I fv1
(d) To geaeralize for M clwmels, - would ...., the same modalalors, but - would choooe a larger
value of L t.o make room for additional spectra above the lower frequency boUDd. If the • -
124
=
bound remained 2,r · 10", L would become L 20 + M for M channels.
A branch al the TDM demultiplexing system would be:
w[n]
li[n+k]
4.56. Since we want W(ei-') kl eqaal X(eiw), Ulen H(ei-') mun compens,ue for die drop offs ill H .. Ufl).
4.57. (a)
E(e) =/ ep(e)de = ...•1 f "''

-l>/2
2
•
2
ede = ~Lt>;•
/>/2 =0
~ = E(e, - 0) = t;.1 f "''

-l>/2
2
•
e de=
e>t;. L1>;
3
1>1• t;. •
2 = 12
E(e[m])E(e[n]l, m ¥- n
r[m, n) = E(e[m)e[n]) = { E(e'[n]l, m =n
t;.2
r[n,m) = r[n - m] = 12 o[n - m)
(b)
(c) Let e,[n] be die output noise.
e,[n] = L h[k)e[n - k)
•
The variance of :[n] is .,..;ghted similarly so die SNR does not change. SNRout =12~.•
125
(d) Jfn] = z[n]e[n]

E(/[n]) = E(z[n)e[n)) = E(z[n])E(e[n)) =0
11} =E(/2 [n)) = E(z2 [n)e2 [n)) 2 2
= E(z [n))E(e [n)) = 11!11!
r,[n, m) = E(z(n)z[m)e[n)e[m)) =E(z[n)z[m)) · E(e[n)e(m))
(e)
(f) Using the results of pan (c).

2
" «. -17
-
2 (
I -
l -) - - -
I-a 4 -1-o4
,r.,r.
Again, the ffriance of z[n] is weighted by the same factor, so the SNR does not change.
12
SNRout = 62 -
4.58. Fim, notice that since 11,(t) =

z1(t)z2(t), Y,(jO) =
t,;(X1(jO) • X2(jO)), and so Y,(jO) = 0 for
JOI::: 11,r/2 x 104. Hence the Nyquist rate T = l/55000s.
Choose System A and B such that w1[n) = a:r,(nT) ud w,[n] = bz2(nT).
For System A, we need to resample such that
M T 2x 10-• 10
-=- = =-
L Ti 1/55000 11
I m
·I n
w I [n)
•
I ·I
x, [n) • I
L= 11 Cllc= 11/ll
I M= 10
For System B, we need to resample such that

M T 2 x 10-< l
L = T, = 1/55000 = 11
L=ll Cllc=ll/11
System C is simply the identity system.

4.59. The speech is lint sampled at 44.l Uh, and we wish to resample it so that the samplillg rate is at S
kHz. There are II<' •Ii asing .ffects anywhere ill the syslem. Hence
L 4t.1 441
-=---
M 8 80
We simply make L = 441, M = 80, and"'• = "/441.
126
4.60. n,, and n, has to be chosen such that

(a) The region l!ll Sn, maps to lwl S 1r/4:
!lpT =4" ==> Op =44,r

(b) No aliasing ocaus in the region l!ll S Op daring sampling:
2,r
7 - n, = 0p = n, = 2.-(4. 44) - 44,. = 308r
4.61. (a)
V(z) = H 1 (z)(X(z)- Y(z))
U(z) = H2(z)(V(z) - Y(z))
Y(z) = U(z) + E(z)
H 1 (z)H2(z) X l E( )
= 1 + H2(z)(l + H,(z)) (z) + 1 + H2(z)(l + H,(z)) z
Substituting H,(z) =1/(1 - .. - 1 ) and H2 (z) =z- /(1 -
1 z- 1 ), we find
H.,(z) = z-•
H.,(z) = (1- z- 1 ) 2
Hence the difference equation is y[n] = :r[n - l] + /[n], where

/[n] = e[n] - 2e[n - l] + e[n - 2].
(b)
P11(ei") = .,:1s,,(ei")I'
= ..:1<1 - .-;..,i•,·
= ..:(1 - .-;")'(l - e'")'
= ~(2 - 2cos(w)) 2
= o-!(4sin2 (w/2)) 2
= 16o-! sin4 (w/2)
The total noise power cry is the autocorrelation of /[n] evaluated at 0:
o-} = E[(e[n] - 2e[n - l] + e[n - 21) 2]

= E[e2 [nil + E[-2e 2[n - ll] + E[e[n - 2]2]
= fia;,
where we have used linearity of expectatiolls, and the fact that since e[n] is white, E[e[n]e[n-.1:]] =0
for k ;,! 0.
ee
K CO
127
(c) Since X(ei") is bancllimited, :i:[n] • h3 [n] = :i:[n]. Bence,
111[n] =11(n] • ho[n] =(:i:[n - l] + /[n]) • h3 [n] =:i:[n - l] + g[n],

where g[n] is the quantization noise in the region lwl < 11/M.
(d) For a small angle :i:, lin:i: "':i:. Therefore,
u: = 2i
1 1·'.,,,,"' .,:c2uw/2)'""
"' 2 1·'"'
1 r,(?.w/2)'""
,r s/11
~"'" I·'"'
= 2.- 5 __ ,,,,
= SM• -·-
~11•
(e) X,(;O) must be suflic:iently ba.Ddlimited that X(ei") =

X,(;OT) is zero for lwl > 1r/M. Hence
=
X,(;O) 0 for IOI> 11/MT.
Assuming that is satisfied, 11.[n] = :i:[Mn - l] = :i:,(MTn - T).
Downsampling does not change the variance of the noise, and hence tr,- a! =
P.. (ei") = P11 (ei" 1"')
= loo! sin' (w /2M)
I
4.62. (a) (i) The transfer function from :i:[n] to y.(n] is
Hence y.(n] = :i:(n - 1].

(ii) The transfer function from e(n] to 11,(n] is
H,,(z) = l _, = 1-,-1
1 + 1!,-1
So
P,. (w) = P,(w)H,,(_,;..)H.,•-;w
= ~(l - •-;.,)(l - _,;..)
= ~(2 - 2cos(w))
(b) (i) :i:[n] contributes ODly to 1/1 [n], but not Wz[n]. Therefore
111s[n] =
:i:[n - 1]
r,(n] = :i:[n -2]
128
(ii) In pan(a), the dilference equation desaibing the sigma-delta noise-shaper is
y(nJ =:[n - l] + e(nJ - e(n - l].

So here we apply the dilference equation to both &igma-delta modulators:
111.(nJ = e1(n) - e1(n - l]

'2c(n] = e1(n - l] + e2[n) - e 2[n - l]
r.(nJ = 111.[n - l] - ('2c(n] - '2<1" - l])
= -e,[n] + 2e2(n - l] - e.(n - 2]
H..,(z) = -(1- z-1i2
P,.(w) = <r.(2 - 2cosw)2
!
129
Transform Analysis of Linear Time-Invariant Systems
131
5.1.
- { 1, 0 $ n $ 10,
II [n 1- 0, otherwise
Therefore,
Y(ei-') = ,-J.., ~ t"'

llD2
This Y(el-') is full band. Therefore, since Y(~") = X(~")H(~"), the Oll!y possible z}n) and..,,. that
could produce 11(n] is z[n] = 11[n] and"'• = 11.
5.2. We haft 11[n - l] - Jf11[n] + 11[n + 1] =z[n] or ,- 1Y(z) - ¥Y(z) + zY(z) =X(z). So,
1
H(z) =
z- 1 - !p + z
z
= (z - !Hz - 3)
_! !
= _.L+....L.
z-! z-3
(a)
Im
1 zeroatz=-
113 Re 3
• (b)
-tz-1 !z-1
H(z) = _l__..,l_z-_• + _l.._~...,3-,-...,,
3
Stable ~ ROC is ! $ l•I $ 3. Therefore,
5.3.
1
11[n - l] + 11[n - 2] = z[n]
3
,-
1
Y(z) + ~z- 2Y(z) = X(z)
Y(z) 1
H(z) = X(z) =
z-1+ 1.-•
z
H(z) =
l + 1,-1
132
i) ½< lzl, h[n] = (-½)n+1 u{n + l] ~ answer (a)

ii) ! > lzl,
5.4. (a)
z(n) = (i) n u(n) + (2)Ru(-n -1)

1 z 1
X(z)= 1-lz-• - z-2' 2<l•l< 2
2
11[n] =6 G) n u(n] - 6 ( ¾) n u(n]

6 6 3
Y(z) = 1 - lz-• - l - i,-1'
2 •
4 < lzl
(l - !z-1)(1 - 2z- 1) l - 2z- 1 3
2 ---.---:- lzl >
_}z-1
2
- 1 - lz-1'
•
4
Im
lzl > 314
(b}
l 2,- 1 3
H(z) = 1- 1,-1 1- !,-1' 1•1 > 4
• •
h(n] = (43)n u(n) - 2 (3)n-l
4 u(n - 1)
(c)
H(z) - Y(z) - 1 - 2z-1

- X(z) - 1 - 1 !z-
Y(z) - ¾•-'Y(z) = X(z) - 2z-1X(z)
11(n) - !11[n - 1) =z(n) - 2z(n - l)

4
i33
(d) The ROC is outside Jzl = ¾, which includes the unit circle. Therefore the system is stable. The
h[n] we found in part (b) tells us the system is also cauaal.
5.5.
11(nJ = (½) •u[n)+ (¼) "u(n) +u(n)
1 1 I
Y ( z ) = - ~ - + - ~ - + -1 lzl>l
I- tz-•
1 - ¼z-1 I - z- '
:r(n) = u[n]
1 .
X(z) = I - z-1' lzl > I
H(z) - Y(z) - 3 - 11-,-1 + J,-2 lzl > 3
I
- X(z) - 1- f.z- 1 + f,;z- 2 '
(a) Cross multiplying and equating ,-1 with a delay in ti?>•=
7 I 19 2
11[n - I]+ 11[n - 2] = 3:r[n] -
11(n] -
12 12 6 :r[n - I]+ 3:r[n - 2]
(b) Using partial fractions on H(z) we get:
I ,- 1 I ,- 1 I
H(z) = 1 _ 1,-1 - I - 1,-1 + I_ 1,-1 - 1 _ 1,-1 + I, l•I > 3
3 3 4 4
So,
= (3I)" u[nJ - (l)n-l (I)" (1)•- 1
h[n] u[n - I]+ u[n] - u[n - I]+ 6[nJ
3 4 4
(c) Since the ROC of H(z) includes Jzl = I the system is stable.
5.6. (a)
l I
2 < fzl < 2
(b)
1 -.,.,..,...--2- - - , -
Y(z) - -,--..---
. - (I - ½z- 1)(I - 2z-1 )
This has the same poles as the input, then!l'ore the ROC is still ½< lzl < 2.
(c)
Y(z) _2
H(z) = X(z) = 1 - z .,. h(n] = 6[n] - cf(n - 2]
134
5. 7. (a)
5
:z(n] = 5u(n] * X(z) = _ z-l, lzl > l
1
y(n]= (2(D" +3(-¾)")u(n]•Y(z)= l-½z-' + l+iz-•' lzl >

3
4
Y(z) 1-z-1 3
B(z) = X(z) = (1-½z- 1 )(1 + Jz- 1 )' l•I > i
Im
112 Re
(b)
1-z-1 -1 ! 3
H( z) = -,--,-----e---,------.--,,.. = _ _,.._,.. + • l•I > 4
(1- ½z- 1 )(1 + ¾z- 1 ) (l - }z- 1 ) (1 + }•-•)'
h[n] = - 2(l)"
5 2 u(n] + 5 - 4 u(n]
7( 3)"
(c)
Y(z) + ~•-'Y(z) - ;z-2Y(z) = X(z) - ,-1X(z)

1 3
y[n] + -y(n - l] - -y[n - 2] = :z[n] - :z[n - l]
4 8
5.8. (a)
y[n] = 3211[n - l] + 11[n - 2j + :z:[n - l]

3 1Y(z) + ,-2 Y(z)
= + •-• X(z)
Y(z)
2z-
Therefore,
Y(z) ,-, z- 1
H (z) - - - ,--...---,---:c
- X(z) - 1- Jz- - -,c-~-:-:-,----.--,-
1 -z- 2 - (1- 2z- 1)(1 + ½z-1)' lzl >2
Im
1 zeroalz•-
-1/2 Re 2
!
135
(b)
izl > 2
h{n] =: [c2r - (-½) ") u[n]

(c) Use ROC of½ < fzl < 2 lillce the ROC m- iDclude fzl = l for a stable system.
h[n] =- 52(2)"u[-n - l] - 2 ( - l)" u[n]
5 2
5.9.
5
y[n - l] -
211[n] + 11[n + l] = z[n)
z- 1 Y(z) - ;Y(z) + zY(z) = X(z)
Y(z)
H(z) = X(z)
z-•
= (l -2z- 1 )(1- ½z-')
a
= 1-2,-1
Im
1 zeroatzs-
112 Re 2
Three regiOIIS of conversence:
(al l•I < ½=

h[n] 2 -
=--(2)"u[-n
3
l] + - 2(l)"
3
- u[-n - l]
2
2
h[n] = --(2)"u[-n - l] - - -
3 3 2
2(l)" u[n]
Includes l•I = l, so this is st.able.
136
(c) 1•1 > 2:

h(n) = 32(2)"u(n) - 2(l)" u[n]
3 2
ROC outside of largest pole, so tms is c:aasal.
5.10. Figure PS.16 shows two zeros and three poles inside the wut circle. Since the number of poles must
equal the number of zeros, there mast be an additioaal zero at z = 00.
H (z) is c:aasal, 10 the ROC lies outside the largest pole and includes the wut circle. Therefore, the
systemisalsostahle.
=
The inverse system switches poles and zeros. The inverse system could have a ROC that includes 1•1 1,
making it stable. However, the zero at z =
00 of H(z) is a pole for H;(z), so the system H,(z) CaDDot
be causal
5.11. (a) It connot be detet-rn.iMd. The ROC might or might not include the wut circle.
(b) It connot be determined. The ROC might or might not include z = 00.
(c) Foue. Given that the system is causal, we know that the ROC must be outside the outermost pole.
Since the outermost pole is outside the unit circle, th~ ROC will not include the wut circle, and
thus the system is DOI stable.
(d) True. H the system is stable, the ROC must include the wut circle. Because there are poles both
inside and outside the unit circle, any ROC including the wut circle must be a ring. A ring-shaped
ROC means that we have a two-sided system.
5.12. (a) Yes. The poles z = :!:j(0.9) are inside the wut circle so the system is stable.
(b) First, factor H(z) into two parts. The first should be minimum phase and therefore have all its
poles and zeros inside the wut circle. The second part should contain the remaining poles and
zeros.
l +0.2z- 1 1- 9,- 2
H(z) = 1 + 0.81.- 2 I
minimum phase poles & zeros
outside llllil circle
Allpass systems have poles and zeros that occur in conjugate reciprocal pairs. H we include the
factor (l - ,,- 2 ) in both parts of the equation above the first part will remain minimum phase
and the second will become allpass.
H(z)
= (l + 0.2z- 1 )(1 - tz- 2 ) . 1- 9z- 2
I+ O.Slz- 2 1- l•-•
= H1(z)H,.(z)
5.13. An a.rid,,: Technically, tms problem is not well defined, since a pole/zero plot does not wuquely
determine a system. That is, many system functions can have the same pole/zero plot. For example,
consider the systems
H1(z) = •-•
Hz(z) = 2.r- 1
Both of these syswms haft the same pole/zero plot, umely a pole at zero and a zero at iDfinity.
Clearly, the system H1 (z) is allpass, as it passes all frequencies with wuty gain (it is simply a wut
delay). However, one could ask whether H 2 (z) is allpass. Looking at the standard definition of an
137
allpaas system provided ID this chapter, the answer would be no, since the system does not pass all
&equencies with •nit11 gain.
A broader definition of an allpass system would be a l)'llem for wbic:b the system magnitude respome
IH(el-')j = o, where a is a real constant. Such a system would pass all &equencies, and scale the output
by a constant factor a. Ill a practical setting, this definition of an allpass system is satisfactary. Under
this delinitiOD, both systems H 1(z) and B 2(z) woaJd be considered allpua.
For this problem, it is assumed that none of the poles or seros shown in the pole/sero plots are scaled,
10 this issue of uiDg the proper definition of an allpass l)'llem does not apply. Tbe standard definition
of an allpaas system is nsed.
Solution:
(a) Yes, the system is allpaas, since it is of the appropriate form.

{b) No, the system is not allpaas, since the sero does 1101 occur at the conjugate reciprocal location of.
the pole.
(c) Yes, the system is allpua, since it is of the appropriate form.
{d) Yes, the system is allpass. This system colllists of an allpass system in cascade with a pole at sero.
The pole at sero is simply a delay, and does not c:baage the magnitude spectrum.
5.14. (a) By the symmetry of z 1 [n] we kaow it has linear phase. Tbe symmetry is around n = 5 so the
continuous phase of X 1 (e''") is arg[X1 (~w)] = -S.,. Thus,
. d { . } d
grd[X,(e'w)] = - dw arg[X,(e'w)] = - dw (-S.,} = 5
3 x,[nJ
2
1
1234.56789 n
(b) By the symmetry of z2[n] we know it has liaear phase. Tbe symmetry is around n = 1/2 so we
kaow the phase of X 2(~w) is arg[X2(~] -w/2. Thus, =
grd[X2(~w)] = -~ {arg[X2(~w)]} = -~ {-~}
dw dw 2
= !2
312
3/4
3/8
••• • ••
-2 -1 0 1 2 3 n
5.15. (a) h[n] is symmetric about n = 1.
B(~) = 2+e-""+2e-2;w
= e-""(2e'W +I+ 2e-iw)
= (I+ 4cosw)e-;w
138
A(w)=l+4a11w, a=l, /J=O

Generalized Linear phase but Dot Linear Phase liDce A(w) is Dot always positive.
(b) This sequence bas no even or odd symmetry, '°
it does not possess generalised linear phase.
(c) h(n] is symmetric about n = 1.
H(ei'-) = 1 + 3e-;., + e-2Jw
= e-;.,cel" + 3 + e-;.,)
= (3 + 2 coow)e-;.,
A(w) = 3+ 2a11w, a= 1, /J= 0
Generalized Linea, phase k Linear Phase.
(d) h(n] has even symmetry.
H(~) = 1 + •-;w
= .-j(1/2)w(e'(l/2)w + e-i(l/2)w)
= 2coo(w/2)e-i0/2>w
1
A(w) = 2 coo(w/2), a=
2, /J = 0
Generalized Linear Phase but Dot Linear Phase since A(w) is DOI always positive.
(e) h(n] has odd symmetry.
H(e'"') = 1 - •- 2'"'
= •-'"'(e'"' - .-,.. )
= e-1""2i sin""
= (2siDw)e-i"'+if
A(w)
.
= 2S1Dw, a= 1, /J =
.
2
Generalized Linear Phase but Doi Linear Phase since A(w) is not always positive.
5.16. The causality of the syslem caDDot be determined &om the figure. A causal system h 1 (n] that has a
linear phase respoDSe LH(ei•) = -av,, is:
h 1 (n] = .S(n] + 26(n - l] + 6(n - 2]
H1(e'"') = 1 + 2e-;., + .-;:i.,
= .-,.. (~ + 2 + .-,.. )
= e-1"'(2 + 2cos(w))
IH,(e'"')I = 2+ 2cos(w)
LH1(e'"') = -w
AD example o( a non-ausal system with the same phase response is:
h2(n] = 6[n + l] + 6[n] + 46(n - 1) + 6(n - 2] + 6[n - 3)
H2(e'"') = ~ + 1 + 4e-;., + .-J2w + .-;s.,
= •-;.(.;:i.., + ~ + 4 + •-;w + .-,-...)
= •-'"'(4 +2coo(w) + 2coo(2w))
-
IH2(~)I = 4+ 2CXll(w) + 2coo(2w)
LH2(e'"') =
Thus, both the causal sequence h,(n] ud the DOD-caasal sequace h2(n] have a liDear phase respoDSe
LH(e'"') = -aw, where a= I.
139
5.17. A minimum phase system Is ooe which has all its poles and zeros illside the wlit circle. It is causal,
stable, and has a causal and stable in-.e.
(a) H, (z) has a zero outside the llllit circle at z =2 ID it ii DOI minimum phase.
(b) H2(z) is minimum phue lince its poles and sero. are inside the unit circk.
(c) Bs(z) is minimum phue lince its poles and seros are inside the UDit circle.
(d) H,(z) bas a zero outside the UDit circle at z =
00 ID it la DOI millimum phase. Moreover, the
ilrRr.se system would no& be causal due to the pole at iwity.
5.18. A minimum phase system with an eqail'llleut magnitude spectrum ean be found by analyzing the system
fmictiOll, and rellectin,g all poles are sero. dial are outside the wlit circle to their COlljugate reciprocal
locat.i0111. Tim will lDOft them illlide the Wlit circle. Then, all poles and uras for H ,..,.(z) will be
inside the llllit circle. Note dial a ICAle factor may be introduced wh• the pole or zero is rededed
inside the UDil circle.
(a) Simply rellect the zero at z = 2 to Its oanjugate reciprocal location at z = ½- Tben, determine the
scale factor.
H-(z) =2 G: t:=:)
(b) First, simply reflect the zero at z =
-3 to its conjugate reciprocal location at z = -!- Then,
determine the sea.le faaor. Tbis NSlllts in
The (I+ ½z- 1) terms cancel, leaving
Note that the term ;h does not alfect the frequency response magnitude or the system. Con-
sequently, it can be remo,ed. Thus, th~ remaining t"'1l! has a zero inside the unit circle, and is
therefore minimum phase. Aa a result, - are left with the system
(c) Simply reflect the zero at 3 to its conjugate reciprocal location at } and reflect the pole at f to its
conjugate reciprocal locatioll at ¾. Then, determine the scale factor.
= -94 (1- 1,-

1 {l - lz-1)
H,..,.(z) -{I - )¾z-1) J
5.19. Due to the symmetry of the impulae ~ . all the systems have generaliz.ed linear phase of
argfH(e"")] = fJ - ,...., where n. ii the point or symmetry in the impulse rapoase graphs. Tbe group
delay is
To find each system's group delay - need only find the point or symmetry n 0 in each system's impulse
response.
140
grd [H1 (ei")] = 2 grd [H.(e-i"')] = 3

grd [H2 (ei"J] = 1.5 grd [H1 (ei")] = 3
grd [Hs(ei")] = 2 grd [H1 (ei")] = 3.5
5.20. (a) Ye.s. The system function could be a generalized linear phue system implemenled by a linear
constaDkoellicient cWferential equaiion (LCCDE) with real coefficients. The seros come in a
set "' four: a r.ero, iu CODjugate, and the WO COlljugate reciprocals. The pole-zero plot could
correspond to a Type I FIR linear phue system.
(b) No. This system function could - be a generalized linear phue system implemenled by a LCCDE
with real coelficiems. Since the LCCDE has real c:oellicients, its poles aad seros mmt come in
conjugate pairs. Howe-,er, the seros in this po1e-sero plot do not have corresponding conjugate
(c) Yu. The system function could be a generalized linear phase system implemenled by a LCCDE
· with real coefficients. The pole-zero plot could correspond to a Type II FIR linear phue system.
5.21. h,,(n] is an ideal lowpass filter with w, =i

(a) y(n] = z(n] - z(n] • hi,[n] ~ H(e-i"') = 1 - H1,.(e-i"')
This is a highpass filter.
1
.... . ..
-II -1114 0 ffl4 II II)
(b) z(n] is first modulaled by ,r, 1owpass filtered, and demodulated by .-. Therefore, H,,(ei'"') filters
the high &equency components cl X(e-i").
This is a highpass filter.
1
••• •••
. 0
-II --311/4 II QI
(c) h1,(2n] is a da,rnsampled version of the filter. Therefore, the &equency respoase will be "spread
out" by a factor of two, with a gain of ½-
This is a lowpass filter.
!
141
••• 112 • ••
0 K (I)
(d) This system apsamples lli,.!n] by a factor ol two. Therefore, the frequency ui5 will be compressed
by a faaor of two.
Thia is a bandstop lilter.
•••
- 1 ..--
••
.
-a-7Kl8 lt/8 0 a/8 7Jt/8 K (I)
(e) This system upsamples the input before passing it through h,,[nj. This effectively doubles the
frequency bandwidth ol H,,(.,;w).
This is a lowpass filter.
••• 112 • ••
-1112 0 ll (I)
5.22.
I - a- 1 z- 1 Y(z)
H(z) = 1
_ az-• = X(z), causal, so ROC is [zi > a
(a) Cross multiplyuig and taking the inverse transform
l
1,t(n] - a1,1(n - l] =z[n] - -z(n - I]
a
(b) Since H(z) is causal,.., blow that the ROC is lzl > a. For stability, the ROC must include the
unit circle. So, H(z) is stable for !al < 1..
(c) a=½ ·
m lzf > 112
.-112 Re 2
142
(d)
1 -,.-1
..
B(•l= _ ... _,- _ ...-,, l•l>ca
1 1
h{n) = (ca)•u[n) - !cai•-•u[n - 1)

a
(e)
. 1 - ..-,.-;,.,
B(e"") = B(z)I- = _ ..,-;,.,
1
IB(.,;,.,)1 2 = H(.,;,.,)B"(ei") = l - .. -,.~;,., · l - .. -•.,;,.,

1 - ... -,., 1 - ...,.,
1+:!,-1C()I..,)½
1
IB(ei")I = '
( 1 + a2 - 2a COS"1
= ! ("' + 1- 2aC()lw) ½
G 1 + a2 - 2a C()IW
1
= .
5.23. (a) Type I:
Jl/2
C()I0
Type II:
A(w)
= 1, cos.-= -1, so there are 110 restrictioDs. -

='E a(n)C()lwn
(Jl+l)/2 l
A(w) L
= _, b{n)cosw (n- )
2
cooO = 1, coo (n.- - j) = 0. So H(ei•) = O.
Type ill:
-
Jl/2
A(w) = L c(n) sillwn
siDO = 0, sinn.- = 0, so B(ei") = B(ei•) = O.
Type IV:
(Jl+l)/2 1
A(w)= L
_, d(n)sillw(n- )
2
sinO = 0, sin (n.- - j) ,f, 0, so just B(ei") = 0.
(bl Type I Typell Typem TypeIV

Lowpus y y N N
Bandpass y y y y
Higbpass I N N y
Bandstop y N N N
Dilferenti&IOr y N N y
143
5.24. (a) Taking the z-trausform o( both sides and reananging
B(z) - Y(z) - -¼
+ ,-•
- X(z) - 1- ¼z- 2
Since the poles and lel'0II {2 poles at z = ±1/2, 2 lel'0II at z = ±2} occur in conjugate reciprocal
pairs the system is allpw. This property is wy to r-cogniu mice, as in the system above,
the c:oellicients ol the nlllDf!rator and denominator z-polynomials get reversed (and in general
conjugated).
(b) It is a property of alJpw systems that the output energy is equal to the input energy. Here i.s the
proof.
..
-
N-1
:E 11,[nJ1 2
=
--
= :E
..1•
..!._
2,r -•
i11[n]l 2
IY(,:iw)I' dw (by Parseval's Theorem)
= 1-:2~ IH(eJW)X(,:iWJl dw
2
= 1-:2~ IX(e1W)l dw
2
(IH(,:iw)I' = I since h[n] is allpass)
=
..
L lz[n]l
2
(by Parseval's theorem)
fto:=:-00
N-1
-
L 2
= lz[n]l
= 5
5.25. The statement is /out. A non-causal system can indeed have a positive collStallt group delay. For
example, collSider the non-ausal system
h[n] = 6(n + 1] + 6[n] + 46[n - 1] + 6[n - 2] + 6[n - 3]

This system has the frequency respome
H(,:iw) = ei"" + 1 + 4e-;w + e-j2'.I + e-jlf.J
= ,-,w(,:i:i.., + ,:iw + 4 + .-jw + .-j2w)
= ,-,w(4 + 2cos(w) + 2cos(2w))
IH(,:iW)I = 4 + 2cos(w) + 2cos(2w)
LB(e'w) = -w
grd[B(eJW)] = 1
5.26. (a) A labeled pol~zero diagram appears below.

Im
1 zeroatz=-
.
X
Re
144
The table ol common z-transfarm pain gi- us

1
(r ,. llD'"'°n
. ) [ ] (rlin'"'°)z-
u n .-+ 1 _ (2, cos'"'°)z-• + r2z-•, lzl > r
which enables us io deriw, h(n).
1
.
/a{n) = (-.- - ) (r" lin'"'°n)u(n)
llD'"'°
rz- 1 rz- 1
B(z) =,,......,.,,.--,--,---:---:,
1- {2r a,s'"'°)z-' + r2z- 2 = {l - rz-
')'' lzl > r
Again, using a table loolcup g;...,. us
h(n) = nr"u[n)
Im
1 zeroalZ=•
5. 27. Making use of some DTFT properties can aide in the solution of this problem. First, note that
h 2 (n) = (-l)"h1 [n)
h2(n) = e-i•"hi[n]
Using the DTFT property that states that modulation in tbe time domain corresponds to a shift in the
&equency domain,
B2(~) = H, (eJ<w+•l)
Consequently, B 2 ( ~ ) is simply B 1 (ei'-') shifted by .-. Tbe ideal low pass filter has now become the
ideal high pass filter, as shown below.
-7"2 0 "'2
-lt -7"2 0
145
5.28. (a)
A 1
H(z) = (l- ½z-l)(l + ½z-l)' lzl > 2 h(n] ausal
H(l) =6~A =4
(b)
4 1
H(z) = (1- ½z- 1)(1 + tz- 1)'
lzl> 2
= (1/) + <fl
1 - ½z-1 1 + 1,-1
h(n] = -12
15
(1)''
-
2
u(n] + -8 ( - -1)• u(n]
5 3
(c) (i)
1 1 - 1,-1
:r:(n] = u(nJ - 2u(n -1] # X(z) =
1
_ •,_ 1 , lzl > 1
Y(z) = X(z)H(z)
1 -21,-1
_ ____ 4
= , -· l•I > 1
. _: - j•-')(l+½z- 1 )'
4
=
(1- z- 1 )(1 + tr')
3 1
= 1- z-1 + 1 + 1,-1
3
y(n] = 3u[nJ + (-½) •u(nJ

(ii)
:r:(t) = 50 + 10cos(20rt) + 30cos(40rt)

1
T= t=nT
40
,r
:r:(nJ = 50 + 10cos 2n _,_ 30conn
= 50 + s.,i(n•/2) + 5e-;(../2) + 1s.,i•• + 15e-;n•
Using the eigenfunction property:
11(nj = 50H(ei0 )+Sei<"" 121 H(ei<•l•>)+Se-;<n•/•I H(e-i<•l•l)+lSein• H(ei")+lSe-;u H(e-i•)
4
H(ei"') =
1- le-1f,I' - ¼e-;:aw
H(e'0 ) = 6, H(ei<~l•>j = 7 (H) - iH, H(e-i<•l•>j = 7 UH+ Hf,
H(e'") = 4, H(e-1 •) 4 =
y(n] =300 + 24v'2 cos ( in - tu,-
1
( D) + 120 cos ,rn
146
5.29.
21
H(z) = (1 - ½.-• )(1 - 2.-• )(1 - 4z-1)
l 28 48
= l - 1,-1
-- --+
l - 2.-1 l - 4z-1
2
Since we bow the Rq1lellCe =

is not st.able, the ROC must not include lzl 1, and since it is two-sided,
the ROC must be a ring. Tllia leaftS Clllly ODe poaible choice: the ROC is 2 < lzl < 4.
(a)
h(n] = (½)" u(n] - 28(2)"u[n] - 48(4)"u(-n-l]

(b)
1 28
H,(z) =I- ½z-' - 1- 2.- 1
48
H,(z) = I - 4z-1
5.30. (a)
M
M-2 M-1 n
-1/4
(b)
1
111(n] = z[n - (M - 2)] - M]
4z[n -
1
v[n] = w(2n] = z[2n - (M - 2)] -
4z(2n - M]
Let v(n] = z[2n],

1
y[n] = v[n - (M -2)/2]- :ci•[n - (M/2)]
Therefore,
1
g(n] = 6{n - (M - 2)/2]- .6[n - (M/2)], M nen
G(z) - z-<1>1->)/> - !z-"'12

- 4
5.31. (a)
H(z) = (l _
z-•
½•-• ){l _ 3,_ 1 ), stable, so the ROC is ½< lzl < 3
!
147
l
:[n] = u[n] ~ X(z) = _ z-l, lzl > l
1
1 l l
Y(z) = X(z)H(z) = 1 _ ½z-• + 1 _ Jz-• - l _ .-•, l < lzl < 3
y[n) = 54(l)" l
2 u[n] - 5(3)"u[-n -1)- u[n)
(b) ROC includes z = 00 so h{n] is caasal. Since both h[n) and :[n] are 0 for n < 0, we know that y[n)
isalso0forn<0
H z - Y(z) - z-2
( ) - X(z) - l - ;.-• + Jz-2
Y(z) - ;z- 1Y(z) + ~z-2Y(z) = z-2X(z)

7 3
y[n] = :[n - 2] + 11[n - l] -
2 211[n - 2)
Since 11[n] = 0 for n < 0, recursion can be done:

y[0) =0, 11[1) =0, 11[2) =l
(c)
l
H,(z) = H(z) =z - 27 z + 32,
2
ROC: entire z..plane
7 3
h;(n] = o[n + 2) - 2o[n + 1) + 26[n)
5.32. Since H(e"') has a zero on the unit circle, its inverse system will have a pole on the unit circle and
thus is not stable.
5.33. (a)
H1(z) = 1- •-•o,-1
There are 8 zeros at z =.- 0
,; t• for k =0, ... , 1 and 8 poles at the origin.
Im
lzl>O
0 0
11u Re
0
ftlordorpolo
(b)
Y(z) = H2(z)X(z) = H2(z)H1(z)S(z)

B2(z) = Bi~z) = 1 _ .:ao,-1
l•I > •-• Rable and causal, izl < •-• not causal or suble
148
(c) Only the causal ho(n] is stable, therefore only it can be used to recover •In].
•-°", n = 0,8,16, ...
hin 1={ 0, otherwise
(d)
z[n] • ho[n] = 6[n] - •-'°o[n - 8]

+ •-'°(6[n - 8] - •-'°o[n - 161)
+ •-''°(6(n -16] - •-'°6(n - 321) + · · ·
= 6[n]
5.U.
h{n] = (½)" u(n] + (½)" u(n]

(a)
1 1 2 - lz- 1 1
H(z) =
1-
½z-1 + 1- ½z-' = •
1- iz-' + 11 z-•
, lzl > -2
Since h[n], z(n] = 0 for n < 0 we can assume initial rest conditions.
5 l 5
11(n] = 11[n - l] - 2] + 2>:[n] -
6 611[n - 6z[n - l]
(b)
h,(n] = { ho,[n], n <

n
11,.
>lo"
(c)
N-1
11(n] L h[m]z(n - m]
=.....,
(d) For llR., we have 4 multiplies and 3 adds per ontput point. This gnes us a total of 4N multiplies
and 3N adds. So, IIR grows with order N. For FIR, we have N multiplies and N - 1 adds for the
n" output point, so this configuration bas order N2. ·
5.35. (a)
20log10 IH(ei<•/llJI =oo :o- pole at ei<•1•1

20log10 IH(ei<'-l•>)I = -oo :o- zero at .,;<2s1•1
l!Monan.-e at w -= 'f :o- pole wide l1llit clzcle here.
Since tbe impube nispome is real, t.be poles and seros must be ill conjugate pain. The remaining
2 zeros are at zero (the number of poles al-ys equals the number of seroo).
149
Im
X
Re
X
(b) Smee H(z) has poles, we~ h{n] is llR.

(c) Since h{n] is causal and IIR, it cannot be symmetric, and thus cannot have linear phase.
{d) Since there is a pole at l•I = 1, the ROC does not include the Wlit circle. This means the system
is not stable.
5.36. (a)
H(z)
= (1- 2z- 1 )(1 + 1,-
1 )(1 + 0.9,- 1 )
(1- z-l)(l +0.7jz-1)(1-0.7jz-1)

l - 0.&z- 1 - 2.35,- 2 - 0.9z-•
= l - z- 1 + 0.49z- 2 - 0.49z- 3
Y(z)
= X(z)
Cross multiplying and talcing the inverse z.transform gives
y[n] - y[n - l] + 0.49y[n - 2) - 0.49y{n - 3] = :r{n] - 0.6:r[n - l] - 2.35:r[n - 2j - 0.9:r[n - 3)
(b)
Im
Re
Note that since h[n] is causal, ROC is 1•1 > 1.

(c)
150
I H(el°') I
20~-------~~--------,
l
f
0
-It 0 1t
I
(I)
!t
(d) (i) The system is not stable since the ROC does not include i•I = l.
'
(ii) Because h(n] is not stable, h(n] does not approach a coDStant as n -+ ex,.
(iii) We can see peaks at"'= ±f in the graph of IH(e'w)I shoWD iD part (c), so this is false.·
(iv) Swapping poles and zeros gives:
Im
Re
There is a ROC that includes the unit circle (0.9 < lzl < 2). However, this stable system
would be two sided, so - must conclude the statement is false.
5.37.
(l - tz- 1 )(1- ¼z- 1 )(1- lz) 6 (l - ½z- 1 )(1- lz- 1 )(1- 5,- 1 )
X(z)= (l-tz) • =s {l-~z-•)
ft [ I X( _ 1 )-~(l-½az- 1 )(1-faz-1 )(1-Saz- 1 )

a :i: n ~ a z - 5 . {l -6az-')
A minimum phase sequence has all poles and zeros inside the unit circle.
la/21 < 1 • !al < 2
la/41 < 1 • !al < 4
1
l5al<l • lal< 5
1
16al<l • lal< 6
151
Therefore, a•:[n] is real and minimum phase ilf a is real and lal < l·
5.38. (a) The causal systems haw conjugate zero pain inside or outside the UDit circle. Therefore
H(z) = (1 - 0.!lf:IO·h z- 1 )(1 - o.9e-JO·•• z- 1 )(1 - 1.~·••z- 1 )(1 - 1.25e-JO-•• z- 1 )

H 1 (z) = (0.9) 2(1.25)2 (1- (10/9~-hz- 1 )(1- (10/9)e-JO·••z- 1 ) •
(1- 0.Se'°-h.,-1 )(1 - o.a.,-JO.k .,- 1 )
H2(z) = (0.9)2(1- (10/9~-k.r- 1 )(1- (10/9)e-;o.a.z- 1 )(1 -1.~·••z-1) •
(1 - i.25e-JO-k z-l)
H,(z) = (1.25)2(1 - o.!lf:IO·••,.- 1 )(1 -o.9e-i0-•• .. - 1 )(1 - o.Se'°·'• ,.-•> •
(1 - o.ae-;o·•• ,.-•i
H2(.r) baa all its r.eros outside the UDit circle, and is a maximum phase sequence. Bs (z) has all its
r.eros inside the UDit circle, and thus is a minimum phase sequence.
(b)
H(z) = l + 2.5788,- 1 + 3_4975,-2 + 2.5074z- 3 + l.2656.r 4

h[n] = 6(n] + 2.57886(n - l] + 3.49756(n - 2] + 2.5074.!(n - 3] + l.26566(n - 4]
B,(.r) = 1.2656 + 2.5074z-l + 3.4975z- 2 + 2.5788.r-• + .r 4
h,(n] = 1.26566(n] + 2.5074.!(n - 1] + 3.49756(n - 2] + 2.57886(n - 3] + 6[n - 4]
H2(z) = 0.81 + 2.1945•-• + 3_3900.r- 2 + 2.8917•-• + 1.5625•-•
hz(n] = 0.816(n] + 2.19456(n-1] + 3.39066(n- 2] + 2.89176(n - 3] + 1.56256[n - 4]
H 3 (.r) = 1.562s + 2.8911.. - 1 + 3-3906,- 2 + 2.1945•-• + o.8h 4
hs(n] = 1.56256(n] + 2..89176(n -1] + 3.39066(n - 2] + 2.19456(n - 3] + 0.816(n -4]
(c)
n E(n) E,. (n) E,(n) E,.(n)

0 1.0 1.6 0.7 2.4
1 7.7 7.9 5.5 10.8
2 19.9 20.1 17.0 22.3
3 26.2 26.8 25.3 27.l
4 27.8 27.8 27.8 27.8
5 27.8 27.8 27.8 27.8
26..2 27.8 27.8 21SJ1 27.8 27.8
EtnJ 1!1.11 20.1
7.1
I.I
012345n 012345n
27.8 27.1 27.1 27.8 27.I
EJ_n) ~ ·• EJ_n) 22.3
17
10.8
9;1
~
J
012345n 012345n
152
Th• plot ol E,[n] conesponds io the minimum phase sequence.·
5.S9. All zeros inside the llllit circle means the sequence is minimum phase. Since
Ill Ill
is true for all M, we can use M

phase ,equenee.
- -
L lh.u..[n]l ~ L lh!n]l
2 2
= O aad just compute h2 [0]. The largest result will he the minimum
TheansnrisF.
5.40.
(i) A zero phase ,equence has all its poles and zeros ill conjugate reciprocal pairs. Generaliz.ed
linear phase sySlemS an zero phase sySlemS with additioul poles or seroo at z = 0, 00, l or
-1.
(ii) A stable system's ROC includes the UDit circle.
(a) The poles aN not ill conjugau reciprocal pairs, 10 this does not have zero or generalized linear
phase. H,(z) has a pole at z = o aad perhaps z = 00. Therefore, the ROC is O < l•I < 00, which
means the iDvene is stable. If the ROC includes • = 00, the inverse will also he causal.
(b) Sillce the poles a,e not conjugate reciprocal pairs, this does not have sero or generalized linear
phase either. H,(z) has poles illside the wilt circle, 10 ROC is 1•1 > j io match the ROC of H(z).
Therefore, the illvene is both stable and causal.
(c) The seroo occur ill conjugate reciprocal pairs, 10 this is a zero phase system. Th• inverse has poles
both inside and outside the UDit circle. Therefore, a stable non-causal inverse emu.
(d) The r.eros
occur ill conjugate reciprocal pairs, 10 this is a zero phase system. Since the poles of the
inverse system are on the llllit circle_& stable illvene does not exist.
5.41. Convolving two symmetric sequences yields &DOtber symmetric sequence. A symmetric sequence con-
volved with an antisymmetric sequence gives an antisymmetric sequence. If you convolve two antisym-
metric sequences, you will pt a symmetric sequence.
A: h1[n] • h,[n] • h3[n] = (11,[n] • h2[n]) • h3[n]

h,[n] • h2[n] is symmetric about n = 3, (-1 :5 n :5 7)
(h 1 [n] • h2[n]) • h3[n] is antisymmetric about n = 3, (-3 :5 n :5 9)
Thus, system A has generalized linear phase
B: (h1[n] • h,(n]) + h3(n]

h,[n] • h2[n] is symmetric about n = 3, u we noted above. Adding h3(n] io this sequence will destroy
all symmtery, 10 this does not have generalized linear phase.
s.,2. (a)
A(ei") = 1, "'11 < ,r

f(w) = -0"1, "'11 <,,.
!
153
all
••• •••
& (I)
••• • ••
-all ........... .
0 & GI
(b)
h(n] = ..!._ (" •-;-~""dw = siD,r(n- a)

2,r /_, r(n - a)
•••
a=3
•
0 ,• 2• l
3 •
4
e
5
e
6
...
n
III
(ls 3.5
••• 0 5 y •••
l, 2
b
I 3 4 6 n
•••
(l:
0
6
3.25
, l
3
T
4
5
.&
'i'
6
(c) U a is an integer, then h(n] is symmetric about about the point n = a. U a = ':, where Mis odd,
•••
n
then h(n] is symmetric about Jf,

which is not a point of the sequence. For a in general, h(n] will
noi be symmetric.
5.43. Type I: Symmetric:, M Even, Odd Length

.,
H(ei"') =
=
-
L h[n]•-;..n
(N-2)/2
L
...0
h[n]•--
.-(Jl+2)/2
+ L
N
h(nje-;,,n + h[M/2]•-;w(N/2)
(N-2)/2 (N-2)/2
= L h[n]•-;wn + L
h[M - m]•-jw(N-,nJ + h{M/2]•-;w(N/2)
n=O ......
154
=
e-;w(Jl/2)
(
-
(Jl-2)/2
L h(m)e'"((Jl/2)-"') +
e-;w(JI/J) (:~/• 2h(m) cosw((M/2) - m) + h(M/2))

(Jl-2)/2
L
......
h(m)e-;w{(Jl/2)-M) + h(M/2)
)
= e-,w(JI/Jl (~2h((M/2)-n)coswn+h(M/2))
Let
ca{n) = { h(M/2), n 0 =
2h[(M/2)-n), n= l, ... ,M/2
Then
...
Jl/2
B(e"') =e-,w(JI/J) L o(n) coswn
and 'ft have
Jl/2
-
M
.A(w) = L o(n) cos(wn), 0=2, /3=0
Type IJ: Symmetric, M Odd, Evez, Length
-
JI
H(e'") = L h(n)•-;""
(Jl-1)/2 JI
= L h(n]•-'"'" + L h(n]e-;""
..... na(Jl+l)/2
=
(Jl-1)/2
L
.....
= ,-,w(Jl/2)
h[nJ•-- +
(
f
(Jl-1)/2
-
(Jl-1)/2
L h(M - m),-;w(Jl-m)
h(m)e"'((Jl/2)-"'l +
(Jl-1)/2
l;, h(m)e-;"'((M/2)-ml
)
= e-MJl/2l (Jiff' 2h(m)cosw((M/2)-m))
= e-;w(JI/J) (Jlf/• 2h[(M + 1)/2 - n) cosw(n - (1/2)))
Let
6(n) = 2h[(M + 't)/2 - n), n = 1, ... , (M + 1)/2
Then (Jl+l)/2
B(e"') = e-,w(JI/Jl L
_, 6(n) cosw(n - (1/2))
and.., have
(Jl+l)/2
M
.A(w) = L
_, b[n) cosw(n - (1/2)), 0=2, /3=0
155
Type ffi: Antisymmetric, M Even, Odd Length

l,f
B(ei°')
=
-
= L h(n)e-;....
(1,/-2)/2
L
..0
h(n)e-i""' + O+
(l,/+2)/2
I,/
L
h(n)e-;....
-
(1,/-2)/2 (1,/-2)/2
=
=
-L h{n)e-;.," +
•-j.. (1,//2)
(
(1,/-2)/2 ·
L
....0
L
h[M - m)e-i"'(l,/~m)
h(m]ei-'((1,//2)-m) _
(1,/-2)/2
L
h[mJ•-;.,((M/2)-m)
m=O
)
= •-;.,(M/2) (i 2
(Mj;/ 2h[m]sinw((M/2)-m))
= •-;..(M/2leil•/2) (% 2h[(M/2) - n]sinwn)
Let
c(n) = h((M/2)-n), n = l, ... ,M/2
Then
1,//2
B(ei"') = •-;.,(M/2lei<•J2) L c(n)sinwn
n=l
and we have
M/2
M
A("') = L c(n] sin(wn), 0=2· fJ=-"2
....,
• Type IV: Antisymmetric, M Odd, Even Length
M
B(ei"') = L h(n)e-;....
n=O
(M-1)/2 M
= L h[n]e-i"'" + L h[nJ•-'"'"
n=O n=(M'+l)/2
(M-1)/2 (M-1)/2
= L h(n]e-;""' + L h{M - mJ•-;.,(M-m)
...0 -
(M-1)/2 (1,/-1)/2 · )
= •-;.,(M/2) ~ h[m]ei"'((l,//2)-m) _ ~ h[mJ•-;..((M/2)-m)
(
2
= •-;.,(M/2) (; (Mj;/ 2hfm)sin"1((M/2) - m))
(Jt+l)/2
= •-;..(M/2lei1•/2l
....L, 2h[(M + 1)/2 - n] sinw(n - (1/2))
156
Let
d[n] = 2h[(M + 1)/2- n], n = 1, ... ,(M + 1)/2
Then (Af+l)/2
and we have
B(ei"') = e-;.,(J1/•let(•/2l
....L d[n] sm"'(n - {1/2))
(Jl+l)/2 M ,,.
A("1) = L 2. ,.,"'=-2
d[n] llill"'(n - (1/2)), a- - -
5.44. Filter Types II and m CaDDOt be bighp•ss filters siDce they both must haw a wo at z =1.
Type I -+ Type I could be bighpus:
l IIII ➔
'
Type II -+ Type IV can be bighpus:
IIIIII ➔
'
Type m ..... Type m CaDDot be bigbpass:

•
➔
.
-
Type IV --t Type II cannal be bighpus:
➔
157
5.45.
H(z) = (l -O.sz- 1 )(1 + 2jz-1 )(1- 2jz- 1 )
(1 - 0.8z- 1)(1 + 0.8z- 1 )
2j
Im
112"'5 Re
-21
(a) A minimum phase syslelD has all poles and zeros inside l•I = 1
H ( J = (1 - o.sz- )(1 + ¼z- 2 )
1
I z (1 - Q.64z- 2 )
Im
(1l2)j
112 "'5 Re
-(112~
Im
(112¥
Re
-(1/2)j
158
=
(bl A generalizedlinearphue system has zeros and poles at z 1, -1,0or oo or in conjugate reciprocal
pain.
· (1 - o.sz- 1 )
Im
(112M
112 4/S Re
-(1J2M
3rd--
2j
Im
Re
-2i
5.46. (a) Minimum phue systems ha..., all poles and zeros inside izl =1. Allpass systems have pole-zero
pairs at conjugate reciprocal locations. Generalized linear phue systems ha..., pole pain and zero
pain in conjugate reciprocal locations and at z = 0, 1, -1 and oo. This implies that all the poles
and zeros of B.,,n(•l are seconCH>rder. When the allpass filter llips a pole or zero outside the unit
circle, one is left in the conjugate reciprocal locati011, giving us linear pha&e.
(b) We lcnow that h[n] is length 8 and theraore has 7 zeros. Since it is an even length generalized
linear phue filter with real coefficients and odd sy,nmetry it must he a Type IV filter. It therefore
has the property that its zeros come in coajugate reciprocal pain stated mathematically as B(z) =
B(l/z"). The zero at z = =
-2 implies a zero at z =-½,while the zero at z o.s.i<•l•l implies
zeros at z = O.&-i(•I•>, z = l.:zsei<•l•l and z = 1.25e-i(•/4 l Bec•o,e it is a IV filter, it also must
have a zero at z = 1. Putting all this together g;...,. us
B(z) = (1 + 2z-1)(1 + O.s,- 1)(1- O.Sei<•l•lz- 1)(1 - o.s.,-il•l•J z- 1).
(1-1.:zseil•/•lz-')(l - l.2Se-i(•/<lz-•)(1 - ,-1)
5.47. The input :r[n] in the frequency domain loob like
!
159
X(el°')
'•(10lt) (10lt)
5
--11 --0.Slt --0.4lt 0 0.4it 0.51t lt (0
while the conesponding output 11(n] looks like
-lt --0.31t O 0.31t It (0
Therefore, the filter must be
-lt --0.3lt O 0.31t It (0
In the time domain this is

h(n] = 2 sin(0.3r(n - 10)]
r(n - 10)
5.48. (a)
Property Applies? Comments
Stable No For a stable, causal system, all poles must be
inside the unit circle.
IIR Yes The system has poles at locatiollS other than
.r=Oorz=oo.
FIR No n.K systems can ollly have poles at • = 0 or
z=c:o.
Minimum No Minimum pDMe sysiems have all poles and r.eros
Phase located inside tbe unit circle.
Allpass No Allpua systems have poles and zeros in conjugate
reciprocal pain.
Generalized Linear Phase No Tbe causal generalised linear phase systems
presented in this chapter are FIR.
Positive Group Delay for all w No This system is not in the appropriate form.
160
(b)
rl"P,-ro""pe.=t=-,--------,I-A,...p-p7eli-es""•"Tl""'Coo-111111e11--ts-----------
St&ble Yes The ROC for this system fwlcti011,
lzl > 0, cocwm the amt circle.
(Note there is 7th order pole at z = O).
IIR No The system has ........ only at z = o.
FIR les The s,stem has poles Ollly at • = O.
Minimum No By de6mtioa., a minimum phase system must
Phase haft all its poles uad _,. locued
inaib die amt cirde.
Allpus No Note that die 1G01 Oil die amt circle will
came the mapitude spectrum to drop r.ero at
certain frequencies. Clearly, tbis system is
not allpass.
Generalized Linear Phase Yes n
This is the pole/zero plot of a type FIR
linear phase system.
Positift Group Delay for all w Yes This system is causal uad linear phase.
Comequently, its group delay is a positift
COIIStaDt.
(c) .
Property Applies? L;OmmeDtl
Stable Yes All poles are iDside the Wlit circle. Since
the system is causal, the ROC includes the
Wlit circle.
IIR Yes The s,stem has poles at locations other than
• =O or•= 00.
Fffi No FIR 1JS1e1DS CUI only haft poles at z = 0 or
Z = 00.
Minimum No Minimum phase systems haft all poles uad zeros
Phase locued inside the wut circle.
Allpass Yes The poles inside the amt circle have
wmspODdillg 1er01 locued at cocjugate ·
reciprocal locatioDS.
Generalized Linear Phase No ·ue causal generalized linear phase systems
presented ill this cbapler are FIR.
Positive Group Delay for all w Yes Stable allpass systems have positive group delay
for all v,.
5.49. (a) Yu. By the region of wnvergence we know there are DO poles at z = 00 uad it therefore must be
causal. Another way to Me this is to use long divisiOll to write H1(z) as
= 1 =:-, =1 + z-• + ,-, + ,-• + z-<, lzl > 0

1 -s
H1(z)
(b) h 1 [n] is a causal rectUlglll&r pu!,e of length 5. If we a111'10lve h,[n] with UlCllher causal rectangular
pulse of length N we will get a triUlgular pulse of leDgth N + 5 - 1 = N + 4. The trw,gular pulse
is symmetric aro1111d its apa uad thus has linear phase. To mw the triangular pulse g[n] have at
least 9 llOllzerO aamples we CUI chome N = 5 « let h,(n] = h1 (n].
Proof:
161
= [1- .-;... ]'

1- e-Jw
2
= r·-jw5/2 (eiw5/2 - ,-;ws/2)]
e-;1,1/2 (eiw/2 _ e-jc,,,/2)
2
sin (Sw/2) -j4w
= sin2 (w/2) e
(c) The required values for h 3 [n] can intuitively be worked out using the flip and slide idea of conv~
lution. Here is a second way to get the answer. Pick h3 (n] to be the inverse system for hi(n] and
then simplify using the geometric series as follows.
l-z- 1
H,(z) = 1- z-•
= (1 - z- 1 ) [1 + z-• + z-• 0 + z-» + .. -)
= I - z-1 + z-5 - z-6 + z-10 - z-11 + z-15 - z-16 + ...
This choice for h3 (n] will make q[n] = o[n] for all n. However, since we only need equality for
0 S n S 19 truncating the infinite series will give us the desired result. The final answer is shown
below.
1 ' hJnJ
- - - 10
---
0 5 15 n
-1
'
5.50. (a) This system does not necessarily have generalized linear phase. The phase response,
is not necessarily linear. As a counter-aample, consider the systems
h1 (n] = o[n] + o[n - l]

h2(n] = 25[n] - 25[n - l]
91(n] = =
h,(n] + h2(n] 35[n] - o[n - l]
G,(eiw) = =
3-,-;w 3-cosw+ jsinw
LG,(&w) = tan-
I ( sinw )
3-cosw
Clearly, G 1 (e;w) does not have linear phase.

(b) This system must have generalized linear phase.
G,(,;,-) = H,(,;,-)H2(,;,-)
jG2(&w)j = jH,(&w)j jH2(,;,-)j
LG2(&W) = LB,(,;,-)+ LH2(,;,-)
The sum of two linear phase responses is also a linear phase response.
162
(c) This system does not necessarily have linear phase. Using properties t: ~ DTIT, the circular
convolution of H,(.,;"') and H 2(_,j"') is related to the product of h 1 [n] and h2[n]. Consider the
systems
hi[n] = o[n] + o[n - l]

h2[n] = o[n] + 26[n - l] + o[n - 2]
93(n] = =
h 1 [n]h2[n] o[n] + U[n -1]
G,(ei") = =
l + 2e-,.. l + 2cosw - j2sinw
_, ( 2sinw )
LG,(ei"') = tan l +2cosw
Clearly, G 3 (.,;"') does not have linear phase.
5.51. False. Let h[n] equal
h[n] = sinw,(n -4.3) +-+ H(e'") = { ,-•.>w, lwl < w,

r(n - 4.3) . 0, otherwise
Proof: Although the group delay is constant ( grd (H(e'"')] = 4.3) the resulting Mis not an integer.
h[n] = ±h[M-n]
H(e'"') = ±ei"'"' H(e-i"')
e-;4.3111
= :1:eJ(M'+4.3)1o1 I [wl <w,
M = -8.6
5.52. The type II FIR system H 11 (z) has generalized linear phase. Therefore, it can be written in the form
where M is an odd integer and A.(_,j"') is a real, even, periodic function of w. Note that the system
=
G(z) (1- ,- 1 ) is a type rv generalized linear phase system.
G(ei"') = 1 - e-jw
,-,w/2(,i"'/2 _ ,-;w/2)
=
= ,-jw/2(2j sin(wf.2))
2 sin(w /2)e-jw/2+jw 12
=
A.,(e'"')•-jw/2+jw /2
=
A.(ei"')
LG(e'"')
=
= --+-
2 2
.
2 sin(w/2)
w
The cascade of Hu(z) with G(z) results in a generalized linear phase system H(z).
H(ei"') = A,(e'"')A.,(ei")e-j"'M/2,-jw/2+jw/2
= A'.(ei"')e'"'"'' /2+;w/2
where A' 0 (e'"') is a real, odd, periodic function of wand M' is an even integer.
Thus, the resulting system H(e'"') has the form of a type m FIR generalized linear phase system. It is
antisymmetric, has odd length (M is even), and has generalized linear phase.
163
5.53. For all of the following we know that the poles and zeros are real or occur in complex conjugate pairs
since each impulse response is real. Since they are causal we also know that none have poles at infinity.
(a) • Since h1[n] is real there are complex conjugate poles at z = o.9e:;•/3 •
• If z[n] = u[n]
Y(z) = H 1 (z)X(z) = 1H_1 ,-,
(z)
We can perform a partial fraction expansion on Y(z) and find a term (l)nu[n] due to the pole
at z = 1. Since 11[n] eventually decays to zero this term must be cancelled by a zero. Thus,
the filter must have a zero at z = 1.
• The length of the impulse response is infinite.
(b) • Linear phase and a real impulse response implies that zeros occur at conjugate reciprocal
locations so there are zeros at z = z 1 , 1/ z 1 , zi, 1/ ~i where z1 = 0.8e' .. / 4 •
• Since h2(n] is both causal and linear phase it must be a Type I, Il, m, or IV Fm filter.
Therefore the filter's poles only occur at z = 0.
• Since the arg {H2(&")} = -2.Sw we can narrow down the filter to a Type II or Type IV filter.
This also tells us that the length of the impulse response is 6 and that there are 5 zeros. Since
the number of poles always equal the number of zeros, we have 5 poles at z = O.
=
• Since 20log jH2 (&0 )j = -ex, we must have a zero at z 1. This narrows down the filter type
even more from a Type II or Type IV filter to just a Type IV filter.
With all the information above we can determine H2(z) completely (up to a scale factor)
(c) Since H,(z) is allpass we know the poles and zeros occur in conjugate reciprocal locations. The
impulse response is infinite and in general looks like
(z- 1 - O.S&•l 4 )(,- 1 -o.Se-;•/•)

H,(z} = (l-0.8e1•/•z- 1 )(1-0.8e-1•/4 z- 1 )H.,(z)
5.54. (a) To be rational, X(z} must be of the form
M
II <1- c.,-•i
X(z} = Go
bo =•cc=.,_!----
N
II (1-d·•-'l
•=1
Because x[n] is real, its zeros must appear in conjugate pairs. Consequently, there are two more
zeros, at z=½•-i•I•, and z = ½•-,"I•. Since x(n] is zero outside O:,;
n:,; 4, there are only four
zeros (and poles) in the system function. Therefore, the system function can be written as
X(z) = (l - ½&•i•z- 1) ( l - ½.;••l•,- 1 ) ( •1•,- 1)

l - ½•-j•l•z- 1) ( l - ½,-1 3
Clearly, X(z) is rational.

(b) A sketch of the pole-zero plot for X(z) is shown below. Note that the ROC for X(z) is l•I > 0.
164
Im
X(zj
0 0
Re
0 0
4lhordlfpole
(c) A sketch of the pole-zero plot for Y(z) is shown below. Note that the ROC for Y(z) is lzl > ½-
Im
X X
Re
X X
41h order zero
5.55. • Since z[n] is real the poles & zeros come in complex conjugate pairs.
• From ( 1) we know there are no poles except at zero or infinity.
• From (3) and the fact that z[n] is finite we know that the signal has generalized linear phase.
• From (3) and (4) we have a = 2. This and the fact that there are no poles in the finite plane
except the five at zero (deduced from (1) and (2)) tells us the form of X(z) must be
X(z) =z[-l]z + :t[O] + :t[l]z- 1 + z[2]z-• + z[3]z- 3 + z[4)z 4 + z[S)z-•
The phase changes by .. &t w = 0 and .- so there must be a zero on the unit circle at z = ±1. The
zero &t z = 1 tells us Ez[n] = 0. Tb,e zero &t z = -I tells us E(-l)"z[n] = 0.
We can also conclude z[n] must be a Type m filter since the length of z[n) is odd and there is a
ze~o at both z = ±1. z[n] must therefore be antisymmetric around n = 2 and z[2] = 0.
• From (5) and Parseval's theorem we have E lz[n]l 2 = 28.
• From (6)
y[O] = 2-1•
2,r -r
Y(eiw)dw =4
= z[n] • u[n] ln=0 = :t[-1) + :t[O]
11[!] = 2_
2,r
1•
-r
Y(eiw)ei"'dw =6
= z[n] • u[n] I..,., = z[-1] + :t[O] + z[l]
• The conclusion from (7) that E(-l)"z[n] = 0 we already derived earlier.
• Since the DTIT {z.[n]} = RA, {X(,.;-,)} we have
:r[S] + z[-5] 3
2
= -2
z(S] = -3+:i:[-S]
:t(S] = -3
Summarizing the above we have the following (dependent) equations
!
165
(1) :t(-1] + :t(0] + z[l] + :t[2] + z[3] + z[4] + z[S] 0 =

(2) -:t[-1] + :t[0]- :t(l] + :t(2] - z[3] + :t[4] - z[S] 0 =
(3) =
:t[2] 0
(4) =
:t(-1] -:t[S]
(5) =
:t[0] -:t[4]
(6) =
:t[l] -:t[3]
(7) :t[-1] 2 + z[0] 2 + :t[1]2 + z[2]2 + z[3]2 + z[4]2 + :t(5] 2 =28
(8) :t[-1] + :t(0] = 4
(9) :t[-1] + :t[0] + :t[l] 6=
(10) =
:t[5] -3
:t[n] is easily obtained from solving the equations in the following order: (3),(10),(4),(8),(5),(9), and (6).
3
JC(nj
2
1
3 4 5
-1 0 1 2 n
-1
-2
-3
5.56. (a) The LTI system S 2 is characterized as a lowpass filter.

The z-transform of h 1 [n] is found below.
· y[n] - y[n - l] + ~y[n - 2] = :t[n]

4
1
Y(z)-Y(z)z- 1 + Y(z)z- 2
4 = X(z)
Y(z) (1 - z-• + ¾z- 2 ) = X(z)
I 1
= (1- z-• + ¼z-•) = (1- ½z-•)•
H1(z)
This system function has a second order pole at z = ½· (There is also a second order zero at z = 0).
Evaluating this pole-zero plot on the unit circle yields a low pass filter, as the second otder pole
boosts the low frequencies.
Since
H2(e'"') = H,(-e'"')
H 2 (z) = H 1 (-z)
If we replace all references to z in H 1 (z) with -z, we will get H 2 (z).

I
H2(z) = (I+ fZ-' )2
Consequently, H 2 (z) has two poles at z = -½·
(There is also a second order zero al z = 0).
Evaluating this pole-zero plot on the unit circle yields a high pass filter, as the second order pole
now boosts the high frequencies.
166
(b) Tbe LTI system S, is characterized as a highpass filter. H,(&"') is the inverse system of H, (e'"'),
since H,(e'"')H,(e'"') = 1. Consequently, H3 (z)H1 (z) = 1.
~ shown in part (a), H 1 (z) has a second order pole at z = ½, and a second order zero at z = 0.
Thus, H,(z) has a second order zero at z = ½, and a second order pole at z = 0. Evaluating this
pole-zero plot on the unit circle yields a high pass filter, as the second order zero attenuates the
low frequencies.
S3 is a minimum phase filter, since its poles and zeros are located inside the unit circle. However,
because the zeros of S. do not occur in conjugate reciprocal pairs, S3 cannot be classified as one
of the four types of FIR filters with generalized linear phase.
(c) First, we compute the system function H4 (z)
11(n] + a,y[n - 1] + a 2 v[n - 2] = Poz(n]
Y(z) + a 1 Y(z)z- 1 + a 2 Y(z)z-2 = A,X(z)
H4 (z) - Po
- 1 + 01z- 1 + o 2 z- 2
s. is a stable and noncausal LTI system. Therefore, its poles must be located 01dsidt the unit
circle, and its ROC must be an interior region that includes the unit circle. We place a second
order pole at z = 2, which is the (conjugate) recip,;ocal location of the second order pole of H 1 (z)
at z = ½- This gives
Po
In order for
jH.(e''")I = IH,(e'•)j
an appropriate value of /3o must be found. Consider the case when z = 1. Then,
I(1 -4,!."+4z-•) I = I(1 - .-,\¼.-•)I

lei -~+4)1 = lc1-:+¼)I
I.Bol = 4
The values a, = =
-4, a 2 4, and Po = 4 satisfy the criteria. Note that Po =-4 also is a valid
solution.
(d) If h•[n] • h 1 (n] is FIR, then the poles of H 1 (z) must be cancelled by zeros of Hs(z). Thus, we
1 2
expect a second order zero of H5 (z) at z = ½- Therefore, H.(z) will have the term (1- ½z- ) -
=
In order for the filter hs(n] to be zero phase, it must satisfy the symmetry property h•(n] h,[-n],
which means that H,(z) = H,(z). For this property to be satisfied, we need two more zeros located
at z = 2. In addition, we want these zeros to correspond to a noncausal sequence. Therefore, H•(z)
will also have the term (1 - ½z) 2 •
Combining these two results,
167
Taking the inverse z.transform yields

· 1 5 33 5 1
hs[n] = 4"5[n - 2] - 4"5[n - l] + 5"[n] -
1 4o[n + l] + 4"5[n + 2]
5.57. (a)
1 . 1 ·
:t[n] = s[n] cos won= s[n]e'w•• + s[n],-,wo•
2 2
X(eiw) = !S(e'<w-wol) + !s(ei<w....,,l)
2 2
y[n] = !s[n]e'(w,n-~) + !s[n],-i(w,n-~)

2 2
= s[n] cos(won - t/>o)
(b) This time,
Y(eiw) = H(e'w)X(e'w) = !..-,,,.-,w•,s(ei<w-wol) + !ei~e-,w••S(ei<w+w,>)

2 2
y[n] = o[n - n,] • G•[n]e'(wo•-~l + is[n]e-i(wo•-~l)
= o[n- n,] • s[n]cos(won - t/>o)

= s[n - n,] cos(won - won, - t/>o)
Therefore, if ¢ 1 = t/>o + won, then

y[n] = s[n - n,] cos(won - ¢1)
for narrowband s[n].

(C)
d . d
-r,, = - dw arg[H(e'w)] = - dw[-t/>o -wn,] = n,
"•• = _.!_arg[H(e'w)] = _.!_[-t/>o-wn,] = t/>o - na

w w w
y(n] = s[n - -r,,(wo)]cos[wo(n- ,.,.(wo)))
(d) The effect would be the same as the following:
(i) Bandlimit interpolate the composite signal to a C-T signal with some rate T.
(ii) Delay the envelope by T •Tgr, and delay the c:.arrier by T • .,.,._
(iii) Sample to a D-T signal at rate T
5.58. (a)
¢.,[m] = y[n] • y[-n] = :t[n] • :t[-n] • h[n] • h[-n]

168
N M
11(n] = L "•llln - k] + L o.:z:[n - k], bo = 1
•=0
N M
Y(z) = L"•Y(z)z-• + X(z) + Lb•X(z)z-•
t=l i:=1
M JI
1+ L b•z-• II (1 - c•z- 1 )
H(z) = --•-=~•-- - A=•-::;•~---
N - N
1 - L ... ,-• II (1 - d.,- 1)
t=l A=l
So,
Or equivalently,
n
M
(1 - c.z- 1 )(1- c.,)
r.,, (z) = A2 a-•2 -="=c,.1
N '--------
fi (1- d.,- )(1- d•z)
1
(b) To "whiten" the signal y(n] we need a system:
H,.(z)H,.(z-') = H(z)!(z-1)
Therefore,
N
fi (1- d•z- )(1-d•z)1
H,.(z)H,.(z-•) = =";c;'~------
IT (1- c.z- )(1 - c,z)
1
l=l
The poles of H,.(z) are the seros of H(z) and the seros of B,.(z) are the poles of H(z). \_Ve mus\
now decide which N of the 2N zeros of H,.(z)H,.(z- 1 ) to associate with B,.(z). The remaining
N zeros and M poles will be reciprocals and will be uaociated with H,.(z- 1 ). Ia order for H,.(z)
to be stable, we must chose all its poles inside the nnit circle. Thus for a pair c•, c; 1 we chose the
one which is inside the nnit circle.
169
{c) There is no real constraint on the zeros of H,.(z), so we can select either d• or a, 1 • Thus, it is not
unique.
5.59. (a)
•
H,(e'w) = 11-e-jw.M
- ,-,.,
<e> h;[n] = Loo 6[n - kM) - 6[n - kM - 1]
•=<>
1 ,, 1
' 1
•••
1 M+1 2M+1
0 M 2M n
'-1 -1
h;[n] has infinite length, so we can never get a result without infinite sums. Therefore, it is not a
real time filter. We can use the transform approach but we must have all the input data available
to do this.
{b) The proposed system is a windowed version of h;[n]:
h,[n] • h2[n] = h;[n]p[n]

Where
[nj = { 1, 0 $ n $ qM
P 0, otherwise
:[n] • h[n] • h;[n]p{n] = w[n]
Therefore, if :[n] is shorter than qM points, we can recover it by looking at w[n] in the range
0 $ n $ qM -1.
{c)
q 1-z-qM
h 1 [n] = L 6[n - kM) <e> H 1 (z) = -M
•=<> 1-z
Thus,
1 1-z-M
H>{z) = H(z) 1- ,-,M
Note that
1- ,_,,.,
bas M zeros and qM poles. Since H2(z) is causal, there are no poles at z = oo. If H(z) bas P
poles and Z zeros:
Z+M$P+qM
170
5.60. (a)
1 cz-1 a- z- 1
H(z) = z - -a = -a- = u- 1
Im
, poleatz=-
Re 1/a
·
H(e'"') = e'"'. - -a1 = cosw + j sinw - -a1
·
arg[H(e'"')] sinw )
= tan- 1 ( cosw _ ¼
(b)
Im
a Re
· z 1
G(z)=-=---,-1
z- a 1- az-
G(ei"') = 1 = ___1_ __
l - OL!-;"' I - a cosw + jasinw
arg[G(ei"'J] = -tan-• (1 ::inc:w)

= tan-1 (a::: 1)
= arg{H(ei"')]
5.61. (a) Because h 1 [n], h2 [n] are minimum phase sequences, all pales and urns of their transforms must
be inside the unit circle. ·
h,[n] • h2[n] ++ H1 (z)H2(z)
Since H (z) and H (z) have all their pales and zeros inside the unit circle, their product will also.
1 2
(b)
h 1 (n] + h,(n] ++ H,(z) + H2(z)
:i:,[n] = (2l)n u[n] +-+ 1 _ 1½z-' = X (z) 1
!
171
z2(n] =2 - (l)n
2
u(n] +---+ _
1- 1 1
2,z = X2(z)
Both of these are minimum phase, with a zero at z = 0 and a pole at z = ½.

X,(z) + X2(z) = 1- 31 ,z _1
This is minimum phase, with the same pole and zero as X,(z} and X2(z}.
z 1(n] =6 (2l)n u(n] +---+

1
_
6
½z-' = X,(z)
z 2(n) = -6 (-l)n u(n] +---+

-6
_ = X2(z)
3 1- 1 1 .-z
X,(z) has a pole at z =½and a zero at z = 0. X 2(z} has a pole at z =½and a zero at z = 0.
z-1
X1(z) + X2(z) = (I - lz-l)(J - lz-1)
2 • 3
This has zeros at z =0 1

oo an9 poles at z = ½, ½- Therefore, it is not minimum phase.
5.62. (a)
r(n] = -34 (l)n

-2 u[n] + 3-(2}"u(-n
4 - l]
R(z} = •3
1- lz-1
2
l -2z- 1
-2z-l
= (1 - ½z- )(1 - 2z- 1 1}
1
= - - - ---
(I- ½z- )(1-½z)' 1
ROC: ½< lzl < 2
Im
1 zeroatz=-
112 Re 2
(b)
r(n] = h(n] • h[-n] ~ R(z} = H(z)H(z- 1 )
R(z) =.-~--~- 1
(1 - ½z- )(1- ½z) 1
We have two choices &om H(z). Since h[n] is minimum phase we need the one which has the pole
at z ·= ½, which is inside the llllit circle.
±1
H(z} = (
1- 1 ,z _,)' ROC: lzl > ½
h(n] = ± (D n u[n]
172
5.63. (a) Maximum phase systems are of the form

M
II<z- c•)
H(z) = ~>_:-1~ - -
II (z-d•)
bl
Since the poles are outside the unit circle, the only stable system will have a ROC of lzl < min ld•I-
This implies the poles will all contribule to the h(n] with terms of the form -(d.ru[-n-1], which
are anticausal. The zeros are all positive powers of z, which means they are shifting to left, and
h(n] is still anticausal.
(b)
M
Hm,.(z) = hm,.(o] II (1- c,z- 1 )
k=l
(c)
H,....(z) = hm,.[O] ft
Pl
(1 - c.,-,) ft (:=• -,~,)
k=l C1c
M
= hm,.(O] II(,-, - c.)
bl
M
= ,- 11 hm,.(o] II (1- c;z)
i=l
= ,-MHm,n(z- 1 )
(d)
h,....(n] = 5[n - M] • hm,.[-n] = hm,.[-n + M]

5.64. (a) We desire IH(z)H,(z)I = 1, where H,(z) is stable and causal and H(z) is not minimum phase.
So,
IH.,(z)Hm,n(z)H (z)I = 1 0
Since jH0 ,(z)I = 1, we want

This means we have
1
H,(z) =H _( )
""" z
which will be stable and causal since all the zeros of Hm,n(z), which become the poles of H.(z),
are inside the unit circle.
173
(b) Since
l
H.(z) =H . ( )
min Z
We have
G(z) = H 0 ,(z)
(c)
H(z) = (l-O.W°· 3•z-1 )(l -0.8e-;o... z- 1 )(1-1.2,;o• 1 •z- 1 )(1-1.2e-i0.1•,- 1 )
H,,.;n(z) = (1.44)(1 - O.W°.>• z- 1 )(1 - O.Se-i0•3 • z- 1 )(1 - (5/6),;o•" ,-1 )(1 - (S/6)e-i0• 7• z- 1 )
l
H.(z) = (1.44)(1- O.SeiO-••z-• )(1 -O.Se-i0.3••-• )(1 - (5/6)ei0• 7 •z- 1 )(1 - (5/6)e-i0-7 • z- 1 )
(z- 1 - (5/6)e-i0 "Hz-• - (5/6)ei0·")
G(z) = H.,(z) = (1- (5/6)ei0- 1 •z- 1 )(1- (5/6)e-,0·"z-')
Im
0 0
Re
0
41h order pole
Im
X X
Re
C#'lorderzero
5.65.
z- 1 -a
H(z) = Hm,n(z) , Jal< l
1 -az- 1
Thus,
1 - az- 1
fun Hm,n(z) = fun _1 H(z)
.1 ➔ 00 .1 ➔ 00 z - a
h,,.;n[O] = - !h(O]
a
Therefore, lhm,n[O]I > Jh[O]I since Jal < 1. This process can be repeated if more than one allpass system
is cascaded. In each case, the factor for each will be larger than unity in the limit. ·
5.66. (a) We use the allpass principle and place a pole at z = •• and a zero at z = .J,.
••
.
H(z)
174
(b)
H(z) = Q(z)z- 1 - z0Q(z)

h(n] = q(n - l] - z;q(n]
Hmin(z) = Q(z) - ••Q(z)z- 1

h...,n[n] = q(nj - z•q[n - lj
(c)
n n
€ = L lh...m[m]l 2
- L lh[m]l 2
ffl=CI ~
n
= L (lq[m]l 2 - z•q[m - ljq*[mj - z;q•[m - ljq[mj + l••l 2 lq[m - 1]1 2 )
n
- L (lq[m - 1]1 2
- z;q•[m - l]q[mj - ••q[m - ljq•[m] + l••l 2 lq[m]l 2 )
n
= (l - 1••12 ) L (lq(m]l 2
- lq(m - 1Jl 2 )
= (l - l••l 2 )lq(n]l 2
(d)
€ = (l - lz•l')lq[n]( 2 ~ 0 Vn since l••I < l

Then
n n
L lh...m[mJl2 - L lh[m]l
m=O m=O
2
~0
n n
L jh[mJl2 !', L lh...,n[m]j 2 Vn
m=O m=O
S.67. (a) x[n] is real, minimum phase and x(n] = 0 for n < O. Consider the system:
xfn} .
- H,..,(z) H..,(z) - y[o]
x(n] is the impulse response of a minimum phase system. 11[n] is the impulse response of a system
which has the same frequency response magnitude as that of x[n] but it is DOt minimlllll phase.
Therefore, the equation applies.
n n
L l:r:[kJl2 ~ L 111[1<]1
.... ....
2
Since h0 ,(n] is causal and :r:[n] is causal, 11[n] is also causal, and these sums are meaningful.
175
(b) As discussed in the book, the group delay for a rational allpass system is always positive. That is,
Therefore, filtering a signal z[n] by such a system will delay the energy in the output y(n]. H we
require that z[n] is causal, then 1,'[n] will be causal as well, and the equation
n n
L lz(A:]1 L l11[kJl
2
::'.
2
bO t=O
applies to the system.

5.68. (a)
g[n] = z[n] • h[n]

r[n] = g[-n] • h(n]
s[n] = r[-n] = g[n] • h[-n] = z[n] • (h[n] • h(-n])
hi(n] = h[n] • h(-n]

H,(ei"') = H(e'"')H"(ei"') = IH(ei"')l2
Since H 1 (e'"') is real, it is zero phase.
(b)
g[n] = z[n] • h(n]

r{n] = z[-n] • h[n]
1,'(n] = g[n] + r[-n] = z{n] • h(n] + z[n] • h(-n] = z(n] • (h[n] + h[-n])
h2[n] = h(n] + h(-n]

H2(ei"') = H(e'"') + H"(e'"')
= 21u{H(ei"')}
H2(ei"') is real, so it is also zero phase.
(c)
✓2 ······
31t/4
1 ······----- 0 fl/4
" "'
-✓2 ·····················
0 "14 3fl/4
" "'
In general, method A is preferable since method B causes a magnitude distortion which is a function
of the (possibly non-linear) phase of h[n].
176
5.69. False. Consider
1 1
H(z) = (1 - ½z-' )(1 - 2,- 1 ) - 1- !z-1 + z- 2
This system function bas poles at z = 1/2 and z = 2. However, as the following shows it is a generalized
linear phase fiher.
= e;"' _ 1 +e-jw
2
= (2cos~ - ½) e'w
5. 70. (a) Since h[n] is a real causal linear phase filter the zeros must occur in sets of 4. Thus, if z1 is a zero
of H(z) then zi,1/z, and 1/zi must also be zeros. We can use this to find 4 zeros of H(z) from
the given information.
z,, magnitude = 0.5, angle = 153 degrees

zi I magnitude = 0.5, angle = 207 degrees
1/z,. magnitude = 2, angle = 207 degrees
1/zi, magnitude = 2, angle = 153 degrees
(b) There are 24 zeros so the length of h(n] is 25. Since it is a linear phase filter it bas a delay of
(L - 1)/2 = (25 - 1)/2 = 12 samples. That corresponds to a time delay of
(o.5 sa:le) (12 samples)= 6 ms
(c) The zero locations used to aeate the following plot were estinlated from the figure using a ruler
"!'d a protractor.
Estimate of Continuous-nme Magnitude Response

0
m -20 Zero Locations (0):

:E.
.,
,::,
-40 (0.0444),r/T
::, (0.128)1</T
'E
0) -60 ( 0.244)1</T
ca
:!
-80
-100
0 0.2 0.4 0.6 0.8 1
n •Tht
5. 71. (a) There are many possible solutions to this problem. The idea behind any IOlution is to have h(n]
be an upsampled (by a factor of 2) version of g(n]. That is,
h(n] = { g{n/2], n = 0, ±2, ±4, ...

0, otherunse
177
Thus, h[n] will process only the even-indexed samples. One suC:. system would be described by
h[n) = 1 +o(n -2)
gfn) = l+o(n-1)
H(z) = l+z-•
G(z) = l+z- 1
(b) As in part a, there are many possible solutions to this problem. The idea behind any solution is
to choose an h(n] that cannot be an upsampled (by a factor of 2) version of g[n]. Clearly, choosing
h(n] to filter odd-indexed samples satisfies this criterion. One such h{n] would be
h[n] = 1 + o(n - 1) + o(n - 2)
H(z) = 1 + z- 1 + z-•
(c) In general, the odd-indexed samples of h[n] must be zero, in order for a g(n] to be found for which
=
r{n] 11(n]. Thus, there must not be any odd powers of z- 1 in H(z).
(d) For the conditions determined in part c, g{n] is a downsampled (by a factor of 2) version of h[n].
That is,
g[n) = h{2n)
5.72. (a) No. You cannot uniquely recover h[n] from c,..(1].
c.. [1) = h[~ • h(-1]
c,..c.,;w) = H(.,.iW)H(e-iw) = IH(.,.iw)I'
C,..(z) = H(z)H.(1/z")
Causality and stability put restrictions on the poles of H(z) (they must be inside the unit circle)
but not its zeros. We know the zeros of c.. (z) in general occur in sets of 4. Here is why. A
complex conjugate pair of zeros occur in H(z) due to the fact that h[n] is real. These 2 zeros and
their conjugate reciprocals occur in C.,.(z) due to the formula above for a total of 4. Thus, H(z)
is not uniquely determined since we do not know which 2 out of these 4 zeros to factor into H(z).
This is illustrated with a simple example below.
CM(ZJ Im 01/zl •
Oz1
Re
Oz1•
_,ordo<pole 01/z ,
Let the above be the pole-zero diagram for c.. (z) and
H 1 (z) = (1- z,z- 1 ) (1- z;z- 1)
1
H 2 (z) = (1-:,z- ) (1-:iz-
1
)
Since
C.,.(z) = H 1 (z)Hi(l/z•) = B2(z)H2{1/z•)
we cannot determine whether h 1 (n] or h2 (n] generated c,..[1).
178
(b) Yes. The poles of c..(z) must occur in sets of 4 for the same reasons outlined above for the zeros.
However, since the poles of h[n] must be inside the unit circle to be causal and stable we do not
have any ambiguity in determining which poles to group into h[n]. We always choose the complex
conjugate poles inside the unit circle. Here is an example
CM(r, Im X 1/p •
1
xp,
Re
Xp1 •
4thanle<zero X 1/p
1
Let the above be the zero/pole diagram for c.. (z). Then, if h(n] is to be real, causal, and stable
H(z) must equal
1
H(z) -
- (1-p,z- 1 )(1-pjz- 1 )
5. 73. As shown in the book, the most general form of the system function of an allpass system with a
real-valued impulse response is
l•I ER.
where R. is the ROC which includes the unit circle. Correspondingly, the associated inverse system is
which in the time domain is

h;[n] = h[-n]
5.14. We can model g[n] as
g[n] = z[n] + ao[n - no]
Now send the corrupted signal g[n] through a highpass filter hap/ [n] with a cutof of 111, = ,r /2.
179
112
• • • -5 -1 1 5 • • •
-7 -3 o 3 7 n
The highpa.ss filter completely filters out the lowpass signal :r[n]. The output 11[n] is
11[n] = (x[n] + ao[n - no])• h,,,[n]

= ah,,1[n - no]
= a(-l)(n-no)sin f(n - no)
.-(n - no)
y[n] looks similar to the picture of h,,,[n] above except that it is scaled by a and shifted to no- Thus,
a= 211[no]
x[n] = g[n] - 211[no]o[n - no]
(a) When no is odd, y[n] = 0 at all odd values of n except n = no- This leads to a procedure to find
:r[n] from g(n]: ·
• Filter g[n] with the highpass filter described above.
• Find the only nonzero value at an odd index in the output y[n]. This value is 11[no]-
• x[n] = g[n] - 211[no]o[n - no]
(b) The only time three cousecutive nonzero samples occur in 11[n] is at n = no- The procedure to find
x[n] is
• Filter g[n] with the highpass filter described above.
• Look for three cousecutive nonzero output samples. The middle value is 11[no]-
• x[n] = g[n] - 2y[no]o[n - no]
5. 75. Looking at the z-transform of the FIR filter,
00
H(z) = L h[n]z-n
n=O
N-1
= L h(N - l - n]z-n
n=O
Substituting m =N - i - n into the summation gives
H(z) = L• h(m]zm-N+l
m=N-1
180
N-1
= L h[m]z"'z-N+l
.....0
N-1
= z-N+1 L h[m]z"'
.....0
= z-N+1H(z- 1 )
Thus, for such a filter,

H(l/z) = zN-l H(z)
Ti zo is a zero of H(z), then H(zo) = 0, and
H(l/zo) = ,f- 1H(zo) = 0

Consequently, even-symmetric linear phase Fm filters have zeros that are reciprocal images.
181
Structures for Discrete-Time Systems

183
6.1. We proceed by obtaining the transfer functions for each of the networks. For network 1,
Y(z) = 2rcos8z- 1Y(z)- r•z- 2 Y(z) + X(z)

or
H (z) _ Y(z) _ l
1 - X(z) - l -2rcos8z- 1 + r•z-•
For network 2, define W(z) as in the figure below:
W(z)
z[n]
-rsin8
rsin8
rcos8
y[n)
z-•
then
and
Eliminate W ( z) to get
Y(z) rsin8z- 1
H,(z) = X(z) = l -2rcos8z- 1 +r 2 z- 2
Hence the two networks have the same poles.

6.2. The only input to the y[n] node is a unity branch connection from the z[n] node. The rest of the network
=
does not affect the input-output relationship. The difference equation is y[n] z[n].
6.3.
System (d} is recognizable as a transposed direct form Il implementation of H(z).
6.4. (a} From the flow graph, we have:
Y(z) =2X(z) + (~X(z}- ~Y(z} + ~Y(z}z- 1 ) , - 1 .

184
That is:
Y(z)(l + ¼z- 1 - ¾z- 2 ) = X(z)(2 + ¼z- 1 ).
The system function is thus given by:
(b) To get the difference equation, we just inverse Z-transform the equation in a. We get:
1 3 1
11[n] + -11[n - l] - -y[n - 2]
4 8
= 2:[n] + -z[n
4
- 1].
6.5. The flow graph for this system is drawn below.
w[n]
z(n] y(n]
(a)
w[n] = z[n] + 3w[n - l] + w[n - 2]
11[n] =w[n] + 11(n - l] + 2y(n - 2]

(b)
W(z) = X(z) + 3z- 1 W(z) + z- 2 W(z)

Y(z) = W(z) + z- 1 Y(z) + 2z- 2 Y(z)
So
Y(z)
X(z) = H(z)
1
= (1 - z-1 - 2z- 2)(1 - 3z- 1 - z-2)
1
(c) Adds and multiplies are circled above: 4 real adds and 2 real multiplies per output point.
(d) It is not possible to rednce the number of storage registers. Note that implementing H(z) above
in the canonical direct form II (minimum storage registers) also requires 4 registers.
6.6. The impulse responses of each system are shown below.

185
4 4
3 3
1 1 1 1
(a) (b)
0 0
-1 -1
-2 -2
3 3 3
2 2 2 2
1 1 1 1
(c) (d)
0 0
-1 -1 -1 -1
6.7. We have
Therefore the direct form II is given by:
x[n] - • -I--•-i--::::-1-• -1/4
y(n]
1/4
6.8. By looking at the graph, we get:
y[n] = 2y[n - 2] + 3x(n - 1] + x[n - 2].
6.9. The signal flow graph for the system is:
w,(n] w,(n]
x(n] y[n]
z-•
-1 2 w,(n]
w3(n]
,-1
4
186
(a) First we need to determine the transfer function. We have
w1(nj = :i:(nj - tu3(nj + 4w4 (n - lj

w,(n] = ""- (nj
w,(nj = w,(n - lj
w4 (n] = 2w3(n]
11(nj = w,(nj + :i:(n - lj + w,(nj.
Taking the Z-transform of the above eqnations, rearranging and substituting terms, we get:
l + 3z- + z- - s,-
1 2 3
H(z) = ;:_:_..:::...---'-.:..____.:_.
l +z- 1 -Sz- 2
The difference equation is thus given by:
y(nj + y(n - l] - 8y(n - 2] = :i:(nj + 3:t(n - l] + :i:(n - 2] - 8:i:(n - 3].

The in3pulse response is the response to an impulse, therefore:
h(nj + h(n - l] - 8h(n - 2] = J(n] + 3o(n - lj + 6[n - 2] - 8J(n - 3].

From the above equation, we have:
h(O] =l
h(l] =3 - h(O] = 2.
(b) From part (a) we have:
y(nj + y(n - l] - Sy(n - 2) = :t(n] + 3:t(n - l] + :i:(n - 2) - 8:i:(n - 3).

6.10. (a)
w(n] = 2l 11(n] + :t(nj

11(nj = 2l y(n] + 2:t(nj + w(n - lj
y(n] = 11[n - lj + :t(n].
(b) Using the Z-transform of the difference equations in part (a), we get the transfer function:
H(z) = Y(z) = l + 2z- 1 + ,- 2 _

X(z) 1- ½z-' - ½z-'
We can rewrite it as :
H( ) + ,-1 )(1 + z- 1 )
(1
z = (1 + ½z-')(1- z-1)"
We thus get the following cascade form:
:i:(n] -·I____._.!·-•----:
l .--..--I.-1.--:______.I,i
-1/2
187
(c) The system function has poles at z = -½ and z = 1. Since the second pole is on the unit circle,
the system is not stable.
6.11. (a) H(z) can be rewritten as:
z- 1 - 6z-• + sz-•
H(z) = '
1- 2 z -1 .
We thus get the following direct from II ftow graph :

:[n] -- y[n]
t,;-1
1/2
t,;-1
-6
t,;-1
8
{b) To get the trausposed form, we just reverse the arrows and exchange the input and the ouput. The
graph can then be redrawn as:
:[n] y[n]
z-•
1/2
iz-1
-6
Lz-1
6.12. We define the intermediate variables w1 [n], w,[n] and w3 [n] as follows:
-1 W1[n] 2
:[n] ---i----<---11'--+-----ell[n]
188
We thus have the following relationships:
wi(n] =
-z[n] + w:,[n] + w,[n]
w:,[n] = z[n - l] + 2w,[n]
w,(n] = w,[n - 1] + y[n - 1)
1,1[n] =
2w,(n].
Z -transforming the above equations and rearranging and grouping terms, we get:
H(z) = Y(z) = -2 + 6z- 1 + 2z-2 •

X(z) 1-Sz-l
Taking the inverse Z-transform, we get the following difference equation:
6.13.
The direct form I implementation is:
z[n]
- - y[n]
z-• z-1
1/4
I
•
z-• z-•
1/8
-1/2
6.14.
The direct form II implementation is:
z[n]
- - y[n]
z-•
1/2 5/6
z-•
1/2 1/6
!
189
6.15.
1 - !z- 1 + !z- 2
H(z) = l +•z-, + !•z-•.
2
To get the transposed direct form Il implementation, we first get the direct form II:
:i:[n] -
- y[n]
z-1
-1 -7/6
z-1
-1/2 1/6
Now, we reverse the arrows and exchange the role of the input and the ouput to get the transposed
direct form II:
:r[n] y[n]
z-1
-7/6 -1
z-1
1/6 -I . ,
~
6.16. (a) We just reverse the arrows and reverse the role of the input and the output, we get:
:i:[n] y[n]
- -
z-1 z-1
-1/2 -2
'
z-1
1/4 3
190
(b) The original system is the cascade of two transposed direct form ll structures, therefore the system
function is given by:
1
H(z) = ( l - 2z- + 3z-• )(l - !,-').
1-!z-2 2
•
Tbe transposed graph, on the other band, is the cascade of two direct form ll structures, therefore
the system function is given by:
H(z) = (1 - !,-1)( 1 - 2,-: + 3,-2 ).

2 1- •• - 2
Tbis confirms that both graphs have the same system function H(z).
6.17.
(a) Direct form implementation of this system:
(b) Transposed direct form implementation of the system:
6.18. The flow graph is just a cascade of two transposed direct form II structures, the system function is
thus given by:
Which can be rewritten as:

191
(1+2z- 1)(1-lz-
3
1)
B(z) -
- (1 + ¼z-1 - }z-•)(1 - cz- 1)
In order to implement this system function with a second-order direct form ll signal flow graph, a
pole-zero cancellation has to occur, this happens if a = J, = = =
a -2 or a O. U a j, the overall system
function is: ·
1
B( ) 1 + 2z-
z = 1 + lz-1 - !z-2.
Ua = -2 , the overall system function is: • •
And finally if" = 0, the overall system function is:

1 1
B(z) = (1 + 2z- )(1 - Jz- )
l + lz-1 - !z-2
• •
6.19. Using partial fraction expansion, the system function can be rewritten as:
-8 1
B(z) = 1
- 3z
' -1 + 1 + 3Z
• -1 + 9.
Now we can draw the Bow graph that implements this system as a parallel combination of first-order
transposed direct form n sections:
-8
:i:(n] -- -- y(n]
z-•
'
1/3
z-•
-2/3
6.20. The transfer function can be rewritten as:

(1 + 2z- 1 + !z-2 )
B(z) - '
- (1 + ¼z-2)(1 - Jz- 1 + z- 2)
which can be implemented as the following cascade of second-order transposed direct form ll sections:
192
:[n]
-- - y[n]
z-• z-1
2 5/2
z-1 z-1
5/4 -1/4 -1
6.21.
. l Y(z)
h[n] =e1w•"u[n] +-¼ H(z) = . = --.
1 - eJ.,.z- X(z)
1
= =
So y[n] e'w•y[n - I]+ :t[n]. I.et y[n] 11,[n] + i11,[n]. Then 11,[n] + i11,[n] = (cosWo +; sinWQ)(y,[n -
l] + jy,[n - 11) + :r[n]. Separate the real and imaginary parts:
11,[n] = :r[n] + coswo11,[n - l] - sinwoy,[n -1]
y;[n] = sinwoy,[n - l] + coswo11,[n - l].
:r[n] 11,[n]
-sinwo
COSWo
COSWQ
sinwo
6.22.
193
z[n] y[n]
• I
' ' •
I 1/4
I.-: l I 1/2
I.-: I
1 1
( 1 + z- ) ( 1 + z- )
H(z) = 1 - ½z-' 1 - ¼z-' .
z[n] y[n]
• ' ' ' •
I 1/2
I< I I 1/4
I.-: I
Plus 12 systems of this form:
:r[n] y[n]
1/4 1/2
with the three types of !st-order systems taken in various orders.

6.23. Causal LT! system with system function:
(a) (i) Direct form I.
1- lz-1
5
H(z) -
- I- !z-
4
1 + .!.z-
24
2 + .l.z( -
12
3)
so
. 1 1 5 1
bo = 1, bi = --5 and 01 = -4 , a2 = --
24
, 03 = --.
12
194
z[n] 11[n]
- .
z-1 z-'
-1/5 1/4 z-1
-5/24 z-'
-1/12
(ii) Direct form IT.
.-
., [n] 11[n]
,-,
1/4 -1/5
,-•
-5/24
,-•
-1/12
(iii) Cascade form using 6.rst and second order direct form IT sections.
195
1 - 1,-1 1
H(z) = ( 1 + L-1 )( 1 - 1,-1 + 1,-2 ).
4 2 3
So
/Jo, = 1 , bu=-¼ , "21 = 0,
/Jo, = 1 , b1, = 0 , "2, = 0 and
au=-¼, a21 = 0, 012 = 022 ½, = -l·
:i:[n] 11[n]
-
.
,-1 ,-1
-1/4 -1/5 1/2 z-l
-1/3
(iv) Parallel form using first and second order direct form II sections.
We can rewrite the transfer function as:
..ll. .!!. - .l!. z-1
H(z) _ 12> + 12• 12•
- 1 + •lz- 1 1- lz-
,
1 - lz-2 ·
3
So
eo1 = 12:s ,eu =O,
36
•- - .!!. e12--125
'"'U2-125, - 1 and
l , . -0
.,_11 - -4 I ,.21 -
11 - n _
I ._.12 - 2l 1a 22 -- l
-3•
196
27/125
-
z-•
-1/4
(n] y[n]
•
-
--
z-•
1/2 -36/125
z-•
1/3
(v) Transposed direct form II

We tau the direct form II derived in part (ii) and reverse the arrows as well as exchange the
input and output. Then redrawing the flow graph, we get:
w 1 [n]
.-[n] --
y[n]
z-•
w,[n]
-1/5 1/4
z-•
w3[n]
-5/24
z-•
-1/12
(b) To get the difference equation for the flow graph of part (v) in (a), we first define the intermediate
variables: wi[n] , w,[n] and w3 [n] . We have:
197
{1) w 1 [n) = z[n) + w,[n - 1]

1 l
(2) w,[n] = 11[n] + w 3 [n - l] - :r[n]
4 5
5 1
(3) "'3[n] = - 24y[n) - 1211[n - 1)
(4) 11[n] = w 1 (n].
Combining the above equations, we get:
1 5 - 1
11(n)- 11[n- l] + 11[n-2) + 11[n - 3)
4 24 12
= z[n)- 51 z(n -1).
Taking the Z-transform of this equation and combining terms, we get the following transfer func-
tion:
which is equal to the initial transfer function.

6.24. (a)
I
H(z) =l - az-1
·.~•l I
y[n] z[n]
• ' •
y[n] = z[n) + cy[n - 1]

1
HT(z) = l -a.z- 1 = H(z)
(b)
1+ 1 -1
H(z) = 1- •'
½z-'
v[n) z(n]
•
I,
I l~. : I
1/2 1/4
•
198
(c)
y[n]
•
z[n]
•
y[n] = ax[n] + bz[n - l] + c:r[n - 2]
Hr(z) =a+ bz-• + cz- 2 = H(z)
(d)
H rsinllz-•
(z) = l -2rcosllz- 1 + r 2 z- 2
y[n]
,-1
w[n]
-rsinll
rsinll
rcosll z[n]
199
= X +z-1U
V
u = rcos/lV - rsin/lY
w = rsin/lV + rcosllz- 1 W
y = ,-1w
y
=-
X =
Hr(z)
rsinez- 1
= 1 - 2r cosBz-1 + r2z- 2
= H(z).-
6.25. (a)
H(z)
(b)
y[n]
(c) Use Direct Form II:
--
.
:r[n] 11[n]
z-1
11/8 9/8
z-t
-5/4 9/8
z-t
7/8 11/8
z-t
7/8
6.26. (a) We can rearrange H(z) this way:

(l + •- 1 ) 2
H (z) - --'-:,..:...::,.....,'-::
- 1 - lz-1 + z-2
2
200
:,:[n] u[n] v[n] w[n] 0.2

- - 11[n)
z-• z-• z-• z-•

2 1/2 -1 2 2 2
z-l z-• z-• z-•

-1 -1/2 -7/8
The solution is not unique; the order of the denominator 2ud-order sections may be rearranged.
(b)
1
u[n] = :,:[n] + 2:,:[n - 1] + :r[n - 2] + u[n - l] - u[n - 2]
2
1
v[n] = u[n] - v[n - l] -
2v[n- 2]
w[n] = 11[n] + 211[n - l] + 11[n - 2]
7
11[n] = w[n] + 2w[n - lj + w[n - 2] + 2y[n - l] -
811[n - 2].
,L 1
. '
•
-,r -• • '
.. w
T 2
(b) For H,(z) =H(-z), replace each ,- 1 by -,-1 . Alternatively, replace each coeflicient of an
odd-delayed variable by its negative.
201
(c)
1,1[n]
"' [n] .-•
-1 2
.-•
2 -1
.-•
-2 1
.-•
1 -2
6.28.
y[n]
-
- -
"
,-1
a w[n] -1
(a)
1,1[n] = 2'[n] + abw[n] + bw[n - l] + abl,l[n]

w[n] = -1,1[n].
Eliminate w[n]:
y[n] = 2'[n] - abl,l[n] - by[n - l] + abl,l[n]

y[n] = 2'[n] - by[n - l]
So:
1
H(z) = l + 6z-'.
(b)
202
z(n] 11(n]
• •
-b
6.29. (a)
z[n]
• I
11(n]
•
(b) From
it follows that
7
~ n -n
l -as Z -s
L- a z = 1 - az-1 .
n=O
(c)
z[n]
• •
•
11[n]
(d) (i) (c) has the most storage: 9 vs. 7.

(ii) (a) has the most arithmetic: 7 adds + 7 multiplies per sample, vs. 2 multiplies+ 2 adds per
sample.
6.30.
(a)
·-•,----------"--'----------,
...
--..... 203
-
•• .
... . ..
. .
-
- • •
• •
(b)
1
H(z) = 15
~[l+cos(!;(n-no))],-n
14 14
= L ,-n + ..!._15=<)2
..!._
15n=O
L .!. [&it(n-no) + ,-,ft(n-no)] ,-•
l 1- z- 10 l l •-;ifno[l -(&ifz- 1 ) 15 ]
= 151-z-1 + 152 1-&itz-t
l l e;ffno[l - (e-;if z- 1 ) 15 )
+ 15 2 l - .-Atz-1
l [ l le-;ifno
= -(1 - z- 15 ) .,..----,.1 + ~.........,=--+
15 l-z- 1-e'itz-t
1,;itno
2 ]
l - •-;if z- 1 •
(c)
H(,;w) = ..!...-;7w [sin((lSw)/2) _ .!_ .-N,

sin((lSw)/2) _ .!_ ,;fr sin((lSw)/2) ] .
15 sin(w/2) 2 sin((w - ~;)/2) 2 sin((w + (2.-)/15)/2)
When no = 15/2, .
204
1 _;.,.+(h/ll) ( - ·15w,,)]
2c-- ;1 1-e'
eiw+(2;/U) _ e-j•+(2;'UJ
= _!_ [•-;.,'(d"'¥ - ,-;.,¥) -

15 2jsinj
½•-;"'7,-;fr(d"'¥ - ,-;.,¥)
2; sin ("'
2
<; 1"1)
½•-;"' 7dfr (d¥"' - ,-;¥"')]
2j sin ( w+(2;115))
= ,-;w7 [•in(l5w/2) _ ½•-;,=•, sin{l5w/2) _

15 sin(w /2) sin ("' (2; /IS))
½dn sin(l5w/2)]
sin ( w+(2; /15))
....... -.... -
..
.. .. ••
When no= 0,
•-;.,, [sin{l5w/2) ½e-h'< sin(l5w/2)
= - - sin(w /2) +..____,,....;:.'--'--:.,..:.
15 sin { w-(2; /15))
+
½&n sin(ISw/2)]
sin ( 1o1+(2;/15))
.....,.,_.._ ..
The system will have generalized linear phase if the impulse response has even symmetry (note it
cannot have odd symmetry), or alt.ematively, if the frequency response can be expressed as:
H(,;.,) =,-;•7 A.(ei"')
205
where A.(ei"') is a real, even, periodic function in w. We thus conclude that the system will have
generalized linear phase for no = 1f k, where k is an odd integer.
(d) Rewrite H(z) as
15 1
l-z- 1 cos~-cos(:!!c+~)z-
H(z) = ---
15
--- [
1- ,-
+ " 1
1- 2cos + z- 2• 15
z-1
" 2
]
•
15
1/15
:fn]
:,; 111in]
z-15 ,-1
-1
") /3
-1
where o = cos(2irno/15), /3 = - cos(2ir(no + 1)/15), and 1 = 2 cos(2ir /15).

6.31. (a)
G u[n]
:,;iTn] l+r -[n]
!/
-r r -1
1-r
.-, wn] z-1
u[n] = G:z:[n] + w[n - 1]

w[n] = -ru[n] - (1 - r)tl[n - 1]
y[n] = (1 + r)u[n] - ry[n - 1].
(b)
U(z) = GX(z) + z- 1 W(z)

W(z) = -ru(z) - (1- r)z- 1 Y(z)
Y(z) = (1 + r)U(z) - rz- 1 Y(z).
206
Solve for U(z) in terms of X(z) and Y(z):
U(z) = GX(z) - (I - r)z- 2 Y(z)

l+rz- 1
Then
2
Y(z) =(I+ r) {GX(z) - (I - r)z- Y(z) }- ,z-'Y(z)
I+ rz- 1
Y(z)(l + rz- 1 ) = G(l + r)X(z) - (1- r 2 )z- 2 Y(z) - rz-'Y(z) - r 2 z-2 Y(z)
Y(z)(l + 2rz-• + z- 2 ) = G(l + r)X(z)
H ( ) G(l +r)
, z = 1+2rz-'+z-•·
From the quadratic formula, the poles are at (-r + ;Jr=?"J- 1 and (-r - ;Jr=,J"J- 1 • The
magnitude of ea.ch pole is I. The angles are
respectively.
(c) U(z) = ,- 1(GX(z) + W(z)}, W(z) = -rU(z)- (1- r)Y(z), and Y(z) = z- 1((1 +r)U(z)- rY(z))
lead to
+ r)z- 2
H2(z) = 1 +G(l2rz- 1 + z- 2 = z
_2
H 1 (z).
6.32. (a)
11,[n] = (I+ r):z: 1[n] + r:z:,[n]

112[n] = -r:z:1 [n] + (1 - r}:z:2(n].
(b)
11,[n] = (1 + a):z:,[n] + d:t2[n] (a= r = d)

112[n] = (1 + cd):z:,[n] + ab:t,[n] (c = d = -1).
(c)
11,(n] = (1 + e):z:,[n] + e:t2(n] (e = r)

112(n] = e/20,(n] + (1 + e/):z:2[n] (/ = -1).
(d) B and C preferred over A:

(i) coefficient qu&Dtiution. If r is small, 1 + r may not be precisely representable even in floating
point. Also, network A has 4 multipliers that must be qnantiud, while B and C have only I.
(ii) computational complexity. Networks Band C require fewer multiplications per output sampl~
6.33.
.-• -0.54
H(z) = 1- 0.54z-1.
(a)
207
•
z[n] •
11[n]
b c
H(z) = ai,-1 + d
1- bz- 1
so set b = 0.54, c = -l.852, and d = -0.54.
(b) With quantized coefficients b, c, and d, &i -I l and d -I -bin general, so the resulting system would
DOI be alJpass.
(c)
,-1
•
z[n] •
11[n]
-1
(d) Yes, since there is only one "0.54" to quantize.

(e)
H(z) = ( :='. ~~1 ) ( :='b;!.)

Cascading two sections like ( c) gives
z-1 w[n] .-,
• •
-1 w[n-1] -1
The first delay in the second section has output w[n - l] so we can combine with the second delay
of the first section.-
z-1 -1
•
z[n]
11[n]
•
208
(f) Yes, same reason as part (d).
6.34. (a) We have:
w 1 (n] w,[n]
2 11[n]
•
:i:(n]
•
First, we find the system function, we have:
(1) w1 (n] = :i:[n] + w2[n - l]

(2) w,[n] = :i:(n] + w,[n - l]
(3) w,[n] = 2w1 [n] + w4(n - lj
(4) 11[n] = w,[n]
(5) W4(nj = -11[n] - w,[n]
Taking the Z-transform of the above equations and combining terms, we get:
(1- z- 1 )Y(z) + z- 1 Y(z) = (2 + z- 1 )X(z).
H z _ Y(z) _ 2 + z- 1
( ) - X(z) - 1 + z-1 - z-2
Since the system function is second order (highest order term is ,-• ), we should be able to im-
plement this system using only 2 delays, this can be done with a direct form II implementation.
Therefore, the minimum number of delays required to implement an equivalent system is 2.
(b) Now we have:
w,(n] w,[n]
2
:i:[n]
Let's find the transfer function, we have:

209
(1) w1(n] = z(n] + w,[n - l]

(2) w2(n] = z[n] + w3[n - l]
(3) w3[n] = 2w1[n)
(4) W4{n) = -w3{n - l] - y(n]
(5) ws(n] = t113{n) + w,[n - l]
(6) y(n] = Ws{n]
H(z) = Y(z) = 2(1 + z- 1)(! - z-

1
) _
X(z) 1-2z-2
Since the transfer function is not the same as the one in part a, we conclude that system B does not
represent the same input-output relationship as system A. This should not be surprising since in
system B we added two unidirectional wires and therefore changed the input-output relationship.
6.35.
(a) Direct form I:
z-1/3
-
z[n]
- y[n]
z-1 z-1
'"'
z
From the graph above, it is clear that 2 delays and 2 multipliers are needed.
(bl
Inverse Z -transforming, we get:

1 I
y(n] - -y(n - l]
3
= --:r[n]
3
+ :z:[n - l]
210
1
11[n] = (11[n - l] - :z:[n]) + :z:[n - l]
3
Which can be implemented with the following Bow diagram:
.-1
f,,'
:z:[n] •
I: I
- - - - - - - - - - • 11[n]
I
-1 ,-1
(c)
z- 1 - ! z- 1 -2
H(z) = (l-3z
1 :1 ){ 1 - 2 -1 ).
z
This can be implemented as the cascade of the Bow graph in part (b) with the following Bow graph:
:r[n] •
I, .
.-,
I: I
• 11[n]
-1 ,-1
However the above Bow graph can be redrawn as:
-1 ,-1
:r[n] • I
' ,-•!
: I· I • y[n]
Now cascading the above Bow graph with the one from part (b) and grouping the delay element
we get the following system with two multipliers and three delays:
-1
:z:[n]-· ~1---:_:r_/--,. _:1,~·.I. . . . .

_=-:
:........_-.....-·I -·y[n]
-1
211
6.36. (a) Transpose = reverse arrows direction and reverse the input/output, we get:
l, .
w,(n]
:r(n] •
l·-:
l :, -,: ,,~
..,, (n]_
• w,(n]
•
z-1
• y[n]
(b) From part (a), we have:
(1) w 1 (n] = 2:r(n] + "'3[n]

(2) 1t12[n] = :r[n] + w 1 [n -1]
1
(3) w,[n] = - y[n] + 2y[n - l]
2
(4) y[n] = w,[n] + y[n - l]
Taking the Z -transform of the above equations, substituting and rearranging terms, we get:
Finally, inverse Z-transforming, we get the following difference equation:
1
y[n] - l] - 2y[n - 2] = :r[n] + 2:r[n - l].
2y[n -
(c) From part (b), the system function is given by:
H(z) = 1 + 2,-1 .
1- lz-
2
1 - 2z-2
It has poles at
8 8
- - - and z
1 - -/33
= ----
1 + -/33
which are outside the unit circle, therefore the system is NOT BIBO stable.
(d)
y(2] = :r(2] + 2:r[l] + ½Y[l] + 2y[0]

11[0] = :r[0j = 1
y[l] =:r[l] + 2:r[0] + f y[O] = ½+ 2 + ½=3
Therefore,
1 3 19
11[2] =-4 + 1 + -2 + 2 =-.
4
6.37. (a)
212
H[O]
,-,
...
H[l]
,-,
z,
1/N
:r[n]
- ''
- y[n]
''
'' '
''
'
' '
H[N-1]
(b) Note that the•• 's are the zeros of (1 - ,-NJ. Then write H(z) over a common denominator:
H(z) =
Therefore, H(z) is the sum of polynomials in ,- 1 with degree :SN -1. Hence, the system impulse
response has length :S N.
(c)
!
213
= ii):) (o(n] - o(n - NJ) • (z.u(n]l

= ii):l (zru(n] - z:-N u(n - NJ]
= ii}:] z.{u(n] - u(n - NJ}.
So
. h(n] = ( !~ B(k].,;~.,.) (u(n] - u(n - NJ).
(d) Note that, since (l - z;;.N) = 0,
= (1 - z-N)ii(m)/NI
l - z,,,z- 1
z=.i: ..
d N •
= j!i"{(l - z- )H[m]/N}lz=z-
1;{1 - z,,,z-l }Jz=z-
N z;;.N-l b[m]/N
= z,,,z;;.•
= H(m]z;;.N
= H[m].
(e) If h[n] is real, JH(eiw)I = =
JH(ei<2 •-wl)j, and LH(ei"') -LH(ei< 2•-wl). H(ei 2rtfN) = H[k] =
=
Jii[k]lei'l•j, so Jii[k]j Jii[N - k]j and ii[k] = -1/(N - k], k = 0, 1, ... , N - l.
H(z) = (l _ z-N) [H[O]/N

1- z- 1
+ t'
t=l
1-
H[k]/N + H(N/2]/N +
Ztz- 1 1- ZN/ 2 z- 1
~
L.,
~,~
ii[l)/N ]
1 - z,z- 1
= (l _ z-N) [H[O]/N
1 - z- 1
+ ii[N/2]/N +
1 + z- 1
t-• 1H[k)/N
L.,, - ztz- 1
+ t-=-• H[N - p]/N]
L., 1 - ZN-.,,z- 1
t=l p=l
= (l - z-N) [ii[O]/N
I - z- 1
+ H[N/2]/N +
1 + z- 1
t-• (1H[k]/N
L.,, - ztz- 1
+ H[N - k)/N)]
1 - z_.z- 1
•=1
= (l - z-N) [H[O]/N + H[N/2]/N +
l-z- 1 l+z- 1
..!_ t-• H[k](l - z_•z- 1

) + H[N - k](l - ztz- 1 )]
N t=l
L, (1- ZtZ- 1)(1 - Z-tZ- 1)
= (i _ z-N) [ii[O]/N + H[N/2)/N +

l-z- 1 l+z- 1
t-' 2JH[k] . cos(ll[k]) - z- cos(ii[k] - 21rk/N)]
2dz- 1 +z-2
1
"-'
t=l N l-2cas IV
And since H[O] = H(l), H[N/2] = H(-1),

H( ) _ ( _ -N) [H(l)/N H(-1)/N
z - 1 z 1- z-1 + 1+ z-1 +
214
t.' 2IH(e;~•, cos[9(2d:/N)] - ,- 1 cos[9(2irk/N) - 2irk/N]]

.L., N · 1- 2cos(21rk/N)z 1 + z- 2 •
>=1
H H[14] = O,then H[16 - 14] = .ii[2] = o also .
.ii[oJ/16
-[n]
:,; -
y[n]
-z-16 .-,
llH[l]I
"
.-,
/3 Q
.-•
'Y
where"= cos(c?(l]l, a= -cos(9(1]- (2•-/16)), /3 = 2cos(21r/!6), and -r = -1.

6.38. (a)
.-•
zTn] - --- '
h(O] h(l] h(2] h[lO]
M:!
M (N + 1) multiplies per output sample; MN adds per output sample.

215
(b)
oln]
M:l M:l M:l
h[O] h[l] h[lO]

-
Illn]
N + 1 multiplies per output sample; N adds per output sample. The number of computations has
been reduced by a factor of M in both adds and multiplies.
(c)
--
:r[n]
M:l
111•n]
-
,-,
l I'2
The total computation can not be reduced because to compute the value of any given output
sample, the previous output value must be known.
216
(d)
nI
- M:l
-
z-1 z-•
7/8 1/2
CJ
u
M:l
.-,
1I12 7I 8
M:l
.-, .-,
1/2
I 7/8
rIVJ
. M:l
-
z-1
7 I8 112
I
Only direct form IT (ii) can be implemented more efliciently by commuting operations with the
downsamplers.
6.39. Since each section is 3.4cm long, it takes
3.4cm - 10-•
3.4~ - 104 - sec
to traverse one section. Since the sampling rate is 20ldh {T, = 0.5 - 10-.sec), it takes two sampling
intervals to traverse a section. The entire system is linear and so the forward going and baclcward going
217
waves add at a boundary. Let

A. -A•
Otn= An+A1i:
(from A• into A.); then a•• = -a•• and we get:
•
:i:(n]
6.40. (a) For rounding:
Ps(e)
1/A
-A/2 A/2 e
(b) For truncation:
Ps(e)
1/A
-A
218
m, = .!..[ ede = .!.. i']"

A _4 A 2 _4
= ~
2
~=.!..[ e•de_t:.• = ~1• _A• =t:.•.

' A_ _ 4 3A _ 4 4 4 12
6.41. Since the system is linear, 11[n] is the sum or the outputs due to :z:1[n] and :z:2[n]. Therefore
00 00
11[n] = L h,[k]:z:,[n - k] + L
b:-c:c,
h2[k]:z:2[n - k]
= 11,[n] + 112[n].
The correlation between 11,[n] and 112[n] is
E{y,(m]112[n]} = E {,f 00
h,[l)z,[m - l) · .f 00 h2[k]:r2[n - k]}
00 00
= L L h,[l)h2[k]E{x,[m - l):r2[n - kl}

t=-00 l=-oo
If :z:,[n] and :z:2[n] are uncorrelated, E{:r 1 [m - l):z:2[n - kl}= O; hence, E{y,[m]y2[n]} = 0. Therefore,
11,[n] and 112[n] are uncorrelated.
6.42. (a) The linear noise model for each system is drawn below.
!
219
(a)
z[n] ho y(n]
(b)
-
b, a
(2a 2 )
(c)
y[n]
l.-:
z[n] ho
•
.,-• j '
I ' ' •
:b,.
l (3<72)
I a
(b) Clearly (a) and (c) are different. Thus tbe answer is either (a) and (b) or (b) and (c). H we take
(b) apart, we get
220
bo '
-- -
,-, ,-,
b, a
'
=
bo
• •
We see that the noise all goes through the poles. Note that the la' source sees a system function
(I - az- 1 )- 1 while the 2<7 2 source sees ,- 1 /(1 - a,- 1 ). However, the delay (z- 1 ) does not affect
the average power. Hence, the answer is (b) and (c).
(c) For network (c),
or using the frequency domain formula,
OJ = 3o-2_I_f l __ I_ dz
2,rj l - az- 1 l - az z
= 3o-2_l_f dz
2,rj (z - a){l - az)
3u2
= 1-a•·
For network (a),

H(z) = bo + b,z-'1
1- az-
h[n] = boo[n] + (bo + b, )a"u[n]

a
• Time domain calculation:
221
= 2u2+u2(b2 +(abo+b,.)2)·
o l -a2
• Frequency domain calculation:
= _21.
1'J
f H(z)H(,-') dz
z
= L (residues of H(z)~(,-')inside unit circle).

H(z)H(z- 1 ) (bo + b,z-')(bo + b,z) z
z = (z:... a)(l - az) ;
(boz + b,)(bo + b,z)
= z(z - a)(l - az)
-b,bo
residue (z = 0) = - a
-
2
.d ( _ ) _ (boa+ b,)(bo + b,a) _ ~a+ /?,a+ b,bo + b1 boa
res, ue z - a - a(l - a•) - o(l - c')
baa+ /?,a+ b1bo + b1boa2 - b1bo + b,boa 2

= a(l - a 2 )
ha + /?, + 2bob, a
= 1 -a 2
= b' + (abo + b,)2
o 1- a2
6.43. (a)
1 1
y[n] = y[n - l] +
4 2, n 2'. 0
1L (l)'
111n1 = -2i=O - = 11- (!f+l
n
;
4 2 i
For large n, y[n] = (1/2)/(3/4) = 2/3.
(b) Working from the diHerence equation and qoa.ntizating after multiplication, it is easy to see that,
= =
in the quantized case, 11(0] 1/2 and y(n] 5/8 for n 2'. 1. In the unquantized case, the output
monotonically approaches 2/3.
ll
32
..,
li!
'
i.rn.
2048
• 11[n] unqoa.ntized
n
0 1 2 3 4 5
222
! ! 5 5 !
1 8 8 i i I
2 y[n] quantized
I 0
llllI
1 2 3 4 5
n
(c) The system diagram is direct form II:
So
!
Y(e'w) = H(e'w)X(e'w)
·
=1- 1 .
4 e-Jw
=
which implies that y[n] (1/2)(1/4)", which approaches O as n grows large.
To find the quantized output (working from the difference equa.tion): 11[0] 1/2, y[l] = =1/8, and
=
y[n] 0 for n 2.e:
l
'
2 1
fi
_, ...L
128
512
'
y[n] unquantized
n
0 1 2 3 4 5
½ !
•
y[n] quantized
n
0 1 2 3 4 5
6.44. (a.) To check for stability, we look at the poles loca.tion. The poles are located at
z "' 0.52 + 0.84j and z "' 0.52 - 0.84j.
Note that
izl 2 " ' o.976 < 1.
The poles are inside the unit circle, therefore the system function is .stable.
223
(b) If the coefficients are rounded to the nearest tenth, we have
1.04 ➔ 1.0 and 0.98 ➔ 1.0.
Now the poles are at

z= l-;,/3 andz= l-j./3_
2 2
Note that now,
1•12 = l.
The poles are on the unit circle, therefore the system is not stable.
6.45. The flow graphs for networks 1 and 2 respectively are:
· ·.-•D-a• · n.-•
a"'-J ·
z[n] -------w~1.-[n_J_ _ _
wi.[n_J_ __.._......._ y[n]
z[n]
• I
y[n]
•
(a) For Network 1, we have:
= z[n] -
w 1 [n] a8 z[n - 8]
w,[n] = ay[n - l] + w,[n]
y[n] = w,[n]
Y(z)(l - az- 1 ) = (1 - a•,-1 )X(z)

That is:
1 - a.•z-•
H(z) = 1-az- 1
•
For Network 2, we have:
y[n) =z[n) + az[n - 1) + a 2z[n - 2) + ... + a7:r[n - 7].

224
Taking the Z-traosform, we get:
Y(z) = (1 + az- 1 + a2z-• + ... + a 7 z- 7 )X(z).

So:
(b) Network 1:
z{n]
Network 2:
z[n]
,-, .-, z-• z-• z-• .-• z-•
1
., a' •• a• a• a• a1
y[n]
(c) The nodes are circled on the figures in part (b).

(d) In order to avoid overflow in the system, each node in the network must be constrained to have
a magnitude less than 1. That is if w•ln] denotes the value of the ktb node variable and h.[n]
denotes the impulse response from the input z[n] to the node nriahle w•ln] , a sufficient condition
for /w.[n]I < 1 is
1
z...,. < ~-co lh>[mJr
In this problem, we need to make sure overflow does not occur in each node, i.e. we need to "'11:e
the tighter bound on z,..,. For network 1, the impulse response from "'2[n] to y[n] is anu[n],
therefore the condition to avoid overllow &om that node to the output is
w,,... < 1-laj.

Where we assumed tlw lal < 1. The transfer fnllction &om z{n] to w 1!n] is 1 - a• z-•, therefore
to avoid overllow at that node we need:
w1 [n] < Zmo,(l - a 8 ) < 1- jaj.
,
225
We thus conclude that to avoid overflow in network 1, we need:
1- ial
:z:ffl4% < --a
1 ••
Now, for network 2, the transfer function from input to output is given by o[n] +acS[n-1) +a2 6[n-
2] + ... + a1 o[n- 7], therefore to avoid overflow, we need:
l
:...., < l+ Ial+a2 + ... +,..
,_,,.
(e) For network 1, the total noise power is ,~ti-

For network 2, the total noise power is 7~. For
network l to have less noise power than network 2, we need
~,, <
1- a
1cr:.
That is:
5
!al< 7.
The largest value of lal such that the noise in network l is less than network 2 is therefore J.
227
Filter Design Techniques

229
7.1. Using the partial fraction technique, we see
H.(s) = s+a = 0.5 _ + 0.5 .

(s + a) 2 + 1,2 •+a + Jb s + a - Jb
Now we can use the Laplace transform pair
•-atu(t) ;-+ _l_

s+a
to get
(a) Therefore,
h,[n] = hc(nT) = ~ [,-<•+;•)nT + ,-<•-;•)nT] u[n]
H1 (z) = 0.5 0.5 l•I > ,-•T

1 _ e-<•+Jb)T z-1 + I_ e-(o-;o)T z-1'
(b) Since
we get
S _ s+a _ A, A2 A2
,(s)- ,(s+a+jb)(s+a-jb) - s + s+a+jb + s+a-jb
where
a 0.5
A1 = a2 + b2' A2=---
a+ jb
Though the system h 2 [n] is related by step invariance to h,(t), the signal s 2 [n] is related to s,(t) by
impulse invariance. Therefore, we know the poles of the partial fraction expansion of S,(s) above
must transform as z1 = e•• T, and we can find
A, A2 2 A
S.(z) = l _ ,-1 + l _ e-(a+;•)T z-1 + l _ e-<•-;•)T ,-1
Now, since the relationship between the step response and the impulse response is
n oo
•2[n] = L h2[k] = L h2[k]u[n - k] = h2[n] • u[n]
S.(z) = 1-
H2(z)
z- 1
We can finally solve for H2(z)

H2(z) = S2(z)(l - ,- 1)
A l - ,-1 A" l - ,-1 izl > ,-•T
= A1 + 21 - e-(•+ib)T z-l + :z 1 - e-<•-,6)T z-1'
where A1 and A, are as given above.
!
230
(c)
s 1 [n) = t h,[k] = ~ t( e-<•+i•l•T + e-<•-i•l•T)
=
12 [l _
1=-00
1 - e-(o+;•>T
l:=O
e-(•+i•)(n+l)T
+
1_ e-<•-i•)(n+l)T]
1 - e-<•-i•lT u[n]
= [s, + s,.-,.+;•)Tn + B,,-1•-i•)Tn] u[n]
where
1- ,-•T cosbT e-<o+;•)T
B, = 1 - 2e-•T cos bT + ,-2oT' B, = - I _ e-l•+i•)T
;.From this we can see that
B, B2 Bi
= I_ z-1 + 1_ e-(o+ji)T z-1 + 1_ e-(o-j6')T z-1
I S.(z)
since the partial fraction constants are different. Therefore, s 1 [n] I s2[n), the two step responses
are not equal.
Taking the inverse z-transform of H2(z)

h2[n] = A1 6[n] + A2 [,-(-+i•)Tnu[n) - ,-<•+ib)T(n-llu[n - IJ]
+ Ai [,-1•-ib)Tnu[n] - e-<•-;•JT(n-llu[n - 1J]
where A1 and A2 are as defined earlier. By comparing h,[n] and h2[n) one sees that h,[n] I h2[n).
The overall idea this problem illustrates is that a filter designed with impulse invariance is different
from a filter designed with step invariance.
7.2. Recall that n = w/T•·
(a) Then
o.s912s :s IHUO)I :s 1, o :s 1n1 :s 0.2.- /T•
IH(jO)I :S 0.17783, 0.3,r /Td :5 101 :5 fr /Td
The plot of the tolerance scheme is
I H(jO) I
1
o.a912s -J;;:;:;;;;,-s-.a:--i.1-:..=;i:ii
o.1naa
00
231
(b) As in the book's example, since the Butterworth frequency response is monotonic, we can solve
1
IH,(io.2..JT•>I' = >N = (0.89125) 2
l + ( 0.2 .. )
O,Td
IH,(j0.3.-JT.)1 2 = l 2N = (0.17783) 2
l+ (0_3.,)O,T4
to get O,Td = 0.70474 and N = 5.8858. Rounding up to N = 6 yields O,Td = 0.7032 to meet the
specifications.
(c) We see that the poles of the magnitude-squared function are again evenly distributed around a
circle of radius 0.7032. Therefore, H,(s) is formed from the left half-plane poles of the magnitude-
squared function, and the result is the same for any value of Td- Correspondingly, H(z) does not
depend on Td-
7 .3. We are given the digital filter constraints
1-o, :S IH(e'w)I :SI +o,, 0 :S lwl :S Wp

IH(e'w)I :So,, w, :S lwl :S"
and the analog filter constraints
l - cl, :S IH,(;0)1 :S I, o s 101 so,

IH,(;0)1 :S cl,, o, s 101
(a) If we divide the digital frequency specifications by (l + o,) we get
1- o,
1-cl, = l+ o,
26,
cl,
cl,
=
=
.
I +01
I+ o,
(b) Solving the equations in Part (a.) for 61 and o,, we find
cl,
o, =
2 - cl,
26,
0, = 2 - cl,
In the example, we were given
6, = 1 - 0.89125 = 0.10875
cl, = 0.17783
Plugging in these values into the equations for o, and o,, we find
o, = 0.0575
a, = 0.1881
232
The filter H'(z) satisfies the discrete-time filter specifications where H'(z) = (I+ o,)H(z) and
H(z) is the filter designed in the example. Thus,
-2.1428 + 1.1455,- 1
H'(z) = 1 0575 [ 0.2871 - 0.4466z-•
· 1 - l.297lz-1 + 0.6949z-• + 1 - l.069lz-1 + 0.3699z- 2
1.8557 - 0.6303z- 1 ]
+ 1 - 0.9972z-1 + 0.2570z-2
0.3036 -0.4723z-• -2.2660 + 1.2114z- 1
= 1 - l.297lz-1 + 0.6949z- 2 + 1 - l.069lz- 1 + 0.3699z-•
+ 1.9624 - 0.6665z-1
1 - 0.9972z-1 + 0.2570z-2
(c) Following the same procedure used in part (b) we find
1. [ 0.0007378(1 + z- 1 ) 1
H'(z) = 0575
(1- l.2686z- 1 + 0.7051z- 2)(1- l.0106z- 1 + 0.3583z- 2)
X1 - 0.9044z-! + 0.2155z- 2]
0.0007802(1 + Z- 1)'
= (1 - l.2686z- + 0.7051z- 2)(1 - l.0106z- 1 + 0.3583z- 2)
1
1
x--------~
1 - 0.9044z-1 + 0.2155z-2
7.4. (a) In the impulse invariance design, the poles transform as z• = , .. T, and we have the relationship
1 Td
- a +-+ ----==,--~
I+- 1 - e-oT-,z-1
Therefore,
H,(s)
= 2/Td _ 1/Td
• + 0.1 s + 0.2
1 0.5
= - ----
•+0.1 •+0.2
The above solution is not unique due to tbe periodicity of z = .;w. A more general answer is
_ 2/Td
H,(s)
- •+(0.1+;~) s+ (0.2+;~)
where k and I are integers.
(b) Using the inverse relationship for the bilinear transform,
1 + (Td/2)s
z=
1- (T./2)s
we get
2 1
H,(s) = 1 - e--<>- 2 ( W,) 1 - e--<>-• ( W,)
2(•+ 1) <• + 1)
= s(l + e--<>.2) + (1 - e--<>·2) a(l + e--<>·•) + (1 - e--<>·•)
= (1+!--02) ( . + · ~ )-(1+!-•• ) (.+'~)

Since the bilinear transform does not introduce any ambiguity, the representation is unique.
233
7.5. (a) We must use the minimum specifications!
6 = O.Ql
l!.w = 0.05.-
A = -20log10 6=40
A-8
M + 1 = 2 _285.<:l.w + 1 = 90.2 -+ 91
/3 = 0.5842(A - 211•·• = 3.395
+ 0.07886(A - 2ll
(b) Since it is a linear phase filter with order 90, it has a delay of 90/2 = 45 samples.
(c)
Hiei"')
1
.
-It -0.6251t -0.31t 0 0.31t 0.6251t It (I)
h.,[n] = sin(.625.-(n - 45)) - sin(.3.-(n - 45))

.-(n - 45l
7.6. (a) The Kaiser formulas say that a discontinuity of height l produces a peak error of 6. If a filter has
a discontinuity of a different height the peak error should be sea.led appropriately. This filter can
be thought of as the sum of two filters. This first is a lowpass filter with a discontinuity of l and
a peak error of 6. The second is a highpass filter with a discontinuity of 2 and a peak error of 26.
lo the region 0.3,r S lwl S 0.475,r, the two peak errors add but must be less or equal to than 0.06.
6 + 26 $ 0.06
6...,. = 0.02
A= -201og(0.02) =33.9794
/3 = 0.5842(33.9794 - 211•·· + 0.07886(33.9794 - 21) = 2.65
(b) The transition width can be
l:.w = 0.3,r - 0.2,r ar
6w = 0.525,r - 0.475,r
= 0.1,r rad = 0.05,r rad
=
We must choose the smallest transition width so l:.w...,. 0.05.- rad. The corresponding value of
Mis
33.9794-8
=
M 2.285(0.05,r) 72.38 -+ 73 =
7.7. Using the relation w = flT, the passband cutoff &eqnency, w9 , and the stopband cutotr frequency, w.,
are found to be
Wp = 2.. (1000110-<
= 0.2.. rad
= 2r(llOO)l0-'
"'•
= 0.22.- rad
234
Therefore, the specifications for the discrete-time frequency r~nse H4(ei•) are
0.99 $ IH.C&")I $ 1.01, 0 $ '"'' $ 0.20,r

JH.(ei")I $ 0.01, 0.22 .. $ '"'' $ .-
7.8. Optimal Type I filters must have either L + 2 or L + 3 alternations. The filter is 9 samples long so its
order is 8 and L = M /2 = 4. Thus, to be optimal, the filter must have either 6 or 7 alternations.
Filter 1: 6 alternations Filter 2: 7 alternations
Meets optimal conditions Meets optimal conditions
7.9. Using the relation w =OT, the cutoff frequency we for the resulting discrete-time filter is
We = flcT
= [2.-(1000)][0.0002]
= 0.4.- rad
7.10. Using the bilinear transform frequency mapping eqnation,
w, = 2tan- 1 (fl;T)
3
= 2 tan-1 (2.-(2000)(~.4 X 10- ))
= 0.7589.- rad
7.11. Using the relation w = flT,
We
fie = T
,r/4
= 0.0001
= 2500,r
= 2.-(1250) rad
s
7.12. Using the bilinear transform frequency mapping equation,
fie = 2
-tan
T
-
2
(w')
= 2 ("'2)
0.001 tan 2
2000 rad
= s
= 2,r(318.3) rad
s
7.13. Using the relation w = flT,
We
T = fie
21t/S
= 2"(4000)
= 50µs
This value of T is unique. Although one can find other values of T that will alias the continuous-time
frequency fie = 2.-(4000) rad/s to the disaete-time frequency We = 2,r /5 rad, the resulting aliased filter
will not be the ideal lowpass filter.
235
0, = ftan (w, ~2.-k) • k an integer
= ftan(~')
T 2
= 2.-(300) tan (3,r/5)
- 2- = 1.46 ms
The only ambiguity in the above is the periodicity in w. However, the periodicity of the tangent function
"cancels" the ambiguity and so T is unique.
7.15. This filter requires a maximal passband error of••= 0.05, and a maximal stopband error of 6, = 0.1.
Converting these values to dB gives
op= -26 dB
•• = -20 dB
This requires a window with a peak approximation error less than -26 dB. Looking in Table 7.1, the
Hanning, Hamming, and Blackman windows meet this criterion.
Next, the minimum length L required for each of these filters can be found using the "approximate
width of mainlobe" column in the table since the mainlobe width is about equal to the transition width.
=
Note that the actual length of the filter is L M + 1.
Hanning:
8,r
0.1,r= M
M = 80
Hamming:
8,r
o.i.- =
M
M = 80
Blackman:
12,r
= M
0.171"
M = 120
7.16. Since filters designed by the window method inherently have 6, = cS, we must use the smaller value for
6.
6 = 0.02
A = -20log10 (0.02) = 33.9794
{J =0.5842(33.9794- 21) 0
·• + 0.07886(33.9794- 21) =2.65
A- 8 33.9794 - 8
M = 2.285&, = 2.285(0.65.- - 0.63.-) = 180.95 ➔ 181
7.17. Using the relation w = OT, the specifiation, which should be used to design the prototype continuous-
time filter are
-0.02 < H(jO) < 0.02, 0 :S 101 :S 2r(20)
0.95 < H(jO) < 1.05, 2,r(30) :S 101 :S 2.-(70)
-0.001 < H(jO) < 0.001, 2.-(75) :S 101 :S 21r(lOO)
!
236
Note: Typically, a continuous-time filter's passband tolerance is between 1 and 1 - 6, since historically
most continuous-time filter approximation methods were developed for passive systems which have a
gain less than one. H necessary, specifications using this convention can be obtained &om the above
specifications by scaling the magnitude response by ,.:.S.
0, = !.T tan ("'•)

2
= 2 x 210- tan (~)
2 3
= 2.-(51. 7126) rad
s
2
0,, = !.tan("'')=
T 2 2 x 10-
tan ( 0·23") = 2.-(81.0935) rad
3 s
Thus, the specifications which should be used to design the prototype continuous-time filter are
IH.(jO)I < 0.04, 101 :S 2.-(51. 7126)
0.995 < IH.(jO)I < 1.005, 101 ~ 2.-(81.0935)
Note: Typically, a continuous-time filter's passband tolerance is between 1 and 1 - 6, since historically
most continuous-time filter approximation methods were developed for passive systems which have a
gain less than one. H necessary, specifications using this co;,vention can be obtained &om the above
specifications by scaling the magnitude response by nJo.-.
7.19. Using the relation w = llT,
w
T = n
.-/4
= 2ir(300)
= 417 µs
This choice of T is unique. It is possible to find other values of T that alias one of the given continuous-
time band edges to its corresponding discrete-time band edge. However, this is the only value of T that
maps both band edges correctly.
7.20. True. The bilinear transform is a frequency mapping. The value of H(s) for a particular value of,
gets mapped to H (e1w) at a particular value of w according to the mapping
S - .!.. (1 - ,-iw)
- T• l +e-iw ·
The continuous frequency axis gets warped onto the discrete-time frequency axis, but the magnitude
values do not change. H H(s) is constant for alls, then H(e'") must also be constant.
7.21. (a) Using the bilinear transform frequency mapping equation,
we have
(b)
237
lt ················ . . . . . . . . . . . . . . . . . . . . . ······•··· .. .
"'p
0+---------------------•
0
(c)
w, = 2 tan-• ('\T•)
21.an-• (nf•)
w, =
tow= w, -w, = 2[tan- (n;T•) -1.an- (n;T•)]
1 1
lt
oL-__:================-
o
7.22. (a) Applying the bilinear transform yields

H(z) =
l•I > 1
which has the impulse response
h[n] = 2Td (u[n] + u[n - 1])

238
(b) The difference equation is

Td
y(n] = (:z:(n] + :z:(n - 11) + y[n - 1]
2
This system is not implementable since it has a pole on the unit circle and is therefore not stable.
(c) Since this system is not stable, it does not strictly have a frequency response. However, if we ignore
this mathematical subtlety we get
= T•
2
(l+•-;"')
1- .-,..
=· r. (,;--1• + ,-;..,,)
2 ,;..12 _ ,-;,,,12
T•
= 2
j cot(w/2)
and since the Laplace transform evaluated along the j!l axis is the continous--time Fourier transform
we also have
H,(j!l) = j~
I H(ei"') I
2h
-It 0 7t/2 1t Ol
LH(ei"') LHC (j.Q)

!t/2 ,------1 !t/2
It It
-It 0 0) -It 0 n
-7t/2 1 - - - - -
In general, we see that we will not be able to approximate the high frequencies, but we can
approximate the lower frequencies if we choose T• 4/,r. =
(d) Applying the bilinear transform yields
G(z)
Jzl > 1
which has the impulse response
g(n]
239
(e) This system does not strictly have a frequency response either, due to the pole on the unit circle.
However, ignoring this fact again we get
G(.,;w) = ;. [! ~ :=::]
= 2 (.,;w/2 _,-;w/2)
Tc1 eiw/2 + e-ii.1/2
i.
2·
= tan(w/2)
G(jO) = ;n
-II 0 1112 II
., -II 0 1112 II n
LG(ei"') LG (jO)
C
1112 1112
-II -II
0 II ., 0 II n
-1112 -1112
Again, we see that we will not be able to approximate the high frequencies, but we can app•oxim•te
the lower frequencies ifwe choose T• 4/1'. =
(f) If the same value of T• is used for each bilinear transform, then the two gystems are inverses of
each other, since then
7.23. We start with IHc(jrl)I,
(a) By impulse invariance we scale the frequency axis by T• to get
. =1
IH, (e'w)I ~ He (·"'
,!:.,, J T. + J.2.-k)I
T.
240
1Cht
-71 -0.171 0.171 71 Cl)
Then, to get the overall system response we scale the frequency axis by T and bandlimit the result
according to the equation
n
(b) Using the frequency mapping relationships of the bilinear transform,
n = :.tan(i),
w = 2tan- 0{•) ,
1
(
we get
10,t
--
0.9871
-71 71 Cl)
Then, to get the overall system response we scale the frequency axis by T and bandlimit the result
according to the equation
H (iO)J _ { JH,(eiwT)I, 1n1 < ;.

I •• - o, JOI>¥,
241
I Helf (jO) I
• 10lt
-9800lt
7.24. (a) Expanding the sum to see things more clearly, we get
r A
= L ( • J• + G.(s)
bl I - lo
A1 A2 A, G( )
= + (S - .. ) 2 + + (1 - .. Jr +
0 0 0
I - .. C$
Now multiplying both sides by (• - ,.J• we get

(• - •or Hc(•l = A1 (• - •oJ•- 1 + A2(• - .. r-• +···+A, + (• - •orG.(s)
Evaluating both sides of the equal sign at • = ,. gives us
A,=<• - •or Hc(•l 1.....

Note that (s - ,.)'Gc(•J = 0 when•=,. because Ge(•) bas at most one pole at s = ••-
Similarly, by taking the first derivative and evaluating at • = •o _we get
! I(• - •or H,(s)) , -
= L(r - l:)At(• - ,.J<•-•-•> + ds [(s - •orG.(s)]
1=1
d
- d
= (r - l)A, <• - .. i•-2 + (r - 2)A2(• - ..r-• +···+A,_, + 0 + ds I(• - ..re.(,
A,,.-1 = ! [(• -,.J• He(•)] I..,,,

This idea can be continued. By taking the (r - l:)-th derivative and evaluating at s = so we get
the the general form
d'-•
At = (r -1 k)! ( d,•-· [(, - •or Hc(•Jl l,z.. )
(b) Using the following transform pair from a lookup table,
i1-1 1
(k-1)!•-"'u(t)-+ (s+o)•' ?u{s} > -a
we get
242
7.25. (a) Answer: Only the bilinear transform design will guarantee that a minimum phase discrete-time
filter is created &om a minimum phase continuous-time filter. For the following explanations
remember that a discrete-time minimum phase system bas all its poles and zeros inside the
unit circle.
Impulse Invariance: Impulse invariance maps left-half 6-plane poles to the interior of the z-plane
unit circle. However, left.half s-plane zeros will not necusarilN be mapped inside the z-plane
unit circle. Consider:
H,(s)
H(z)
H we define Poly.(z) = Ilf., {I -e•,T•,- 1), we can note that all the roots of Poly.(z) are
j"¢Jc
inside the unit circle. Since the numerator of H(z) is a sum of A•Poly.(z) terms, we see
that there are no guarantees that the roots of the numerator polynomial are inside the unit
circle. In other words, the sum of minimum phase filters is not necessarily minimum phase.
By considering the specific example of
s+ 10
H,(s) = (s + l)(s + 2)'
and using T = l, we can show that a minimum phase filter is transformed into a non-minimum
phase discrete time filter.
Bilinear 'Iransform: The bilinear transform maps a pole or zero at s = So to a pole or zero
(respectively) at Zo = :~f;: .Thus,
l.zol = 11l +
-
f.. I
2 so
Since H,(s) is minimum phase, all the poles of H,(s) are located in the left half of the •-plane.
Therefore, a pole so = a + jfl must have a < 0. Using the relation for , 0, we get
(l + ta) 2 + (tO)•
l.zol = (1- fa) 2 + (tfl)2
< I
Thus, all poles· and zeros will be inside the z-plane unit circle and the discrete-time filter will
be minimum phase as well.
(b) Answer: Only the bilinear transform design will result in an allpass filter.
Impulse Invariance: In the impulse invariance design we have
H(e'w) = .t.., 2
He(;(;.+ ;:))
The aliasing terms can destroy the allpass nature of the continuous-time filter.
243
Bilinear Transform: The bilinear transform only warps the in,quency axis. The magnitude
response is not affected. Therefore, an all pass filter will map to an all pass filter.
(c) Answer: Only the bilinear transform will guarantee
H(e'"')l.,=0 = H,(jO)ln=0
Impulse Invariance: Since impulse invariance may result in aliasing, we see that
if and only if
or equivalently
f: (l;,k)
,.., __ H, =O
....
which is generally not the case.
Bilinear Transform: Since, under the bilinear transformation, 0 = 0 maps tow= 0,
H(e'0 ) = H,(jO)
for all H,(s).

(d) Answer: Only the bilinear transform design is guaranteed to create a bandstop filter from a
bandstop filter.
If H, (s) is a bandstop filter, the bilinear transform will preserve this because it just warps the
frequency axis; however aliasing (in the impulse invariance technique) can fill in the stop band.
(e) Answer: The property holds under the bilinear transform, but not under impulse invariance.
Impulse Invariance: Impulse invariance may result in aliasing. Since the order of aliasing and
multiplication are not interchangeable, the desired identity does not hold. Consider Ho, (s) =
=
H.,(s) •-•T/2_
Bilinear Transform: By the bilinear transform,
(f) Answer: The property holds for both impulse invariance and the bilinear transform.
Impulse Invariance:
H(e'"') = .tao H, (; (;: +~ k))

= f
l:=-cc
Hc1 (; (;: + ~k)) + f: Hc2 (; (;: + ~k))
t=-00
= H 1 (e'"') + H,(e'"')
244
Bilinear Transform:
H\z) = He\~. \l-+•~~0)

= H,, (;. G::=:)) +H,, (;. G::=:))
= H 1 (z) + H2(z)
(g) Answer. Only the bilinear transform will result in the desired relationship.
Impulse Invariance: By impulse invariance,
H, (eiw) = . f: (i (;. + 2;.k))

A:=-oo
H,,
H2 (eiw) = f: 2
+ ;.k))
H,, (; (;..
•=-00
We can clearly see that due to the aliasing, the phase relationship is not guaranteed to be
maintained.
Bilinear Transform: By the bilinear transform,
H1 (eiw) = He, (; ;, tan(w/2))
H2(eiw) = H,, (; ;. tan(w/2))
therefore,
7.26. (a) Since
and we desire
we see that
H(e'w )lw=0 = ~ (·(w 2.-k)) lw=0 = H,(jO)ln=0
L. H, 1 T• + T, .
lr=-oo
requires
f: (;2;,k) =O.
H,
·---
....,
(b) Since the bilinear transform maps ll = 0 tow = 0, the condition will hold for any choice of H,(jll).
7.27.
245
(a)
h1 [n] = h[2n]
00
H, (e'w) = L h[2n]e'wn
n=-00
= I:
n even
h[n]e"r
= f.
n.=-00
~ [h[n] + (-lth[n]Je'"r
I ¥I(""")
= 2H(e' ) + 2H e3-,-
H, (ei"')
1/2
-lt -w/2 0 7[ (1l
(b)
h[n/2],-Jwn
H2(e'w) =
I:
n even
00
h[n]e-Jw2n
= I:
n.=-oc
= H (<'2w)
HiCei"'J
- 1
-
-x-7lt/8 -lt/8 0 lt/8 7lt/8 x <1l
(c)
-lt -3lt/4 0 3lt/4 lt (1l

246
7.28. (a) We have
1- z- 1
• = 1 + z- 1
1- e-jw
;n = 1 + e-Jw
ei""/2 _ e-Jw/2
= eiw/2 + e-J,.;/2
n = tan (i)
O.=tan(w;') ........ w,,. = 2ian- (0,) 1
(b)
I+ z- 1
• = 1-z-•
1+ e-jw
;n = 1- e-iw
e31i11/2 + e-iw/2
= eii.1/2 _ e-iw/2
n = -cot (i)
= =(w;.-)
n, = tan ( w"' 2-.-)
(c)
(d)
The even powers of z do not get changed by this transformation, while the coefficients of the odd
powers of z change sign.
Thus, replace A, C, 2 with -A, -C, -2.
7.29. (a) Substituting Z = ei' and z = e3w we get,

,_;• = _,_;..,
= ,!(""'+•)
8-,r
8=2w+.- +---+ w=-2-
(b)
247
H, (ei"')
ec ec
'
A
.
0 7fl2 II (I)
(c)
h[n] +-+ B(,,;')
h1[n] +-+ B (,,;<..,+•>)
In the frequency domain, we first shift by 1r and then we upsample by 2. In the time domain, we
can write that as
h [n]
1
= { (-l)nl2 h[n/2], for n even
O, for n odd
(d) In general, a filter
H(z) = bo + b,z- 1 + 1>,z-• + · ••+ b,.,_,zM-I + b,.,z-M
ao + a1z- 1 + a2z- 2 + · · · + CN-1zN-l + aNz-N
will transform under Hi(z) = H(-z2 ) to
bo - b,z-• + 1>,z-• + · · · - bM_,z2M-• + bMz-•M
H,(z) = -=--=-~-=---'----=--=---'---'=--~
Go - a1z-2 + a2z-t + ... - aM-1z2N-2 + O.Nz-2N
where we are assuming here that M and N are even. All the delay terms increase by a factor of
two, and the sign of the coellicient in front of any odd delay term is negated.
The given difference equations therefore become
g[n] = z[n] + a,g[n - 2] - bif[n - 4]
/[n] = -a2g[n - 2] - l>,/[n - 2]
y[n] = cif[n] + c2g[n - 2]
To avoid any possible confusion please note that the b, and a, in these difference equations are
not the same b, and a, sbown above for the general case.
7.30. We are given·
H(z) = He(•) I -/J[=]
1+ .. - ·
,=
where a is a nonzero integer and /3 is a real number.
(a) It is true for /3 > 0.

Proof:
• = /3 + z-
z-o
[11- 0
]
s + ,z-0 = /3 - {Jz-o
• -/3 = -/3z-a - sz-o
{J-. = z- (/J + s)
0
z-o = /3-.
fJ +.
zo /3 +.
= fJ-.
!
248
The poles •• of a stable, causal, continuous-time filter satisfy the condition & {s} < 0. We want
these poles to map to the points z•
In the z-plane such that lz• I < 1. With a > 0 it is also true
that if lz•I < I then lzfl < l. Letting •• =,; + jw we see that
< l
lz•I
< l
lzfl
1.B+a+JOI < 1.8- u-JOI
(,8 + a) 2 + 0 2 < (,8- a) 2 +02
2a,8 < -2<7,8
But since the continuous-time filter is stable we have&{,.} < 0 or a < 0. That leads to
-,8 < ,8
This can only be true if ,8 > O.
(b) It is true for ,8 < 0. The proof is similar to the last proof except now we have jz0 j > 1.
(c) We have
z' =
2
:~ ;J.=,n
lz I = l
izl = l
Hence, the jO axis of the s-plane is mapped to the unit circle of z-plane.
(d) First, find the mapping between {l and w.
1- e-i'lw
j{l = 1 + e-i2w
eJw - e-i1,,1
= eJw + e-ir.i
{l = tan(w)
w = tan- 1(0)
Therefore,
l - 61 :s IH(e-'~)I :s l + 61, { lwl :S i} U { 34" < lwl < "}

Note that the hlghpass region 3,r /4 :S lwl :S ,r is included because tan(w) is periodic with period
,r.
7.31. (a)
l + z- 1 s+ I
• = ---,-
1 - z-
+--+ z = - -
1 •-1
Now, we evaluate the above expressions along the jO axis of the •-plane
jO+ l
z =
;n-1
lzl = l
249
(b) We want to show 1•1 < 1 if 'R.e{ s} < 0.

<T+jO+ I
z = <T+ jO -1
✓<"' + 1)2 + O'
l•I = ✓c.. - 1)' + o•
Therefore, if l•I < 1
c.. + 1)2 + 0 2 < c.. - 1)2 + o•

q < -u
it must also be true that ., < 0. We have just shown that the left-half s-plane maps to the interior
of the z-plane unit circle. Thus, any pole of Hc(s) inside the left-half •-plane will get mapped to
a pole inside the z-plane unit circle.
(c) We have the relationship
1 + e-i""
;o = 1 - e-,w
e'..,/2 + e-JIIJ/2
= eiw/2 _ e-Jw/2
o = - cot(w/2)
10,1 = lcot(,r/6)1=-✓3
10,,, I = Icot(.-/2)1 = o
1n.,1 = lcot(,r/4)1=1
Therefore, the constraints are
0.95 S IHc(iO)I S 1.05, 0 S 101 $ I

IHc(iO)I S 0.01, -✓3$ 101
7.32. (a) By using Pa.rseval's theorem,
<2 = 2..1·
2,r -ir
IE(e'W)l 2 dw
= L""
n.=-00
le[n]l 2
where
(b) Since we only have control over e[n] for 0 $ m $ M, we get that <2 i, minirniwl if h[n] = h,,[n]
for 0 $ n $ M.
(c)
0$n$M,
w[n] = { ~: otherwise.
which is a rectangular window.

250
7.33. (a)
Hd(~w) = (1 - 2u(w))~(•l•-•wl for- ,r < w < ,r
IHd(~w)I = 1, 'lw
;----~'1112
It
-It 0
-'1112 i----....:
(b) A Hilbert transformer of this nature requires the filter lo have a zero at z = 0 which introduces the
180° phase difference at that point. A zero at z = 0 means that the sum of the filter coefficients
equals zero. Thus, only Types ill and IV fulfill the requirements.
(c)
For the -windowed Fm system lo be linear phase it must be antisymmetric about ';. Since the
ideal Hilbert transformer h.i[n] is symmetric about n = T we should choose T = ':.
{d) The delay is M/2 = 21/2 = 10.5 samples. It is therefore a Type IV system. Notice the mandatory
zero at w = 0.
IH(ei°')I
0-1--------------~ It
251
=
(e) The delay is M /2 20/2 = 10 samples. It is therefore a Type ID system. Notice the mandatory
=
zeros at w 0 and ,r.
Oi------------......;
(j) "
7.34. (a) It is well known that convolving two rectangular windows results in a triangular window. Specifi-
cally, to get the (M + 1) point Bartlett window for M even, we can convolve the following rectangular
windows.
r,(n] = { [k, n=0, ... ,~ -1

0, otherwise
r2(n] = r 1(n - 1]
Using the known transform of a. rectangular window we have
WR,(eiw) = {2sin(wM/4) -jw(-'f-½)

VM sin(w/2)
WR,(eiw) = {2 sin(wM/4) ,-,w( -If+½)
VM sin(w/2)
Ws(ei"') = WR, (ei"')WR,(ei"')
2
= 2_ (sin (wM/4)) -jwll/2
M sin(w/2) e
Note: The Bartlett window as defined in the text is zero at n = 0 and n = M. These points are
included in the M + 1 points.
For M odd, the Bartlett window is the convolution of
r,(n] = {.[b. n -- 0 , ... ,--y--

0, otherwise
M-t
= {.f½, - ,-.-
n - 1, ... M-1
••lnJ
0, otherwise
In the frequency domain we have
= {2 sin(w(M + 1)/4) -,w( ¥ )
VM sm(w ;2J
= {2sin(w(M- l)/4) jw(.l!.f-!+t)
VM sm(w/2)
Ws(ei"') = WR,(ei"')WR.(ei"')
= 2. (smlw(M + 1)/21) (sm(w(M - 1)/2]) -jwll/2
M sin(w/2) sin(w/2) e
252
(b)
2
w[n] = [A+ Bcos ( :;') + Ccos ( ;,n)] WR(n]
4
W(,;w) = {2.-A6(w) +Bir [6 (w + !;) +6 (w- !;) ] +Cir [6 (w + ;;) + 6 (w- ;;) ]}
~ { sin(w(M + 1)/2)) e-jwlll/•}
2,r sin(w/2)
where @ denotes periodic convolution.
=
(c) For the Hanning window A= 0.5, B -0.5, and° C =0.
2
Wftanmnglnl = [o.s - o.scos ( :;')] w,[nJ
Wftanning(,;w) = 0.5WR(,;w) -0.25WR(,;w)@ [6 (w + !;) + 6( W - :)]
= 0.SWR(,;w)-0.25 [wR(,;<w+~l) + WR(e'Cw-~>)]
where
W (,;w) = sin(w(M + 1)/2)) -jwM/2
R sin(w/2) e
Below is a normalized sketch of the magnitude response in dB.
Normalized Magnitude plot in dB
7.35. (a) The delay is ': = 24.

(b)
1/2 1/2 - - - - ~
--0.6lt 0 0.3lt 0.6lt II {I)
This can be viewed as the sum of two lowpass filters, one of which has been shifted in frequency
(modulation in time-domain) tow= ,r. The linear phase factor adds a delay.
h,[n] = sin(0.3,r(n -24)) + !(-l)(n-••>sin(0.4.-(n -24))
1r(n - 24) 2 .-(n - 24)
253
(c) To find the ripple values, which are all the same in this case since it is a Kaiser window design, we
first need to _determine A. Since we lcnow /j and A are related by
0.1102(A - 8.7), A> 50
{J = 3.68 = { 0.5842(A - 21) 0 ·• + 0.07886(A - 21), 21 $ A $ 50
0, A< 21
we can solve for A in the following manner:
=
1. We lcnow /j 3.68. Therefore, from the formulas above, we see that A 2'. 21.
2. If we assume A > 50 we find,
3.68 = 0.1102(A - 8.7)
A = 42.1
But, this contradicts our assumption that A > 50. Thus, 21 :,; A $ 50.
3. With 21 $ A $ 50 we find,
3.68 = 0.5842(A - 21) 0·• + 0.07886(A- 21)
A = 42.4256
With A, we can now calculate 6.
6 = 10-A/20
= 10-42.425<1/20
= 0.0076
The discontinuity of I in the first passband aeates a ripple of 6. The discontinuity of 1/2 in the
second passband aeates a ripple of 6/2. The total ripple is 36/2 = 0.0114 and we therefore have
61 = 6, = 6, = 0.0114
Now using the relationship between M, A, and t:.w
A-8
M = 2.285!:.w
42.4256- 8
2.285(48) =0.3139 a, 0.I,r
Putting it all together with the information about Hd(eiw) we arrive at our final answer.
o.9886 $ IH(eiw)I $ 1.0114, 0 :S w $ 0.25w
IH(eiw)I :5 0.0114, 0.35w $ w $ 0.55w
o.4886 :5 IH(eiw)I :5 0.5114, 0.65w :,; w $ ff
I H(ei'°) I
1 t 20,
0.5 203 t
i;2
o-l-----___.;-..:..1.--===-;....--;..--------,,--- n
0 0.2511 0.3511 0.5511 0.6511 II
!
254
7.36. (a) Since H(ei0 J t, 0 and H(ei•J t, 0, this must be a Type I filter.
(b) With the weighting in the stopband equal to 1, the weighting in the passband is ~-
W(Ol)
1.6~---------,
00 0.4,c 0.581t It (I)
(c)
IE(Ol)I
li2
It
0
-li2
(d) An optimal (in the Parks-McClellan sense) Type I lowpass filter can have either L + 2 or L + 3
alternations. The second case is true only when an alternation occurs at all band edges. Since this
filter does not have an alternation at w = .-
it should only have L + 2 alternations. From the figure,
= =
we see that there are 7 alternations so L 5. Thus, the filter length is 2L + 1 11 samples long.
(e) Since the filter is 11 samples long, it has a delay of 5 samples.
(f) Note the zeroes off the unit circle are implied by the dips in the frequency response at the indicated
frequencies.
Re
0
101h order pole
7.37. (a) The most straightforward way to find h,i(n] is to recognize that H,(,;w) is simply the (periodic)
convolution of two ideal lowpass filters with cutoff frequency We= .-/4. That is,
where
255
Therefore, in the time domain, hd[n) is (hipt[n)) 2 , or

2
hd[n) = (5in<:/4))
sin2 (.-n/4)
=
(b) h[n] must have even symmetry around (N - 1)/2. h[n] is a type-I FIR generalized linear phase
system, since N is an odd integer, and H(eiw) ,f- 0 for..,= 0. Type-I FIR generalized linear phase
systems have even symmetry around (N - 1)/2.
(c) Shifting the filter hd[n) by (N - 1)/2 and applying a rectangular window will result in a causal
h[n] th..t roinirni:res the integral squared error •· Consequently,
· 2 ['( N-1))
h[n] = sm • n- 2 w[n)
.-•(n _ N
2 1 )2
where
w[nJ = { l, 0$ n$ N - 1
0, otherwise
(d) The integral squared error <
can be reformulated, using Parseval's theorem, to

00
•= L Ja[n] - hd[n)J
-00
2
Since
a[nJ = { hd[n), _N,1 $ n $

0, otherwise
N•'
-(N-1)/2-1 (N-1)/2 00
< = :E Ja[n] - hd[n]l 2 + :E Ja[n] - h,,[n]J2 + :E Ja[n] - h•[n]l

2
-00 -(N-1)/2 (N-1)/2+1

-(N-1)/2-1 00
2
= :E
-00
Jh.i[nJI' + o+ :E
(N-1)/2+1
lha[nJl
By symmetry,
00
• =2 L Jh,,[n)J
2
(N-1)/2+1
7.38. (a) A Type-1 lowpass filter that is optimal in the Parks---McClellan can have either L + 2 or L + 3
alternations. The second case is true only when an alternation occun at all band edges. Since this
=
filter does not have an alternation at "' 0 it only bas L + 2 alternations. From the figure we see
there are 9 alternations so L = 7. Thus, M = =
2L 2(7) 14. =
256
(b) We have
hHp(n] = -ei'"h£p(n]
HHP(ei"') = -HLP(,i(w-•))
= -A,(ei<w-•>),-;cw-•>¥
= A,(,;<w-•l)e-;.,y
= B,(ei"')•-;.,y
where
B,(ei"') = A,(,i<w-•l)
The fact that M = 14 is used to simplify the exponential term in the third line above.
(c)
II (I)
(d) The assertion is c:orrect. The original amplitude function was optimal in the Parks-McClellan
sense. The method used to create the new filter did not change the filter length, transition width,
or relative ripple sizes. All it did was slide the frequency response along the frequency axis creating
a new error function E'("') = E("' - ,r). Since translation does not change the Chebyshev error
(max IE("')I) the new filter is still optimal.
7 .39. For this filter, N = 3, so the polynomial order L is
N-1
L = --=I
2
Note that h[n] must be a type-I FIR generalized linear phase filter, since it consists of three samples,
and H (,;., ) ,;. 0 for "' = 0. h[n] can therefore be written ill the form
h[n] =a6[n] + M[n - l] + aa[n - 2]

Taking the DTFT of both sides gives
H(ei"') = Cl+ 1,e-;.. + ... -;2.,
= ,-iw(czeiw + b + ...-;..)
= ,-;"'(b + 2acosw)
A(ei"') = b+2acosw
257
=
The filter must have at least L + 2 3 alternations, but no more than L + 3 = 4 alternations to satisfy
the alternation theorem, and therefore be optimal in the minimax sense. Four alternations can be
obtained if all four band edges are alternation frequencies such that the frequency response overshoots
at w = 0, undershoots at w = i, overshoots at w = f and undershoots at w = ,r.
I
Let the error in the pa.ssband and the stopband be •• and 6,. Then,
A( ,Jw) Jw=0 = l +6,

A(eJw)
A(&w)
lw=•/3
lw=•/2
=
=
1-•.
A(&w) lw=• = ••-6,
Using A(eiw) = b + 2acosw,
A(&w) Jw=<J = b+ 2a
A(e;w) lw=•/3 = b+a
A(&w) lw=•/2 = b
A(e;w) lw=• = b-2a
Solving these systems of equations for a and b gives
2
a = 5
2
b = 5
Thus, the optimal (in the minimax sense) causal 3-point lowpass filter with the desired passband and
stopband edge frequencies is
h[n] = 52o[n] + 52 o[n - 2
l] + o[n - 2]
5
7.40. True. Since filter C is a stable IIR filter it bas poles in the left half plane. The bilinear transform maps
the left half plane to the inside of the unit circle. Thus, the discrete filter B has to have poles and is
therefore an Iffi filter.
7.41. No. The resulting discret,,.time filter would not have a constant group delay. The bilinear trans-
formation maps the entire jfl axis in the s-plane to one revolution of the unit circle in the z..plane.
Consequently, the linear phase of the continuous-time filter will get nonlinearly warped via the bili-
nar transform, resulting in a nonlinear phase for the discret,,.time filter. Thus, the group delay of the
discrete-time filter will not be a constant.
7.42. (a) Using the fact that H,(s) = }:\:\ and cross multiplying we get
H ( ) = Y.,(s) A
' s X,(s) = s+c
(s + c)Y.,(s) = AX,(s)
dy,(t) + cy,(t) = Aze(t)
dt
(b)
dy,(t)
di,
I
t=nT
= [Az,(I) - C!/,(t}j lt=nT
= Az,(nT) - cy,(nT)
y,(nT) - y,(nT - T)
::: Az,(nT) - cy,(nT)
T
258
(c)
y[n] -y[n - 1]
T = Az[n) - cy[n)
Az[n] = (c+ f) y[n]- fy[n-1]

AX(z) = (c + f) Y(z) - f Y(z)•-•
H( ) = Y(z) = A
z X(z) c+ +-+•-•
(d)
= 1-z-
.,.----
1
+C
= H(z)
(e) First solve for z

1- .-•
s = - T-
1
z = 1-sT
and then substitute s = "+ jn to get
1
z = 1- (" + ;n)T
1 ei ...-•us>
=
Jc1 - ">' + <nT>'
If we let 8 =tan-•(:':.) we see that
1
= 2(1 1- <7) (ei' + .-;•)
and thus the s-plane maps to the z-plane in the following manner
z = [2(1 l- <7) (ei' + .-;•)] ei'

= l+lei211
2(1 - <7) 2(1 - <7)
= 1 + 1 .,-. ...-•(e.-)
2(1 - <7) 2(1 - <7)
To find where the ;n axis of the s-plane maps, we let • =;n, i.e., " = 0 and find
1 l ~;2 ... ·'(0T)
'= 2 + 2..
259
Therefore, the jO-ms maps to a circle of radius 1/2 that is centered at 1/2 in the z-plane. We
also see that_ the region c, < 0, i.e., the left half of the ,-plane, maps to the interior of this circle.
s-plane
z-plane
jQ
(I
If the continuous-time system is ,table, it, poles are in the left half s-plane. As shown above, these
poles map to the interior of the unit circle and so the discrete-time system will also be stable. The
stability is independent of T.
Since the jO-ms does not map to the unit circle, the ~ete-time frequency response will not be
a faithful reproduction of the continuous-time frequency response. As T gets smaller, i.e., as we
oversample more, a larger portion of the jO-ms gets mapped to the region close to the unit circle
at w = 0. Although the frequency range becomes more compressed the shape of the two responses
will look more similar. Thus, as T deaeases we improve our approximation.
(f) Substituting for the first derivative in the differential equation obtained in part (a) we get
y,(nT + T) - y,(nT) ( T)
T +cycn = Ax,(nT)
y[n + l] - y[n] []
T +eyn = Ax[n]
Y(z) A
H(z) = X( ) = 1 = H,(s) 1,-•-•
z T+c --,.-
z-1
s =
T
z = l+sT
= l + c,+ jOT
To find where the ;n axis of the s-plane maps, we let s = jO, i.e., " = O and find
z = l +jOT
Therefore, the jO-ms lies on the line 1ue{z} = 1. We also see that the region c, < 0, i.e., the left
half of the s=plane, maps to the left of this line.
z-plane
!
260
If the continuous-time system is stable, its poles are in tbe left half •-plane. As shown above, these
poles can map to a point outside tbe unit circle and ,o tbe discrete-time system will not necessarily
be stable. There are cases where ""Ying T can tum an onstable system into a stable system, but
it is not true for the general case.
Since tbe jO-axis does not map to the unit circle, the discrete-time frequency respome will not be
a faithful reproduction of the continuous-time frequency response. However, as T gets smaller our
approximation gets better for tbe same reasons outlined for the first backward difference.
7.43. (a} Just doing the integration reveal,
Using the area in the trapezoidal region to replace tbe integral above, we get
lle(nT) = J."T Ye (T)dT + 1/e(nT - T)

nT-T
"= [ile (nT)+ lie (nT- T)]; + 1/e(nT -T)
(b} Solving for i;, (nT) in the differential equation we get
ii, (nT) = Aze(nT) - cy,(nT)

Substituting this into the answer &om part (a} yields
T
y,(nT) = [Aze(nT) - cy,(nT) + Azc(nT - T) - cy,(nT - T)]
2 + y,(nT - T)
(c) The difference equation is

T
y[n] = (A.z[n] - cy[n] + Az[n - l] - cy[n - l]} 2 + y[n - l]
y[n] (1 + c;) -y[n -1] (1 - c~'.) = Af (z[n] + z[n -1]}

Therefore,
Y(z} [1 + c;]- Y(z)z- 1 [1 - cf] = A}X(z) (1 + z- 1J
H Y(z) At(l + z- 1 )
(z) = X(z) = 1 + cf - z-1 + z-•ct
(d}
= I - z- 1 + cf (1 + z- 1 )
= H(z)
+,(jO} = He(jO)He(-jO)
+(z) = H(z)H(z- 1 )
261
(a} (i} Since H.(s) has poles at ••• H.(-•} has poles at -••·
(ii} The material in this chapter shows that under impulse invariance
A• T•A•
- - +-+ -
8 - $j; 1 -~ --.
~.1tT4z-l
Thus, going from step l to step 2 means that the autocorrelation of the discrete-time system
is a sampled version of the autocorrelation of the continuous-time system.
(iii) Since +(z) = H(z)H(z- 1 ) we can choose the poles and zeros of H(z) to be all the poles inside
the unit circle, and that choice leaves all the poles and zeros outside the unit circle for H(z- 1 ).
Consider the following example using h.(t} = ,-0 'u(t).
l 1
H.(s) =-
s+o
- and H.(-•l =- -
-s+o
+.(,} = H.(s)H.(-•i
= [,!0] [-,~0]
1/20 _ 1/20
= s+0 s-0
+(z} = T•/2o T•/20
if 0 > 0, then
h[n] = ✓-::.(I - ,->aT,) (,-or,f u[n]
(bl Since !H.(jn)j 2 = +.(in) and ♦ (&"'}= H(&"')H(e-;,.,} = !H(&"')l2 , we see that since ¢[m] =
T.¢.(mT.), .
+( ei"'} = J;,., •. (; (;: + 2;.1c)) ·

Therefore, if +.(in)= 0 for 1n1 2! I;, then ♦(&"')=+. {;1.;) and jH(ei"'}l2 = jH. (ii;) I'•
(c} No. We could always cascade H(z) with an allpass filter. The new filter is dilferent, but has the
same autocorrelation.
262
7.45. (a) Since the two 8ow diagrams are equivalent we have
z- 1 - a I - oz
z-•
= 1-az- 1 =-;=-;--
z-o
z = 1-oz
· = H,,(Z)lz= •-• = H,, (z-o)
H(z) -1 - -
t--a - QZ
(b) Let Z = ei8 and z = ei"'. Then

z- 1 -o
z-• = 1- oz- 1
e-jw - Q
1- oe-Jw
e-;'-oe-;•e-jw = e-;w -Q
,-;"'(l + a,-;8 ) = ,-;•+a

e-;, + o
1 + ae-i 8
e-;s + a 1 + oe16
= 1 + ae-;8 · I+ oei 6
,-;• + 2a + o'ei'
= 1 + 2ocos8 + o 2
Using Euler's formula,
cos9- jsin9 + 2a + o 2 case+ jo2 sin8
e-jw = 1 + 2ocos8 + o 2
2a + (1 + a') cose + j[(o' - 1) sin9]
= 1+2ocos9+a2
Noting that -w = tan-• [ ¼,f:r],
-w = tan-• [ (a' - l)sin9 ]
2o+(l+o')cos8
2
w = tan-• [ (l-o )sin8 ]
2a + (1 + <>2) cose
This relationship is plotted in the figure below for a = 0, ±0.5.
Warping of the frequency scale, LPF to LPF
(1)
263
Although a warping of the frequency scale is evident in the figure, (except when o 0, which=
corresponds to z-
1 = ,-, ), if the original system has a piecewise-constant lowpass frequency
response with cutoff frequency 8,, then the transformed system will likewise have a similar lowpass
response with cutoff frequency "'• determined by the choice of o.
w _ tan-• [ (l - a2) sin(8,) ]

• - 2o + (l + o 2 ) cos(8,)
(c)
xjnJ,----------0----y(n)
xjn) -----------1--+--<l,___
1
__., y[n)
H(z) -1
Htp(Z) r
- o.p -
Looking at tbe 6ow graph for H(z) we see a feedback loop with no delay. This effectively makes
the current output, y[n], a function of itself. Hence, there is no computable difference equation.
(d) y,., the 6ow graph manipulation would lead to a computable difference equation. The 6owgraph
of an FIR filter has a path without delays leading from input to output, but this does not present
any problems in terms of computation. Below is an example.
H,P(Z) bo
xjn) y(n)
xjn) ) l y(n)
r'! :: j H(z) -1
-1
b,
The transformation would destroy the linear phase of the FIR filter since the mapping between 8
=
and_ w is nonlinear. The only exception is the special case when o 0, i.e., when 8 w. =
Since there are feedback terms in the transformed filter, it must be an IIR filter. It therefore has
an infinitely long impulse response. ·
(e) Since the two 6ow diagrams are equiva.lent we have
-11 -
z-• = z
-1 z-1 - Q
1- az- 1
=z - -
z- a
QZ
z-a
z = z--
1-az
H(z) •-• = H,, (zz-o)

= H1,(Z)lz=, t-.a- --
1- az
Letting Z = &8 and z = &"' we have,
= eiweiw-~
1- (MJW
• ei""' - a 1 - ae-;v,
= e7w
1-
. .
aeJw
.
1 - ae-1111
- &"' - 2o + a2e-;"'
= e'"'------~
l -2ocosw+oZ
264
,;• = .,;,-(1 +a2)cosw-2a+ j(l -a2)sinw

l-2acosw+a2
Noting that 8 = w + ian- 1 [ ~H],

8 = w + tan _ 1 [ (1 - o') sinw ]
(1 + a2) cosw - 2a
(I) •
2lt ..
-It
rc/2 1t 8
-It
......... -21t
We see from the plot of w versus 8 that a lowpass filter will not always transform into a lowpass
=
filter. Take, for example, the case when the original lowpass filter has a cutoff of 8 "/2. With
a = 0 it would transform into an allpass filter.
7.46. (a) Since

y[n] = (2z[n] - h[n] • z[n]) • h[n]
= (2h[n] - h[n] • h[n]) • z[n]
the new transfer function is
g(n] =2h[n] - h[n] • h(n]
(i) It is FIR since the convolution of two finite length sequences results in a finite length sequence.
(ii) Note that the term h[n] • h(n] is symmetric since it is the convolution of two symmetric
sequences. Therefore, g[n] must be symmetric since it is the difference of two symmetric
sequences.
(b) The frequency response for G(&w) is
G(&w) = 2H(eiw) - H(,;w)H(eiw)
265
As shown above, if the passband of H(eiw) is the region (I -61 , 1 +6,1, then the passband of G(eiw)
is in the region [l - ~, l] which is a smaller band. However, the stop band gets bigger since it
maps to (-26, -6i, 262 - 5i].
Thus,
A = (I - 6f)
B =I
C = -26,-6~
D = U.-6i
If 61 « I and 0:, « I then,
Maximum passband app.-nxirnation error "" 0

Maximum stopband approximation error "" 26:,
(c) Since
y(n] = (3z[n] - 23:(n] • h(n]l • h(n] • h(n]

= (3h(n] • h(n] - 2h[n] • h(n] • h[n]) • z[n]
the new transfer function is
hsharp[n] = 3h[n] • h[n] - 2h(n] • h[n] • h[n]
and so
The new tolerance specifications can be found in a similar manner to the last section. We get,
A = l-36?-Uf
B = I
C = 0
D = ~+Ul
If 61 « I and 6, « I then,
Maximum passband approximation error s,, O

Maximum stopband approximation error s,, O
I
266
(d) The order of the impulse response h(n] is M. Since it is linear phase it must therefore have a delay
of "f samples. To convert the two systems we must add a delay in the lower leg of each network
to match the delay that was added by the first filter.
l(nll-~t---:_l_hl_n_J_T'--hl_n_J---'~y(n]
1
2z......
l(n] ti.___h(nJ___,J ]+1.___h[nJ___.H.___hlnJ___,f-Ylnl

2
The restrictions on the filter that carry over from part (a) are that it have
(i) Even symmetry
(ii) Odd Length
Hence, Type I Fm filters can be used.
The length of h[n] is 2L+ l. Since the term that is longest in the twicing system's impulse response
is the h[n] • h[n] term, the length of g[n] is 4L + 1. Since the term that is longest in the sharpening
system's impulse response is tbe h[n] • h[n] • h[n] term, the length of h5 harp[n] is 6L + 1.
7.47. We know that any system whose frequency response is of the form
L
A.(~"')= I>•(cos(w))'
l=O
can have at most L - l local maxima and minima ;ll the open interval O < w < ,r since it is in the form
of a polynomial of degree L.
If we include all endpoints of the approximation region
{O $ lwl $ wp} LJ{w, $ lwl $ ,r}

then we see we can have at most L + 3 alteruation frequencies.
If the transition band has two of the lOCl'I minima nT maxima .-,f A.(ei"'), then only L - 3 can be in the
approximation bands. Even with all four endpoints of the approximation region as alternation points,
we can only have a maximum of L + l alteruation points. This does not satisfy the optimality condition
of the Alternation Theorem which requires al least L + 2 alternation points. It follows that the transition
band cannot have more than two local minima nr maxima 'If A.(ei"') either.
If the transition band only has one of the lOCl'I minima '>r maxima of A.(ei"'), then the error will not
alternate between w7 and w, and they cannot both be alteruation frequencies. In this case, only L - 2
of the local minima or maxima of A. (ei"') are in the appro:rimalion bands. If we add the muimum of
three band edges to the total count of alternation frequencies we get L + 1, which is again too low.
• Therefore, the transition band cannot have any local minima QT maxima ond must be monotonic.
7.48. (a) A.(ei"') has 7 alternations of the error. If the appmximation bands are of eqnal length uid the
weighting function is unity in both bands, why would the stopband have l extra aliematiOll than
the passband? The answer is thal, lf it were an optimal filter, it would not. The optimal filter for
this set of specifications shonld have the ,cme number of altemaiions in ead, band and therefon,
requires an even number of alternations. Since the optimal approximation is unique, the one shown
in the figure cannot be optimal.
267
(b) A polynomial of degree L can have at most L - 1 local minima or maxima in an open interval.
Since A. (&"') has tiµee local extrema in the interval from O < w < .-, we lcnow L ~ 4.
Note that the optimal filter is half wave anti-symmetric if you lower its frequency response by one
half, i.e.,
A.,.(e""') = -A•,. ( .,;<•-.,>)
=
where A• .,(&"') H.,,,.(,;"') - 1/2. Another way of saying this is to say that the optimal filter is
anti-symmetric around w = .-/2 after lowering the response by 1/2. This property holds because the
optimal filter has symmetric bands with the same number of alternations. Plugging in A.,.(e-i"') =
H..,(ei"') - 1/2 into the above expression gives
H,,,,.(e""')-1/2 = - [H.., (eJ'C•-.,>)-1/2]

H..,(e""') = -H.,,,. ( e"<•-"'l) + 1
h..,[n] = -(-l)nh.,,,.[-n] + 6[n]
This condition implies that
h.,,,.[-n], n odd
h..,[n] ={ 0, neven,n-:/0
0.5, n=O
A sample plot of h.,,,.[n] appears below, for L = 6.
112
-1 o 1 4 s n
Note that because h.,,,.[n]= =
0 for n even, n 'I 0, a plot of h..,[n] for L 5 would have the same
=
nonzero samples, and therefore be equivalent. So the optimal filter with L 6 is really the same
= =
filter as the case of L 5, just as the optimal filter with L 4 is the same filter as the case with
L=3.
We know the filter non-optimal filter has 7 alternations. The optimal filter should be able to meet
the same specifications, but with a lower order. From part (a), we lcnow the number of alternations
must be even. Thus, the optimal filter for these specifications will have 6 alternations.
An optimal lowpass filter has either L + 2 or L + 3 alternations which means L = 4 or L = 3.
However, we showed above that these are really the same filter. Since the optimal filter has L = 4,
the filter shown in the problem cannot have L 4. =
Putting it all together we find L > 4 for the filter shown in the figure.
7.49. (a)
268
(b) The delay of tbe linear phase system is 51/2 = 25.5 samples since it is a linear phase system of
order 51. Therefore, the total delay is
Delay =
=
--
H(e1"")
25.ST + O.ST
26T
= 2.6 ms
HoUCI)
(c) H(eiOT) should cancel the effects of H 0 (jO). However, to cancel the effects of the delay introduced
by Ho(jfl) would require a noncausal filter which is not practical in this situation. Using the
relation w = nT,
H,(dw) ={ sin ~j), lwl :S 0.2..

o, o.4.- :S lwl :S "
To obtain equiripple behavior in He«UO), we need to weight the error so that the ripples grow
with Ha(e'w). Then when we multiply by H0 (jfl) the ripples will be decreased to an equal size.
Therefore, we need
sin (j)
"'11 :S 0.2..
W(w)=
{
T°'
l, 0.4.- :S lwl :S .-
W(m)
11----
oo~--"------------
0211 0.411 1t m
H(ei°')
1
0
o 0.2Jt 0.411 II {l) 0 0.2Jt "'
(d) lf H,(ifl) is also sloping across the band, lfll < ..;r, we would combine its effects with those of
H 0 (jfl) and compensate as in part (c), i.e.,
Ha(dw) = { sin~j) IH, ~If) I' "'11 < o.2.,,

0, 0.4" :S "'11 :S "
This would take care of the distortion due to IH,(jfl)I but not of any pbase distortion. The
weighting function will change in a similar manner.
269
7.50. (a) To avoid aliasing, we require
Mw. :S 1r
,r
M :5
"'•
So the maximum allowable decimation factor is
Mmax= - "
"'•
(b)
11------
0.9lt/100 n/100 (I)
Y(e"")
1/1001----------------------.
(I)
0.91! "
(c)
11------,.
00 0.9lt/100 (1)$1 II (I)
,~I Wid"'J
00
.~
0.45x 50Ct>s1
"
(I)
270
Vi#>J
·~1 ~
00 0.45,,: 0.5K
"
Y(#>J
,nool
00
\
0.911
(d) After the first decimation by 50 is performed, W1 (&w) should look like the following:
II Cll
·~1 ~
oo-----'---~--.._---"'------'-----~~'--"'
0.4511 SOC!l.,
/] ,
" 211-SOC!l., 1.5511 '" w
Since we allow aliasing to occur in the transition ha.nds, we have
50w,, $ 1.55,r
w,, $ 0.031,r
(e) Using 6, = 0.01, 6, =0.001, Aw = 0.001.- we get

-!Olog (0.0l x 0.001) - 13
N = 10
--="- --~-'-_..:..:.
2.324(0.001.-)
+1
:::: 5069
In general, the number of multiplies required to compute a single output sample is just N. For
a linear phase filter, however, the symmetry in the coefficients allow us to cut the number of
multiplies (roughly) in half if implementing the filter with a difference equation. The following
is a.n example of how this is accomplished using the simple Type I linear phase filter h[n] =
0.256[n] + 6(n - l] + 0.256(n - 2].
y(n] = 0.25z(n] + :r(n - l] + 0.25:r(n - 2] (2 multiplies)

= :r(n - l] + 0.25(:r[n] + :r(n - 2]) (1 multiply)
The procedure is similar for the other types of linear phase filters.
Thus, we need 2535 multiplies to compute each sample of the output.
(f) We have
-10log10 (0.0l x 0.001) -13
N, = 2.324(0.031.- - 0.009,r) + l
271
:::: 232
-lOlog,.(0.01 x 0.001) - 13 +1
2.324(0.5,r - 0.45.-)
:::: 103
H we again use linear phase filters we find

116 multiplies to get each sample of v, [n]
O multiplies to get each sample of w 1 [n] from v, [n]
52 multiplies to get each sample of v,[n] from w,[n]
0 multiplies to get each sample of y[n] from v,[n]
The total number of multiplies is 168.
(g) We have
-10 log 10 (0.005 x 0.001) - 13 +l

N, = 2.324(0.022.-)
251
"'
-10log 10 (0.005 x 0.001) - 13 +l
N2 = 2.324(0.05,r)
111
"'
Therefore, we have a total of 126 + 56 = 182 multiplies per output point.
(h) No. Since 6, « I we have ~ < 6, which means the stopband ripple is getting smaller. Thus, we
could actually increase the specifications.
(i) Performing a similar analysis on the other possibilities yields
M, M2 Multiplies per output
50 2 182
25 . 4 156
20 5 172
10 10 291
5 20 557
4 25 693
2 50 1375
Thus, the choice M 1 = 25 and M 2 = 4 yields the minimum number of multiplications for this
example.
7.51. (a)
h,[n] = h[n] + .S,6[n - no]

H, (eiw) = H(«iw) + 6,e-j.,..
= A,(eiw)e-j"""' + .s, 0 -;w..
= [A.(eiw) + .S.] 0 -,wne
H,(«iw)
H 3 (eiw) is real since A.(eiw) is real and .S. is real. It is nonnegative since A.(eiw) 2: -6,. Note
that H 3 (eiw) is an even function of w and is a zero-phase filter.
(b) H 3 (eiw) is a zero-phase filter with real coefficients. Thus, a zero at z• implies there must also be
zeros at z;, 1/z•, and 1/z,. In addition, a zero on the unit circle must be a double zero because
!
272
both its value and its derivative is zero. Note that this last property is true for H,(eiw) but not
for A.(dw). We can write H 3 (z) as
H,(z) = H2(z)H2(l/z)
where H2(z) contains all the complex conjugate zero pairs inside the unit circle and H2(l/z)
contains the corresponding complex conjugate zero pairs outside the unit circle. We factor one of
the double zeros on the unit circle and its complex conjugate zero into H2(z). The other pair on
the unit circle goes into H 2 (1/z).
Since H2(z) has its zeros on or inside the unit circle it is minimum phase ( - allow minimum
phase systems to have zeros on the unit circle in this problem). Since the zeros occur in complex
conjugate pairs, h 2 [n] is real.
(c)
where c = >'1+ 6i+d2~Y1 - 61 + 6a. Since 1 - 61 $ Ae{ei'"') :S 1 + 01 in the passband and -62 :5
A,(&w) S 62 in the stopband, we have
w E passband
w E stopband
Therefore,
o; = ! [Jl + 6 + 6, _ JI - .!, + 62]

1
2 a a
= 1- b b = ✓ I - 6, + 6,
l+b' 1+61 +5,
6,' ru;-
= v~
The original filter h[n] has order M. Therefore, h1 [n] also has order M, but h2 [n] has order M/2
due to the spectral factorization. Since h,.;.[n] has the same order as h2 [n] we find that the length
of h,,.;n[n] is M /2 + 1.
(d) No. If we remove the linear phase constraint, then the zeros of H 3 (z) are not distributed in
conjugate reciprocal quads. It then becomes impossible to express
where H 2 (z) is a minimum phase filter.

No. It will not work with a Type ll linear phase filter. In tms case no= M/2 is not an integer.
7.52. (a)
M
H(eiw) = L h[n]e-;..n
.....
273
(M-1)/2 M
= L h[n]e-jwn + L h[n]e-jwn
n=0 n.=(M+l)/2
(M-1)/2 (M-1)/2
= L h[n]e-jwn + L h[M _ m],-jwM ,;wm
n=O m=O
(M-1)/2 (M-1)/2 ]
= .0-;wM/2 L h[n]eiw(M/2-n) + L h[n]e-jw(M/2-n)
[
- n=O
(M-1)/2
= ,-;wM/2
= ,-;wM/2
-
L
(JHl)/2
L
=l
2h[n]cosw(M/2- n)
2h[M;t' - n]cosw(n- ½)
Then
(M+l)/2
H(eJw) = ,-;wM/2 L b[n]cosw(n- 1/2)
where b[n] = 2h[(M + 1)/2 - n] for n = 1, ... , (M + 1)/2.

(b) Using the trigonometric identity
cosacosfj = 2l cos(a + fj) + 2l cos(a - fj)

we get
M->
--,- ¥ ¥-
cos(w/2) L ii[n] coswn = 21"-
L., b[n]cosw(n+ ½l + 1"- 1
2 L.,b[n]cosw(n- 2 )
n=O n=O n=O
¥ ¥
= 2l°"-
L.,b[n-l]cosw(n-½)+ 1°"- 1
2 L.,b[n]cosw(n- 2 )
n=l n=)
1- 1- M 1
+ b[O]cosw/2-
2 2b[+JcoswM/2
¥
= ~ L (bln] + ii{n - 1]) cosw(n - ½) + ½ii[O] cosw/2 - ½ii[ M,tl] coswM/
=l
Since this last expression must equal

¥
L b{n] cosw(n - ½)
we can just match up the multiplien in front of the cosine \ermS of the two expressions. We get
b[l] + 2b[O]
2
b{n] = ii{n] + b[n - 1]
2<n<.!!=l
2
2 1 - -
ii[ "21] n _- 11+1

2 • 2
274
(c) Consider
W(w) (Hd(e'w) - A(eiw)] = W(w) [ Hd(e'w) - ~ b(n] COSW ( n- D]

= W(w) [ Hd(e'w) - cos(w/2) I b(n] coswn]
= W(w) [ii,(eiw)-tb[n]coswn]
where we have defined

M-1
L =
2
H,(eJW)
Hd(e'w) =
cos(w/2)
W(w) = W(w)cos(w/2)
We also see that
,p.i.n
6-(n)
{ma,c{·}} = min {max{·}}
wEF ~n] wEF
(d) Type III filters:

M
H(e'w) = ~ h\n]e-jwn
n=O
Jl/2-1 M
= L h(n]e-jwn + 0 + L h(n]e-jwn
n.=O n=M/2+1
M/2-1 M/2-1
= L h(n],-;wn - L h(m],-Jw(M-m)
....0 m=O
M/2-1
= ,-jwM/2 L h(n] (,-jw(n-M/2) _ e3w(n-M/2))
n=O
M/2-1
= ,-;wM/ 2 L (-2j)h(n] sinw(n - M /2)
n=O
M/2
= ,-;wM/2 L 2jh(M/2 - m] sinwm
m=l
Then
M/2
H(e'w) =,-;wM/2 L c(n] sinwn
where c(n] = 2jh(M /2 - n] for n = 1, ... , M /2.
If we follow a similar analysis as the one in part (b) we get
.Y-1 .Y-1 .Y.-1
sinw L c(n]coswn = ½ L
n=O
c(n]sinw(n + 1)-½ L
n=O
c(n]sinw(n-1)
=O
275
= 1'°
I:c[n -
2n=l l]sinwn- 1'° .
I:c!n]smwn
2n=l
+ ½c[O]sinw+ ½c[¥JsinwM/2
= ½ "t,
n=l
(c{n - 1) - c[n])sinwn + ½c[o] sinw + ½c[¥JsinwM/2
Matching terms we get
2c{O] - c[l)
n=l
2
c[n - 1) - c[n]
c(n) =
2
cf¥ - 1) n -- M
2
2
In a manner similar to that of part (c) we can find
M
L = --1
2
Hd(e'"')
sinw
W(w) = W(w) sinw
F = F
Type ry filters:
M
H(e'"') = L h[nJ,-'"'"
n=O
(M-1)/2 M
= L h[n],-i"'" + L h[n],-'"'"
A==O n=(M+l)/2
(M-1)/2 (M-1)/2
= L h[nJ,-i"'" - L h[m)e-,.,(M-m)
(M-1)/2
= 0 -J.,M/2 L h[n] ( ,-,.,(n-M/2) _ ,'"'(n-M/2))
n=O
(M-1)/2
= ,-,..M/2 L (-2j)h[n]sinw(n - M/2)
n=O
(M+l)/2
= •-iwM/2 L
..,., 2jh((M + 1)/2 - m]sinw(m - 1/2)
Then
(M+l)/2
H(e'"') L
=•-;.,M/> _, d(n) sinw(n - 1/2)
276
where d[n] = 2jh((M + 1)/2 - n] for n = l, ... , (M + 1)/2. We C&L find

2d{O] - d{l]
n=l
2
d(n] = d[n - l) -d[n) 2<n<A!::!
- - 2
2
di M;• I
--2-, n -- M'tl
2
M-1
L :,
2
H•(<'"')
fl.(<'"') =
sinw/2
W(w) = W(w)sinw/2
F = F
7.53. (a) The fiow graph for A.(z) looks like
x{n] O.S(z+z- 1) O.S(z+z"') O.S(z+z- 1} e---
•"'ao a, a2 ..__, ....

.. .. .. y(n}
(b) The filter length is 2L + l. The causal version of the fiow graph looks like
x{n]
' ..
0.5(1+z..,,)
~
_,
. ,
0.5(1+Z-.2)
z·'
•• ..__,
0.5(1+z-2) e---
~-1
.,.._
. .
(c) The fiow graph for B,(z) looks like
x{n]
, .. ~'. : O.S(z+z·'i f+-

•,
.....__ _ _ ___,_ _ _ _ _..,____.Y1nl
. ..
The filter length is still 2L + l. The modified flow graph looks like
277
IC(n)
a,
. II o.5(1+z.,.l fr a,
'---+----l 0.5(1+z4 )
"o a,
,-• _._ _ _ _ _ _ _ _ _ _ _....._---+y'1n)
(d) Because Z = &1 and z = &"' we have

&' + ,-;• [ &"' + ,-,.,]
2 = <to+<>, 2
cos/I = Qo + 01COSW
cos II - ao
cosw = <>1
w = cos
_, ( cos/I - <>o)
<>1
' I
for cos~; Oo :S I I
(e)
!
278
.·!
Increasing
ao
a,
.,
8
0
0
1 cos(ro) _,
It
The picture above shows the mapping for a 0 somewhere between O and 1. The top right plot is
the mapping of
ms8 = ao + (1-ao)msw
We see that as ao increases, the transformation pushes the new passband further towards.-. The
new filter is not generally ao optimal filter since we lose ripples or alternations while keeping L
fixed. (Note that some of the original filter does not map anywhere in the new filter).
(f) In a similar manner, this choice of Qo will cause the new passband to decrease with deaeasing Oo·
7.54. (a) Let D,(z) be the z-transform of .ti.<•>{:r[nj}. Theo
Do(z) = Z {ti0 {:i:[nl}} = X(z)

D 1 (z) = Z {Ll. 1 {:i:[n]}} = (z - z- 1 )X(z)
D2(z) = Z{Ll.2 {:i:[n]}}=(z-z- 1 ) 2X(z)
279
(b) By taking the transform of both sides of the continuous-time differential equation one gets (assum-
ing initial rest conditions)
N M
L:O•••Y(s) = 2),s' X(s)
A:=O r=O
Solving for H,(s)
Similarly,
N M
:~:>•<• - ,-,i•Y(z) = Lb,(z -
.... r=O
z- 1 )' X(z)
Hd(z)
=> m(z) = z- z- 1
(c) First, map the continuous-time cutoff frequency into discrete-time and then make the sketch.
ejw - e-jw
0 =- -
j
- 2sin(w) =I
w=-.6
-,c/6 0 Jtl6 ll Cll
7.55. (a) Using DTFT properties,
h1 [n] = h(-n]
H1(ei"') = H(e-;"')
= =
Since H(ei"') is symmetric about w 0, H(,-; .. ) H(ei"'). Thus, H 1 (ei"') H(,-;w) H(ei"'). = =
H(e 1"') is optimal in the minimax sense, so H1 (ei"') is optimal in miuirnax ..-.nse as well.
280
0$W$Wp
B,(ei"') ={ ~: w. :s :s
w ,r
W(ei"') = { t/•,, 0$W $Wp

"'• :s w :s ,r
(b) Using DTIT properties,
h2(n] = (-lJAh(n]
=
(,-;•JAh(n]
H2(ei"') = H(ei<w+•l)
H2(ei"') is a high pass filter obtained by shifting H(ei"') by ,r along the frequency axis. H2(&"')
satisfies the alternation thereom, and is therefore optimal in the minimax sense.
0$ w :S ,r-w.
,r-wp:Sw:S1r
0:Sw $ ,r-w.
w-w,:Sw:S1r
(c) Using DTIT properties,
h3[n] = h[n] • h(n]

H3(e'"') = H(ei"')H(ei"')
In the passband, H3 ( e'"') alternates about 1 + of with a maximal error of 2cSf. In the stopband,
H3 (ei") alternates about ~/2 with a maximal error of ~/2. At first glance, it may appear that
H3 (&"') is optimal. However, this is not the case. Counting alternations, we find that the original
filter H (,;., ) has 8 alternations.
We lcnow that since H(&") is optimal, it must have at least L + 2 alternations. It is also possible
that H (&"') has L + 3 alternations, if it corresponds to the extraripple case. So L is either 5 or 6
for this filter. Consequently, the filter length of h[n], denoted as N, is either 11 or 13.
The filter h3(n] is the convolution of two length N sequences. Therefore, the length .of h,(n], de-
noted as N', is 2N - 1. Since N is either 11 or 13, N' must be either 21 or 25. It follows that
the polynomial order for h 3 (n], denoted as L', is either 10 or 12. For h 3 (n] to be optimal in the
minimax sense, it must have at least L' + 2 alternations. Tbns, hs(n] must abihit at least 12 alter•
nations, for the non-extraripple case, or at least 14 alternations in the extraripple case to be optimal.
A simple counting of the alternations in H3 (&"') reveals that there are 11 alternations, consisting
of the 8 alternations that were in H(ei") plus 3 where H(ei"') =
O. These are too few to satisfy
either the non-raripple case or the extraripple case. As a result, this filter is not optimal in the
minimax sense.
(d)
'4(n] = h[n] - K cS(n]

H 4 (ei"') = H(ei"') - K
This filter is simply H(ei"') shifted down by K_ along the B,(ei"') axis. Consequently, this filter
satisfies the alternation theorem, and is optimal in the minin,ax sense.
281
0$w$w,
w. :S w :S 1r
0$w$w,
w. :$ w::; 7f
(e) hs(n] is h(n] upsampled by a factor of 2. In tbe frequency domain, upsampling by a factor of 2 will
cause the frequency axis to get scaled by a factor of 1/2. Consequently, Hs(e'w) will be a bandstop
filter that satisfies the alternation theorem, with twice as many alternations as H (e1w). This filter
is optimal in the minimax sense.
0 $W $w,/2
w,/2 $ w $ .- -w,/2
.- -w,/2 $ w $ .-
0 :Sw :Sw,/2
w,/2$w$.--w,/2
.- -w,/2 $ w $ .-
7 .56. We have an odd length causal linear phase filter with values from n = 0, ... , 24. It must therefore be
either a Type I or Type ID filter.
(a) True. We know either
Type I Type ill
h(m] = h(24 - m] or h(m] = -h[24 - m]
for -oo < m < oo since the filter has linear phase. Substituting m = n + 12 we get
h[n + 12] = h[l2 - n] or h(n + 12] = -h[l2 - n]
(b) Fwe. Since the filter is linear phase it either has zeros both inside and outside the unit circle or
it has zeros only on the unit circle.
If the filter has zeros both inside a.nd outside the unit circle, its inverse has poles both. inside and
outside the unit circle. The only region of convergence that would correspond to a stable inverse
would be the ring that includes the unit circle. The inverse would therefore be two-sided and not
causal.
If the filter only has zeros on the unit circle, its inverse has poles on the unit circle and is therefore
unstable.
(c) Insufficient /nfonnatioTL If it is a Type ID filter it would have a zero at z =
-1 but if it is a Type
I filter this is not necessarily true.
(d) True. To minimize the maximum weighted approximation error is the goal of the Parks-McClellan
algorithm.
(e) True. The filter is Fm so there are no feedback paths in the signal flow graph.
(f) True. The filter has linear phase and
arg (H(e'W)] =fJ - 12w
where fJ = 0, ,r for a Type I filter or fJ = .- /2, 3r/2 for a Type ID filter. Tbe group delay is
grd [H(,;w)] = - ! {arg [H(,;w)]}

= 12
> 0
282
7.57. (a) The desired tolerance scheme is
(b)
W(w) = !· t~ (or
(or 1)
(or
f.)
f.)
~:: :~
·(or 1)
0$ lwl $ WJ
..,. :s lwl :s ""
w,:,jwj:S.-
(c) From the Alternation Theorem, the minimum number of alternations is L + 2.

(d) The trigonometric polynomial (of degree L) can have at most L - 1 points of local minima or
maxima in the open interval between O and .-. If these are all alternation points and, in addition,
all the band edges are alternation points, we find the maximum number of alternations is
L-1+6=L+5
(e) If M = 14, then L = M/2 = 1. The maximum number of alternations is therefore 7 + 5 = 12.
Typical E(w) looks like :
E(oo) Ii
0 .,
(f) ~ will be shown in part (g), the 3 band case can have maxima and minima in the transition
regions. It follows that we do not have to have an extremal frequency at w4 • Therefore, if we
started with an optimal maximal ripple filter and jnst slid "'• over we may move a local minimum
or maximum into the transition region, bnt there will still be enongh alternations left to satisfy
the alternation theorem. Thus, the maximum approximation error does not have to decrease.
(g) (i) If a point in the transition region has a local minimum or maximum then there is the possibility
that the surrounding points of nwcimum error do not alternate. Thus, we might lower the
number of alternations by two. Howefff, if...., started with L + 5 alternations this reduction
does not drop the number of alternations below the lower limit of L + 2 set by· the Alternation
Theorem. Therefore, local rnaxirna 'llld minima of A.(eiw) can occur in the transition regions.
Note that this is not true in the 2 band case.
(ii) If a point in the approximation bands is a local minimum or maximum, the surrounding points
of maximum error do not alternate. Thus, a local minin,um or maximum in the approximation
bands implies that the total number of alternations is reduced by two. However, if we started
with L + 5 alternations this rednction does not drop the number of alternations below the
lower limit of L + 2 set by the Alternation Theorem. Therefore, we can have a local maximum
or minimum in the approximation bands. Note that in the 2-band case we drop &om L + 3 to
L + 1 which violates the Alternation Theorem.
283
7.58. (a) In order for condition 3 to hold, G(z- 1 ) must be an allpass system, since
z- 1 = G(z- 1 )
,-,• = G(e-"")
= IG(e-jw)I e3LG(,-;")
Clearly, !G(e-Jw)I must equal unity to map the unit circle of the Z-plane onto the unit circle of
the z.plane.
(b) Consider one allpass term in the product, and note that o• is real.
The inside of the unit circle of the Z-plane is
O$ IZI < I
Or equivalently,
l<lz-11<00
Substituting the allpass term for z- 1 gives
< I ~;:, Ii'~ 10

I
(I - o,,- 1 )(1 - o,z•- 1 ) < (z- 1 - o;)(z•-t - o,)
1- okz- 1 - oa:z•- 1 + oiz- 1z•- 1 < z- 1z•- 1 - 01z·- 1 - oa:z- 1 + af
(I - Oi) < z- 1z•- 1(! - of)
If (! - "il < 0, then

z-1 z•-1
1 >
I
I >
Jzi'
l•I > I
The inside of the unit circle of the Z-plane maps to the outside of the unit circle of the z-plane.
This is not the desired result. However, if(! - af) > 0, then
z-lz•-1
I o
Ja,1 2 < 1
lo•! < 1
This condition holds for the general case as well since the general case is just a product of the
simpler allpass terms.
I
284
(c) First, it is shown that G(z- 1 ) produces the desired mapping for some value of a. Starting with
G(z- 1 },
z-1 -a
z-1 =
1- az- 1
e-Jf,r,J - a
e-;,
= 1- ae-Jw
e-;, - ae-;•e-;w e-;.., - a
=
e-;.,(l + ae-;•) = e-jl +Q
e-;161
e-;• + a
= 1 + ae-;•
e-;, +a 1 +ae;•
= 1 +ae-;• 1 + a,;•
,-;• + 2a + a 2 ei'
= 1+2acos8+a2
cos8 - ; sin8 + 2a + a2 cos8 + ;a2 sin8

= 1 + 2acos8 + a2
2a + (1 + a2)cos8 + j((a2 - l)sin8]
= 1 + 2acos8 + a2
Noting that -w = 1an- 1 [~In,

2
-w = tan-' [ (a- 1) sin8 ]
2a+(l +a2 )cos8
2
w = 1an-• [ (1- a ) sin8 ]
2a+(l+a2 )cos8
This relationship is plotted in the figure below for different values of a. Although a warping of the
frequency scale is evident in the figure, (except when a =
0, which corresponds to z- =
1
,-•),if
the original system has a piecewise-constant lowpass frequency response with cutoff frequency e,,
then the transformed system will likewise have a similar lowpass response with cutoff frequency w,
determined by the choice of a.
Warping of the frequency scale, LPF to LPF

(I)
285
Next, an equation for o is found in terms of e, and "'•· Starting with G(z- 1 ),
z-1-o
z-, = 1-oz-l
e-;w.,. - Q
1 - ae-iw,.
e-;,,. - ae-;•,.e-;"', = e-;w,. - Q
e-;,.,. - e-;w.,. = o(e-;<,,+...,l - 1)
e-;a,. - e-;w,.
0 = e-i(l,.+w,.) - 1
e-i(l,.+w,.)/2(e-i(l,.-'"',.)/2 _ ei<B,.-w,.)/2)
= e-i(l,.+1,o1,.)f2(e-i{B,.+w,.)/2 _ ei(B,.+w,.}/2)
-2j sin((e, - w,)/2]

= -2jsin((e, +w,)/2]
= sin((e, - w,)/2]
sin((6, + w,)/2]
(d) Using the equation for w found in part c, with e, = ,r /2,
2
Wp = tan - l [1~
- o ]
(i}
2
-I [1- (-0.2679) ]
=
"'• tan 2(-0.2679)
-I ( 0.9282 )
= tan -0.5358
= 21r/3
(ii)
= tan-1 [I - (0)2]
"'• 2(0)
= tan-• (oo)
= ,r/2
(iii)
2
-I [1- (0.4142) ]
=
"'• tan 2(0.4142)
= tan-• (1)
= ,r/4
(e) The first-order allpass system
G(z- 1 ) = - •-• + 0
l+oz- 1
satisfies the criteria that the unit circle in the Z-plane maps to the unit circle in the z-plane, and
that e = 0 maps tow="· Next, o is found in terms of e, and "'•·
z-• =
286
e-;w,,. + Q
e-iB,,,
= I+ ae-;w,.
-e-;,, - oe-i(w,.+I) = e-Jw,,, + o
a(l + •-i(w,+B,l) = -e-;,.,, - e-jw,,.
e-il, + e-jw.,,
a = 1 + e-i(w,.+I,.)
e-j(w,,.+l,.)/2(e-iC-w,+l,.}/2 + e-j(w,.-1.. )/2)
= - e-i(w,.+l,.)/2(ei(w-,,+l,,J/2 + e-i(w,.+l,)/2)
cos[(w, -8,)/2]
= cos[(w, + 8,)/2]
(f) First, an equation for w is found in terms of 8 and a.
z- 1 +a
z-• = 1 + o:z- 1
e-JW + Q
= 1 +ae-,w
-e-i8 _ ae-i(w+B) = e-jw +a
.-iw(l + oe-i') = -e-i' - a
e-il +o
= I+ ae-J'
e-i'+o l+oei 6
= 1 + oe-i1 1 + oei8
.-ii + 2a + ci'ei'
= 1 + 2ocos8 + a 2
cos8 - j sin8 + 2a + a 2 ccs8 + ja 2 sin8
= 1 + 2acos8 + a 2
cos8 + 2a + a2 cos8 + j(- sin8 + a 2 sin8)
= 1 + 2ocos8 + a 2
Therefore,
-w + 7r = tan-' [2o+(a (1 +a 2
l)sin8 ]
-
)cos8 2
w = (I-a2)sin8 ]+
tan-•[ 2a+(l+o )cos8 2
"
Note that this lowpass to highpass expression is the similar to the lowpass to lowpass expression
for w found in part (c). The only difference is the additive " term, which shifts the lowpass filter
into a highpass filter. The frequency warping is plotted below.
287
Warping of the frequency scale, LPF to HPF

(J)
For B, = ,r /2, this becomes
(i)
w, = tan
_1 [I -2(-0.2679)
(-0.2679)
2
]
+"
-1 ( 0.9282 )
= tan -0.5358 + ,r
= 2tr/3+tr
= Sr/3
The right edge of the low pass filter gets warped to 5,r /3, which is equivalent to -,r/3. The
frequency response of this filter appears below.
... . ..
-It -it/3 0 It (I)
(ii)
w,, = tan
_1 rl - (0)
2(0)
2
]
+ .-
= tan-• (oo) + .-
= ,r/2+tr
= 3,r/2
The right edge of the low pass filter gets warped to 3,r /2, which is eqar,aleot to -ir /2. The
288
••• • ••
-7112 0 II (I)
(iii)
1 f1- (0.4142) 2 )
"'• = tan- L 2(0.4142) +"
= tan-• (~:::) + ,r
= ,r/4+,r
= 51'/4
The right edge of the low pass filter gets warped to 5,r/4, which is equivalent to -3,r/4. Th•
••• •••
.
-II -31114 0 31114 II (I)
289
The Discrete-Time Fourier Transform

291
8.1. We sample a. periodic continuous-time signal with a sampling rate:

n. _1
F =-=-=-Hz
6
' 2.- T 10- 3
(a) The sampled signal is given by:
:i:[n] = :i:,(nT)
Expressed as a Discrete Fourier Series:
:i:(n) = L• "•ei'f•n
1:-=-9
We note that, in accordance with the discussion of Section 8.1, the sampled signal is represented
by the summation of harmonically-related complex exponentials. The fundamental frequency of
this set of exponentials is 2.-/N, where N = 6.
Therefore, the sequence :r[n] is periodic with period 6.
(b) For any bandlimited continuous-time signal, the Nyquist Criterion ma.y be stated from Eq. (4.14b)
as:
F,?. 2FN,
where F, is the sampling rate (Hz), and FN corresponds to the highest frequency component in
the signal (also Hz).
As evident by the finite Fourier series representation of :r,(t), this continuous-time signal is, indeed,
bandlirnited with a maximum frequency of Fn = ,:-,
Hz.
Therfore, by sampling at a rate of F, = ,o"-•Hz, the Nyquist Criterion is violated, and aliasing
results.
(c) We use the analysis equation of Eq. (8.11):
N-1
X[k) =L x[nJ,-i\Hn
n=O
From part (a), x[n) is periodic with N = 6.

Substitution yields:
X(k] = t (t
n.=O m=-9
a,,.ei'fmn) ,-;'f•n
= L• L• a,,.ei(2• /l)(m-•)n
A=Om=-9
We reverse the order of the summations, and use the orthogonality relationship from Example 8.1:
• 00
X(k]=6 La,,. L o[m-k+rN]

m.= -9 r=-00
Taking the infinite summation to the outside, we recognize the convolution between a,,, and shifted
impulses (Recall a,,. =
0 for Jml > 9). Thus,
00
.X(k) =6 L "•-•·
=-oo
Note that from .X(k), the aliasing is apparent. ·
292
8.2. (a) Using the analysis equation of F.q. (8.11)

N-1
X[k] = L i[nJwtn
Since i[n] is also periodic with period 3N,
3N-l
X,[k] = L i[nJw.";J
n=O
N-1 2N-1 JN-1
= L i(n]W;;";J + L i(n]W;N + L i[n]W;;";J
n=O n=N n=2N
Performing a change of variables in the second and third summations of x;[k],

N-1 N-1 N-1
.X,(k] = L i(n]W;N + w;t L i(n + N]w;N + wftN L i(n + 2NJW;N
n=O n=O n=O
Since i(n] is periodic with period N, and w;N = wttin,

N-1
.X3 (k) = (1+,-J2•(tl+e-i 2•(\tl) Li(n]Wttnl
n=G
= (1+.-,.. (tl+,-jh("fl)X(k]
= { 3X(k/3], =
k 3l
0, otherwise
(b) Using N = 2 and i[n) as in Fig PS.2-1:
N-1
X[k) = L i(nJwtn
n=G
n=G
= i(O] + i(l]e-id
= 1+2(-1)•
= {3,
-1,
k=O
k =I
Observe, from Fig. PS.2-1, that i(n] is also periodic with period 3N = 6:
3N-1
i,(k] = L i(n]w;N
n=G
= L• i(nJ,-ii""
n=G
= (1 + ,-;'f• +,-,¥•)(1 + 2(-l)l)
= (1 + ,-;'f• + ,-;'f-•)X(k/3]
= ( ~3. ::~
0, le= 1,2,4,5.
293
8.3. =
(a) The DFS coefficients will be real if i[n] is even. Only signal B can be even (i.e., is[n] is[-n];
if the origin is selected as the midpoint of either the nonzero block, or the zero block).
(b) The DFS coefficients will be imaginary if x[n] is even. None of the sequences in Fig P8.3-l can be
odd.
(c) We use the analysis equation, Eq. (8.11) and the closed form expression for a geometric series.
Assuming unit amplitudes and discarding DFS points which are zero:
XA[k] = I:• ei'fkn

n=O
1- e,i¼4A:
= 1- ei¼•
l - (-1)•
= 1-e'•
.• • = 0, k = ±2, ±4, ...
2
Xs[k) = I: ei'f•n
n=O
1 - e,iflk
= 1 - e,i¼.t
3
Xc[k) = I: ei'fkn - I: 7ei'f•n

n=O
3
=•
= I: (eit•• - .,.,,.1n+<1)
n=O
= (1 - ei.. ) l - e1:•
1- eJ'ik
= 0, k = ±2, ±4,
8.4. A periodic sequence is constructed from the sequence:
as follows:
00
i[n) = L :i:[n + rN], lal < l

---oc
(a) The Fourier transform of :r[n]:
00
X(eiw) = L :i:[n]e_,.,,.
n=-oc
00
= La"e-;..,n
..... l
= 1- oe-P,,' lal < l
(b) The DFS of i[n]:

N-1
X[k] = L x[n]w~•
n=O
294
N-1 oo
= L L z(n+rNJW}n
N-1 00
= L L on+rNu(n+rN]W}n
n=Or=-oo
N-1 oo
= L Lo"+rNw¾"
n=Or=O
Rearranging the summations gives:
oo N-1
X[k] = L o•N Lon win
r=O n=O
l _ 0 N e-.j2rlt)
= LarN
r=0
oo (
1 - oe-,'t,'-
, lal < 1
= _1_(1-a11
1- aN
e-i 2d:)
1 - a.-;'t,'-
, lal <1
1
X[k] = 1- oe-;(2.t/N) ' lal <1
(c) Comparing the results of part (a) and part (b):
X[k] = X(eiw)l..,=>••JN.
8.5. {a)
z[n] = o[n]
N-1
X[k] = L o[n]W}n, 0 ::, k ::, (N - 1)
n=O
= 1
(b)
z(n] = c5[n -no], 0 $no$ (N -1)
N-1
X(kj = En=O •In - noiwin, 0 $ k $ (N - 1)
= wt""
(c)
{ 1, n even
z[n] = 0, nodd
N-1
X(k] = E:1n1win,
n=O
0 $ k $ (N -1)
(N/2)-1
= E
n=O
w],""'
1- e-i2 •"
= l - e-;(sk/N)
{ N/2, k=0,N/2
X[k] = 0, otherwise
295
(d)
{ 1, 0 5 n 5 ((N/2) - 1)
:r:[n] = 0, N/2 5 n 5 (N - 1)
N-t
X[.1:J = I;:r:fn]W;", 0 5 k 5 (N - 1)
.....
(N/2)-1
=
....I:
l - e-id
W'"
N
= 1 _ e-i(2d)/N
{ N/2, k=0
X[k] = 1 _ e !2•k/N)' k odd
0, k even, 0 5 k 5 (N -1)
(e)
{an, 05n5 (N-1)

:r:[n] = 0, otherwise
N-t
X[k] = L anw«nN• 0 5 k 5 (N - I)
n=O
1- aNe-i2d
= 1_ ae-i(2d)/N
1-aN
X[k] = I_ ae-i(2d)/N
8.6. Consider the finite-length sequence
e1won 0:S:n:S:(N-1)
z[n] ={ '
0, otherwise
(a) The Fourier transform of z[n]:
00
X(e'"') = L z[n]e-iwn
n.=-oc
N-t
= L ~Wone-jwn
n=O
1 _ e-i{w-wo)N
X(e'"') = 1 - e-j(w-We)
= e-i(w-.,.)(N/2 ) (sill [(w -Wo)(N/2)])
e-i(w-wo)/2 sill [(w - Wo)/2]
X(e'"') = -i(w-.,.)((N-t)/2) (sinf(w-Wo)(N/2)])
e sin ((w - Wo)/2]
(b) N-polnt DFT:
N-t
X[k] = L :r:(n]wtn, 0 5 k S (N -1)
=•
296
N-1
= L e1wonw;;
n=O
1_ •-j((2••/N)-wo)N
= 1- e-j((2rk/N)-wo)
= -;('N'--.... )(¥)sin((~ -w,,) ~)
e sin[(~ -w,,) /2)
Note that X[k] = X(&w)lw=(2d)/N
(c) Suppose Wo = (2do)/N, where ko is an integer:
1- e-i(A:-to)2'r
X[k] = 1_ e-i(•-.. )(2•)/N
= -j(2•/N)(•-.. )((N-1)/2) sin.-(k - ko)

e sin(.-(k - ko)/N)
8. 7. We have a six-point uniform sequence, :[n], which is nonzero for O :S n :S 5. We sample the Z-transform
of :[n] at four equally-spaced points on the unit circle.
X[k] = X(z)l,=,<>••J•>
We seek the sequence : 1 [n] which is the inverse DFT of X[k]. Recall the definition of the Z-transform: 1
00
X(z) = L :[n]z-n
n=-00
Since x[n] is zero for all n outside O :S n S 5, we may replace the infinite summation with a finite
summation. Funhermore, after substituting z = ei( 2 rk/ 4 ), we obtain
X[k]
•
= L :[n]W;", 0 :S k S 4
n=O
Note that we have taken a 4-point OFT, as specified by the sampling of the Z-transform; however, the
original sequence was of length 6. As a result, we can expect some aliasing when we return to the time
domain via the inverse DFT.
Performing the DFT,
X[k] = "1• +Wt+ w;• + w;• + Wf" + W;", 0 :S k S 4
Taking the inverse DFT by inspection, we note that there are six impulses (one for each value of n
above). However,
W4•• -- 0
"'"
"'• and w•• - w•
4. - 4'
so two points are aliased. The resulting time-domain signal is
2 2
:i[n]
.l l I I .
-1 0 1
1
2
1
3 4
•5 •6 n
297
8.8. Fourier transform of z[n] = (1/2)nu[n]:

00
X(e'"') = L z[n],-,..,n
n=-00
1
=
Now, sample the frequency spectra of z[n]:
Y[k] = X(e'w)lw=2d/10, 0$ k$ 9
We have the 10-pt DFT:

I
Y[k] = 1_ le-i(2wi:/10)'
2
=
•
LY[nJw,•;
n=O
Recall:
So, we may infer:

(!jn
y[n] = 1 _ 2(½ )'", 0 :, n $ 9
8.9. Given a 20-pt finite-duration sequence z[n]:
(a) We wish to obtain X(eiw)lw=h/• using the smallest DFT possible. A possible size of the DFT is
evident by the periodicity of eJWj..,=.,/•· Suppose we choose the size of the OFT to be M = S.
The data sequence is 20 points long, so we use the time-aliasing technique derived in the previous
problem. Specifically, we alias z[n] as:
00
z,[n] = L z[n + Sr]

r=-00
This aliased version of z[n] is periodic with period 5 now. The 5-pt DFT is computed. The desired
value occun at a frequency corresponding to:
2.-k 4,r
N=s
For N = s, k = 2, so the desired value may be obtained as X[kJl•= 2 •
(b) Next, we wish to obtain X(e'"')lw=10./2?·
The smallest DFT is of size L = 27. Since the DFT is larger than the data block size, we pad z[n]
with 7 zeros as follows:
z[n], 0 :, n $ 19
%2 InI
{ 0,= 20:,n:,26
We take the 27-pt DFT, and the desired value corresponds to X[k] evaluated at k = 5.
298
8.10. From Fig PS.10-1, the two 8-pt sequences are related through a circular shift. Specifically,
o:.[n] = o:i[((n - 4))a]
From property 5 in Table 8.2,

DFI'{o:,[((n - 4)),1} = W:' X,[k]
Thus,
X,[k] = w:• x,[k]

= ,-,.. X1 [k]
x,[k] = (-1)' x,[kJ
8.11. We wish to perform the circular convolution between two 6-pt sequences. Since o:,[n] is just a shifted
impulse, the circular-convolution coincides with a circular shift of o: 1 [n] by two points.
y[n] = o:i[n]®:t,[nj
= o: 1 [n](Q),[n - 2]
= o: 1 [((n - 2)),]
4 y[n]
-1 0 I 2 3
fI
4 5
I
6
I
7
n
8.12. (a)
transforms to
3
X[k] = L cos(";'Jwf", o S k S 3
.....
The cosine term contributes only two non-zero values to the summation, giving:
X[k] = 1 - ,-i•k, 0S k S3
= 1-wr
(b)
h[n] = 2", 0S nS 3
3
H[k]. = L2"Wf", 0SkS3
.....
= 1 + 2wt + 4Wf' + BWt°
299
(c) Remember, circular convolution equals linear convolution plus aliasing. We need N ~ 3+4-1 = 6
to avoid aliasing. Since N = 4,we expect to get aliasing here. First, find 11[n] = z[n] • h[n]:
6
y[n] = z[n] • h[n]
3
2
l
n
-1 0 l 2 3 4 5 6 7
-4
-8
For this problem, aliasing means the last three points (n = 4, 5, 6) will wrap-around on top of the
first three points, giving y[n] = z[n@,[n]:
6
y[n] = z[nJ©h[n]
3
n
-1 0 l 2 3 4 5
-3
-6
(d) Using the DFT values we calculated in parts (a) and (b):
Y[k] = X[k]H[k]
= l + 2Wf + 4W;• + BW]k - w;• - 2w]• - 4Wt° - 8W;'
Since Wt' = ff1• and W;' = Wf
Y[k] = -3 - 6Wf + 3W;• + sw:•, 0 :S: k :S: 3
Taking the inverse DFT:

y[n] = -3o[n]- 6o[n - l] + 35[n - 2] + 6o[n - 3], O :S: n :S: 3
300
8.13. Using the properties of the DFT, we get y(n] = z[((n - 2)).J, that is y[n] is equal to z[n] circularly
shifted by 2. We get:
2 2
y[n]
n
012345
8.14. :r,[n] is the linear convolution of z 1(n] and :z:2(n] time-aliased to N = 8. Carrying out the 8--point
circular convolution, we get:
9 9 9 9
:r3(n]
8 8
7 7
n
0 1 2 3 4 5 6 7 8
We thus conclude :r 3 [2] = 9.

8.15. y[n] is the linear convolution of :r,(n] and z 2 [n] time-aliased to N = 4. Carrying out the 4-point circular
convolution, we get:
l 24+ 1 a 2+a
y(n]
•
-1 0 l
j j j j
2 3
•4 •5 n
=
Matching the above ,equence to the one given, we get a -1, which is UDique.
8.16. Xi[k] is the 4-point DFI' of :r[n] and z,[n] is the 4-point inverse DFI' of X 1[k], therefore :r1(n] is :r[n]
time alia.ed to N = =
4. In other words, z 1[n] is one period of :i:(n] z[((n)),]. We thus have:
4 = b+ 1.
Therefore, b = 3. This is clearly UDique.
8.17. Loo~ at the ,equences, we see that z, [n] • z2(n] is non-zero for 1 $ n $ 8. The smallest N such that
.:r1[n] ~ 2[n] = :ri[n] • :r2[n] is therefore N = 9.
301
8.18. Taking the inverse DFT of X 1 [k] and using the properties of the DFT, we get:
z 1 [n] = z[((n + 3))s]-

Therefore:
z 1 [0] = z[3] = c.
We thU5 conclude that c = 2.
8.19. z,[n] and z[n] are related by a circular shift as can be seen from the plots. Using the properties of the
DFT and the relationship between X 1 [k] and X(k], we have:
= z[((n - m)),].
zi[n]
m = 2 works, clearly this choice is not unique, any m = 2 + 61 , where I is an integer, would work.
8.20.
X, [k] = X[k]e+j(2d2/NI.
Using the properties of the DFT, we get:
z 1[n) = z[((n + 2))N)-

From the figures, we conclude that:
N=5.
This choice of N is unique.
8.21. (a) We seek a sequence y1 [n] sucli that
Y,[k] = X1[k]X2[k]
From the discU5Sion of Section 8.2.5, y[n] is the result of the periodic convolution between f1[n]
and i 2 [n).
N-1
!i,[n] = L f1[m]f [n - m]
m=O
2
Since f 2 [n] is a periodic impulse, shifted by two, the resultant sequence will be a shlfted (by two).
replica of i ,In].
6 6
i,:liifi ' .Iii ri '0.

!i,[n]
1
1
0
n
-1 0 1 2 3 4 5 6 7 8 910111213 14 15
Using the analysis equation of Eq. (8.11), we may rigoroU5ly derive y,[n]:
X,[k] = L• f,[n]W;"
n=<>
302
= 6+5Wf +4W;' +3W/1 +2wt• + wr
L• :i:2[n)Wf"
.X2[k] =
....
= w;>
Y1[k] = .X1[k).X2[k]
= 6W;' + 5W.f1 + 4W/• + 3Wf• + 2'111• + w;•
Noting that w;• = ei'f<n) = 1 = W¥•, we use the synthesis equation of Eq. (8.12) to construct
!i,[n]. The result is identical to the sequence depicted above.
(b) The DFS of the signal illustrated in Fig. PS.21-2.is given by:
.Xs[k] = L• :i:a[n]W;"
.....
= 1+wt•
Therefore:
Y2[k) = .X,[k].X.[k]
= X1[k] + Wt' .X,[k)
Since the DFS is linear, the inverse DFS of Y2[k) is given by:
!i2[nj = :i:,[n] + :i:1[n - 4).
8.22. For a finite-length sequence z[n], with length equal to N, the periodic repetition of z[-n] is represented
by
z[((-n))N) =z[((-n+tN))N), l: integer
where the right side is justified since z[n] (and z[-n]) is periodic with period N.
The above statement holds true for any choice oft. Therefore, for l l: =
8.23. We have :r[n] for O $ n $ P.

We desire to compute X(z)l,=,-il,.>tN> nsing one N-pt DFT.
(a) Suppose N > P (the DFT size is larger than the data segment). The technique nsed in this case
is often referred to as zero-padding. By appending zeros to a small data block, a larger DFT may
be used. Thus the frequency spectra may be more finely sampled. It is a common misconception
to believe that zero-padding enhances spectral resolution. The addition of a larger block of data
to a larger D FT would enhance this quality.
So, we append N • = N - P zeros to the end of the sequence as follows:
:r'[n) = { :r[n], 0 $ n $ (P - 1)
0, P:,n:,N
:r[n] -....-,1 N-pt DFT
I
f
303
(b) Suppose N > P, consider taking a DFT which is smaller than.the data block. Of course, some
aliasing is expected. Perhaps we could introduce time aliasing to offset the effects.
Consider the N-pt inverse DFT of X[k],
l ,,_,
z[n] = N L
X[kJW,."", 0 :Sn :S (N - 1)
lo=O
Suppose X[k] was obtained as the result of an infinite summation of complex exponents:
z[n] = ~! (f z[m],-;c2d/N)m) w,.""

k=O m=O
Rearrange to get:
z[n] = L
00
m=-oo
z[m]
(
! L ,-;(2,/N)(m-n)i
,,_,
k=O
)
Using the orthogonality relationship of Example 8.1:

00 00
z[n] = L z[m] L o[m-n+rN]

m=-oc r=-00
00
z[n] = L z[n - rN]

r=-oo
So, we should alias z[nj as above. Then we take the N-pt DFT to get X[k].
8.24. No. Recall that the DFT merely samples the frequency spectra. Therefore, the fact the /m{X[k]} 0 =
for 0 :S k :S (N - l) does not guarantee that the imaginary part of the continuous frequency spectra is
also zero.
For exan.ple, consider a signal which consists of an impulse centered at n = I.
z[n] ;,, o[n - l], 0 :Sn :S l
The Fourier transform is:
X(eiw) = ,-;w
Re{X(eiw)} = cos(w)
/m{X(eiw)} = -sin(w)
Note that neither is zero for all 0 :S w :S 2. Now, suppose we take the 2-pt DFT:
X[k] = W,f,
0 :S k :S l
= { 1, k=0
-1, k=l
So, /m{X[k]} = 0, 'lk. However, /m{X(eiw)} # 0.

Note also that the size of the DFT plays a large role. For instance, consider taking the 3-pt DFT of
z[n] =
o[n - l], 0 :Sn :S 2
X(k] = Wf, 0:Sk:S2
1, k =0
= .-;(h/S)' "= I
{
,-J(.. /3)' "= 2
304
Now, Jm{X[k]} ,f- 0, for k = 1 or k = 2.
8.25. Both sequences z[n] and y(n] are of finite-length (N = 4).

Hence, no aliasing takes place. From Section 8.6.2, multiplication of the DIT of a sequence by a complex
exponential corresponds to a circular shift of the time-domain sequence.
Given Y[k] = W/' X[k], we have
y[n] = z[((n - 3)) 4 ]
We use the technique suggested in problem 8.28. That is, we temporarily extend the sequence such that
a periodic sequence with period 4 is formed.
i(n]
n
-4 -3 -2 -1 0 1 2 3 4 5 6 7
Now, we shift by three (to the right), and set all values outside OS n S 3 to zero.
y[n]
• •
-2 -1 0 1 2 3
•4 •5 n
8.26. (a) When multiplying the DIT of a sequence by a complex exponential, the time-domain signal
undergoes a circular shift.
For this case,
Y(k] Wt' X(k], =
OSkS5
Therefore,
y(n] = z[((n - 4))6], 0'.5n'.5S
4
3
I
2 y(n]
I
1
I• •
•
-1 0
'
l
•2 •3 4 5 6 7
n
.
(b) There are two ways to approach this problem. First, we attempt a solution by brute force.
X[k] = 4 + 3W.. + 2W;' + W/', w.• = ,-;<•••!•> and O -< /c -< 5

W(k] = Ju{ X[k]}
= ½(X[k] + X"[k])
= 2l (4 + 3w.•I + 2W.""
6 + w.I.. + 4 + 3w.-•
I
+ 2w:-2t
I
+ w:-•·)
I
305
Notice that
w~ = e-·j(2rt/N}
w-•
N = ~(2d/N) = e-;(2r/N){N-•) = w::-•
W[k] = 4 + ~2[w.•
6 + u,!-•J + [w. + w•-
6
2
6• 6
2
•] + !2[w,.
6 + w•-,.]
6'
So,
w[n] = 4o[n) +; ( o[n - 1) + o[n - sJ) + o[n - 2) + o[n - 4)
+ ~ ( o[n - 3) + o[n - 3])

3 3
w[n) = 4o[n) + iln - l] + o[n - 2] + 6[n - 3] + 6[n - 4] + iln - 5),
Sketching w[n):
4
II
w[n]
3/2 l 1 l 3/2
• t t t T • • n
-1 0 1 2 3 4 5 6 7
As an alternate approach, suppose we use the properties of the DIT as listed in Table 8.2.
W(k] = Xe{X[k)}
X[k] + X•[k)
= 2
w[n] = ~ IDFT{X[k)} + ~ IDFT{X.[k)}
= ~ ( :r[n] + x·[((-n))N])
For O :5 n :5 N - 1 and :r[n) real:
w[n) = ~ (:r[n] + x[N - nJ)
4
3
I• •
2 :r[N - n], for N =6
II•
1
• t •7 n
-1 0 1 2 3 4 5 6
So, we observe that w[n] results as apove.

(c) The OFT is decimated by two. By taking alternate points of the DFT output, we have half as
many points. The influence of this action in the time domain is, as expected, the appearance of
aliasing. For the case of decimation by two, we shall find that an additional replica of :i:[n) surfaces,
since the sequence is now periodic with period 3.
306
From part (b):

X[k] = 4 + 3W." + 2Wl° + wJ•, 0$ k$ 5
Let Q[k] = X[2k],
Q[k] =4 + 3Wf + 2Wf' + wf•, 0$ k$ 2
Noting that W:1 = Jl1'•
q(n] = 56(n] + 36(n - l] + 26{n - 2], 0 :Sn :S 2
5
.l f t ...
-1 0 1 2 3 4 5
q(n]
8.27. (a) The linear convolution, z 1 (n] • z 2 [n] is a sequence of length 100 + 10 - 1 = 109.
10 10
9 9
8 8
7 7 zi(n] • z,[n]
6 . 6
3
4 ,.
5 ' 5
4
3
2 2
1 1
T
-1 0 ' l 2 3 4 5 6 7 8 9
....l..---''--J..._..J...-1--'-..J........L-''--'--+- n
99 100 101 102 103 104 105 106 107 108 109
(b) The circular convolution, z 1 (n] ~ 2 [n], can be obtained by aliasing the first 9 points of the linear
convolution above:
10 10 10 10 10 10 10 10 10 10 10
llllllllll L"
01234 56789
(c) Since N? 109, the circular convolution zi[n]@,[n] will be equivalent to the linear convolution
99
of part (a).
8.28. We may approach this problem in two ways. First, the notion of modulo arithmetic may be simplified
if we utilize the implied periodic extension. That is, we redraw the original signal as if it were periodic
with period N = 4. A few periods are sufficient:
f j j f jjj i
-4 -3 -2 -1 0 l 2 3
jj i j
4 5 6 7
i(n]
n
307
To obtain z 1[n] = z[((n - 2)) 4], we shift by two (to the right) and only keep those points which lie in
the original domain of the signal (i.e. 0 :5 n :5 3):
• •
-2 -1 0
fi l
li
2
• •
3 4 5
z,[n]
To obtain :r2[n] = z[((-n)) 4 ], we fold the pseudo-periodic version of :r[n] over the origin (time-reversal),
and again we set all points outside O :5 n :5 3 equal to zero. Hence,
• •
-2 -1 0
li i i l 2 3
I
4 5
I
:r,[n]
Note that :r[((0)) 4 ] =z[O], etc.

In the second approach, we work with the given signal. The signal is confined to
0 :5 n :5 3; therefore, the circular nature must be maintained by picturing the signal on the circumfer-
ence of a cylinder.
8.29. Circular convolution equals linear convolution plus aliasing. First, we find y[n] =:r1[n] • :r2[n]:
8
6 ' 6
. 5
• 4 • 4 y[n]
• 3 3
2
'
l
T
01234567891011 ' - - n
Note that y[n] is a ten point sequence (N =6 + 5 - 1).
(a) For N = 6, the last four non-zero point (6 :5 n :5 9) will alias to the first four points, giving us
Y1 [n] = z, [nJ(§):2 [n]
308
8
10 " 6
• 8
6 " 11,(n]
4
'
'
-
.
-1 0 l 2 3 4 5 6 7
n
(b) For N = 10, N ;:: 6 + 5 - l, so no aliasing occurs, and circular convolution is identical to linear
convolution.
8.30. We have a finite length sequence, whose 64-pt DFT contains only one nonzero point (for k = 32).
(a) Using the synthesis equation Eq. (8.68):
l ,,_,
:r[n] =N L X[k]Wi,"", 0 Sn S (N - l)
A:=O
32
:r[n] = !x[32]W64 "
= .!..,.;i.(32)n
64
= _!_e-71rn
64
:r[n] = !<-1)", 0SnS(N-1)
The answer is unique because we have ta.ken the 64-pt DFT of a 64-pt sequence.
(b) The sequence length is now N = 192.
:r(n]
:r[n] =
64 Sn S 191
This solution is not unique. By taking only 64 spectral samples, z(n] will be aliased in tinle.
As an alternate sequence, consider
8.31. We have a 10-point sequence, :,;[n]. We want a modified sequence, :,;1 (n], such that the 10-pt. DFT of
zi[n] corresponds to
X;(k] = X(z)l,=½•'",_,,,o>+<•t>•ll
Recall the definition of the Z--transform of z(n]:
00
X(z) = L z[n]z-•
n.=-00
309
Since z[n] is of finite duration (N = 10), we assume:

0$n$9
z[n] = { nonzero,
0, otherwise
Therefore,
X(z) = L• z[n]z-•
n=O
Substituting in z = ½eil<•••/10)+(•/IO)),
We seek the signal z 1 {n], whose 10-pt. DFT is equivalent to the above expression. Recall the analysis
equation for the DFT:
X 1 [k)
•
= :[;zi{n)Wt.;', 0$ k$ 9
n=<I
Since Wf0n = e-i( 2" /lO)A:n, by comparison
8.32. We have a finite-length sequence, z{n] with N =

8. Suppose we interpolate by a factor of two.· That
is, we wish to double the size of :r{n] by inserting zeros at all odd values of n for O $ n $ 15.
Mathematically,
y{n] = { z{n/2], n even, 0 $ n $ 15
0, n odd,
The 16-pt. DFT of y[n]:
15
Y{k) = :[;y{nJwt.•,
n=O
0 $ k $ 15
= :[;:i:[n]Wf;"
n=O
7
Y{k] = L z{n]Wt°, 0 $ k $ 15
n=O
Therefore, the 16-pt. DFT of the interpolated signal contains two copies of the 8-pt. DFT of z{n]. This
is expected since Y{k] is now periodic with period 8 (see problem 8.1). Therefore, the correct choice is
C.
As a quick check, Y[0] = X{0].
t
310
8.33. (a) Since

:i:[n], 0 :S n :S N - 1
:i:2[n] = -:i:(n - NJ, N :S n :S 2N - 1
{
0, otherwise
If X(k] is known, :i:2(n] can be constructed by :
X(k]--+1, I N-pt IDFT f---:i:[n,;--------,
Scale by -1
Shift by N
concatenate 2N-pt DFT X2[k]
(b) To obtain X[k] from X,ik], we might try to take the inverse DFT (2N-pt) of X,ik], then take the
N-pt DFT of :r,ln] to get X[k].
However, the above approach is highly inefficient. A more reasonable approach may be achieved if
we examine the DFT analysis equations involved. First,
2N-1
X,[k] = L :ri[n]W;';, 0 :S k :S (2N - 1)
n=O
N-1
= L :r[n]W;';)
,.,_,
=O
= I: :r[nJwt12>n, 0 :S k :S (N - 1)
=O
X1 [k] = X(k/2], 0 :S k :S (N - 1)
Thus, an easier way to obtain X[k] from X 1 [k] is simply to decimate X 1 (k] by two.
X,(k] ---.t•~I__._2__:--· X(k]

311
8.34. (a) The DFT of the even part of a real sequence:

H :z:[n] is of length N, then :z:.[n] is of length 2N - 1:
- { :[n] +/[-n], (-N + 1) :Sn :S (N - 1)

:z:.(n] -
otherwise
X,[k] = NL-1 (:z:[n] + :z:[-n]) .,,._

,., (-N + 1) 5 k 5 (N - 1)
2 ZN-1,
n=-N+l
~ :z:[-n].,,._ ~ :z:[n]w:•n
= L.J -2-"2N-l + L.J 2 2N-l
n=-N+l n=O
Letm= -n,
N-1 [ ] N-1 [ ]
X.[k] = ~ !!'_w,-1:n
~ 2 2N-1
+~ ~w,kn
L.J 2 2N-1
n=O n.=O
X,[k] = ~ :z:[n]cos (/;~nl)

n=O
N-1
X[k] =L :z:[n]Wt", 0 5 k 5 (N -1)
n=O
and
Re{X[k]} = N-1 (2 k )
~ :z:[n]cos ';.,, n
So: DFT{:z:,[n]} # Re{X[k]}

(b)
X[k] + X'[k]
Re{X[k]} = 2
l N-1 l N-1
= 2L :z:(n]Wt" + 2L :z:(n]WN""
n=O n=O
N-1
= ½ L (:z:[n] + :z:[N - n])Wt"
n=O
So,
Re{X[k]} =DFT { ½(:z:[n] + :z:[N - n])}
8.35. From condition 1, we can determine that the sequence is of finite length (N = 5). Given:
X(~"') = 1 + A1 cosw + A2 cos2w
= 1 + A1 (~" + e-'"') + A2 (e'..., + e-i'"')
2 2
From the Fourier analysis equation, we can see by m•khing terms that:
:z:[n] = 6[n] + A, (6[n - l] + 6[n + l ]) + A2 (o[n - 2] + 6(n + 2])

2 2
312
Condition 2 yields one of the values for the amplitude constants of condition l. Since z[n] • cS[n - 3] =
:r[n - 3] = = = =
5 for n 2, we know z[-1] 5, and also that z[l] z[-1] 5. Knowing both these values =
=
tells us that A, 10.
For condition 3, we perform a circular convolution between z[((n-3)),] and w[n], a three-point sequence.
For this case, linear convolution is the same as circular convolution since N = 8 ?: 6 + 3 - l.
We know z[((n - 3)) 8 ] = z[n - 3], and convolving this with w[n] from Fig PS.35-1 gives:
22
A2 + 15
2 + 11
lli
5+A2
1> + 13
lli
2
1>
n
0 1 2 3 4 5 6 7 8
For n = 2, w[n] • z[n - 3] = 11 so A2 = 6. Thus, z[2] = z[-2] = 3, and we have fully specified z[n]:
5 5
l' lI
3 3
z[n]
•
-3
I
-2 -1
1
0 1 2
•3 n
8.36. We have the finite-length sequence:
z[n] = 2o[n] + cS[n - l] + cS[n - 3]
(i) Suppose we perform the 5-pt DFT:
X[k] = 2 +Wt+ Wi', 0 :S k $ 5

where Wt =,-;('fl•.
(ii) Now, we square the DFT of z{n]:
Y[k] = X 2 [k]
= 2 + 2Wt +2wff•
+2W{ + W;"+ W:'
+ 2w;• +wt•+ wt•. o :s .1: :s s
Using the fact wt• = ~ = 1 and w:• = w;

Y[.I:] = 3 + 5Wt + w;• + 4Wi' + w:•, 0 :S k $ 5
313
(a) By inspection,
y(n] = 3o[n] + So(n - 1] + o[n - 2] + 4o[n - 3] + o[n - 4], 0:, n :, 5
(b) This procedure performs the autocorrelation of a real sequence. Using tbe properties of tbe DFT,
an alternative method may be achieved with convolution:
y[n] = IDFT{X 2(k]} = z[n] • z[n]

The IDFT and DFT suggest that the convolution is circular. Hence, to ensure there is no aliasing, the
size of the DFT must be N 2: 2M - 1 where M is the length of z[n]. Since M = 3, N 2: 5.
8.37. (a)
gi[n] = z[N - 1 - n], 0 :Sn :S (N - 1)
N-1
G1 [k] = L z(N - 1- n]Wt", 0 :S k $ (N - 1)
n=O
Letm=N-1-n,
N-1
G1(k] = L z[m]W~(/'1-l-m)
m=O
N-1
= w~(N-1) L z[m]w,v•m
m=O
N-1
G1[k] = ei(2d//'I) L z[m]ei(2dm//'I)
m=O
= ei(>d/1'1 X(ei")lwz(b>/1'1)
G1(k] = H1[k]
(b)
g,[n] = (-l)"z[n], 0:, n :S (N -1)
N-1
G2[k] = L (-l)"z[n]W;', 0:, k :, (N - 1)
n=O
N-1
= L z[nJwtfl•wt·
n=O
N-1
= I: x1n1w:.,,+ti•
n=O
= X(ei")l.,=b(Hf)/N
q,[k] = He[k]
314
(c)
{ z[n], 0$n $ (N-1)

93(n] = z(n - NJ, N $ n $ (2N- 1)
0, otherwise
2N-1
G3(k] :E xfnJw.~.
= ..,.., 0 $ k $ (N - 1)
N-1 2N-l
L z[n]w;~ + L z[n -
= ..,.., N]Wfiv
=N
N-1 N-1
= L z[n]Wfiv + L z[mJw;im+N)
n=O m=O
N-1
= L z[n] (1 + w;p) w.~

n=O
N-1
= ( 1 + wt•N/2)) L z[nJwttn/2)
..,..,
= (1 + (-l)t) X(_.iw)lw=(d/N)
G3[k] = H3[k]
(d)
z[n] + z[n + N/2], 0 $ n $ (N/2 - 1)

94 [nl
·
={ 0, otherwise
G4 [k] = O $ k :S (N - 1)
N/2-1 N/2-1
= L
n=O
z[n]W,t12 + L
n=O
z[n + N/2]W,t12
N/2-1 N-1
= L z[n]W,t12 + L z[m]W!j';-Nl•l
A=O m=N/2
N-1
= L z[n]w}tn
n=O
= X(e''"')lw=(4rt/N)
G4 [k] = Ha[k]
(e)
:z:[n], 0 :Sn$ (N- 1)

gs[n] = 0, N $ n $ (2N - 1)
{
0, otherwise
315
2/11-1
G.[k] = I: :i:[nJwm, O :S k $ (N -1)
n=O
N-1
= L x[n]W,/'N
....0
= X(eiw)lw=(d/N)
G.(k] = H2[k]
(f)
.90[n] = { :i:[n/2], n even, 0 $ n :S (2N - 1)

0, nodd
2N-l
G6 [k] = L :r[n/2)WfN, 0 :S k $ (N - 1)
n:0
N-l
= L :r[n]W~n
n=O
= X(eiw)lw=(2d/N)
G&[k] = H,[k]
(g)
97(n] = x[2n), O $ n :S (N/2 - 1)
f-1
G1[k] = L x[2n]WM2, 0 :S k $ (N - 1)
n=O
= ~ :r[n) (1 + tl)n) w~n

N-1 ( l + wlN/2)n)
= 1:x[n] ; w~n
n=O
N-1
= ½~ :r[n] (w;:• + w;<•+Nt•>)
= ½[x(,i( 2•/N)) + X(,i(2•/N)(HN/2JJ]
G,[k] = H5(k]
8.38. From Table 8.2, the N-pt OFT of an N-pt sequence will be real-valued if
For O:S n :S (N - I), this may be stated as,

x[n] = x(N - n], 0 :Sn :S (N - 1)
316
For this case, N = 10, and

::r[l] = :z:[9]
:z:[2] = :z:[8]
The Fourier transform of ::r[n] displays generalized linear phase (see Section 5.7.2). This implies that for
::r[n] ,; 0, 0 S n S (N - 1):
::r[n] = ::r[N - 1 - n]
For N = 10,
::r[O] = :z:[9]
::r[l] = :z:[8]
:z:[2] = :z:[7]
To satify both conditions, ::r[n] must be a constant for OS n S 9.
8.39. We have two 100-pt sequences which are nonzero for the interval OS n S 99.
If x, [n] is nonzero for 10 S n S 39 only, the linear convolution
::r,[n] • :z:2[n]
is a sequence of length 40 + 100 - 1 = 139, which is nonzero for the range 10 Sn S 139.
A 100-pt circular convolution is equivalent to the linear convolution with the first 40 points aliased by
the values in the range 100 S n S 139.
Therefore, the 100-pt circular convolution will be equivalent to the linear convolution only in the range
40 Sn S 99.
8.40. (a) Since ::r[n] is 50 points long, and h[n] is 10 points long, the linear convolution y[n] = :r[n] • h[n]
=
must be 50 + 10 - 1 59 pts long.
(b) Circular convolution= linear convolutin + aliasing.
If we let y[n] = ::rjn] • h[n], a more mathematical statement of the above is given by
00
::r[nJ©,[n]= I: 11[n+rN], OSnS(N-1)

r=-oo
For N = 50,
::r[n]@.[n] =11[;.] + y[n + 50],
We are given: :z:[n]@).[n] =10
Hence,
11[n] + 11[n + 50] = 10, 0 S n S 49
=
Also, y[n] 5, 0 S n S 4.
Using the above information:
317
n=O y[O) + y[SO) = 10

y(SO) = 5
n=4 11(4) + 11(54) = 10
11(54) = 5
n=5 11[5] + 11(55) = 10
11(55) = ?
n=8 11[8) + 11(58] = 10
11(58) = ?
n=9 11[9) = 10
n=49 11(49) = 10
To conclude, we can determine 11[n) for 9 S n S 55 only. (Note that 11[n) for O S n S 4 is given.)
8.41. We have
A B
_ _.__ _ _.__ _ _ _ __.__ _ _~ - - n
0 9 30 39
[1
10 19
n
(a) The linear convolution z(n) • 11[n) is a 40 + 20 - 1 = 59 point sequence:
B•C
_ _..__ _ _ _ _....,__ _ _ _.,___ _ _ _ _....,___ n
10 28 40 58
Thus, z[n] • y[n) = w(n] is nonzero for 10 Sn S 28 and 40 Sn S 58.
318
(b) The 40-pt circluar convolution can be obtained by aliasing the linear convolution. Specifically, we
alias the points in the range 40 $ n $ 58 to the range O $ n $ 18.
Since w(n] = z(n] • y(n] is zero for O $ n $ 9, the circular convolution gin] = z(n]@\,(n] consists
of ooly the {aliased) wlues:
w(n] = z(n] • y(n], 40 $ n :$ 49
Also, the points of g(n] for 18 $ n $ 39 will be equiwlent to the points of w(n] in this range.
To conclude,
w(n] = g(n], 18:::,n:$39
w[n +40] - g(n], 0 $ n :$ 9
8.42. (a) The two sequences are related by the circular shift:
h2[n] =h 1 (((n + 4))a]

Thus,
and
IH,[k]I = 1w,-•• H,[k]t = IH,(k]I
So, yes the magnitudes of the S-pt OFTs are equal.
(b) h,(n] is nearly like (sinx)/x.
Since H 2 (k] = .,,. H,(k]. h,(n] is a better lowpass filter.
8.43. (a) Overlap add:
If we divide the input into sections of length L, each section will have an output length:
L + 100 - 1=L + 99
Thus, the required length is
L = 256 - 99 = 157
=
If we bad 63 sections, 63 x 157 9891, there will be a remainder of 109 points. Hence, we must
pad the remaining data to 256 and use another OFT.
Therefore, we require 64 OFTs and 64 IDFTs. Since h(n] also requires a OFT, the total:
65 OFTs and 64 IDFTs
(b) Overlap save:

We require 99 zeros to be padded in &om of the sequence. The first 99 points of the output of
each section will be discarded. Thus the length after padding is 10099 points. The length of each
section overlap is 256 - 99 = 157 = L.
We require 65 x 157 = 10205 to get all 10099 points. Because h(n] also requires OFT: a
66 OFTs and 65 IDFTs
(c) Ignoring the transients at the beginning and end of the direct convolution, each output point
requires 100 multiplies and 99 adds.
overlap add:
# mult = 129(1024) = 132096
# add = 129(2048) = 264192
319
overlap save:
# mult = 131(1024) = 134144
# add = 131(2048) = 268288
direct convolution:
# mult = 100(10000) = 1000000
# add = 99(10000) = 990000
8.44. First we need to compute the values Q[O] and Q[3]:
Q[O] = Xi(l}= Xi(e'w)lw=O

00
1
= L ri[n] = -
n:0
-
1- -1 4
4
= 3
Q[3] = X,(-1) = X,(e'w)lw=•
00
= L ri[n](-l}n
=<>
4
= 3
One possibility for Q[k], the six-point DFT, is:
4 4
Q[k] = 3'5[k] + o[k -
3 3].
We then .find q[n], for O ~ n < 6 :
q[n] = ~ L' Q[k]e'f-tn

>=O
= !(~ + ~(-l}n)
6 3 3
= ~(l
9
+ (-1r)
otherwise it's 0. Here's a sketch of q[n]:
4/9 4/9 4/9

q[n]
l. I.I.
012345
n
320
8.45. We have:
Then:
1 •
= 7LX2[k]
lo=O
1 •
= 7 L(Re{X2[k]} + jlm{X2[k]})
lo=O
1 •
=
7 lo=O
LRe{X2[k]} , since x2[0] is real.
= g[O].
To determine the relationship between x2 [1] and g[lj, we first note that since x,[n] is real:
x(ei"'J = x·c,-'"'J.
Therefore:
X[k] = X"[N -k], k = 0, ... ,6.
\Ve thus have:
1 •
g[l] =
....
7 E&{X2[k]}W7-•
! t X2[k] + X2[klw:-•
=
=
7 >=O
7 2
. 7
l:=O
+7
2
2
[
7
!LX2klw-• !LX.[N-klw-•
7
.
k=O
1 1 •
= 2%2[1] + 14 L X2[k]W,'
•=0
•
~x2[l] + 1~ L X2[kJw,-u
=
•=0
1
= 2(x2[l] + z2[6])
1
= 2 (x2[l] + OJ
1
= 2x2[l].
8.46. (i) This corresponds to z,[n] = x,[(( ..:n))N], where N = 5. Note that this is only true for z 2[n].
(ii) X,(e'"') has linear phase corresponds to z,(n] having some internal symmetry, this is only true for
x,[n].
321
(ill) The DFT has linear phase corresponds to z,(n) (the periodic sequence obtained from z,(n]) being
symmetric, this is true for z 1 [n] and x 2 [n] only.
8.47. (a)
(b)
V[k] = X(z)I .i-=2itj( 2•\t•)

n=oo
= I:
n.=-oo
x(n]z-•1 , , ••••
.i-=2r' -.-- 1
=
=•
L x[n]z-•J , '•~•·,
..... ;i:=2e'
=
=•
L x(n)(2eii )-•,-i¥•
.....
=
=•
L v(n],-i'i'•.
n=O
We thus conclude that
(c)
3
w(n] = ¼L W[kJw.-•·
•=<>
3
= ¼L(X(k] + X(k + 4])e+,'f••
l:=O
= ¼L
3
.t-d)
X[k]e+,'f•• + 1L X(k + 3
l.=O
4]e+,'f••
X[k]e+;'f•• + 1
3 7
= ¼L L X(k]e+;'f••
1-=0 l:=4
7
= ! L X(k]e+;'f>2n
4 >=O
= 2x[2n).
We thus conclude that

w[n) = 2x[2n).
(d) Note that Y[k) can be written as:
Y[k] = X(k) + (-I)'X(k]

= X(k] + w:• X(k).
322
Using the DFT properties, we thus conclude that
y[n] = r[n] + x[((n - 4))s],
8.48. (a) No. x[n] only has N degrees of freedom and we have M ~ N constraints which can only be satisfied
if r[n] = 0. Specifically, we want
Since M ;;: N, there is no aliasing and x[n] can be expressed as:
l M-1
x[n] =M
....L X[k]W;," , n = 0, ... , M - 1.
Where X[k] is the M-point DFT of :r[n], since X[k] = 0, we thus conclude that r[n] = 0, and
therefore the answer is NO.
(b) Here, we only need to make sure that when time-aliased to M samples, :r[n] is all zeros. For
example, let
:i:[n] = o[n] - o[n - 2]
then,
Let M = 2, then we have
X(ei\'- 0 ) = I - I= 0
X(ei\'- 1
) = I - I= 0
8.49. :i: 2 [n] is r,[n] time aliased to have only N samples. Since
We get:
n= O, ... ,N-1
:i:,[n] ={ otherwise
8.50. (a) Let n = 0, ... , 7, we can write x[n] as:

:i:[n] = J + !(,.;tn + 0-;tn) _ !(,.;'fn + 0-;'fn)
2 4
= 1 + !,.;'fn+ !,.;'fn7 _ !,.;'fn3 _ !,.;'fn5
2 2 4 4
= !cs+ 4,!'fn + 4,!'fn7 _ 2e,i'fn3 _ :w'f"')
8
7
= ! L Xs(A:],-i'f"n
8 >=o
We thus get the following plot for Xs[k]:

323
8
Xa[k]
4 4
k
0 l 2 3 4 5 6 7
-2 -2
(b) Now let n = 0, ... , 15, we can write v[n] as:

v[n]
We thus get the following plot for V16 [k]:
16
v,.[k]
8 8
k
0 l 2 3 4 5 6 7 8 9 10 11 12 13 14 15
-4 -4
(c)
where X(e'w) is the Fourier transform of z[n].

Note that z{n] can be expressed as:
z[n] = y[n]w(n]
where:
,m l 3,m
y[n] = 1 +cos(-)
4
- - cos(-)
2 4
324
and w(n] is an eight-point rectangular window.

JX,.(k]I will therefore have as its even points the sequence IX8 (k]I .The odd points will correspond
to the bandlimited interpolation between the even-point samples. The values that we can find
exactly by inspection are thus:
IX,.(k]I = IXs(k/2]1 k = 0,2,4, ... ,14.
8
IX,.(k]I
,;,
4 4
2 2
Q Q Q
Q Q Q Q :
•. k
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
8.51. We wish to verify the identity of Eq. (8.7):
!L
N-1
n=O
eJi;(t-r)n ={ l,
k- r
O, otherwise
= mN, m: integer
(a) For k - r = mN,

eJ~(t-r)n = eJ~(mN)n
ei2rmn
Since m and n are integers;

e'~(t-,)n =l , fork - r = mN
So,
N-1 l
2_ L eJ~l•-•)n
= -I:1
N-1
N n=0 N n=<>
= 1 , for k - r = mN
(b)
N-1 '"-IN
l ""' -~in_ 1-•'"
N L..., e' - l - eiif 1
n=O
This closed form solution is indeterminate for I = mN only.

For the case when I = mN, we ase L 'Hopital 's Rule to find:
1- ei2d
lim ..._,
l-.mN 1- eJ...,,-
325
(c) For the case when k - r # mN:
1-ei••<•-•l
1 - e" ~<•-•>
= 0
Note that the denominator is nonzero, while the numerator will always be zero for k - r # mN.
8.52. (a) We know from Eq. (8.11) that if £ 1 [n] = i[n - m], we have:
N-1
Xi[k] = I>=[n - m)W,tn
.....
If we substitute r =n - m into this equation, we get:
r=-m
N-1-m
= w,tm I: xr,1wt·
r=-m
(b) We can decompose the summation from part (a) into
Using the fact that i[r] and w,t• are periodic with period N:
-1 -1
L i[rJwt· = L i[r + NJwt<•+N)
r=-m r=-m
Substituting l =r + N
N-1
L i[l]W,t'
r=-m l=N-m
(c) Using the result from part (b):
X1[k] = w,tm f I:
LN-m
i[r)Wff + Nf:- i[r]Wt']
r=O
1
N-1
= w,tm L i[r)Wff
r=D
= W;;"X[k]
Hence, if :ii[n] = i[n - m), then X1[k] = Wt"' X[k).
8.53. (a) 1. The DFS of i"[n) is given by:
N-1
N
I:x"[n]Wtn = ~ i[n]W,."
l )"
(
n.=0
= X"[-k]
326
2. The DFS of :i:'[-n]:
N-1
I;x'[-n]W~"
n=O
= (=t+t :i:[l]W;/) •
= X'[k]
3. The DFS of &{:i:[n]}:
~ :i:[n] + :i:'[n] w""

L- 2 N = ~ ( X[k] + X'[-kJ)
n=O
= X,[k]
4. The DFS of j/m{i[n]}:

J
~ :i:[n] -
L-
n=O
2
:i;' [n] w•n
,., = 21 (-X[k] -
= X0 [k]
-
X'[-k] )
l
,I
l
(bl Consider z[n] real:
1.
Re{X[k]} = X[k] + X'[k]
l
Jl
2
From part (a), if i[n] is real,
DFS {:i:[n]} = DFS {i'[n]}
DFS {:i:[-n]} = DFS {i'[-n]}
So,
X[k] = X'[-k]
X[-k] = X'[k]
X'[k] + X[-k]
&{X[k]} = 2
= &{X[-k]}
(i.e. the real part of .X[k] is even.)

2.
X[k] - X'[k]
/m{X[k]} = 2
X'[-k] - X[-k]
= 2
= /m{X[-k]}
(i.e., the imagina.ry part of X[k] is odd.)

3.
IX[k]I = ✓X[k]X'[k]
= ✓x•[-1:]X[-k]
= IX[-k]I
327
(i.e., the magnitude of X[k] is even)

4.
LX[k] = arctan (Im{!(k]})

~{X[k]}
Im{X[-k]})
= arctan ( ~{X(-k]}
= -LX[-k]
(i.e., the angle of X[k] is odd.)
8.54. l. Let :r[n] (0 $ n $ N - 1) be one period of the periodic sequence f(n]. The Fourier transform of this
periodic sequence can be expressed as:
00
X(el"') = L f[n],-'"'"
=-00
Recall the synthesis equation, Eq. (8.12):

N-1
f[n] = }._ L X[k]WN••
N •=<>
X(elw) =};
00
(! %X(k]wN••) ,-,.,.
Rearranging the summations and combining terms:
The infinite summation is recognized as an impulse at w = (2,rk/ N):
X(ei"') = }._ ~ X(k]6 (w - 2"k)

N t=0 N
2. Since :r(n] corresponds to one period of f[n], we must apply a rectangular window (unit amplitude
and length N) to the periodic sequence. Thus, to extract one period from f[n]:
:i:[n] = f(n]w[n]
0 $ n $ (N -1)
w[n] = { l,
0, otherwise
The window has a Fourier transform:
00
W(e-1"') = L w[n]e-;"'n
--00
N-1
= L e-;wn
n=O
1 - e-;wN
= 1 - ,-;., = .-,'f ei'f - ,-;t
= ,-;.. (¥)sin(w1)
sin(~)
328
=
3. Since z[n] :r[n]w[n], the Fourier transform of z[n] can be represented by the periodic convolution
(see Eq. (8.28)).
Integration over -.- :,; fJ :,; r reduces to the summation (note the impulse train):
Hence, the Fourier transform is obtained from the DFS via an interpolation formula.
8.55. The N-point DFT of the N-pt sequence, z[n) is given by

N-1
X[kJ = L z[nJwtn, 0:,; k:,; (N - 1)
n=O
N-1
X[O] = L z[n]
n=O
=
(a) Suppose z[n] -z[N -1- n]. For N even, all elements of z[n] will cancel with an antisymmetric
component. For Nodd, all elements have a counterpart with opposite sign. However, z[(N -1)/2]
must also be zero.
=
Therefore, for z[n] -z[N -1 - n], X[O] 0. =
(b) Suppose z[n] = z[N - 1 - n] and N even.
N-1
X[N/2] = L z[nJWJ:'121n
n=O
N-1
= L z[n](-l)n
n=O
= z[O] - z[l] + z[2) - z[3) + · · · + z[N - 2] - z[N - l]
Since z[n] = z[N - 1 - n], then

z[O] = z[N - l]
z[l) = z[N - 2]
Therefore, X[N/2)= 0.
8.56. (a) The conjugate-symmetric part of a sequence:
z,[n] = ~ (z[n) + :r"[-nJ)
The periodic conjugate-symmetric part:
:r,,[n] = 1
(:r[((nllN] +:r"[((-n))N]), 0:,; n:,; (N - 1)
329
Note that:
z[((n))N] = z[n], 0 $ n $ (N - 1)
z"[((-n))N] = z"[-n + N] + z"[O]o[n] - z"[O]o[n - N]
Substituting into z,,[n]:
z,,[n] = ~ [z[n] + z"[-n + N] + z"[O]o[n] - z"[O]o[n - NJ], 0 $ n $ (N - 1)
Since,
z,[n] = ~ (z[n] + z"[-nJ)

= ~(z[n]+z"[O]o[nJ), 0$n$(N-l)
andz,[n-N] = ~(z[n-N]+z"[N-nJ)
= ~ ( - z"[O]o[n - NJ+ z"[N - nJ) 0 $ n $ (N - 1)
'Ne can combine to get:
z.,[nJ = z,[nJ + x,[n - N] 0 $ n $ (N - 1)
The periodic conjugate-antisymmetric part is given as

z.,[nJ = (z {n] + z
0 0 [n - NJ), 0 $ n $ (N - 1)
Recall that the odd part can be expressed as
z 0 [n] = ~ (z[n] - z"[-nJ)
So,
For O :5 n :5 (N - 1):
z 0 [n] = ~ ( z[n] - z"[O]o[nJ), 0$ n $ N - 1
z 0 [n - N] = ~ ( z[O].![n - NJ - z"[N - nJ)
From the definition of z.,[n]:
z.,[n] = ~ ( z[((n))N]- z"[((-n))NJ), 0 $ n $ (N -1)
= ~ (z[n] - z"[OJ6[n] + z"[0]6[n - NJ - z"[N - nJ), O $ n :5 (N - 1)
Recognizing the expressions for z 0 [n] and z 0 [n - N] in z.,[n], we have

z.,[n] =z.[nJ + z 0 [n - N], 0 $ n $ (N - 1)
330
(b) z[n] is a sequence of length N; however,
z[n] = { "'1 [n], 0 $n $ N/2

0, N/2$n$N-l
The even part: (assume N is even) '

z[n] z*[0]o[n] 0 _< n _< N/ 2
2 + 2 ,
:i:,[n] = :,;•[-n]
-2-·
-N/2 $ n $ -1
0, otherwise
From part (a):

x.,.[n] = :i:,[n] + :,;,[n - NJ, 0 $ n $ (N - 1)
Because :r[n] = 0 for lnl ?; N /2,
:i:,p[n] = z,[n], 0 $ n $ (N /2 - 1)
Also, since z,[n] = z;[-n],
x,[n] = x;p[-n], -N/2 < n $ -1
To conclude:
z,p[n], O $n $ N/2
x,,[n]
n= N/2
:i:,[n] = 2 '
x;,.[-n], -N/2<n$-l
x;,.[-n]
n = -N/2
2
8.57.
N-1 N-1
L jz[n]l = L :i:[n]z*[n]
2
n=O n.=O
From the synthesis equation:
Hence,
substituting:
z*(n] =
.
! L..,
N-1
X*(k]W~"
331
= ! I: l:=O
X'[k] ('f n.:=O
z[n]Wff)
= !L N-1
l=O
X'[k]X[k]
N-1 N-l
L lz[n]l 2
= ..!_
N
L IX[k]l
l=O
2
n=O
8.58. (a) This statement is TRUE:
X[k] = X(e'"')L=•••/N
= B(2;k) e>!2•/N)to
A[k] = B(2;k)
2.-ac
'Y = N
(b} This statement is FALSE:
Suppose z[n] = o[n] + ½•[n - l],
X[k]
Expressed in the form
= A[kje''•,
X[k]
1 •
A[k] = 1 + -(-1)
2
and -y = 0
The Fourier transform of :r[n] is X(e'"') = 1 + ½ei"', which cannot be expressed in the form
X(e-'"') = B(w)& 0 "'.
8.59. We desire 128 samples of X(&"')Y(e'"').
Since z[n] and y[n] are 256 points long, the linear convolution, :r[n] • y[n], will be 512 points long.
We are given a 128-pt DFT only. Therefore, we must time-alias to get 128 samples. The most efficient
impiementation is:
:r[n] --+I I
m JV 1---R,[k]
y[n] --+I I
Total cost = 110.

332
8.60. Ideally, the inverse system would be:

H,(z) =z - bz-•
Hence,
X(z) = (z - bz-')Y(z)
and
:r[n] = y[n + l] - by[n - l], -oo $ n $ oo
H we use an N-pt block of v[n]:
y[n] : 0 $ n $ N,
then
and
v[n] = v[((n + l))N] - by[((n - l))N]
Because the shift is circular, the points at n 0 and n = = (N - 1) will not be correct. Therefore, only
the points in the range l $ n $ (N - 2) are valid.
8.61. (a)
N-1
X[k] = L :r[n]e-i(>r/N)tn, 0 $ k $ (N -1)
n=O
N-1
X.,[k] = L :r[n]e-;(2.t/N+r/N)n
n=O
N-1
= E z[nje-j(,rn/N)e-J(2,r/N)l:n
n=O
So, x.,[n] = x[nJ.-;(rn/N)_

(b)
N-1
x.,[N -k] = L x[n]e-;(rn/N).-;(../N)(N-t)n, 0 $ k $ (N - 1)
n=O
N-1
= L :r[n]e-;(rn/N),i(2r/N)t
n=O
N-1
x.,[N - (k + l)] = L :r[n],-i(rn/N).-;(2r/N)(N-t-l)n
n=O
= L :r[n]e- ;(rn/N) ,-;(2r /

N-1
N)(N-1 )n ,i(2r / N).,.
n=O
N-1
= L :r[n]ei(rn/N),i(2r/N).,.
. n=O
= X_it[k]
So,
X.,[k] = X_it[N - (k + l)] , for O $ k $ (N - 1) and :r[n] real.
333
(c) (i) N-k-1 is odd when k is even. H R[k] = XM[2k], we may obtain XM[k] from R[k] as follows:
G { R[J:/2], k even
[k] = R•[(N - (k + 1))/2], k odd
where we note that
R•[(N - (k + 1))/2] = Xi,[N - (k + l)]
fork odd.
(ii)
R[k] = XM[2k]
(N/2)-1
= L z[n]e-;(4d/N+•/N)n
n=O
N-1
= L z[n]e-,<•n/N),-i('Mf)
(N/2)-1 N-1
= L z[n],-,c•n/Nle -;( '..ffl' )·+ L x[n],-i<•n/N)e -i('..ffl')
n=O n=N/2
(N/2)-1
= L (:i:[n],-i(•n/N) +z[n+N/2],-i(•n/Nl,-,1•/21),-;('Mf)
n=O
So,
r[n] = (x[n] - jx(n + N /2]),-iC•n/N), 0<- n <- (N2 -1)
(d)
X3.,(k] = X1M[k]X2M[k]
N-1
X 3.,[n] = L z 1.,[r]x2.,[((n - r))N]
r=O
From part (a):
Z1M[n] = z,[n]e-;(,n/N)
Z2M[n] = z2[nj,-i(•n/N)
X3M(n] = :t3(n],-;( .. /N)
So,
N-1
z,[n] = ,i(•n/N) L zi[r]z2[((n - r))N],-iC•/N)[((n-r))N+•l
r=O
N-1
= L :i:i[r]z,[((n - r))N],-i(•/N)[((n-r))N-(n-r)]
r=O
Since,
n-r, n>r
((n-r))N ={ -
N+n-r, n<r
((n - r))N - (n - r) = { 0, n ~r
N, n <r
334
then
e-;(,/N){((n-rJlN-(n-r)) = sgn [n _ r] = { 1, n~r
-1, n <r
and
N-1
Z3 =L z,[r]z2[((n - r))N]sgn [n - r]
=•
(e) Suppose, that for n 2: N/2:
z,.v[n] = z,[n],-;(,n/N) = 0
:z:2.v[n] = z2[n]e-;(,n/N) O =
then the modilied circular convolution is equivalent to the modified linear convolution:
:r,.v[n] ~2.v[n] =:r,.v[n] • :r2.v[n]

(i.e. no aliasing occurs.)
z3.v[n] = z 1.v[n) • z 2.v[n]

N-1
Thus,
=
N-1
-
L z1.v[r]z2.v[n - r)
:z:,[n] = ,i(on/N) L :z:,[n]z,[n _ r]e-;(,n/N)e-J(•n/N)(n-r)

r=O
N-1
= L z1[r]:z:2[n - r],-;(r/N)(n-r)
r=O
So,
N-1
z3[n] =L :r1[r]:z:2[n - r]e-,C•/N)(n-r) = :z:1[n] • :r2[n]
8.62. (a) We wish to compute z[nJ@,[n]:
let :r, [n] = :r[n], 0 :5. n :5. 31

:i:2[n] = :r[n + 32], 0 :5. n :5. 30
h1[n] = h[n], 0:5.n:5. 31
h2[n] = h[n + 32], 0 :5. n :5. 30
:i:[n] • h[n] = :i:1[n] • h1[n] + :r1[n) • h2[n] • 6[n - 32] + z 2[n] • h,[n] • o[n - 32]
+ z 2 [n] • h 2 [n] • o(n - 32] • o[n - 32]
Let
!11[n] = » ,_, • •• l•l • » l•l,, l•l
112[n] = :r1[n] • h2[n] = z,(n] 2[h]
113[n] = z2[n] • h,[n] =:r2[n] ,[n]
11,[n] = :r2[n] • h2[n] =:r2[n] 64 2[n]
335
We can compute each of the above circular convolutions with two 64-pt DFTs and one 64-pt inverse
DFT.
y(n) = :r[n) • h(n)

= 11,[n) + y,(n - 32) + y3(n - 32) + 11,[n - 64)
So
= y(n) + y(n + 63),
:r[n)@).[n) 0 :Sn :S 62
The total computational cost is 12 DFTs of size N = 64.
(b) Using two 128-pt DFTs and one 128-pt inverse DFT:
y[n) = :r[n)@[n] = :r[n] • h(n]

The 63-pt circular convolution:
:r[n]@i[n) = y[n) + y[n + 63), 0 :S n :S 62
(c) Using the 64-pt DFT method of part (a):
#mult = 4(12)(64 log2 (64)) = 18432

Using 128-pt DFTs:
#mult = 4(3)(128 log2 (128)) = 10752
Direct convolution: .,
#mult =2 L n - 63 = 3969
=•
8.63. From each circular convolution, the first 49 points will be incorrect. Therefore, we get 51 good points
and the input must be overlapped by 100 - 51 = 49 points.
(a) V = 49
(b) M = 51
(c) The points extracted correspond to the range 49 :Sn :S 99.
Distorting filter: h[n) = o[n) - ½6(n - no)

8.64. (a) The Z-transform of h[n)
00
H(z) = L h(n)z-n
n=-oo
H(z) = 1-!,-no
2
The N-pt DFT of h(n]: (N = 4no)
•no-1
H(k] L
= n=O h[nJw;:-, 0 :S k :S (4no - I)
= 1- !w;no
2 no
1 - !e-i(•/>l•
H(k] = 2
336
(b)
H;(z) = 1
+ l
112
,_,.., l•I > 2 (1)-no for causality
h;[n] = t. G) n/no 6[n - kno]
The filter is IIR..

(c)
l l
G[k] = H[k] = 1 _,,-;<•l•l•' 0 $ k $ (4no - l)
The impulse response, g[n], is just h;[n] time-aliased by 4no points:
g[n] = (1 + 116 + 2!6 + ···) 6[n] + G + ;2 + 5~2 + ···) o[n-no]
+ (~+ ~ + 1; 24 + · ·-) o[n - !

2no] -+- ( ¼+ 1 8 + ~ 8 + • • -) o[n - 3no]
16 8 4 2
g[n] = 15
o[n] + o[n-no] + o[n- 2no] + o[n-3no]
15 15 15
(d) Indeed,
G[k]H[k] = l, 0 $ k $ (4no - l)
However, this relationship is only true at 4no distinct frequencies. This fact does not imply that
for all w:
(e)
y[n] = g[n] • h[n]

M 8 4 2 8
= o[n] +o[n -no]+ o[n-2no] + o[n -3no] - o[n - no]
15 15 15 15 15
4 2 l
- o[n-2no]- o[n - 3no]- o[n- 4no]
15 15 15
16 1
y[n] = 15
o[n]- o[n-4no]
15
8.65. (a) We start by computing Xn[k + NJ:
N-1
Xn[k + NJ = L i[n]HN[n(k + N)]
n=O
= I; i[n](cos(2,r(nk; nN)) + sin(2.-(nk + nN))

=<> N
N-1
2
= I;:[n](cos( n,k)+sin(~))
.,.. N N
N-1
= L i[n]HN[nk]
n=O
= Xn[k).
337
We thus conclude that the DHS coefficients form a sequence that is also periodic with period N.
(b) We have:
I N-1 I N-1 N-1

N L XH[k]HN[nk] = N L(L z[m]HN[mk])HN[nk]
•=0 l:=O m=O
} N-1 N-1
= -
N
L z[m] L HN[mk]HN[nk]
m=0 .t=a
= !z[n]N
= z[n].
Where we have used the fact that }::,;;;,' HN[mk)HN[nk) = N only if ((m))N = ((n))N, otherwise
it's 0.
This completes the derivation of the DHS synthesis formula.
(c) We have:
HN[a+N] = cos(2-,,,{_a;N))+sm(2,r(a;N))
21ra 2,ra
= cos( N + 2,r) + sm( N + 21r)
2.-a) . (2.-a)
= (
cosN +smN
= HN[a].
And:
HN[a+b) = cos(2.-('.;.,+b))+sm(2.-('.;.,+b))
= (CN[a]CN[b) - SN[a)SN[b]) + (SN[a]CN[b] + CN[a]SN[b])

= CN[b)(CN[a] + SN[a]) + SN[b)(-SN[a] + CN[a])
= CN[b)(CN[a) + SN[a]) + SN[b)(SN[-a] + CN[-a])
= CN[b]HN[a) + SN(b]HN[-a)
= CN[a)HN[b] + SN[a]HN[-b] ( smce HN[a + b] HN[b + a] ) =
Where we have used trigonometric properties.
(d) We have:
N-1
DH S(z[n - no]) = I: z[n - no]HN[nk]
-=O
N-1-no
= }: z[n]HN[(n +no)k]
n.=-ftcl
338
N-1-no
= L :i:(n](HN[nk]CN[nok] + HN[-nk]SN(nok])
N-1-no N-1-no
= CN[nok] L :i:(n]HN(nk] + SN(nok] L :i:(n]HN[-nk]
n=-no n=-no
N-1 N-1
= CN(nok] L :i:(n]HN[nk] + SN(nok] L :i:(n]HN(-nk]
n=O n=O
= CN(nok]XH[k] + SN(nok]XH[-k]
Where we have used the periodicity of HN(nk] and :i:(n].
(e) We have:
N-1
DHT{i,[n]} = DHT{L z1[m]x2(((n - m))N]}
m=O
N-1 N-1
XHl[k] = L (L z1[m]x2[((n - m))N])HN[nk]
n=O m=O
N-1 N-1
= L z,[m] L z2(((n - m))N]HN[nk]
m=O n.=O
N-1
= L z,[m]DHT{z2[((n - m))N]}
m=O
N-1
= L z,[m](XH2[k]CN[mk] + XH2[((-k))N]SN[mk]) (using PS.65-7)
N-1 N-1
= L z,[m]XH2[k]CN(mk] + L z,[m]XH2[((-k))N]SN[mk]
m=O m=O
= 'i:'
=O
z,[m]XH>[k](HN[mk] + HN[-mk])
2
+ 'i:'
m=O
z,[m]XH2[((-k))N](HN(mk] -2HN[-mk])
l l
=
2XH2[k](XH1[k] +XH1[((-k))N]) + 2XH2[((-k))N](XH1(k]-XH1[((-k))N])
= 2l XH1(k](XH2[k] + XH2[((-k))N]) + 2l XH,[((-k))N](XH2[k]- XH2[((-k))N])
This is the desired ·convolution property.
(f) Since the DFT of z[n] is given by:

N-l
X[k] = L z[n]e-,'iF
......
N-l 2.-kn 2,rkn
= L z(n](cos(-~)
n=O
+ jsin(-~))
339
= ~• 2rkn . 2,rkn
L., :[n](cos( JV) - j sm( JV))
....,
N-1
-· L :[n](CN[kn) - jSN[kn))
=O
then:
N-1
L o:[n]CN[kn]
=D
=
N-1
L :[n]SN[kn)
...., =
We thus get:
N-1
XH[k) L o:[n](CN[kn] + SN[kn))
= ....,
This allows us to obtain XH[k) from X[k).
(g) We have:
N-1
Xg[k] = L :[n)(CN[kn] + SN(kn))
=O
Therefore:
N-1
L o:[n]CN[kn] =
=D
N-1
L o:[n]SN[kn] =
=D
We thus get:
N-1
X[k] = L :[n)e-i",F-
=D
N-1
= L o:[n](CN[kn] - jSN[kn))
=D
340
This allows us to obtain X(k] from XH(k].
8.66. (a) The DTIT is given by:
.i(.,;") = . X(.,;") + X(.,;"l•-;v,N

= X(_,;"')(l + •-;"'N)
The DIT is just samples of the DTFI':
.X(k] = .i(.,;"ll,.=W
= X(,i2•12N)(l + (-I)')
Therefore:
k even
k odd
(b) The original system computes the following:
.X(k]H(k] = { 2X(!]H[k~ , k even

k odd
We thus want:
X(k]G[k] = 2X[k]H(2k} k = 0, ... ,N-1

G[k] = 2H[2k]
2N-1
= 2 L h(n],-;9 k =O, ... ,N-1
.....
g(n] = 2(h[n] + h[n + NJ)
System A time aliases and multiplies by 2.
For system B, we need:
k even
k odd
341
Thus:
y(n] = ! w[n-N]
w(n)
0
, 0-S.n-S.N-1
N-S.n-S.2N-1
otherwise
System B regenerates the 2N-point sequence by repeating w(n].

8.67. (a) We have:
= { 1 , lwl -s. {
0 , otherwise
Since h(n) is FIR, we assume it is non-zero over O -s_ n -S. N. The phase of H(e 1 ~) should be set
such that h(n) is symmetric about the center of its range, i.e. ~- Therefore, the phase of H(e'~)
should be e' "f- . So one possible H(k) may be:
0 -S. k -S. ½4N

otherwise
4N-~-S.k-S.4N
that is:
!
ei¼• 0 < k < !f.
H(k) = 0 : o~he~
,it• '
4N - !f. < k < 4N
2 - -
(b) System A needs to perform the following operations:
!
X(k)H'(k] 0-S. k -S. ~
Y2(k] = 0 otherwise
X(k - 3N]H'[k - 3N] 4N-!f.<k<4N
2 - -
Where H'(k] is the N-point OFT of h(n].

(c) It is cheaper to implement N-point DFTs than 4N-point DFTs, therefore the implementation in
Figure PS.67-2 is usually preferable to the one in Figure PS.67-1.
8.68. Substituting the expression for X 1 (k] from equation (8.164) into equation (8.165), we get:
2N-3
=
z 1 (n) _1_ "
2N-2L..,
N-1
.... X 1 (k]ei••tn/(2N-2)
2N-3
= 1 ( L xc1(kJe12•>nt12N-•> + L xc1[2N - 2 - kJe1•"'"1<2N-2>J

2N-2 •=0 •=N
342
Note that:
2N-3 N-2
L X''[2N - 2 - kjei2dn/(2N-2) = L X"[r]_,i2r(2N-2-r)n/(2N-2)
l=N
N-2
= L X"(k]e-j2rb/(2N-2)
l=l
therefore:
l N-1 N-2
:r,(n] = --=--("
2N-2 ~
X"[k]_,i2dn/(2N-2) + "X"[k]e-;2dn/(2N-2lj
~
h=O k=l
N-2
= 2
1
N _ (X"(O] + X''[N -1]_,i2rn +
2
L
X"[k]{.,i2r•n/(2N-2) + 0 -;2dn/(2N-2)))
•=1
1 N-2
= -2N-2 -(X''[O] + X"[N - l]ei'" + "X"[k]2cos( dn ))
~ N-1
k=l
and:
z[n] = :r1[n] for n = 0,1, ... ,N-I

N-l
= N ~ 1 (L o[k]X'1[k]cos(;:'1 ))
•=0
where a[k] is given by:
o[k] ={ ! k=0andN-1
I$ k $N-2.
This completes the derivation.
8.69.
v[n] = z2[2n]
therefore, for k =0, I, ... , N - I:
V[k] = 2I (X2[k] + X2[k + NJ).

Using equation (8.168), we have:
V[k) = ~(X2[k) + X2[k + NJ)

= e1fi Re{X[k]e-iffr} + .,;•<uN) Re{X[k + NJ•-; •<uN)}
= .,iii Re{X[kJe-;fi} + eiieifi Re{X[k + NJe-;fie-ii}
= eifi Re{X[kJe-;fi} + ;eifi Re{-jX[k + NJe-;fit}
= .,ifi(Re{X[kJ•-;.,e-} + jlm{X[k + NJ•-;fi}.
343
Using the above expression, we get:
2Re{e-i¼Y-V[k]} = 2&{,-'* ei* (Jl•{X[k]e-ift} + jlm{X[k + NJ•-'*})}

= 2Re{X[k],-'*}
= X'2 [k] where we used equation (8.170).
Furthermore, we have:
N-1
2Re{e-i¼Y-V[k]} = 2Re{,-i¼Y- L v[n]e-i"P}
n=O
N-1
= 2&{I; v[n],-,<~(n+¼n}
n=O
N-1
= 2 L Re{v[n],-il'w'(n+¼))}
n=O
N-l 2,rk l
= 2 L v[n]cos(N(n + ))
=O
4
= 2 I:[J
n=O
vncos ("k{4n+l))
2
N.
2&{,-,Wv[k]} = 2Re{X[k],-'*}
2N-l
= 2&< I: :r[n1,-,zw ,-,*}

=O
N-1
= 2Re{L :r[n],-i*( 2 n+l)}

n=O
N-1
= 2 L Re{:r[n],-i*( 2n+l)}
n=O
N-1
[ ] cos ("k(2nN+ 1)) .
2 L :rn
= 2
n=O
From the results above, we conclude, for k = 0, 1, ... , N - 1:
8.70. Substituting the expression for X2[k] from equation (8.174) into equation (8.175), we get:
344
l 2N-l .
:r2[n] = -
2N •=0
L X2[k]e'....../(2N)
1 N-1 2N-1
= 2N(X•2[0] + L
X"(k]ei""f(2N)e1'2•ln/(2N) _ L xe2(2N _ k]ei""f(2N)_,j2dn/(2N))
Cl k=N+l
1 N-1 · 2N-l
= w<X"[0] + L
X'.[k]ei••(2n+1)/(2N) _ L X"[2N _ j;J_,id(2n+l)/(2N))
k=l i=N+l
l N-1 N-1
=
2
N(X"[0] + L
X'2[kj_,id(2n+l)/(2N) _ L
X"[kJ.,i•(2N--<e)(2■+1)/(2N))
l=-1 l=l
l N-1 N-1
= 2
N(X"[0] + L
X"(k]_,id(2n+l)/(2N) +L X"[k]e-j•l(h+l)/(2N))
i=l i=l
l N-1
= 2N(X''[0] + L x·'[k](ei••<••+l)/(2N) + .-jd(2n+l)/(2N)))
•=1
N-1
(X'2[0] + ~ X' 2[k] cos("k( 2n + l)))
1
= -2N L.., 2N .
•=1
Furthermore:
:r[n] = :r2[n] for n = 0, 1, ... , N - l
= ! •=0L
N-1
P[k]X''[k] cos{"k(~',:/ l))
where P[k] is given by:
P[k] = { ! k=O
l:Sk:SN-1.
This completes the deri,...tion.
8. 71. First we derive Parsev..l's theorem for the DFT.
Let :r[n] be an N point sequence and define y[n] as follows:
y[n] = :r:[nJ®:r*[((-n))N]-
Using the properties of the DFT, we have:
Y(k] = X(k]X*[k] = fX(k][ 2 •

·Note that:
1,1[01 = L 1:rrnll'
n
and using the DFT synthesis equation, we get:
l N-1
y[0] = N
....L Y[k] .
345
Parseval's Theorem for the OFT is therefore:

N-1
L jz[n]l2 = ~ L IX[k]l
2
•
n A:=O
(a) Note that:

N-1 N-1
L IX'1 [k]l 2 =L IX,{k]l
2
n=O
and, using equation (8.164):

2N-3 N-1
I: JX,[k]l = 2 I: IX"[k]l
2 2
- iX"[oJ1 2 -
2
JX"[N -111 .
Using the OFT properties:

2N-3
L jz,[n]l2 = 2 N 1_ 2 L IX,[k]l
2
n '=O
2N-3 N-1
L !z,[n]l 2 =2 L lz[n]I' - !z[O]l 2 - )z/N -1]1
2
•
n=O
We thus conclude:
N-1 N-1
21
,/_ (2
2
L JX"fk]I' - !X''[O]I' - IX"[N -1]1 2 ) =2 L jz[n]j 2 - lr[O]l
2
- lrfN -1]!
2
.
n=O n=O
(b) Using equation (8.171).

N-1 N-1
L IX' [k]l 2 =
2
L 2
IX2[k]l -
n=O n=O
Note that, using equation (8.167):

2N-l N-1
L IX,fk]I' =2 L jX[k]l 2 - IX[O]I',

2N-l N-1
L jz,[n]I' =2 L iz[n]j 2.
Using the OFT properties:

2N-l l 2N-l
L lz2[n]I' = N
2
L 2
IX2[k]l .
n=O ....
We thus conclude:
-
N-1 N-1
~(2 L IX[k]J 2 IX[O]l 2) = 2 L lz[n]j 2.
....
-
2
347
Computation of the Discrete-Time Fourier Transform

349
9.1. There are several possible approaches to this problem. Two are presented below.
Solution #1: Use the program to compute the DFT of X(k], yielding the sequence g[n].
N-1
=L
g[n]
.... X[k],-;2dn/N
Then, compute
1
x[n] = Ng[((N - n))N]
for n = 0, ... , N - 1. We demonstrate that this solution produces the inverse DFT below.
1
x[n] = Ng[((N - n))N]
N-l
= .!_ L X[k],-;2wl(N-n)/N
N •=0
N-1
= .!_ L X[k],i2dn/N
N •=0
Solution #2: Take the complex conjugate of X[k], and then compute its DFT using the program,
yielding the sequence /[n].
N-1
/[n] =L X"[k],-;••>n/N
i:=0
Then, compute
1
x[n] = Nf"[n]
We demonstrate that this solution produces the inverse DFT below.
:r[n] = !r[n]
= !L N-1
1=0
X[kj,i2•ln/N
9.2. (a) The "gain" along the emphasized path is -W}.

(b) In general, there is only one path between each input sample and each output sample.
(c) :r[O] to X[2]: The gain is 1.
:r[l] to X[2]: The gain is Wk
:r[2] to X[2]: The gain is -WX, -1. =
x[3] to X[2]: The gain is -WX,W} -Wk =
:i:[4] to X[2]: The gain is wX, 1. =
:i:[5] to X[2]: The gain is wX,W} = W}.
x[6] to X[2]: The gain is -WX,WX, -1. =
=
x[7] to X[2]: The gain is -wX,W"X,W} -W}, as in Part (a).
Now
7
X[2] = L x[nJwr
n=O
2
= x[O] + x[I]W; + x[2Jw: + x(3Jw: + x[4Jw: + z[SJW/ 0 + x(6]W;
+ x[7]W; 4
= x(O] + x(l]W; + x[2](-l) + x(3](-W/) + x(4)(I) + z[S]W;
+ x(6](-1) + z(7)(-W;)
350
Each input sample contributes the proper amount to the output DFI' sample.
9.3. (a) The input should be placed into A[r] in bit-reversed order.
A[O] = z[O]
A[l] = z[4]
A[2] = z[2]
A[3) = z[6]
A[4) = z[l]
A[S) = z[S)
A[6] = z[3]
A[7] = z[7]
Tbe output should then be extracted from D[r] in sequential order.
X[k] = D[k], k =0, ... , 7

(b) First, we find the DFT of (-WN )" for N = 8.
X[k] '
= L(-W,)"W,.•
n=()
'
= I:<-1rw,;w,;•
n=O
'
= I;cw.-')"w,w,;•
n=()
'
= I;w;<•-,)
n=O
1- w•-•
= 1- w;-•
= So[k-3]
A sketch of D[r] wis provided below.
0 1 2 3 4 5 6 7 r
(c) First, the array D[r] is expressed in terms of C[r].

D[O] = C[O] + C[4]
D[l] = C[l] + C[S]WJ
D[2] = C[2l + C[6JW;
D[3] = C[3l + C[7]W;
351
D[4] = C[O] - C[4]

D[S] = C[l] - C[S]WJ
D[6] = C[2] - C[6]Wl
D[7] = C[3] - C[7]W/
Solving this system of equations for C[r] gives
C[O] = (D[O] + D[4])/2

C[l] = (D[l] + D[S])/2
C[2] = (D[2] + D[6])/2
C[3] = (D[3] + D[7])/2
C[4] = (D[O] - D[4])/2
C[S] = (D[l] - D[s])w.• /2
C[6] = (D(2] - D[6]) w 0- 2 /2
C(7] = (D[3] - D[7])W8- 3 /2
for r = 0, l, ... , 7. A sketch of C(r] is provided below.
1 '
'
0 1 2 3 4 5 6 7 r
9.4. (a) In any stage, N/2 butterflies must be computed. In the mth stage, there are 2m-l different
coefficients.
(b) Looking at figure 9.10, we notice that the coefficients are
1st stage: w,'

2nd stage: Wl, WJ'
3rdstage: w,',W.',WJ',W/
Here we have listed the different coefficients only. The values above correspond to the impulse
rt:$ponse
h(n] = w;.. u(n]
which can be generated by the recursion
y[n] = W2-y[n - l] + :r[n]

Using this recursion, we only generate a sequence of length L = 2m- 1 , which consists of the different
coefficients. Then, the remaining If -
L coefficients are found by repeating these L coefficients.
(c) The difference equation from Part (b) is periodic, since
h[n] = Wi- u[n]

= •-j>•n/2- u[n]
has a period R = 2m. Thus, the frequency of th;• osciliator is

2,r
w= :im
352
9.5. Multiplying out the terms, we find that
(A-B)D+ (C-D)A = AD- BD+AC-AD = AC-BD =X

(A-B)D+ (C+ D)B = AD-BD +BC +BD = AD+ BC= Y
Thus, the algorithm is verified.
9.6. Answer 3
Decimation in Time: The figure is the basic butter:fly with r = 2.
Decimation in Frequency: The figure is the end of one butter:fly and the start of a second with r = 2.
9. 7. The figure corresponds to the flow graph of a second-order recursive system implementing Goertzel's
=
algorithm. This system finds X[k] for k 7, which corresponds to a frequency of
14,r 7r
.,. = 32 = 16
9.8. This is an application of the causal version of the chirp transform with
N = 20 The length of z[n]

M = 10 The number of desired samples
2,
Wo = T The starting frequency
2,
t,.., = 21 The frequency spacing between samples
We therefore have
for Wn = wo +nD.w or
for Wn = wo + (n - 19)1:,..,.
9.9. In this problem, we are using butter:fly flow graphs to compute a DFT. These computations are done in
place, in an array of registers. An example flow graph for a N = = =
8, (or v log2 8 3), decimation-in-
time DFT is provided below.
353
(a) The difference between l 1 and lo can be foood by using the figure above. For example, in the first
stage, the array elements A[4] and A[S] comprise a butterfly. Thus, l1 - lo = =
5 - 4 1. This
difference of 1 holds for all the other butterflies in the first stage. Looking at the other stages, we
find
stage m = 1: l1 - lo 1 =
stage m = 2: l1 - lo 2 =
stage m = 3: l1 - lo = 4
From this we find that the difference, in general, is
form=l, ... ,v
(b) Again looking at the figure, we notice that for stage 1, there are 4 butterflies with the same twiddle
factor. The lo for these butterflies are 0, 2, 4, and 6, which we see differ by 2. For stage 2, there are
two butterflies with the same twiddle factor. Consider the butterflies with the IV,\' twiddle factor.
The lo for these two butterflies are O and 4, which differ by 4. Note that in the last stage, there
are no butterflies with the same twiddle factor, as the four twiddle factors are unique. Thus, we
found
stage m = 1: ti.lo 2 =
stage m = 2: ti.lo =4
stage m = 3: n/a
From this, we can generalize the result

·ror m = l, ... ,v-1
3S4
9.10. This is an application of the causal version of the chirp transform with
N = 12 The length of z[n]

M = 5 The number of desired samples
Wo = ~; The starting frequency

Aw = h10 The distance in frequency between samples
Letting W = •-;t.., we must have

r[n] = ,-;w,nwn'/2 = ,-;'ftn.-;½fn'/2
9.11. Reversing the bits (denoted by -+) gives
0 = 0000 -+ 0000 = 0
l = 0001 -+ 1000 = 8
2 = 0010 -+ 0100 = 4
3 = OOll -+ 1100 = 12
4 = 0100 -+ 0010 = 2
5 = 0101 -+ 1010 = 10
6 = 0ll0 -+ 0110 = 6
7 = 0111 -+ 1110 = 14
8 = 1000 -+ 0001 = l
9 = 1001 -+ 1001 = 9
10 = 1010 -+ 0101 = 5
ll = 1011 -+ 1101 = 13
12 = 1100 -+ 0011 = 3
13 = ll0l -+ 1011 = 11
14 = 1110 -+ 0111 = 7
15 = 1111 -+ 1111 = 15
The new sample order is 0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15.
9.12. False. lt is possible by rearranging the order in which the nodes appear in the signal !low graph.
However, the computation cannot be carried out in-place.
9.13. Only them = 1 stage will have this form. No other stage of a N = 16 radix-2 decimation-in-frequency
FFT will have a W1 & term raised to an odd power. ·
9.14. The possible values of r for each of the four stages are
~= 1, r=O
m=2, r=0,4
m=3, T =0,2,4,6
m=4, r = 0, 1,2,3,4,5,6, 7
355
9.15. Plugging in some values of N for the two programs, we find
N Program A Program B
2 4 20
4 16 80
8 64 240
16 256 640
32 1024 1600
64 4096 3840
Thus, we see that a sequence with length N = 64 is the shortest sequence for which Program B runs
faster than Program A.
9.16. The possible values for r for each of the four stages are
m= 1, r=0
m=2, r =0,4
m=3, r =0,2,4,6
m=4, r =0, 1,2,3,4, 5,6, 7
where WN is the twiddle factor for each stage. Since the particular butterfly shown bas r = 2, the stages
which have this butterfly are
m=3,4
9.17. The FFT is a decimation-in-time algorithm, since the decimation-in-frequency algorithm bas only 10,'2
terms in the last stage.
9.18. lf the N 1 = 1021 point DFT was calculated using the convolution sum directly it would take Nf
multiplications. lf the N 2 = 1024 point DFT was calculated using the FFT it would take N2 log2 N2
multiplications. Assuming that the number of multiplications is proportional to the calculation time
the ratio of the two times is
N'f 1021 2
N2 log2 N2 = 1024 log2 1024 = lOl.S s:: lOO
which would explain the results.
9.19. X(e'••I•) corresponds to the k = 3 index of a length N = 8 DFT. Using the flow graph of the
second-order recursive system for Goertzel's algorithm,
a = 2cos(2;k)
= 2cos (2"i3))
= -v2
b = -wt
-e-ib/8
=
1 +i
=
v2
356
9.20. First, we derive a relationship between the X 1 (ei") and X(ei") using the shift and time reversal
properties of the DTFT.
r,[n] = z[32 - n]
X1 (ei") = X(,-;"),-,-.2w
Looking at the figure we see that calculating 11[32] is just an application of the Goertzel algorithm with
=
k 7 and N = 32. Therefore,
11[32] = x,[1]
= X,(ei")l.,=W
= X(,-;"),-;.,321
w=fi
= X(,-;tt ),-;(if )32
= X(,-;tt)
Note that if we put x[n] through the system directly, we would be evaluating X(z) at the conjugate
location on the unit circle, i.e., at w = +71r/l6.
9.21. (a) Assume x[n] = 0, for n < 0 and n > N - 1. From the figure, we see that
Y•[n] = x[n] + Wty.[n - l]
Starting with n =0, and iterating this recursive equation, we find
Y>[O] = z[O]
11•[1] = r[l] + wtx[0]
Y•[2] = i[2] + Wtx[l] + Wff:i:[0]
Y>[NJ = x[Nj + Wtz[N - l] + · · · + w;(N-l)x[l] + WtN x[0]

N-1
= o+ L w;cN-,>.,rlJ
l=O
N-1
= L W,v.,r[l]
l=O
N-1
= L r[l]W~-•>'
l=O
= X[N-k]
(b) Using the figure, we find the system function Y.(z).
X(z)
1- w-•,-
N
1
1- 1
2z- cos(~) + z-2
= X(z)
1- w-•z-
N
1
(1- w,v•z- 1 )(1 - wtz-')

X(z)
Therefore, Y•[n] = x[n] + Wty,[n - l]. This is the same difference equation as in part (a).
357
9.22. The flow graph for 16 point radix-2 decimation-in-time FFT algorithm is shown below•
x[O) ._-+-_::;:--+---::70--+-..._----~--+-o.-----+-~-+--,-------+-1 X[O)
x[8)
w;. X[1)
x[4) X[2)
x[12)
w;. X[3]
x[2) X(4]
x[10]
w;. X(5]
x[6) X[6]
-
x[14]
vi;, X[7J
x[1) , X(8]
vi;,
x[9) _,
x[5)
x[13]
vi;,
x{3}
x[11)
w;.
x[7)
x[15]
vi;,
To determine the number of real multiplications and additions required to implement the flow graph,
358
consider the number of real multiplications and additions introduced by each of the coefficients Wt:
W/'6 :0 real multiplications + 0 real additions
Wt, : 0 real multiplications+ 0 real additions (W140 (a + jb) =b - aj)
W{, : 2 real multiplications+ 2 real additions (Wr6 (a + jb) = ,1/-(a + b) + i,1/-(b- a))
Wf6 : 2 real multiplications+ 2 real additions similarly
Wf, : 4 real multiplications+ 2 real additions
Wf, : 4 real multiplications+ 2 real additions
Wf, : 4 real mnltiplications + 2 real additions
U'i, : 4 real mnltiplications + 2 real additions
The contribution of all the Wt 's on the flow graph is 28 real multiplications and 20 real additions. The
butterflies contribute O real multiplications and 32 real additions per stage. Since there are four stages,
the butterfiles contribute O real multiplications and 128 real additions. In total, 28 real multiplications
and 148 real additions are required to implement the flow graph.
9.23. (a) Setting up the butterfly's system of equations in matrix form gives
Solving for
gives
which is consistent with Figure P9.6-2.

(b) The flow graph appears below.
359
1/2
X{O] x(O]
w:,2
X{4J x(1]
1/2
Xl2J x(2]
w:,2
X{6] x(3]
1/2
Xl1J x(4]
w'12
8
XIS] x(S]
1/2
X{3] x(6]
w:,2
Xf7l
(c) The modification is made by removing all factors of 1/2, changing all Wj;' to W,v, and ~labeling
the input and the output, as shown in the flow graph below.
w'
x(4) ' X{1]
YI'
x(6] ' X13I
w'
x(S] • XIS]
(d) Ye.,. In general, for each decimation-ill-time FFT algorithm there ezists a decimation-in-frequency
FFT algorithm that corresponds to interchanging the input and output and reversing the direction
of all the arrows in the flow graph.
360
9.24. (a) Using the figure, it is observed that each output Y[k] is a scaled version of X[k]. The scaling
factor is W[k], which is found to be
k =01234567
W[k] = 1GGG2GG2 G2 G3
Using this W[k], Y[k] = W[k]X[k].

=
(b) W[k] = G7'!>1, where p[k] the number of ones in the binary representation of index k.
(c) A procedure for finding 5:[n] is as follows.
step 1: Form W'[k] = 1/W[k].
step 2: Take the inverse DFT of W'[k], yielding w'[n].
step 3: Let 5:(n] be the circular convolution of z[n] and w'(n].
li 5:[n] is input to the modified FFT algorithm, then the output will be X(k], as shown below.
Y(k] = W(k]X[k]
= W(k]X[kjW'(k]
= X(k]
9.25. Let z, be the z-plane locations of the 25 points uniformly spaced on an arc of a circle of radius 0.5
from -'If /6 to 2,r /3. Then
where
71'
WO =
6
&, = (5;) (;4)
5.-
=
144
From the definition of the z-transform,

N-1
X(z.) = L z[n]z,"
n=O
Plugging in z;, and setting W = ,-it=,

N-1
X(z.) =L :z:(n](0.5)-•,-iwo•w""
n=O
This is similar to the expression for X(e'~) using the chirp transform algorithm. The oiJ.ly difference is
the (0.5)-• term. Setting
we get
N-,
X(z.) = w•· /2 L g\n\w-(•-•l' /2
...0
using the result of the chirp transform algorithm. A procedure for computing X (z) at the points •• is
then
361
• Multiply the sequence x(n] by the sequence (O.sJ-••-;"'••w•'/2 to form g[n].
• Convolve g(n] with the sequence w-•' /2 •
• Multiply this result by the sequence w•'l 2 to form X(z•J-
A block diagram of this system appears below.
g{n]
x[n] ---l(:X}------1( l----i(_X}--➔
9.26.
2N-l
Y(k] = L y(n],-;(~l••
n=O
N-1 2N-l
= L 2
e-j(r/N)n e-j(2r/N)(k/2)n + L e-j(r/N)n 2 e-j(2 .. /N)(li:/2)n
n.=O n=N
N-1 N-1
= L 2
e-i(•/N)n e-j(211/N)(k/2)n + L e-i(•/N)(l+N)2 e-j(2w/N)(k/2)(l+N)
n=O l=O
N-1 N-1
= L 2
e-i(•/N)n e-j(2r/N)(A:/2)n + e-i•lc L e-j(•/N)(l 2+2Nl+N 2 )e-i<2•/N}(i/2)l
n=O l:sO
N-1 N-1
= L 2
e-j(r/N)n e-j{2r/N).(li:/2)n + (-l)k L e-j(r/N)l 2 e-j(2w/N)(1/2)J
n=O l=O
N-1
= (1 + (-1)•) L ,-;(r/NJ•',-;(2r/N)(•/2)n
n=O
= { 2X(k/2], k even
0, k odd
Thus,
k even
Y(k] = { 0,
k odd
9.27. Let
y[n] = .-j2rn/627:r(n]
Then
Y(e'"') = X(e'l"'+tM)
Let y'(n] =:E:=-oo y(n + 256m], 0 :5 n :S 255, and let Y'(k] be the 256 point DFT of y'[n]. Then
See problem 9.30 for a more in-depth analysis of this technique.

362
9.28. (a) The problem states that the effective frequency spacing, !!./, should be 50 Hz or less. This
constrains N such that
1
!!./ = NT :S 50
1
N '2:. SOT
~ 200
Since the sequence length L is 500, and N must be a power of 2, we might conclude that the
minimum -value for N is 512 for computing the desired samples of the z-transform.
However, we can compute the samples with N equal to 256 by using time aliasing. In this technique,
we would zero pad z[n] to a length of 512, then form the 256 point sequence
y[n] = { z[n] + z[n + 256], 0 :S n :S 255

0, otherwise
We could then compute 256 samples of the z-transform of y[n]. The effective frequency spacing of
these samples would be 1/(NT)"' 39 Hz whlch is lower than the 50 Hz specification.
Note that these samples also correspond to the ..,.,n-indexed samples of a length 512 sampled
z-transform of z[nj. Problem 9.30 discusses this technique of time aliasing in more detail.
(b) u,t
y(n] = (1.25rz[n]
Then, using the modulation property of the z-transform, Y(z) = X(0.8z) and so Y[k] = X(0.8e;,r1/N).
9.29. (a) We offet two solutions to this problem.
Solution #1: Looking at the DFT of the sequence, we find
N-1
X[k] = L z(nJe-j2dn/N
=O
(N/2)-1 N-1
= L z[n],-j2dn/N + L z[n]e-j2dn/N
n=O n.=N/2
(N/2)-1 (N/2)-1
= L z(n]e-;2,•n/N + L z(r + (N/2)Je-j2d[,+(N/2)1/N
n=O r=O
(N/2)-1
= L z(nl[l - (-l}"]e-;,,>n/N
=O
= 0, k even
Solution #2: Alternatively, we can use the circular shift property of the DFT to find
X[k] = -X(k],-;<~>•<f>
= -(-I)'X[k]
= (-1)>+ 1 X[k]
When k is even, we have X(k] = -X[k] whlch can only be true if X[k] = O.
363
(b) Evaluating the DIT at the odd-indexed samples gives us

N-1
X[2k + l] = L :i:[nJ,-i(2•/N)(2Hl)n
.....
N/2-1 N-1
= L :i:[n],-;2,n/N ,-;2,tn/(N/2) + L :i:[n],-;2,n/N ,-;2,>n/(N/2)
n=O n=N/2
N/2-1
= DITNI' { :i:[n]e-;(2•/N)n} + L :i:(1 + (N/2)f,-;2,{1+(N/2)}/N ,-;2d{l+(N/2)]/(N/2)
,...,
N/2-1
= DITNt• { :t[n],-;(2•/N)n} + (-l)(-l) L :t(l],-;2,1/N ,-;2,t1/(N/2)
= DIT N/2 { 2:i:(n]e-;<••/N)n}
=
for k 0, ... , N /2 - 1. Thus, we can compute the odd-indexed DIT values using one N /2 point
DIT plus a small amount of extra computation.
9.30. (a) Note that we can write the even-indexed values of X[k] as X[2k] for k = 0, ... , (N/2) - 1. From
the definition of the DIT, we find
N-1
X[2k] = L :t[n]e-;2,(2t)n/N
.....
N/2-1
= L :t[n],-;,p;,,•n
.....
N/2-1
+ L :t[n + (N/2)],-_;.,~;,,1n,-;,J;,,<NJ2>•
.....
N/2-1
= L (:t(n] + :t(n + (N/2)])e-;TP7l!tn
.....
= Y[k]
Thus, the algorithm produces the desired results.

(b) Talring the M-point DIT Y[k], we find
.M-1 00
Y[k] = L L :t[n + rM],-;2dn/M
M-1
L L
00
= :t[n +rM],-;2,>(n+rM)/M.,i2r(rJl)t/M
r=-oo n=O
Let I= n + rM. This gives

00
Y(k] = L :t[l],-;..t1/Jt
l=-oo
= X(ei•••fM)
Thus, the result from Part (a) is a special case of this result if we let M =
N /2. In Part (a), there
are only two r terms for which y[n] is nonzero in the range n = 0, ... , (N /2) - 1.
364
(c) We can write the odd-indexed values of X[k] as X(2k + l] fork = 0, --- , (N/2) - l. From the
definition of the DFT, we find
N-1
X[2k + l] = L z(nJe-i..(2Hl)n/N
.....,
N-1
= L z(n]e-i2rn/N•-;2r(2k)n/N
.....,
(N/2)-1 (N/2)-1
= L z[n]e-;2rn/N•-i 1Jj,, •n + L z[n + (N/2)J•-;2r{n+(N/2)1/N•-;;lr,•ln+(N/2))
n=O n=O
(N/2)-1
= L [(z(n] - z(n + (N/2)])•-;~n] •-;rM,y>n
n=O
Let
(z(n] - z[n + (N/2)])e-i< 2•/N)n, 0 $ n $ (N/2) - l
11(n] = {
0, otherwise
Then Y[k] = X[2k + l]. Thus, The algorithm for computing the odd-indexed DIT values is as
follows.
step 1: Form the sequence
(z[n] - z[n + (N/2)])e-;(.. /N)n, 0 $ n :S (N/2)-1

11[n] = {
0, otherwise
step 2: Compute the N/2 point DFT of y(n], yielding the sequence Y(k].
step 3: 'l'he odd-indexed values of X[k] are then X(k] = Y[(k - 1)/2], k = 1, 3, ... , N - l.
9.31. (a) Since x(n] is real, z[n] = x•[n], and X(k] is conjugate symmetric.
N-1
X(k] = L x"[n]e-;~•n
n=O
N-1 )"
= (
~ z(n]ei~•n•-j~Nn
= X"(N-k]
Hence, XR(k) = XR(N - k] and Xr[k] = -Xr(N - k].

(b) In Part (a) it was shown that the DFT of a real sequence z[n] consists of a real part that has even
symmetry, and an imaginary part that has odd symmetry. We use this fact in the DFT of the
sequence g(n] below.
G(k] = X,(k] + jX2(k]

= (X1ER(k] + jX,or(k]) + j(X2ER[k] + ;X,or(k])
= x,ER(k] - X201(k] +i (X,or(k] + X2ER(k])
real part imaginary part
In these expressions, the subscripts "E" and "0" denote even and odd symmetry, respectively, and
the subscripts "R" and "I" denote real and imaginary parts, respectively.
365
Therefore, the even and real part of G[k] is
GER[k) = X1ER(k]
the odd and real part of G[k] is
GoR[k] = -X201[k]
the even and imaginuy part of G[k] is
GEr[k] = X2ER(k]
and the odd and imaginary part of G[k] is
Gor[k] = X,or[k]
Having established these relationships, it is easy to come up with expressions for Xi[k] and X 2(k].
X 1[k] = X1ER[k) + jX,or(k)

= GER(k] + jGor(k]
X2(k] = X2ER[k] + jX201(k)
= GEr(k) - jGoR(k)
(c) An N = 2" point FFT requires (N/2) log2 N complex multiplications and N log2 N complex addi-
tions. This is equivalent to 2N log2 N real multiplications and 3N log2 N real additions.
{i) The two N-point FFTs, X 1[k] and X 2[k], require a total of 4Nlog2 N real multiplications and
6N log2 N real additions.
{ii) Computing the N-point FFT, G[k], requires 2N log2 N real multiplications and 3Nlog2 N real
additions. Then, the computation of GER(k), GEr[k], Gor[k], and GoR(k) from G[k] requires
approximately 4N real multiplications and 4N real additions. Then, the formation of X 1 (k] and
X2(k] from GER(k), GEr[k], Gor(k), and GoR[k] requires no real additions or multiplications.
So this technique requires a total of approximately 2N log2 N + 4N real multiplications and
3N log2 N + 4N real additions.
(d) Starting with
N-1
X[k] = L z(n],-j2dn/N
....0
and separating z(n] into its even and odd numbered parts, we get
X(k] = L z[n),-;2w1m/N + L z[n),-;2w1m/N

n even nodd
Substituting n = 2! for n even, and n = 2l + 1 for n odd, gives
(N/2)-1 (N/2)-1
X[k] = L :[2!),-,..•.,/(N/2) + L :(2! + 11,-;2d(2l+l)/N
l=O l=O
(N/2)-1 (N/2)-1
= L :[2l],-j2dl/(N/2) + ,-;2.t/N L :(2! + 11,-j2dl/(N/2)
l=O l=O
= { X 1[k) + ,-;•••IN X2[k),

X,[k - (N/2)) - ,-J'2d/N X2[k - (N/2)],
(e) The algorithm is then

366
step 1: Form the sequence g[n] = z[2n] + jz[2n + l], which has length N /2.
step 2: Compute G[k], the N/2 point DFT of g[n].
step 3: Separate G[k] into the four parts, fork= l, ... , (N/2) - 1
1
GoR[k] =
2(GR[k] - GR[(N/2) - kl)
l
GsR[k] =
2(GR[k] + GR[(N/2)- kl)
l
Gor[k] =
2(Gr[k] - Gr[(N/2) - kl)
Gsr[k] = ~(Gr[k] + G 1 [(N/2) - kl)
which each have length N /2.

step 4: Form
X1[k] = GsR[kJ + jGor[k]

X2'[k] = •-;2>•/N (Gsr[k] - jGoR[k])
which each have length N/2.

step 5: Then, form
X[k] = Xi[k] + X2'[k],
step 6: Fina.lly, form
X[k] = X"[N - k],
Adding up the computational requirements for each step of the algorithm gives (approximately)
step l: 0 real multiplications and O real additions.
step 2: 'f 'f
2'f log2 real multiplications and 3'f log2 real additions.
step 3: 2N real multiplications and 2N real additions.
step 4: 2N real multiplications and N real additions.
step 5: 0 real multiplications and N real additions.
step 6: 0 real multiplications and O real additions.
In total, approximately N log2 'f + 4N real multiplications and JN log2 'f + 4N real additions are
required by this technique.
The number of real multiplications and real additions required if X[k] is computed using one N-
point FFT computation with the imaginary part set to zero is 2N log2 N real multiplications and
3N log2 N real additions.
9.32. (a) The length of the sequence is L + P - 1.
(b) In evaluating y[n] using the convolution sum, each nonzero value of h[n] is multiplied once with
every nonzero value of z[n]. This can be seen graphica.lly using the flip and slide view of convolution.
The total number of real multiplies is therefore LP.
(c) To compute 11[n] = h(n] • z(n] using the DFT, we use the procedure described below.
step 1: Compute N point DFTs of z[n] and h[n].
step 2: Multiply them together to get Y[k] = H[k]X[k].
step 3: Compute the inverse DFT to get 11[n].
Since y[n] has length L + P - l, N must be greater than or equal to L + P - l so the circular
convolution implied by step 2 is equivalent to linear convolution.
367
(d) For these signals, N is large enough so that circular convolution of :i:[n] and h[n] and the linear con-
volution of :z;[n] and h[n] produce the same result. Counting the number of complex multiplications
for the procedure in pa.rt (b) we get
DFT of :i:[n] (N/2)log2 N

DFT of h[n] (N/2)1og2 N
Y[k] = X[k]H[l:] N
Inverse DFT of Y[k] (N/2) log,, N
(3N/2)log,N +N
Since there a.re 4 real multiplications for every complex multiplication we see that the procedure
takes 6Nlog,, N + 4N real multiplications. Using the answer from part (a), we see that the direct
=
method requires (N /2)(N /2) N2 /4 real multiplications.
The following table shows that the sma.llest N =
2• for which the FFT method requires fewer
multiplications than the direct method is 256.
N Direct Method FF!' method

2 l 20
4 4 64
8 16 176
16 64 448
32 256 1088
64 1024 2560
128 4096 5888
256 16384 13312
9.33. (a) For each L point section, P - 1 samples a.re discarded, leaving L - P +l output samples. The
complex multiplications a.re:
L point FF!' of input: (L/2) log2 L = v2• /2
Multiplication of filter and section DFI': L 2•=
L point inverse FFT: (L/2) log2 L = v2• /2
Total per section: 2•(v + 1)
Therefore,
Complex Multiplications 2• ( v + l)
Output Sample
= 2• - P + l
Note we assume here that H[k] ba.s been precalculated.
(b) The figure below plots the number of complex multiplications per sample \'etS1IS v. For v 12, =
the number of multiplies per sample reaches a minimum of 14.8. In comparison, direct evaluation
of the convolution sum would require 500 complex multiplications per output sample.
368
,S! 25
I
., 20
'
'S
CL
~ 15
' "
"
8.
!!
0
10
I
'§
5 •
::! 0
10 11 12 13 14 15 16 17 18 19 20
V
Although ,., : 9 is the first valid choice for overlap-save method, it is not plotted since the value is
so large (in the hundreds) it would obscure the graph.
(c)
fun 2'(v+l) : lim v+l

11-+CIO 2" - P + 1 ... ➔ c.o 1+ -;:1
: ,.,
Thus, for P : 500 the direct method will be more efficient for ,., > 500.
(d) We want
_2_'..,_(v_+-'--1"-) < P.
2•-P+1-
Plugging in P: L/2: 2•- 1 gives
2•(,., + 1) < 2•-•.

2• -2•-l +} -
As seen in the table below, the FFT will reqnire fewer complex multiplications than the direct
method when ,., : 5 or P : :24 : 16.
! IOverlap/Save IDirect j
I ,., I 2"(•+1)
2"' -
2"' 1+1
I 2•-l I
1 2 1
2 4 2
3 6.4 4
4 8.9 8
5 11.3 16
9.34. This problem asks that"we find eight equally spaced inverse DFT coefficients using the chirp tranSform
. algorithm. The book derives the algorithm for the forward DFT. However, with some minor tweaking,
it is easy to formulate an inverse DFT. First, we start with the in?er&e DFT relation
N-1
:r[n] = .!_ L X[k]ei'ru/N
N ,._.,
N-1
:r[n,] : .!, L X[kjd2wn,•/N
N •=0
369
Next, we define
.O.n = 1
n, = no+ l.O.n
where l = 0, ... , 7. Substituting this into the equation above gives
:i:[n,] =
Defining
we find
N-1
z[n,] =~ L X(kJei2•no•tNw-tt
4=0
Using the relation
lk = ~[l' + k 2 - (k - l) 2 l
we get
Let
Then,
z(n,] = ~w-"'' (E G(k]wl•-t)'I')

From this equation, it is clear that the inverse DFI' ca.a be compuied using the chirp transform algorithm.
All we need to do is replace n by k, change the sign of each oftl,e expo,,ential terms, and divide by a
factor of N. Therefore,
2
m,(k) = ei2•d:no/Nw-A:: /2
2
m2(k) = J,1.t-1: /2
h(k) = ~w•'1,
N
Using this system with no = 1020, and l = 0, ... , 7 will result in .a sequence y(nl which will contain the
desired samples_ wilere
11[0] = z[1020)
11[1) = z[1021)
11[2) = z{1022)
y(3) = z(1023)
y[4) = :i:[O)
11(5] = :i:(1)
11[6) = :i:[2]
11(7) == :i:[3]
370
9.35. First note that
= { ,:[n], iL :S n :S iL + 127,
0, otherwise
= { ,:[n + iL], 0 :Sn :S 127,

0, otherwise
Using the above we can implement the system with the following block diagram.
x[n]
Shift
b -iL FFT-1
Multiply f---1.i
w[n] = u[n]-u[n-128) ---1~
256- I IFFf-2 y,[n]
256- t
FFT-1
h[n)---1~
256- t
The FFT size was chosen as the next power of 2 higher than the length of the linear convolution. This
insures the circular convolution implied by multiplying DFTs corresponds to linear convolution as well.
Neoov = N., + Nb - 1
= 128+ 64- I
= 191
NpPT =256
9.36. (a) The flow graph of a decimation-in-frequency radix-2 FFT algorithm for N = 16 is shown below.
371
lC(OJ X(OJ
lC(1J
w';,
X(8J
lC(2J X(4J
w';,
lC(3J X(12J
lC(4J X(2J
w';,
lC(SJ X(10J
lC(6J X(6J
w';,
x[7J _, _, X(14]
lC(8J X{1J
w';,
lC(9) X{9J
xf10) X{SJ
w';, X(13)
x[11J
x{12) X{3J
lC(13)
w';. X(11]
lC{14) X{7J
w';, X[15]
lC(15]
(b) The prw,ed Bow graph is shown below.

372
,tO] X(OJ
>11)
w:. X[BJ
w:. X[4]
w:. w:. X[12]

-1
w:. X[2]
w:. w:. X(10)
w:. X[6)
w:. _, w:. X[~4]
w:. X[1)
w',. w:. X[9)
w:. Xl5J
w:. _, w:. X[13]
w:. X(3]
w:. _, w:. X[11}
w:. X[7]
w:. _, w:. X[15]
(c) The pruned butterflies can be used in ( 11 - I') stages. For simplicity, assume that N /2 complex
multiplies are required in each unpruned stage. Counting all W~ terms gives
Number of multiplications = (Unpruned multiplications)+ (Pruned multiplications)

N .,_,,,
= µ·2+ }:2-'
l=l
373
9.37. (a) Starting with the equation

N
/[n] = :r[2n+ l]- :r(2n- l] +Q, n = 0,1, ... , -1,
2
where
f-1
Q =NL
2
:r(2n+ l],
n=O
we note that :r[2n + l] = h[n], and :r[2n - l] = h[n - l] for n = 0, l, ... , ~ - 1. We then get
/[n] = h[n] - h[n - l] + Q, n = 0, l, ---, 2N - 1.
Taking the N (2 point DFT of both sides gives

f-1
F[kJ = H[k] - wt1,H[k] + Q I: wti,
= H(k](l - wJll + ~ Qo[k]
So
F[O] = NQ
2
1
N2 ~
= 2 N .t..., :r[2n + l]
n=O
f-1
= L x[2n+ l]
n=O
= H[O]
Therefore,
X[k] = G[k] + WtH[k]
X[O] = G[O] + H[O] = G[O] + F[O]
X[N/2] = G[N/2] + w;12 H[N/2]
= G[O] + w;1' H[O]
= G(O] - H[O] = G[O] - F[O]
(b) The equation,
F[kJ = H[A:J(1 - wJl> + ~ Qo(kJ
for k # 0 becomes
F/k} = H/k){l - w;,•)
= H[k]Wt(w,.• - Wt)
374
So
H[k] - F[k]
- wicw;,• - wi >
Therefore,
X(k] = G[k] + WtH(k]
G[k]+ F(k]
= w-•
N - w•
N
j F(k]
= G[k] - 2sin(2,rk/N)
Clearly, we need to compute X(0] and X[N/2] with a separate formula since the sin(2,rk/N) = 0
=
for /c 0 and k N/2.=
(c) For each stage of the FFT, the equations
X[0] = G[0] + F(0]
X[N/2] = G[0] - F(0]
require 2 real additions each, since the values G[0] and F[0] may be complex. We therefore require
a total of 4 real additions to implement these two equations per stage.
For a single stage, the equation
l . F[/c]
X[k] = G(ic] - 2; sin(2,r/c/N) k #- 0, N /2
requires (N - 2)/2 multiplications of the purely imaginary "twiddle factor" terms by the complex
coefficents of F[k] fork#- 0, N/2. The number of multiplications were halved using the symmetry
sin(2,r(/c + N/2)/N) =- sin(2,rk/N) and the fact that F[k] is periodic with period N/2. Since
multiplying a complex number by a purely imaginary number takes 2 real multiplies, we see that
the equation requires a total of (N - 2) real multiplies per stage.
We also need (N - 2) complex additions to add the G(k] and modified F[k] terms for k f- 0, N /2.
Since a complex addition requires two real additions, we see that the equation takes a total of
2(N - 2) real additions per stage.
Putting this all together with the fact that there are log2 N stages gives us the totals
Real Multiplications = (N - 2) log2 N
Real Additions = 2N log2 N
Note that this is approximately half the computation of that of the standard FFT.
(d) The division by sin(2,rk/N) fork near 0 and N/2 can cause X[k] to get quite large at these values
of k. Imagine a signal z 1 [n], and signal z 2 [n] formed from z 1 [n] by adding a small amount of white
noise. Using this FFT algorithm, the two FFTs X 1 [k] and X2[k] can vary greatly at such values
of k.
9.38. (a)
N-1
X(2k] = L z(n]W~
n=O
(N/2)-1
= L (z[n]W~+z(n+(N/2)JW!>(n+(N/•ll)
-=O
(N/2)-1
= L (:i:[n] + :i:[n + (N/2)]) wi•n
n=O
375
In the derivation above, we used the fact that W},N = 1. Since W;l" = W},12 , X[2k] has been
expressed as an N/2 point DFT of the sequence z[n] + z[n + (N/2)], n = 0, 1, ... ,(N/2) - 1.
(b)
N-1
X[4k + l] = L z[nJwt•.Ht)n
n=O
(N/4)-1 .
= L (z[n]w;w:0n + :,;(n + (N/4)Jw;+(Nf•>w:,•<•+(N/•))
n=O
+ z[n + (N/2)]w;+(Nf')w;,•<•+(Nf•)) + z[n + (3N/4)JW;+(3 N/4 )W:,t(o+(3 N/4 )))

(N/4)-1
= L {(z[n] - z[n + (N/2)]) - j(z[n + (N/4)] - z[n + (3N/4)])}w;w:,••
n=O
In the derivation above, we used the fact that Wf:14 = -j, W;/"14 = j, Wf: 12 = -1, and W},N = 1.
Since wt,••= WJ:,14 , X[4k + I] has been expressed as a N/4 point DFT. But we need to multiply
the sequence (z[n] - z[n + (N/2)]) - j(z[n + (N/4)) - z[n + (3N/4)]) by the twiddle factor w;,
0 $ n $ (N/4) - I before we compute the N /4 point DFT.
The other odd-indexed terms can be shown in the sa.me way to be
(N/4)-1
X[4k + 3] = L {(z[n] - z[n + (N/2)])
n=O
+ j(z[n + (N/4)] - z[n + (3N/4)])}wi•w:,••, k = 0, I, ... , (N/4) - 1.
Parts (a) and (b) show that we can replace the computation of an N point DFT with the compu-
tation of one N/2 point DFT, two N/4 point DFTs, and some extra complex arithmetic.
(c) Assume N = 16 and define
g(n] = z[n] + z[n + (N /2)], n = 0, 1, ... , (N /2) - 1
/,(n] = z[n] - z[n + (N /2)], n = 0, 1, ... , (N/4) - I
J,[n] = z[n+(N/4)]-z(n+(3N/4)], n=0,l, ... ,(N/4)-1
A diagram for computing the values of X[k] looks like:
)
376
g(O)
x(OJ X[OJ
x(1J X[SJ
x(2) X[4J
x(3) X[12J
II-point OFT
x(4)
X[2J
x(SJ X[10J
x(6J X[6J
x(7J X[14J
x(BJ
~. X[1J
,
w,.
x(9J X[9J
x(10J
w.. 4-pooitOFT
X[S]
x(11) w:. X[13]
><!12]
~. X[3]
x(13]
w:. X[11J
x(14J
w,. 4-pooit OFT
X[7J
x(15]
w,. X[15]
-1
-j
If we carry on applying the split-radix principle, we get the next diagram:

377
X[OJ
~. X[8J
lC[4)
~. )([12)
X[2J
~. )([10)
lC[6J
-1
~. )([14)
lC[1)
~. X[9J
~. X[5J
~. )([13)
X[3J
~. X(11J
~. lC[7J
~. )([15)
(d) The flow diagram for the regular radix-2 decim&tion-in-frequency algorithm is shown in the next
figure for N = 16. Not cowmng trivial multiplications by wi, we find that there are 17 complex
multiplications total. Of these 17 complex multiplications, 7 are multiplications by wt. = -j.
Since a multiplication by - j can be done with ,zero real multiplications, and a complex multipli-
cation requires 4 real multiplications, we find that the total number of real multiplications for the
=
decimation-in-frequency algorithm to be (10)(4) 40.
Taking a look at the split-radix algorithm, we find again that there are 17 complex multiplications.
378
In this case, however, 9 of these are by Wt. = -j. Thus, it takes a total of (8)(4) = 32 real
multiplications to implement this ftow graph.
lqO]
w:. lq8]
X[4]
w:. lq12]
)(12]
w:. lq10]
X{6]
w:. lq14]
x(B] lq1]
x(9] w:. lq9]
x(10] lCl5]
x(11] w:. X(13]
x(12] X(3]
x(13] w:. X(11]
x(14] X(7)
x(15] _, w:. X(15]
9.39. (a) Noting that
arctan(:r) ,.,, < 1

379
we notice that, to first order, the 8, and 8,+1 differ by a factor of 2. ·(Note that these formulae are
in radians). This approximate factor of 2 for sucessive 8, is confirmed by looking at some values
of 8,: 80 = 45°, 81 = 26.6°, 92 = 14.0°, 93 = 7.1°. So we have a set of angles whose values are
decreasing by about a factor of 2.
You can add and subtract these 8, angles to form any angle O < 8 < ,r /2. The error is bound by
8M = arctan(2-M), the angle that would be included next in the sum. H the error were greater
than 8.11, then one of the a, terms must have been incorrect. The inclusion of the Mth term must
bring the sum closer to 8.
(b) An algorithm to compute 8, is described below.
ao = +l
-8 = 0080
fori=ltoM-1
if (8 > 8)
else
a,= +l
end for
Using this algorithm, the sequence a 1 is found to be
(c) Note that (X + jY)(l + ja,r') = (X - a,y2-•) + j(Y + a,x2-•). Hence, the recursion is simply
multiplying by M complex numbers of the form (1 + ja,2-'). These can be represented in polar
form:
(I+ ja,2-') = ✓1 + 2-2<_,io, .......,(,--1
= G;.tJa;I;
Multiplication of polar numbers produces a sum of the phases, a,8,.

M-1
e= :E a,8,
i=O
(d) Multiplication of polar numbers produces a product of the magnitudes, G;.

M-1
GM = II ✓1 + 2-2<
i=O
9.40. (a) Starting with the definition of the DFT,

N-1
X(k] = L x(n]w;;•
n=O
380
N-1
X[3k] = L z[n]W1,..
n=O
N/3-1 2N/3-l N-1
= L z[n]W1,.. + L zjn]W1,.. + L z[n]W1,...
A=O n=N/3 ,,,_2N/3
Substituting m = n- N /3 into the second summation, a.nd m = n-2N/3 into the third summation
gives
N/3-1 N/3-1 N/3-1

X[3k] = L z[n]W1,.. + L z[m + N/3]Wt"'•wg• + L z[m + 2N/3]Wt"'•wlf•
n.=O m=O m=O
N/3-1
= L (z[n]+z[n+N/3]+:[n+2N/3])W1,...
.....
N/3-1
= L
n=O
(z[n] + z[n + N/3] + z{n + 2N/3])wm.
Define the sequence

zi[n] =z[n] + :r[n + N/3] + :r[n + 2N/3)
The 3-point DFT of z 1[n) is X 1[k] = X[3k].
(b) This part is similar to part (a). First, z 2 [n] is found. Starting again with the definition of the
DFT,
N-1
X[k] = L z[n]w~•
n=O
N-1
X[3k + l] = L :[nJw;<3t+l)
.....
N/3-1 2N/3-1 N-1
= L z[nJw;<u+i) + L :[nJw;<u+i) + L z[nJw;(3t+l)
ft=O n.=.N/3 n.=2N/3
Substituting m = n-N/3 into the second summation, a.nd m = n~2N/3 into the third summation
gives
N/3-1 N/3-1
X[3k + l] = L z[nJw;(3t+i) + L z[m + N/3Jwtm+N/3H3t+l)
n=O m=O
N/3-1
+ L
m=O
z[m + 2N/3JW1"'+2N/3)(3t+t)
.
N/3-1 N/3-1
= L z[n]w;<St+I) + L z[m + N 1a1w;<n+l)w~•w;1•
n=O m=O
N/3-1
+ L z[m + 2N/3Jw;<St+i>wlf•w:,ivi•
m=O
N/3-1
= L (z[n] + :z:[n + N1a1w;1• + :z:[n + 2N/3JWJ,"/3)w;:<St+I)
n=O
381
=
Define the sequence
13
z 2 [n] = (z[n] + z[n + N/3Jw::1• + z[n + 2N/3JW;,"' )W.v
The 3-point DFT of z 2 [n] is X2 [k] = X[3k + 1]. Next, z 3 [n] is found in a similar manner. Starting
with the definition of the OFT,
N-1
X[k] = L z[n]~•
n=<>
N-1
X[3k + 2] = L :r[nJw;;<•>+•l
n=<>
N/3-1 2N/3-1 N-1
= L :r[n]w,:;(3>+2) + L z[nJw;;<>H2) + L :r[n]w,:;(3t+2)
n=O n=N/3 n=2N/3
Substituting m = n- N/3 into the second summation, and m = n-2N/3 into the third summation
gives
N/3-1 N/3-1
X[3k + 2] = L :r[nJw;;(3H2) + L :r[m + N/3JW1m+N/3)(3t+2)
n=O m=1f·
N/3-1
+ L :r[m + 2N/3JW1m+2N/3)(3H2)
N/3-1 N/3-1
= L :r[n]w,:;(3H2) + L :r[m + N/3Jw;<at+2lwff•w~N/3
n=O m=O
N/3-1
+ L :r[m + 2N/3Jw;<•>+•>w,v•w<;13
N/3-1
= L (:r[n] + z[n + N/3]W~N/ 3
+ z[n + 2N/3Jw';/ 3Jw,:;<at+ 2>
n=O
N/3-l
= L (:r[n] + :r[n + N/3]W;/'13 + :r[n + 2N/3]w';13 )Wl,ftWM3
Define the sequence

3
:r3[n] = (:r[n] + :r[n + N/3]W~N/ 3 + :r[n + 2N/3Jw';/ )Wl,n
=
The 3-point DIT of z 3[n] is X3 [k] X[3k + 2].
(c) To draw the radix-3 butterfly, it helps to derive the output of the butterfly first. From the definition
of the DIT,
2
X[k] = L :r[n]W;'
n=<>
X[O] = z[O] + :r[l] + z[2]
X[l] = :r[O] + :r[l]WJ + :r[2]Wf
X[2] = :r[O] + :r[l]Wf + :r[2JW: =:r[O] + z[l]Wf + z[2]WJ
The butterfly for the 3 point DIT is drawn below.
382
xm - ,(q)
x,., - ,IPJ
(d) Using the results from parts (a) and (b), the flow graph is drawn below.
383
x,(OJ
X(OJ
x,(11
X(3J
x,(2I
X(6]
~ xJOJ
X(1]
w'
• •,[11 N•3DFT X(4]
vi, x,r2I
X[7J
~ x;oI
X(2]
vi, •Pl N=30FT X(S].
w: •Pl X(8)
(e) The system consisting entirely of N = 3 DFTs is drawn below.
•
384
x 1(0J
,c(O) X)OJ
,c(1J N=3 ~ OJ N=3 X)3)

OFT OFT
,c(2J
~ OJ
X)6)
x,[11 X)1)
,c(3)
w'
,c(4) N=3
OFT
• 91 I N•3
OFT
X)4)
,c(SJ
w: X[7J
,c(6J X)2J
N•3 N=3 X)SJ

x[7J
OFT OFT
X)8J
,c(8J - - - - - - - - - - -
(fl A direct implementation of the 9 point DFT equation requires !l2 = 81 complex multiplications.
The system in part (e), in constrast, requires 4 complex multiplications for each 3 point DFT, and
an additional 4 from the twiddle factors, if we do not count the trival ~ multiplications. In total,
the system in part (e) requires 28 complex multiplications. In general, a radix-3 FFT of a sequence
of length N = 3" requires appn,:r;imauly
Number of complex multiplications = (4

complex multiplications) (N 3-pt DFI'•) (v stages)+
3-pt DFT 3 stage
N twiddle factors ) . )
( stage with twiddle factors (v - 1 stages with unddle factors
385
Replacing v with log, N, and simplifying this formula gives
Number of complex multiplications= ~Nlog, N - N
Note that this formula for a radix-3 FFT is of the form N log, N. The constant multiplier, ½,·is
significantly larger than that of a radix-2 FFT. This is because a radix-2 butterfly bas no complex
multiplications, while in part (c) we found that a radix-3 butterfly has 4 complex multiplications.
Also note that this formula is an upper bound, since some of the N twiddle factors in the v - 1
stages will be trivial. However, the formula is a good estimate.
9.41. (a)
N-1
X(k] = h"[k] l):r[n]h"(n])h[k - n]
n=O
N-1
= e-id 2 /N } : z{n]e-i•n2/N e3"•(t2-2&n+n2)/N
n=O
N-1
= L :r[n],-;2rn.t/N
"'"°
(b)
N-1
X[k +NJ= h"[k + NJ L :r[n]h"[n]h[k + N - n]
=O
h"[k + NJ = 2
,-;r(t+N) /N
= 2 2
e-j,r(l: +U.N+N }/N
= e-id /N e-j,rN
2
= h"[k],-,,N
So
N-1
X[k + NJ = h"[kJ,-i•N L :r[n]h"[n]h[k - n]ei•N
= X[k]
(c) From the figure
x{k]---ilXr---ll y{k]
I\•
h [k]
we define the signals :r,[k] and z2[k) to be
:r1 [k] = :r[k]h"[k]

386
00
:t2[k] = L :z:,[t]h[k - l]
l=-oo
N-1
= L :z:[tJ•-;•t'tN.,;•<•-t)'/N
t=O
k E (0, ... , 2N - l]
Therefore,
y[k] = h"[k]:z:2 [k] ke[N, ... ,2N-l]

N-1
= 0 -;d'/N L :z:[t]e-;•t'tN.,;•<•-t>'IN k E [N, ... ,2N - l]
,...,
N-1
= L :z:[t]e-;•dt/N
,...
k E [N, ... , 2N - l]
= X[k+N] k E (0, ... ,N-lJ

= X[k]
{d)
2N-1
H(z) = L .,id'/N,-•
•=0
M-12M-1
= L L 2
~1t(r+lM) /Nz-(r+tM)
r=O l=O
M-l 2M-1
== L L ei'" 2 2
/N ei2•rl/M ei•l z-r z-LM
r=O l::=O
= 3:' r=O
.,;rr'/N ,-, rt\.,;2r,/.V ,-.v)'(-1)'2]
l ,=0
= 3:' .,;rr'/N .-, rt· (d2r,/.V .-.... )'{-!)']

r=O l l=O
= 3:' .,i"' /N ,-, rt'<-e'"2r,/M z-M)t]

r=O l ,=0
= M-1
~
. ,
e1•r /N z-r
[J - ,i2r<(2M)/.V z-2.V']
~
...... I+ ei2r,/.V z-M
= ~· ei"' /N -, [ l - .-2.w• ]
~ z 1 + ei(b/Al)rz-M
(e) The fiow graph for the system,
is drawn below.
387
z-M
z-1 .
-z-'Ar -1
~
.
z-M
z-1
~
ei',r/M
z-M
z-1
-ei2"(M-1 )IM
=
(f) Complex multiplications: Since we are only interested in y[k] for k N, N + 1, ... , 2N - 1 we
do not need to calculate the complex multiplications on the output side of each parallel branch
until k ? N. Thus,
Operation Complex Multiplications

xi[k] = x[k]h•[k] N
Poles of H(z) fork= O, ... ,N-1 NM
Poles and branch exponentials of H(z) for k = N, ... , 2N - 1 2NM
y[k] = x,[k]h•[k] N
=3MN+2N
=3M3 +2M'
We are including the multiplication of -1 and 1 &om the first branch here for simplicity.
Direct evaluation requires N' = M' complex multiplications.
Note that since we are only interested in y[k) for lo = N, N + 1, ... , 2N - 1, the initial delay of
2M2 is unneccessa.ry; we have obtained all interestiDg output before the first delayed sample
appears.
388
Complex additions: The complex additions on the output side of each parallel branch do not
need to be computed until k ,:: N. Thus,
Operation Complex Additions

Poles of H(z) fork= O, ... ,N -1 NM
Poles and branch exponentials of H(z) fork= N, ... , 2N - l 2NM
=3MN
=3M3
Direct evaluation requires N(N - 1) = M2(M2 - 1) complex additions.

9.42. (a) We separate the system function H(z) into two pieces; one corresponding to hR(n] = &{h(n]}
and another corresponding to hr[n] /m{h(n]}.=
1-wi,-•
H(z) = 1- 2cos(21rk/N)z-l + ,-2
l - ws(21rk/N)z- 1
HR(z) = l - 2 ws(21rk/N)z- 1 + z- 2
hR(n] = cos(2,r/m/N)u(n]
sin(21rk/N)z- 1
Hr(z) = l - 2ws(27rk/N)z-l + z-2
hr(n] = sin(2.-kn/N)u(n]
Since :r[n] is real, the real and imaginary parts of X(k] = y,(N] are computed using the following
fiowgraph.
x[r] o----+-------+----1-----,---,...--+---◄ Re{X[k]}
z-1 ,s,-..
ft'" •2
2 cos"\
lm{X[k]}
sin u,k
z-1
e1
e3
-1 "\ = 2ld<IN
(b)
Re{X(k]} = Re{y,[N]}
Im{X(k]} = lm{yo[N]}
Since the output of interest is the Nth sample, we need only consider the ,ariance at time N.
The noise ei(n] is input to both hR(n] and hr[n]. Using the techniques from chapter 6, we find the
variance of the noise is
N
cr~(N] = ,r., + ..~, I>~(n]
n=O
389
N
cry[N] = a;, + u!, L hJ[n].
n=O
Let 8=21fk/N.
N
:Ecos•en
n=O n=O
N
= ¼L(e''n + e-ifn)2
n=O
N
= !. L(e'"n + 2 + ,-,nn)
4n=O
1 ( 1 _ ei21(N+I) 1_ ,-i2'(N+l))
= 4 1 - ei28 + 2(N + 1) + 1 - e-;21
= ¼(1 + 2(N + l) + 1)
= N +l
2
Similarly, L:=0 h1{n] = N /2.
Therefore,
2-2B
uh(n] = 12 (1 + (N/2) + l)
2-2B
= 12 (N +4)/2
2 8
unn] = ~; (l + (N/2))
2-2B
= 12 (N +2)/2
9.43.
N-1 N-1
X(k] =L :r[n]cos(2.-kn/N)-j L :r(n]sin(2.-kn/N).
n=O n-o
For k # 0, there are N - 1 multiplies in the computation of the real part and the imaginary part:
<Tk = (N - l)u2 = cry,

where u2 = 2- 28
/12. Fork= O there are no multiplies, and therefore u1. = 0 = crj.
~ 2 { 0 k=O
R = 171 = (N - l)u2 k#0
9.44. (a)
1x.,_,[q]~I = IX.,_,[qJll~I = [X.,_,[q]I

1 1
IX.,fp]I :5 IX.,_,(p]I + IXm-1[q]I < 2 + 2 = 1
implies that IRe{X,.(p]}I < l and llm{X,.(p]}I <1. A similar argument holds for [X.,[q]I-
390
(b) The conditions a.re not suflicient to guarantee that overflow cannot occur.
IR.e{X.. [p]}I ::S IR.e{X.. [p]H + IR.e{WNXm-1[q]}I
::S ½+ lcos (2;) R.e{X.._,[q]}- sin (2;) lm{Xm-1[q]}I

Consider the worst case, when r = 3N/8. Then,
JR.e{X..[p]}I $ ½+I ~R.e{Xm_i(q]} + ~lm{Xm-1[q]}I
1 1 ·
::s 2 + J2 ,n.
Therefore, overflow can occur.
9.45. (a) First, note that each stage has N /2 butterfiles. In the first stage, all the multiplications a.re
=
~ +l. In the second stage, half a.re +land the other half a.re wJt•
= -j. Successive stages
have half the number of the previous stage. In general,
Number of +l multiplications in stage m = :. , m= 1, ... ,v
and
m= I
Number of - j multiplications in stage m = { O,
N/2"',
(b) If we assume that all the + 1 and -j multiplications a.re done noiselessly, then the noise variance
will be different at each output node. This is easily seen by looking at Figure 9.10, where we see
for example that X[O] will be noise-free, while X[l] will not be noise-free. Thus, a noise analysis
would be required for each output node separately. A somewhat simpler approach would be to
assume that since the first two stages consist of only +land -j multiplications, these two stages
can be performed noiselessly. Each output node is connected to all N/2 butterfiles in the first stage
and to N /4 butterflies in the second stage. Thus, if the first two stages a.re performed noiselessly,
a better estimate of the number of independent noise sources contributing to the output is
N N N
N - 1- 2 - 4 =4 - 1.
Note that all the odd indexed outputs will have exactly (N/4) - 1 of these noise sources, while
the even indexed outputs will have less. In fact, X[O], X[N/4], X[N/2], X[3N/4] will be noiseless.
X[N/8), X[3N/8], X[SN/8], and X[7N/8] will have one noise source. It is possible to continue this
analysis for all X[k], but clearly, a complicated formula would be required to desaibe the number
of noise sources for all even k. We have shown that
Number of noise sources = (N /4) - 1, k odd

Number of noise sources < (N/4) -1, k even
Thus, \h.<e uum.ber of noise sources is upper bounded (N/4) - 1. Using this bound, we can get a
"."'"-~~"'-~~~~-
£[1F[k]I'] $ ( ~ - l)uJi
~ ~ <Ti for large N

391
When the scaling is done at the input, an upper bound on the noise-to-signal ratio is found to be
l'(IF(k]l 2] < ~a1 3 2 2 _ N 22- 28

l'[IX[k]l 2] ~ .J. = 4N as - 4
This equation is similar to Eq. 9.65, but scaled by ¼- This implies that Eq. 9.65 is about 1 bit too
pessimistic. However, note that the N 2 dependence is still present.
Another approach to this noise analysis is to compute the average noise at the output by using the
average number of noisy butterfties connected to an output node. This style of analysis is used in
Weinstein.
(c) Now assume as before that the first two stages are noiseless. Thus, equation 9.67 would not include
the first two stages.
•-1
l'(IF(k]l 2] < a1 L 2<•-ml(~)2v-2m-2
m=2
•-1
= a1 L (~ i•-m-2
m=2
•-3
= 2at I:<~)·
= 20-2
B
c-
i::0
(!J--2)
2
1- !
2
= 4'71(1-(!)"-2)
2
2 4)
= 4as(l- -
N
Thus,
l'[IF[k]l 2] 12Na1N- 4
l'[IX[k]l 2) :::. N
< 12(N -4)"1
9.46. The butterfly for decimation-in-frequency is drawn below.
X.,(q]
where
Xm(p) = Xm-1(p] + Xm-1[q]

Xm[q) = (Xm-1!P] - Xm-1[q))W,v
The statistical model is drawn below.

392
As in a decimation-in-time FFT, each output node connects to N - 1 butiedlies in a decimation-in-

frequency FFT, each oC which introduces a noise source whose variance is
£(1<[m, q]l2] = ('i = ½r>B.

Thus the output noise propagated through the 8owgraph is
£(1F[k]l2] = (N - l)u1
since each noise source propagates along a unity gain path to the output nodes.
Thus, the results for the decimation-in-frequency FFT are identical to those for the decimation-in-time
FFT. This is true for both cases oC scaling either at the input of the FFT by 1/N, or at the input of
each stage of the FFT by 1/2.
9.47. Reca.ll the following symmetry properties of the DFT:
:t(n] real = X(k] = X"[N - k]

:t(n] =:• (N - n] = lm{X(k]} =0
:t(n] = -2:• (N - n] = Re{X(k]} =0
Thus, :t[n] real and even= X(k] real and even; and :t[n] real and odd= X(k] imaginary and odd.
(a)
11,(n] = :t1[n] + :t3(n]

:t 1[n] is real and even; ,:3(n] is real and odd.
Y1 [k] = Re{Y1 [k]} + jlm{Y,[k]} = X,[k] + X3[k]
Re{Yi[k]} is real and even; jlm{Y1 (A:]} is imaginary and odd; X 1 (k] is real and even; X3[k] is
imaginary and odd. It follows that
X1 (k] = Re{Y1 (A:]}

X 3 [A:] = jlm{Y,(A:]}
(b)
Y,[k] = Y1 (k] + jY2(k] = [Re{Yi(A:]} + jlm{Y,(A:]}) + j[Re{Y2(k]} + jlm{Y2(k]}]

= Re{Yi(A:]}- lm{Y2(k]} +j(Re{Y2(A:]} + Jm{Y,[k]})
real odd even odd
Y3 [k] = (Ev{Re{Y,[k]}} + Od{Re{Y,(1:1}}] + j(Ev{lm{Y,(A:]}} + Od{Im{Y3[k]} }]
393
Thus we have
Re{Y,[k]} = Ev{Re{Y.[k]}}
Re{Y2[k]} = Ev{Im{Y3[k]}}
Im{Y1[k]} = Od{Im{Y,[k]}}
Im{Y2[k]} = -Od{Re{Y,[k]}}
and so
= 2l [Re{Y3 [k]} + Re{Y,[N - kl}]
+½[lm{Y,(k]} - Im{Y3[N - kl}]
Y2[k] = ~[lm{Y3[k]} + Im{Y3(N - kl}]

-½(Re{Y3[k]} - Re{Y3[N - kl}]
and from part (a)
l
X,[k) =
2[Re{Y.[k]} + Re{Y,[N - kl}]
X2[k] = 2l [Im{Y,[k]} + Im{Y.[N - kl}]

X,[k] = 2j [lm{Y.(k]} - Im{Y,(N - kl}]
X,[k) = 2-J [Re{Y3[k]} - R.e{Y3[N - kl}]
(C)
U3(n] = %3[((n + l))N] - z,[((n - l))N]

u3[((N - n))N] = z3(((N - n + l))N]- z3(((N - n - l))N]
Since Z3(n] = z,[((N - n))N],
u3(((N - n))N] = z,(((n - l))N] - z,(((n + l))N] = -u,(n]

For n = 0, we have u,[0] = -u,(0], which is only satisfied for u 3 (0] = 0.
(d) Using the circular shift property of the DFT we have
U3(k] = X,[kj_,jC••/NJ• - X3(k]e-i< 2 •/NJ•

= 2j sin(2.-k/N)X3(k]
(e) From part (a), since u3(n] is antisymmetric,
X 1(k]=Re{Y1(k]}
U,(k] =;Im{Y,(k]}
and so
X [k] = Im{Y,(k]} k _, O N
s 2sm,;. r , 2
Note that X 3 (0] cannot be recovered using this technique, and if N is even, neither can X3[N/2].
394
(f) In part (b) replace X 3 and X, with U3 and U, and use the re3Ult of (d) to give
X,[A:J = 21 [R.e{Y,[A:)} + Re{Y [N - 3 kl}]
X,[k] = 2l [lm{Ys[A:]} + Im{Y,[N - A:]}]
X3[k) = ¼[lm{Ys[A:]} - Im{Y,[N - A:]}]/ sin(2.-k/N), k # 0,N/2
X,(k] = -¼[R.e{Y,[k]}- Re{Y3 [N - k]}]/sin(2.-k/N), A:# 0,N/2
9.48. First, we find an expression for samples of the system function H(z ).
H(z) = '"-~
<C'" b,z -•
l - Lt=• a,z-l
'<C'M b -j2•kT/N
H(ei' ..I") = l -..:.,,=0
<C'" ••a,,-;,..,,,,
'L..lt=l
Now assume N, M ~ 5ll. Let b[n] = bn and
1
a[n) ={ '
a,.,
Let B[k], A[k] be the 512 pt DFTs of b[n), and a[n]. Then
H(ei'dfm) = B[k]
A[k]
9.49. (a) It is interesting to note that (linear) convolution and polynomial multiplication are the same
operation. Many m&thematical software tools, like Matlab, perform polynomial multiplication
using convolution. Here, we replace
L-1
.,_,
p(z) = L a,z', q(z) =L b,z"
;.:() ;.:()
with
L-1
.,_,
p[n] = L a;c5[n - i], q[n] = L b,6[n - i)
;.:()
...,
Then,
r(n) = p[n] • q[n).
The coefficients in r[n) will be identically equal to those of r(z). We can compute r(n] with circular
convolution, inste.ad of linear convolution, by zero padding p[n) and q[n] to a length N = L+ M -1.
This zero padding ensures that linear convolution and circular convolntion will give the same resnlt.
(b) We can implement the circular convolution of p[n] and q[n] using the following procedure.
step 1: Take the DFTs of p[n) and q[n) using the FFT program. This gives PIA:] and Q[k).
step 2: Multiply to get R(A:) = P[k)Q[A:).
step 3: Take the inverse DFT of R(k) using the FFT program. This gives r[n).
395
Here, we assumed that the FFT program also computes inverse DFTs. If not, it is a relatively
simple matter to modify the input to the program so that its output is an inverse DFT. (See
problem 9.1).
While it may seem that this procedure is more work, for Jong sequences, it is actually more efficient.
The direct computation of r[n] requires approximately (L + M) 2 real multiplications, since a; and
b, are real. Assoming that a length L + M FFT computation takes ((L + M)/2) Jog2 (L + M)
complex multiplications, we count the complex multiplications required il> the procedure described
above to be
Operation Complex Multiplications

FFTs of p(n] and q(n] 2[(L + M)/2) Jog2 (L + M) =(L + M) log,(L + M)
R(k] =P[k]Q(k] L+M
Inverse FFT of R(k] [(L + M)/2] Jog2 (L + M)
= (3(L + M)/2)1og,(L + M) + (L + M)
Since a complex multiplication is computed using 4 real multiplications, the number of real multi-
plications required by this technique is 6(L+ M) Jog2 (L+ M) +4(L+ M). Plugging in some values
=
for (L + M) 2•, we find
L+M Direct FFT
2 4 20
4 16 64
8 64 176
16 256 «8
32 1024 1088
64 4096 2560
Thus, for (L + M) 2: 64, the FFT approach is more efficient.
(c) The binary integers u and v have corresponding decin,al values, which are
L-1
"decimal = L u.2'
M-1
vdecimal = L Vi2i
i=O
Note the resemblance to p(x) and q(x) of part (a). We form the signals
L-1
u(n] = L u,o(n - i]
i=O
Jt-1
111n1 = L .,,.rn - iJ
i=O
and use the procedure described in part (b). This computes the product u • v in binary. For
=
L 8000 and M =
1000, this procedure requires approximately
# real multiplications = 6(8000 + 1000) Jog,(8000 + 1000) + 4(8000 + 1000)

= 7.45 x lo'
In contrast, the direct computation requries 8.1 x 107 real multiplications.

396
(d) For the (forward and inverse) FFI's, the mean-square value of the output noise is (L + M)o-~.
While ~ will be small, as there are 16 bits, the noise can be significant, since L + M is a large
number.
9.50. (a) Using the definition of the discrete Hartley transform we get
HN(a + NJ = CN[a +NJ+ SN[a + NJ

= cos(2.-a/N + 2,r) + sin(2.-a/N + 2.-)
= cos(21ra/N) +sin(21ra/N)
= CN[a] + SN[a]
= HN[a]
HN[a + b] = CN(a + b) + SN[a+b]

= cos(2ira/N + 2.-b/N) + sin(21ra/N + 21tb/N)
= cos(21ra/N) cos(2irb/N) - sin(2ira/N) sin(2irb/N)
+ sin(21ra/N) cos(2.-b/N) + cos(21ra/N) sin(2irb/N)
Grouping the terms in the last equation one way gives us
HN[a + b] = [cos(2,ra/N) +sin(2ira/N)]cos(2,rb/N)

+ [cos(-21ra/N) + sin(-2,ra/N)] sin(2irb/N)
= HN[a)CN[b) + HN[-a]SN[b)
while grouping the terms another way gives us
HN[a+b) = [cos(21rb/N)+sin(2,rb/N)]cos(2.-a/N)
+ [cos(-2.-b/N) + sin(-21rb/N)] sin(2ira/N)
= HN[b)CN[a) + HN[-b)SN(a)
(b) To obtain a fast algorithm for computation of the discrete Hartley transform, we can proceed as
in the decimation-in-time FFI' algorithm; i.e.,
(N/2)-1 (N/2)-1
XH[k) = L :t[2r]HN[2rk] + L :t[2r + l]HN((2r + l)k]
r=O r=O
(N/2)-1 (N/2)-1
= L :t[2r]HN[2rk] + L :t[2r + l]HN[2rk]CN[k]
r=O r=O
(N/2)-1
+ L :t(2r + l]HN[((-2rk))N]SN[k]
r=O
Now since HN[2rk] = HN12 [rk], we have

(N/2)-1 (N/2)-1
XH(k] = L
r=O.
:t[2r]HN12(rk] + L
r=O
z(2r + l]HN;2[rk]CN(k)
(N/2)-1
+ L z[2r + l]HN12[((-rklJN12)SN(k]
397
where
(N/2)-1
F[A:] = I: z[2r]HN12[rk]
r=O
is the N/2-pomt DHT of the e\'ell-mdexed pomts and
(N/2)-1
G[A:] = I:
- z[2r + l]HN12[rk]
is the N /2-pomt DHT of the odd-mdexed pomts. As m the derivation of the decimation-in-time
FFT algorithm, we can continue to divide the sequences m half if N is a power of 2. Thus the
indexmg will be exactly the same except that we have to access G[((-A:))N12] as well as G[k] and
F[k]; i.e., the "butterfly" is slightly more complicated. The fast Hartley transform will require
N log2 N operations as in the case of the DFT, but the multiplies and adds will be real instead of
complex.
9.51. (a)
l 10 0 0 0 0 0 l 0 0 0 0 0 0 0
l -1 0 0 0 0 0 0 0 1 0 0 0 0 0 0
0 0 1 l 0 0 0 0 0 0 ~ 0 0 0 0 0
F, = 0 0 1 -1 0 0 0 0
T,=
0 0 0 0 w; 0 0 0
0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0
0 0 0 0 1 -1 0 0 0 0 0 0 0 l 0 0
0 0 0 0 0 0 l l 0 0 0 0 0 0 wo8 0
0 0 0 0 0 0 1 -1 0 0 0 0 0 0 0 W;
l 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0
0 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0
1 0 -1 0 0 0 0 0 0 0 l 0 0 0 0 0
0 1 0 -1 0 0 0 0 0 0 0 1 0 0 0 0
F2 = 0 0 0 0 1 0 1 0
T2 = 0 0 0 0 ~ 0 0 0
0 0 0 0 0 1 0 1 0 0 0 0 0 II-'.'
8 0 0
0 0 0 0 1 0 -1 0 0 0 0 0 0 0 w•• 0
0 0 0 0 0 1 0 -1 0 0 0 0 0 0 0 W'8
1 0 0 0 1 0 0 0
0 1 0 0 0 1 0 0
0 0 l 0 0 0 1 0
0 0 0 1 0 0 0 1
F, = 1 0 0 0 -1 0 0 0
0 1 0 0 0 -1 0 0
0 0 1 0 0 0 -1 0
0 0 0 1 0 0 0 -1
(b)
QH = FfTfFfzj'Ff
= F1TiF2T2F,
398
where • denotes conjugation. Drawing the tlow graph, we get
xfOJ
xf1J y(1]
-1
vf.
xf2J y(2]
xf3)
xf4] y(4)
xfSJ
xf6] y(6]
x(7J -1 y{7J
-1 -1
This structure is the decimation in frequency FIT with the twiddle factors conjugated and therefore
calculates
N • IDFI'{z[n]}
(c) Knowing that Q calculates the DIT and 11Q
8 calculates the IDFT, we should realize that cas-
cading the two should just return the original signal. More formally we have
F{IF, =21 FfF2 =21 FfF3 =21

T{IT, =I TfT2 =I
(l/N)Q 8 Q = (1/N) (F{ITfFfTfFf) (F,T2F2T,F1)
= (1/N)(NI)
= I
where N = 8 in this case.
9.52. (a) First, we derive the circular convolution property of the DFT. We start with the circular convo-
lution of z[n] and h[n].
N-1
y(n] = L z(m]h[((n - m))N]
m=O
Taking the DIT of both sides gives
N-1 /11-1
Y[k] = L L z(m)h(((n - m))N)W"'
n=Om=O
N-l N-1
= L :i:(m) L h[((n - m))N)W"'
m=O .....
399
Using the circular shift property of the DFT,

N-1
Y[k] = L :r[m]H[k]WN•
m=O
N-1
= H[k] L :r[m]w;•
m=O
= H[k]X[k]
Next, the orthogonality of the basis vectors is shown to be a necessary requirement for the circular
convolution property. We start again with the circular convolution of :r[n] and h[n]
N-1
y[n] = L :r[m]h[((n - m))N]
m=O
Substituting the inverse DFT for :r[m] and h[((n - m))N] gives
y[n] = }:
m=O
(! }: X[k Jw,,••"') (~ ~ H[k,Jw;:,;••«n-m))N)
l:1-0
1
l:2=0
= }:
m=O
(!}: X[k,Jw,,••"') (! ~ H[k,Jw;:.;••<•-m))
.k1 =O i:2:0
= ~2 ~ ~ (x[k ]H[k ]W,,••• ~ w,,•,mw~•"')

1 2
t1=0&2=0 m=0
With orthogonal basis vectors,

} : WN°' = { N, k 0 =
n=0 0, k;<O
so the right-most summation becomes
N-1
I: w;:2-l:1)m
m=O
= No[k, - k,]
Therefore,
N-1 N-l
y[n] = -:,. L L (X[k1]H[k2Jw,,••• N o[k, - k 2])
i1=0l:2=0
N-1
= ! .,=0
L X[k,JH[k,Jw,,••·
N-1
= L :r[m]h[((n - m))N]
m=O
Therefore, the circular convolution property holds as long as the basis vectors are orthogonal.
(b)
400
k = 0: ((1 + 1 + 1 + 1)),, = ((4)),, = 4

k = . 1: ((1 + 4 + 16 + 64))17 = ((85)),, = 0
k = 2: ((1 + 16 + 256 + 4096))17 = ((4369)),, = 0
k = 3: ((1 + 64 + 4096 + 262144)),,
= ((266305)),, = 0
The relation holds for P =17, N =4, and Wiv =4.
(c)
X[k] = ( (t z[n]4n>))
17
= ((1 · 1 + 2 · 4• + 3 · 16• + 0 · 64•))17
= ((1 +2·4• +3-16•))17
Using this formula for X[k],
X[O] = ((1 + 2+3))17 = ((6)),, = 6

X[l] = ((1 + 2 · 4 + 3 · 16))17 = ((57)),, = 6
X[2] = ((1 + 2 · 16 + 3 · 256))17 = ((801))17 = 2
X[3] = ((1 + 2 · 64 + 3 · 4096)),, = ((12417)),, = 7
H[k] = ( (t h[n)4n•)) 17
= ((3· 1 + l ·4• +O· 16• +0·64•))17
= ((3+4•Jh,
Using this formula for H[k],
H[O] = ((3 + 1)),, = ((4))17 = 4

H[l] = ((3+4))17 = ((7)),, = 7
H[2] = ((3 + 16))17 = ((19Jh, = 2
H[3] = ((3 + 64Jh, = ((67)),, = 16
Multiplying terms Y[k] = X[k]H[ii:] gives
Y[O] = ((24)),, = 7
Y(l] = ((42)),, = 8
Y[2] = ((4)),, = 4
Y(3] = ((112))17 = 10
(d) By trying out different values,
N- 1 = 13
w;;' = 13
1
((N- N)h, =((W;i 1Wiv )),, =((13 · 4))11 =((52))17 = 1
401
(e)
y[n] = ( (13 tY(k]l3,..))

17
= ((13(7 · l + 8 · 13n + 4. 169n + 10 · 219r])J,1
Using this formula for 11(n],
11{0] = ((13(7 + 8 + 4 + 10]})17 = 3 = ((377Jh1

11{1] = ((13(7 · l + 8 · 13 + 4 · 169 + 10 · 2197])),, = ((29584l)h, = 7
11(2] = ((13(7 · l + 8 · 169 + 4 · 28561 + 10 · 4826809])),, = ((628988009)),7 = 11
y(3] = ((13(7 · l + 8 · 2197 + 4 · 4826809 + 10 · 10604499373])),, = ((1378836141137))17 = 3
Performing manual convolution 11(n] = z(n] • h(n] gives

y(O] = 3
11(1] = 7
y(2] = 11
11(3] = 3
The results agree.
9.53. (a) The tables below list the values for n and k obtained with the index maps.
n2 k,
IO I l I2 0 l 2
n, 0 I(, ' i2 k, 0 0 2 4
l I3 j 4 I5 l l 3 5
As shown, the index maps only produce n = 0, ... , 5 and k = 0, ... , 5.
(b) Malring the substitution we get
X(k] = X(k, + 2k2]

= I:• zlnJw?•+..,>n
n=O
2 I
= L L :r:l3n1 + n2Jwt1+21::z)(3n1+n2)
n:z ==O n1 =O
(c) Expanding out the We terms we get
(d) Grouping the terms we get
The interpretation of this equation is as follows

402
(i) Let G(k,, n2] be the N = 2 point DFTs of the inner parenthesis; i.e.,
1
G(k., n 2] = L :i:(3n 1 + n2]Wt• "',
n,=O
This calculates 3 DFTs, one for each column of the index map associated with n. Since the
DFT size is 2, we can perform these with simple butterflies and use no multiplications.
(ii) Let G(k1, n2] be the set of 3 column DFTs multiplied by the twiddle factors.
0 $ k1 $ 1,
{ 0$n2 $2.
(iii) The outer sum calculates two N = 3 point DFTs, one for each of the two -values of k1.
2
X(k, +2J:2] =L G(k,,n2]Wf'"',
n:a=O
(e) The signal flow graph looks like
The only complex multiplies are due to the twiddle factors. Therefore, there are 10 complex
multiplies. The direct implementation requires N 2 = 62 = 36 complex multiplies (a little less if
you do not count multiplies by l or -1).
403
(f) The alternate index map can be found be reversing the roles of n and k; i.e.,
n = n1 + 2n2 for n 1 = 0, 1; n2 = 0, 1, 2
k=3.l:1 +k2 for .l:1 = 0, l; k2 = 0, 1,2
405
Fourier Analysis of Signals
Using the Discrete Fourier Transform

407
10.1. (a) Using the relation

2.-k
0
• = NT'
we find that the index k = 150 in X[k] corresponds to a continuous time frequency of
2.-(150)
1'1100 = (lOOO)(l0-•)
= 2.-(1500) ra,l/s
=
(b) For this part, it is important to realize that the k 800 index corresponds to a negative continuous-
time frequency. Since the OFT is periodic in k with period N,
2.-(800 - 1000)
l'lsoo = 1000(10-4)
= -2.-(2000) ra,1/s
10.2. Using the relation

n. = 2.-k
NT
or
k
f• = NT
we find that the equivalent analog spacing between frequencies is
I
t,.J = NT
Thus. in addition to the constraint that N is a power of 2, there are two conditions which must be met:
j, > 10,000 Hz (to avoid aliasing)

;i>r < 5Hz (given)
These conditions can be expressed in the form
1
10,000 < T < 5N
The minimal N = 2" that satisfies the relationship is
N = 2048
for which
10, ooo Hz < fI < 10, 240 Hz
Thus, Fmin = 10,000 Hz, and Fmax = 10,240 Hz.
10.3. (a) The length of a window is
L = (16,ooosa:1 es)(20x10-•sec)
= 320 samples
(b) The frame rate is the number of frames of data processed per second, or equivalently, the num-
ber of OFT computations done per second. Since the window is a,lvanced 40 samples between
computations of the OFT, the frame rate is
frame rale = ( 16, 000 samples) ( 1 frame processed)

sec 40 samples
= 400~
sec
408
(c) The most straightforward solution to this problem is to say that since the window length Lis 320,
we need N 2: Lin order to do the DFT. Therefore, a value of N = 512 meets the criteria of N 2: L,
=
N 2". However, since the windows overlap, we can find a smaller N.
Since the window advances 40 samples between computations, we really only need 40 valid samples
for each DFT in order to reconstruct the original input signal. If we time alias the windowed data,
=
we can use a smaller DFT length than the window length. With N 256, 64 samples will be time
=
aliased, and remaining 192 samples will be valid. However, with N 128, all the samples will be
aliased. Therefore, the minimum me of N is 256.
(d) Using the relation
the frequency spacing for N = 512 is

l!.f = 16,000 = 31.25 Hz
512
and for N = 256 is
l!.f = 16256
' OOO = 62.5 Hz
10.4. (a) Since :z:[n] is real, X[k] must be conjugate symmetric.

X[k] = X"[((-k))N]
We can use this conjugate symmetry property to find X[k] for k = 200.
X[((-k))N] = X"[k]
X[((-SOO)hooo] = (1 + j)"
X[200] = 1- j
(b) Since an N-point DFT is periodic in k with period N, we know that
X[SOO] = 1 +j
implies that
X[-200] =1+ j
Using the relation
2,rk
!l, = NT'
we find
-2ir(200)
11-200 = (1000)(1/20, 000)
= -2,r(4000) rad/s
2.-(200)
!1200 = (1000)(1/20, 000)
= 2.. (4000) rad/s
Consequently,
l+j
X<(j 0) ln=-2•(4000) = 20,000
1-j
X<(j !l) ln=••<t000> = 20,000
Note that both expressions for X,(j !l) have been multiplied by the sampling period T = 1/20,000
because sampling the continuous-time signal :z:,(t) involves multiplication by 1/T.
409
10.5. (a) After windowing, we have

z(n] = cos(l1oTn)
= ½[.,iOoTn + ,-;O.Tn]
= ½[ei~("l?T)n + .-j~("l?T)n]
for n = 0, ... , N - 1 and z(n] = 0 outside this range. Using the DIT properties we get
X[k] = ~ o(((k - N~:T))N) + ~ o[((k + N~T))N)

If we choose
T=~ko
Nl1o
then
X(k] = ~ o[k - ko] + ~ o(k - (N - ko)],
whlch is nonzero for X[ko] and X[N - ko], but zero everywhere else.
(b) No, the choice for Tis not unique since we can choose the integer ko-
10.6. Since :r(n] is real, X(k] must be conjugate symmetric.
X(k] = X'(((-k))N]
X(((-k))N] = X"(k]
Therefore,
X(((-900)hooo] = (l)'
X(lOO] = 1
X(((-420)hooo] = (5)"
X(580] = 5
Note that the k = 900 and k = 580 correspond to negative frequencies of !l. Since the DIT is periodic
in k with period N, we use k = 900 - 1000 = -100 and k = 580 - 1000 = -420, respectively, in the
equations below.
Starting with
2.-k
!l• = NT'
we find
2,r(-100)
!l-100 = (1000)(1/10,000)
= -2.-(1000) rad/s
2.-(100)
!l,oo = (1000)(1/10, 000)
= 2.-(1000) rad/s
2r(-420)
n_,20 = (1000)(1/10,000)
= -2r(4200) rad/s
2,r(420)
a... = {1000)(1/10,000)
= 2r(4200) rad/s
410
Consequently,
1
Xe(j 0) lns-2r(1000) = 10,000
1
X.(j 0) ln=2r(1000) = 10,000
1
X.(j 0) ln=-2r(4200) = 2,000
1
x.u o> ln=••<<2001 = 2,000
Note that all expressions for Xe(j 0) have been multiplied by the sampling period T = 1/10, 000 because
sampling the continuous-time signal ze(t) involves multiplication by 1/T.
10. 7. The Hamming window's mainlobe is l>.wml = 1~, radians wide. We want
l,,wml < "
8,r
s
.
100
L-1 100
L ~ 801
Because the window length is constrained to be a power of 2, we see that
Lmin = 1024
10.8. All window• expect th, Blackman 5ati5/y the criteria. Using the table, and noting that the window
length N =
M + 1, we find
Rectangular:
4,r
~Wml = M+l
4,r
= 256
= ~<~rad
64 - 25
The resolution of the rectangular window satisfies the criteria.
Bartlett, Hanning, Hamming:
= 255
. .
= 31.875 S 25 rad
The resolution of the Bartlett, Hanning, and Jfarnrning windows satisfies the aiteria.
Blackman:
12,r
=M
12..
= 255
= -"-t~rad
21.25 25
The Blackman window does not have a frequency resolution of at least ,r /25 radians. Therefore,
this window does not satisfy the criteria.
411
10.9. The rectangular window's mainlobe is

4,r 4.-
6"'"" = T = 64
radians wide. The difference in frequency between each cosine must be greater than this amount to be
resolved. If they are not separated enough, the mainlobes from each cosine will overlap too much and
only a single peak will be seen. The separation of the cosines for each signal is
.11.w, =li- ::I=~ 1
tw. =li- ::I=~ 2
.11.w, =li- ::I=~ 2
Clearly, the cosines in z 1 [n] are too closely spaced in frequency to produce distinct peaks.
In z,[n], we have a small amplitude cosine which will be obscnrred by the large sidelobes from the
rectangular window. The peak will therefore not be visible.
The only signal from which we would expect to see two distinct peaks is z2[n].
10.10. The equivalent continuous-time frequency spacing is
LI./= NT
1
Thus, to satisfy the criterion that the frequency spacing between consecutive DFT samples is 1 Hz or
less we must have
LI./
1
s 1
NT s 1
1
T ?:
N
1
T ?: 1024 sec
However, we must also satisfy the Sampling Theorem to avoid aliasing. We therefore have the addition
restriction that,
1
f ?: 200 li2
1
T S sec
200
Putting the two constraints together we find
_l_<T<-1-
1024 - - 200
1
Tmin = 1024 sec
10.11. The equivalent frequency spacing is
.11.n = =
2.-
NT = 2.-
(Sl92)(50µs) 15.34 rad/s
or
LI./ =-.11.n = 2,r 2.44 Hz
412
10.12. The equivalent frequency spacing is

1
t.J = NT
Thus, the minimum DFI' length N such that adjacent samples of X[k] correspond to a frequency spacing
of 5 Hz or less in the original continuous-time signal is
t.J $ 5
1
$ 5
NT
1
N ?: ST
8000
?: 5
?: 1600 samples
10.13. Since w[n] is the rectangular window and we are using N = 36 we have
JS
X,[k] = L :r[rR + m]e-i(2r/ •>•m 3
m=O
= DFI'{:r[rR + n]}
Because :r[n] is zero outside the range O $ n $ 71, X,[k] will be zero except when r = 0 or r = l.
'When r = 0, the 36 points in the sum of the DFI' only include the section
,i(i,)3n + ,-;(i,)3n
cos(,m/6) = 2
of :r[n]. Therefore, we can use the properties of the DFI' to find
Xo[k] = fo[((k - 3))31] + ¥•[((k + 3))31]

= 18o[k - 3] + 18o[k - 33]
When r = 1, the 36 points in the sum of the DFI' only include the section
,;ci,)On + ,-;(ft)9n
cos(,m/2) =
2
of :r[n]. Therefore, we can use the properties of the DFI' to find
X,[k] = ... o[((k - 9)),1] + fo[((k + 9))31]

= 18o[k - 9] + 18o[k - 27]
Putting it all together we get
18(.S[k - 3] + o[k - 33]), r=O

=
X,[k]
1 18(.S[k - 9] + 6[k - 27]), r=l
0, otherwise
10.14. The signals :r2 [n], :r3 [n], and :r,[n] could be :r[nj, as described below.
413
Looking at the figure, it is clear that there are two nonzero OFT coefficients at k = 8, and k = 16.
These correspond to frequencies
(2w)(8)
w, =
. 128
= -8 rad
(2w)(l6)
"'2 = 128
= !:4 rad
Also notice that the magnitude of the DFT coefficient at k = 16 is about 3 times that of the OFT
coeflicient at k = 8.
• :,;,(n): The second cosine term has a frequency of .26.- rad, which is neither 1r/8 rad or 1r/4 rad.
Consequently, :,; 1 [n] is not consistent with the information shown in the figure.
• :,;2[n]: This signal is consistent with the information shown in the figure. The peaks occur at the
correct locations, and are scaled properly.
• :,;,[n]: This signal is consistent with the information shown in the figure. The peaks occur at the
correct locations, and are scaled properly.
• z,[n]: This signal has a cosine term with frequency .-/16 rad, which is neither 7'/8 rad or .-/4 rad.
Consequently, :,; 4 [n] is not consistent with the information shown in the figure.
• 3:s[n]: This signal bas sinusoids with the correct frequencies, but the scale factors on the two terms
are not consistent witb the information shown in the figure.
• [n]: This signal is consistent with the information shown in the figure. Note that phase infor-
:,; 6
mation is not represented in the DIT magnitude plot.
10 .15. The instantaneous frequency of the chirp signal is
w;[n] = w0 + >.n
This describes a line with slope ,\ and intercept Wo- Thus,
). = f!.y = (Q.5.- - 0.25,r) =41.34 X 10-• rad

!!.:,; {19000 - O)
Wo = 0.25.- rad
10.16. Using
I
t.f = NT
and assuming no aliasing occured when the continuous-time signal was sampled, we find that the fre.
quency spacing between spectral samples is
1
t.f = (1024)(1/10, 000)
= 9.77 lh
or
t.fl = 21ft.f = 61.4 rad/s
10.l 7. We should choose Method£.
414
Method 1: This doubles the number of samples we take of the frequeocy wria.ble, but does not change
the frequeocy resolution. The size of the main lobe from the window remains the same.
Method 2: Thu improves the frel/uency resolution ,;,..,., the main lobe from the window get, mu,ller.
Method 3: This increases the time resolution (the ability to distinguish events in time), but does not
affect the frequency resolution.
Method 4: This will decrease the frequeocy resolution since the main lobe from the window increases.
This is a strange thing to do since there are samples of x[n] that do not get used in the transform.
Method 5: This will only improve the resolution if we can ignore any problems due to sidelobe leakage.
For example, changing to a recta.ngular window will improve our ability to resolve two equal
amplitude sinusoids. In most cases, however, "!' need to worry about sidelobe levels. A large
sidelobe might mask the presence of a low amplitude signal. Since we do not know ahead of time
the nature of the signal we are trying to analyze. changing to a rectangnlar window may actually
make things worse. Thus, in general, changing to a rectangular window will not necessarily increase
the frequency resolution.
10.18. No, the peaks will not have the same height. The peaks in V2 (&") will be larger than those in l'i (,;").
First, note that the Fourier transform of the rectangular window bas a higher peak than that of the
Hamming window. H this is not obvious, consider Figure 7.21, and recall that the Fourier transform of
an L-point window w[n], evaluated at DC (w = 0), is
L-1
W(&O) = L w[n]
n=O
Let the rectangular window be WR(n], and the Hamming window be WH(n]. It is clear from the figure
=
(where M L+l) that
L-1 L-1
L "'R[n] > L WH(n]
n=O n=O
Therefore,
WR(&O) > WH(.,.i0 )
Thus, the Fourier transform of the rectangular window has a higher peak than that of the Hamming
window.
Now recall that the multiplication of two signals in the time domain corresponds to a periodic convolution
in the frequency domain. So in the frequency domain, l'i (&") is the convolution of two scaled impulses
from the sinusoid, with the Fourier transform of the L-point Hamming window, WH(&"). This results
in two scaled copies of WH(&"), centered at the frequencies of the sinusoid. Similarly, V.(&") consists
of two scaled copies of WR (ei"), also centered at the frequencies of the sinusoid. The scale factor is the
same in both cases, resulting from the Fourier transform of the sinusoid.
Since the peaks of the Fourier transform of the rectangular window are higher than those of the Hamming
window, the peaks in V2(&") will be larger than those in V,(ei").
10.19. Using the approximation given in the chapter
L-
~ 24.-(A., + 12)
155Am1 +1
we find for A., = 30 dB and A,., = ~ rad,
L = 24.-(30+ 12)
155(,r/40) +1
z 261.1 ➔ 262
415
10.20. (a) The best sidelobe attenuation expected nnder these constraints is
24.-(A,1 + 12)
L ::
155.0..., +1
24r(A., + 12)
512 ::
155(.-/100) +1
A,1 :: 21 dB
(b) The two sinusoidal components are separated by at least .- /50 radians. Since the largest allowable
mainlobe width is 1t /100 radians, we know that the peak of the DFT magnitude of the weaker
sinusoidal component will not be located in tbe mainlobe of tbe DFT magnitude of the stronger
sinusoidal component. Thus, we only need to consider the sidelobe height of the stronger compo-
nent.
Converting 21 dB attenuation back &om dB gives
-21 dB = 20log10 m
m = 0.0891
Since the amplitude of tbe stronger sinusoidal component is 1, the amplitude of the weaker sinu-
soidal component must be greater than 0.0891 in order for the weaker sinusoidal component to be
seen over the sidelobe of the stronger sinusoidal component.
10.21. We have
v[n] = cos(2,rn/5)w[n]
ei2•n/• + ,-;2,n/5]
= [ w[n]
2
The rectangular window's transform is
W(eiw) = sin(16w) -jw3l/2

sin(w/2) e
In order to label V(eiw) correctly, we must find the mainlobe height, strongest sidelobe height, and the
first nulls of W(e'w).
Mainlobe Height of W(eiw), The peak height is at w = 0 for which we can use l'hopital's rule to find
W(ei 0 ) = 32 cos(l6w)
cos(w/2)
I
w=O
= 32
Strongest Sidelobe height of W(eiw): The strongest sidelobe height for the rectangular window is
=
13 dB below the main peak height. Therefore, since 13 dB 0.2239 we have
Strongest Sidelobe height = 0.2239(32) "' 7.2
First Nulls of W(eiw): The first nulls can be found be noting that W(eiw) = O when sin(l6w) = 0
Thus, the first nulls occur at
2..
w=±-
32
Therefore, JV(&w)l looks like
416
16 I V(J">, I
-2KIS ♦ 2Kl'32
2lr/5 - 2"/32
_,, lt Ill
Note that the numbers used above for the heights are not exact because we are adding two copies of
W(e-'w) to get V(eiw) and the exact values for the heights will depend on relative phase and location of
the two copies. However, they are a very good approximation and the error is small.
10.22. The 'instantaneous frequency' of :r[n], denoted as >.[n], can be determined by taking the derivative
with respect to n of the argument of the cosine term. This gives
>.[n] = :,, ["; + lOOOsin(~)]

" " (,rn)
= 4+8cos 8000
>.[n]
2,r = 81 + 161 cos ("n)
8000
Once A[n]/2,r is known, it is simple to sketch the spectrogram, shown below.
0.5
0.45
0.4
0.35
0.3
"
~ 0.25
..,
0.2
0.15
0.1
..
0.05 ---
0
2000 4000 6000 8000 10000 12000 14000 16000
Sample number (n)
417
Here, we see a cosine plot shifted up the frequency (>./2,r) axis by a constant. A$ is customary in a
spectrogram, only the frequencies 0 $ >./2,r $ 0.5 are plotted.
10.23. In this problem, we relate the DFT X(k] of a discrete-time signal z[n] to the continuous-time Fourier
transform X.(jO) of tbe continuous-time signal z.(t). Since z(n] is obtained by sampling z.(t),
z[n] = z.(nT)
X(ei"') = f }: (;f +;2;)

T=-CIC
Xe
Over one period, assmnmg no aliasing, this is

for -,r S. w $ ,r
which is equivalent to
X(ei"') = { ½Xe (i'f), for OS w < .-
fXc (j~), for.- Sw < 2,r
Since the DFT is a sampled version of X(e;"'),
for0Sk$N-l
we find
'Xc: (·2d)
T" 1NT , for0$k< If
X[k] = { 1X ( •2•<•-Nl) forf:S:k$N-l
~ C: J NT I
Breaking up the DFT into two terms J.iJo, this is nnececessaary to relate the negative frequencies of X.(jO)
'f
to the proper indicies S k S N -1 in X(k].
Method 1: Using the above equation for X[k], and plugging in values of N = 4000, and T = 25/JS, we
find
X,[k] = { 40,000Xc (j2,r -10 · k), for 0 $ k S 1999
40, OOOX. (j2,r · 10 · (k - 4000)), for 2000 $ k S 3999
Therefore, we see this does not provide the desired samples. A sketch is provided below, for a
triangular-shaped X.(jO).
-I ..... .t.t=10Hz
418
Method 2: This time we plug in values of N = 4000, and T = SOµs to find
X,[l:] = { 20, OOOX, U2.- · 5 - l:), for O$ l: $ 1999
20, ooox, u2.- ·5 · (.1: - 4000)) , for 2000 $ l: $ 3999
Therefore, we see this does provide the desired samples. A sketch is provided below.
-1 f-- Af=5Hz
Method 3: Noting that z3[n] = z 2[n] + z2 (n - ~], we get
X3[k] = X2[k] + (-1)• X2[k]
X [l:] = { 2X2 [k], for k •~en

3
0, otherwise
40, OOOX, U2.- · 5 - l:), for .I: even, and O$ k $ 1999

X,[k] = 40,000X, U2.- · 5 · (k - 4000)), fork even, and 2000 $ k$ 3999
{ 0, otherwise
This system provides the desired samples only for k an even integer. A sketch is provided below.
-1 f-- Af=5Hz
419
10.24. (a) In this problem, we relate the DFT X[k] of a discrete-time signal :t[n] to the continuous-time
Fourier tranform X,(j!l) of the continuous-time signal :z:,(t). Since :z:[n] is obtained by sampling
:r,(t),
:r[n] = :r,(nT)
X(eiw) = f f (;f + j2;r)

r=-00
X,
Over one period, assuming no aliasing, this is
for -1r :5 w :5 1r
which is equivalent to
Since the DFT is a sampled version of X(eiw),
we find
1X ( ]W'f
,.
•2••)
C 1 for0:,k<f
X[k] = { 'X ( -2•<;,TN))
'f' C J I forf:,k:,N-1
Breaking up the DFT into two terms like this is necessary to relate the negative frequencies of
f
X,(jn) to the proper indicies S k S N - I in X[k].
The effective frequency spacing is

2,r
~fl = NT
2,r
= (1000)(1/20,000)
= 2.-(20) rad/s
(b) Next, we determine if the designer's assertion that
Y[k] = oX,(j2,r · 10 · k)
is correct. To understand the effect of each step in the procedure, it helps to draw some frequency
domain plots. Assume the spectrum of the original signal :t,(t) looks like
420
Q
-~~(1~0000-==~)-----1-----~211(:-:-:1~0000)
Sampling this continuous-time signal will produce the discrete-time signal z[n], with a spectrum
X(ei°') .
o X{kJ = Samples of X( el "')
Next, we form
X[k], 0$k$250
W(k] = 0, 251 S k S 749
{
X[k], 750SkS999
and find w(n] as the inverse DFT of W[k].
421
W[k]
1/T
250 500 750 999 k
Before going on, we should plot the Fourier transform, W(e'w), of w[n]. It will look like
1/T
1---___..!ID,.C:,.l.~,il,r::,.L.~,£;;,.(.__ _ _ .,
2 1t
"
W(e'w) goes through the DFT points and therefore is equal to samples of X,(iO) at these points
for O ::; k :=; 250 and 750 ::; k :=; 999, but it is not equal to X,(;11) between those frequencies.
Furthermore, W(e'w) = 0 at the DFT frequencies for 251 ::, k :=; 749, but it is not zero between
those frequencies; i.e. we can not do ideal lowpass filtering using the DFT.
Now we define
¥[n]={ w[2n], 0 ::, n ::; 499
0, 500 ::; n ::; 999
and let Y[k] be the DFT of y[n]. First note that Y(~) is
Y(~) = !w(~I•)
2
+ !w(ei<w-••l/2)
2
which looks like
1
422
~c:.L;:_1..Q.Q..C:,,J.J.£:.,CI..Q.Q..C>.LJ.£:..C.L..l..£:::..Q.LJ,,L~ (I)
It 2 it 4it
Y[k] is equal to samples of the Y(eiw)

= Y(eiw)lw=2•k/N
Y[k]
= ~w (ei'lH) + ~w (e1~(¥l)
Now putting all that we know together, we see that fork = 0, 1, ... , 500, Y[k] is related to X,(jO)
as follows.
k even, k 'I' 500
k = 500
k odd
In other words, the even indexed DFT samples are not aliased, but the odd indexed values (and
k = 500) are aliased. The designer's assertion is not correct.
10.25. (a) Starting with definition of the time-dependent Fourier transform,
00
Y[n, .\) = L y[n + m]w[mJe-;•m

m=-oo
we plug in
M
= Lh[k]z[n + m -
to get
y[n + m]
.... k]
00 JI
Y[n, .\) = L L h[k]z[n + m - k]w[m]•-;•m
JI 00
= L h[k] L z[n + m - k]w[m]e-;•m

le-a --oo
JI
L
=
=
.... h[k]X[n - k, .\)
h(n] • X(n, .\)

where the convolution is for the variable n.
(b) Starting with
we find
Y[n, >.) = e-;>n lt h[k]X[n - k, >.)]
= •-;>n lt h[k]eiC•-•l> X[n - k,>.)]
M
= L h[kJ•-;u X[n - k, >.)
>=O
H the window is long compared to M, then a small time shift in X[n, >.) won't radically alter the
spectrum, and
X[n - k, >.) ::: X[n, >.)
Consequently,
M
Y[n, >.) ::: L h[k],-;u X[n, >.)
::: H(ei')X[n, >.)
10.26. Plugging in the relation for c,,.[m] into tbe equation for /(w) gives
/(w) =
l L-1 [L-1
LU m=~-l) ~ v[n]v[n + m] ,-,wm
]
L-1 L-1
= L~ L v[n] L v[n + m]e-;wm
n=O m.=-(L-1)
Let l = n + m in the second summation. This gives

l L-1 n+(L-1) .
I(w) = LU L v[n] L v[l],-,w(l-n)
n=0 l=n-(L-1)
L-1 n+(L-1)
= L~ L v[n]eiw• L v[lJ•-;wl
n=0 t=n.-(L-1)
Note that for all values of O :o; n :o; L - I, the second summation will be over all non-zero values of v[l]
in the range O S l S L - I. M. a result,
l L-1 L-1
/(w) = - L v[n]eiwn L v[l],-;wt
LUn=0 l=<>
1
= -LU V"(eiw)V(ei"')
1
= - LU
IV(ei"')l 2
Note that in this analysis, we have assumed that v[n] is a real sequence.
424
10.27. (a) Since z[n] has length L, the aperiodic function, c,,[m], will he 2£ - 1 points long. Therefore,
in order for the aperiodic correlation function to equal the periodic correlation fuction, c.,[m], for
0 $ m $ L - 1, we require that the inverse DFT is not time aliased. So, the minimum inverse
DFT length N min is
Nmin 2£-1 =
(b) H we require M points to he unaliased, we can have L - M aliased points. Therefore, for c.,(m] =
c,,[m] for O $ m $ M - 1, the minimum inverse DFT length Nmin is
Nmin = 2L - l - (L - M)
= L+M-1
10.28. (a) Let

l
WR(m] = v'M(u(n] - u(n - M])
be a scaled rectangular pulse. Then we can write the aperiodic autocorrelation as,
00
ws[m] = L
n.=-oo
WR[n]wa(n + m]
00
= I: WR[k - m]wa[k]
00
= L w11[k]w11(-(m - k)]
.t=-oo
= WR(m]. WR[-m]
The convolution above is the triangular signal desaibed by the symmetric Bartlett window formula.
This is shown graphically below for a few critical cases of m.
Consider m = -(M - 1). This is first value of m for which the two signals overlap.
m = -(M - 1) case
0 WR[k) • ' ' I~ I~ M-112
•. wR[k+(M-1)]
k
T
k=-(M-1)
At m = 0, all non-zero samples ooerlap.

425
m=Ocase
Consider m = (M - 1). This is last value of m for which the two signals overlap.
m = (M-1) case
0 WR(k] M-112 n ' a ' ' •
• WR[k-(M-1)]
T k
k=M-1
The final result of the aperiodic autocorrelation is
T m
m=-(M-1)
Stated mathematically, this is
1- lml/M, 1ml S M-1

I l
wsm ={ 0, otherwise
(b) The transform of the causal scaled rectangular pulse WR(n] is
W (,?W) = 1 sm(wM/2) .-,w(M-1)/2

R ../Msm(w /2)
426
From part (a), we know that the Bartlett window can be found by convolving WR[m] with WR[-m].
In the frequency domain, we therefore have,
Ws(_,;,.,) = WR(eiw)WR(•-;w)
= [ l sm(wM/2) -jw(M-1)/2] [ l sin(-wM/2leiw(M-l)/2]
,Ill sm(w/2) ,Ill sin(-w/2)
2
= .!_ [sm(wM/2)]
M sm(w/2)
(c) The power spectrum, defined as the Fourier transform of the aperiodic autocorrelation sequence,
is always no1111egative. Thus, any window that can be represented as an aperiodic autocorrelation
sequence will have a no1111egative Fourier transform. So to generate other finite-length window se-
quences, w[n], that have no1111egative Fourier transforms, simply take the aperiodic autocorrelation
of an input sequence, :i:[n].
w[n] = L"" :i:[m]:i:[n + m]
The signal w[n] will have a no1111egative Fourier transform.

10.29. (a) Rectangular: The Fourier transform of the rectangular window is given by
M-1
WR(eiw) = L {l)e-jwm
m=-(M-1)
Let n = m + (M - 1). Then, m =n - (M - 1), and

2(M-l)
WR(eiw) = L ,-;w[n-(M-1)]
n=O
2(Jl-l)
= e-i'"'<.11-1, L e-;IJn
n=O
Using the relation
we find
. l _ ,-iw[2(M-l)+l]
= ,'w(M-1)
1- e-,w
.
. 1- e-jw(2M'-l)
= ,'w(M-1) _
1- e-JW
e,iw(Jt-1) _ e-;wM
= 1- e-;w
.-;w/2[,iw(M-1/2) _ ,-;..(M-1/2)]
= e-jw/2[eiw/2 _ 0 -;../2]
,;w(M-1/2) _ ,-iw(Jl-1/2)
= eiw/2 _ e-;w/2
= 2jsin{w(M - ½)]
2jsm(w/2)
= sm[w(M - ½ll
sm(w/2)
427
or
. smw-
· [ 2At-lj
2
-
WR(e'"') = sin(w/2)
where 2M - I is the window length. A sketch of WR (&"') appears below.
-2"/(2M-1) 2"/(2M-1)
Bartlett (triangular): W8 (&"') is the Fourier transform of a triangular signal,
-(M-1) 0
II
which is the convolution of a rectangular signal,
x[m)
~
' ' '~ b ,, ~ ,o ~ ~ ...- 112
-
-(M-1)/2 0 (M-1)/2
=
with itself. Tha.t is, wa[m] :[m] • :[m].
Above, we found the Fourier tra.nform of a rectangular window, as
. sin[w2¥J
WR(e'"') = sin(w/2)
where 2M - I was the length of the window. We can use this result to find the Fourier
transform of :[m]. The signal :i:[m] is similar to the rectaz,gular window, the difference being
428
that it is scaled by f,;; and has a length 2M'21 + 1 = M. Therefore,
X(.,;"') = _1_ sin(wM/2)

.,/M sin(w/2)
=
The time domain convolution, w 8 (m] :t[m]•:t[m] corresponds to a multiplication, Ws(&"') =
[X(ei"')J2 in the frequency domain. As a result,
Ws(.,;"') = [x(.,;"')]'
2
= ..!_ [sin(wM/2)]
.M sin(w/2)
A sketch of Ws(&"') appears below.
0 It
"'
-21</M
JI anning/Hamming: Starting with
wH[m] = (o + ,B cos[nn/(M - 1)]) wR[m)
WH(m] = (o + i.,;•m/(M'-l) + ~,-,..,,./(M'-l)) WR(m]
We take the Fourier transform to find
WH(_,;"') = oWR(_,;"') + ~ {WR(_,;lw-•/(M'-1)]) + WR(_,;lw+r/(M'-lll))
= 0
sin[w (M - ½)l ~ [sin((w- -.f.:r)(M - ½ll]
sin(w/2) +2 sin((w· ,,".. 1 )/2)
+ ~ [sin[(w + -.f.:r)(M -½ll]

2 sin[(w + .;-_, )/2]
A sketch of WH(e1"') appears below.
-
(I)
-It It
429
(b) Rectangular: The approximate mainlobe width, and the approximate variance ratio, F, for the
rectangular window are found below for large M.
In part (a), we found the Fourier transform of the rectangular window as
W (t!w) = sin(w(M - ½)]

R sin(w/2)
The numerator becomes zero when the argument of its sine term equals rn.
(2M - l)w
2
= ,m
2.-n
w = 2M-1
Plugging in n = 1 gives us half the mainlobe bandwidth.
2,r
½Mainlobe bandwidth = 2M-1
4,r
Mainlobe bandwidth =
2M-1
Mainlobe bandwidth
l (M-1)
F = Q L w
2
[m]
m=-(M'-1)
1
= -(2M -1)
Q
2M
Q
Bartlett (triangular): The approximate mainlobe width, and the approximate variance ratio,
F, for the Bartlett window are found below for large M.
In part (a), we found the Fourier transform of the Bartlett window as

2
W (t!w) = _!_ [sin(wM/2)]
B M sin(w/2)
The numerator becomes zero when the argument of its sine term equals .-n.
wM
= ,m
2
2.-n
w = M
Plugging in n = 1 gives us half the mainlobe bandwidth.
2
!2 Mainlobe bandwidth = M
"
4.,
Mainlobe bandwidth
= M
To compute F, we use the relations
.,_, M(M-1)
}:m =
.......
.,_,
2
M(M - 1)(2M - 1)
}:m' = 6
m=O
430
F
__ Q1 L 1-M(M-l) lml)
(
2
--(M-1)
= .!.(2'f:'(1-!!!.)'-1]
Q . .. =0 M
l [ M-1 ( 2M-1 M-1 ]
L 1 - -M__,
= Q- 2 ,..... L m + -M2.,...
L m2 - 1
= .!_ [2M _ 4(M - l}M 2(M - l}M(2M - 1) _ l]
Q 2M + 6M2
:: h [2M-2M+ 2~]
2M
::
3Q
Hanning/JI arnrning-. We c..an approximate the mainlobe bandwidth by analyzing the Fourier
transform derived in Part (a). Looking at one of the terms from this expression,
~ [sin[(w- -rf=;)(M - ½>l]

2 sin[(w - u"-, )/2]
we note that the numerator is zero whenever the its argument equals ,m, or
n,r "
"' = M - (1/2) + M - 1
n,r .-
:: - +-
M M
"(n + 1)
::
M
So the mainlobe bandwidth for this term is
½Mainlobe bandwidth :: ;,
2
Mainlobe bandwidth :: "
ii
Not< that the peak value for this term occnrs at a frequency w:: 1r/M.
A similar analysis c..an be applied to the other terms in Fourier transform derived in Part {a).
The mainlobe bandwidth for the term
~ [sin{{w + J/=r )(M - ½)]]

2 sin{(w-+ u"-, )/2]
is also 2w/M. Note that the peak ""1ue for this term occurs at a frequency w:: -,r/M.
Finally, the mainlobe bandwidth for the term
sin[w (M - ½)]
a .
sm(w/2)
431
is also 21t/M. Note that the peak value for this term occun at a frequency w =O.
A sample plot of these three terms, for {J = 2a and large M is shown below.
Thus, for large M, the mainlobe bandwidth is bounded by

2~ 4,r
M < Mainlobe bandwidth < M
Therefore, a reasonable approximation for the main.lobe bandwidth is

3,r
Mainlobe bandwidth c:: M
Using the relation

l l
cos2 8= -+-cos211
2 2
we get
Noting that
Jl-1 ( )
L cos M":1 = -1
--(M-1)
•
2nn )
M-1
L
m=-{Al-1}
(
COSM-1 =1
432
we conclude
F = ~ [(2M - I)o2 - 2of3 + ~• (2M - I)+~•]
~ 2:(o•+~•)
10.30. (a) Using the definition of the time-dependent Fourier transform we find
13
X(O, k] = L :[m}e-j(2•/7)•m
m=O
< 13
= L :(m],-j(2•/7)•m + L :(1Je-j(2•/7)"'
m=O J=7
= L• :[m],-j(>./7)•m + L• :r[m + 7]e-i(2•/7)>m,-;2d

m=O m=O
•
= L (:[m] + :[m + 7]),-j(2•/7)•m
m=O
By plotting :[m)
'
•••
-1 0 1 2 3 4 5 6 7 8 9 10 n
we see that :[m] + :r[m + 7] = I for O :S m :S 6. Thus,
X[O,k]
•
= L(l),-;c2,11l•m
m=O
= 1:>J'T{l}
= 7o(k]
(b) If we follow tbe same procedure we used in part (a) we find
13
X[n, k] = L :(n + mJe-;C •/7)>m 2
m=O
< 13
= L :[n + mJ,-;(2•/Tl>m + l:=[n + ij,-;<••/7).,
m=O l=?
= L• (:(n + m) + :(n + m + 7]),-iC••l l>m

m=O
7
With n ~ 0 we have·:r[n+m) +:[n +m+ 7] = I for O:Sm :S 6, and so

X[n, k] = 1:>J'T{l}
= 7o(k]
Therefore, for O $ n $ co we have
• •
LX[n,k] = L76[k)
10.31. (a) Sampling the continuous-time input signal

:z:(1) = .,;(3r/8)10't
with a sampling period T = 10-• yields a discrete-time signal
:z:[n) = :z:(nT) = .,;3.n/ 9
In order for X,.[k] to be nonzero at exactly one value of k, it is necessary for the frequency of the
complex exponential of :z:[n) to correspond to that of a OFT coefticent, "'• 2-.:k/N. Thus, =
3.- 2.-k
8
= N
N = 16k
3
The smallest value of k for which N is an integer is k = 3. Thus, the smallest value of N such that
Xw[k) is nonzero at exactly one value of k is
N = 16
(b) The rectangular windows, w,[n] and w 2 [n], differ only in their lengths. w,[n) has length 32, and
w,[n] has length 8. Recall that compared to that of a longer window, the Fourier transform of a
shorter window has a larger mainlobe width and higher sidelobes. Since the OFT is a sampled
version of the Fourier transform, we might try to look for these features in the two plots. We notice
that the second plot, Figure Pl0.31-3, appears to have a larger mainlobe width and higher sidelobes.
As a result, we conclude that Figure Pl0.31-2 corresponds to w1 [n), and P!0.31-3 corresponds to
tu2[n].
(c) A simple technique to estimate the value of Wo is to find the value of k at which the peak of jX,.[k)I
occurs. Then, the estimate, is
• 21rk
""'= N
The corresponding value of !lo is
• 2.. .1.
Clo= NT
This estimate is not exact, since the peak of the Fourier transform magnitude jX,.(e'w)I might
occur between two values of the OFT magnitude IX,.[k]I, as shown below.
OTFT: IX (ei°')I
0 OFT:IX}JI
(I)
0 2!t
434
The maximum possible error, Omax error, of the frequency estimate is one half of the frequency
resolution of the DFI'.
1 2.-
Om.ax =
error
=
.
2NT
NT
For the system parameters of N = 32, and T = 10-4, this is
Omax error =982 rad/s
(d) To develop a procedure to get an exact estimate of Oo, it helps to derive X,.[k]. First, let's find
the Fourier transform of :t,.[n] = :t[n]w[n], where w[n] is an N-point rectangular window.
N-l
Xw(~'"') = L e''-'one-;,.,n
n=O
N-1
= L e-j(w-wo)n
=<I
Let w' =w -w0 . Then,

N-1
X.,(eiw) = L .-jw'n
=<I
1- ,:.-iw'N
= 1- e-jw'
{eiw' N/2 _ •-jw' N/2)e-jw' N/2
= (e-;w• /2 _ •-;.,• /2)e-,..,. /2
= sin(w'N/2) -jw'(N-1)/2
sin(w' /2)
= sin[(w -.,.)N/2] -j(w-wo)(N-1)/2
sin[(w -.,.)/2] •
Note that X,.(eiw) has generalized linear phase. Having established this equation for X,.(eiw),
we now find X.,[k]. Recall that X.,[k] is simply the Fourier transform X,.(eiw) evaluated at the
= =
frequencies w 2,rk / N, for k 0, ... , N - 1. Thus,
sin[(2,rk/N - "'°)N/2] -j(2d/N-w,)(N-l)/2

X.,[k] = sin[(2,rk/N -.,.)/2] •
Note that the phase of X,.[k], using the above equation, is
(21rk/N - "'°)(N - I)
l X ,. [kl = +m,r
2
where the m,r term comes from the fact that the term
lin{{2d:/N -.,.)N/2]
lin{(21rk/N - "'°)/2]
can change sign (i.e. become negative or positive), and thereby offset the phase by .- radians. In
addition, this term accounts for wrapping the phase, so that the phase stays in the range [-,r, .-J.
435
Re-expressing the equation for LX.,[k], we find

2(LX,.[k] - m,r) 2.-k
wo= N-1 +N
=
Let X,,.[k] be the OIT of the 32-point sequence :i:1.,[n] :r[n]w1 [n], and let X2.,[k] be the OFT of
the S-point sequence :i:2,.[n] = :r(n]w2 [n]. Note that the ktb OFT coefficient of X2,.[k] corresponds
to X,,.(4k]. Thus, we can relate the 8 OIT coeffients of X2,.[k] to 8 of the DIT coefficients in
=
X,,.[k]. Using the k 0th OFT coefficient for simplicity, we find
= 2(LX,.i(O]- m,r) _ 2(LX.,,(O] - p,r)
"'° 32-1 - 8-1
LX,.,[O] - m.- LX,.,[O] - p,r
= 15.5 - 3.5
A solution that satisfies these equations, with m and p integers, will yield a precise estimate of
WO- We can accelerate solving these equations by determining which values of m and p to check.
This is done by looking at the peak of IX.,(k]I in a procedure similar to Part (c). Suppose that
the indices for two largest values of [X,.(k]I are k.n,n and le,,,... Then, we know that the peak of
IX(e'w)I will occur in the range
2,rk,.,;n 2,r k,,,..,
--<•-~<---
N _-u - N
By re-expressing the equation for LX,.(k], we see that
m,,.,n = ;1 [2LX,.1 Ikn.in l + (2.-k...,n

-y-- - Wo• ) (N -1) ]
m,.... = ; [ux..i11cn...1 + (2";'"" -wt>) -1)] (N
In these equations, wo is the estimate found in Part (c). So we would look for values of m in the
range (Lm,,,.nJ, fm,.... l]- Similar expressions bold for p.
Once wo is known, we can find !lo using the relation !lo =wo/T.
10.32. For each part, we use the definition of the time-dependent Fourier transform,
00
X(n,>.) = L :r(n + m]w[m],-i>m_

m=-00
(a) Linearity: using :r[n] =az 1 [n] + b:t2[n],
X[n, >.) = L :r[n + m]w(m],-i>m

m=-oo
00
= L (az,[n + m] + lr.r2[n + m])w[m]e-i>m

m=-00
00
:t1 (n + m]w[m],-;>m + b L
-=-00
= aX1 [n, >.) + bX2[n, >.)
(b) Shifting: using y[n] = :r[n - no],
Y[n, >.) = L
.. y[n + m]w[m],-i-'m
m=-oo
436
00
= L :[n - fl() + m)w[m],-;>m
= X[n - fl(),).)
(c) Modulation: using y[nl = .,;won:[nl,

y[n + ml = .,;...<n+m>.,[n + m)
00
Y(n, ).) = L y[n + m)w[ml,-;>m

m=-oo
= L00
.,;wo(n+m):[n + m)w[m],-;>m
m=-oo
= L00
.,;w,n:[n + m)w[ml,-;(>-wo)m
m=-oo
(d) Conjugate Symmetry: for z[n) a.nd w[n) real,

00
X[n, ).) = L z[n + m)w[m],-;>m

m=-oo
0
= L,too :[n + m]w[m]ei'm]
= [X[n, ->.)]'
= X'[n, ->.)
10.33. (a) We are given that ¢ 0 (T) = C {zc(t)zc(t + T)}. Since z[n] = Zc(nT),
¢[m] = C {:[n]z[n + ml}
= C {zc(nT)z0 (nT + mT)}
= <Pc(mT)
(b) P(w) a.nd P 0 (fl) are the transforms of ¢[ml a.nd ¢c(T) respectively. Since ¢[ml is a sampled version
of <Pc(T), P(w) a.nd Pc(fl) are related by
(c) The condition is that no aliasing occurs when sampling. Thus, we require that P0 (fl) = 0 for
lfll ;;:: f so that
lwl <"
10.34. In this problem, we are given
• z[n] = A cos(WQn + 8) + e[n]
• 8 is a nniform random variable on O to 2.-
• e[n] is a.n independent, zero mean random variable
437
(a) Computing the autocorrelation function,
¢.,(m] = £ {z(n]z(n + ml}

= £ {(A cos(won + 8) + e(n]) (A cos(wo(n + m) + 8) + e(n + ml)}
= £ { A2 cos(won + 8) cos(wo(n + m) + 8)}
+ £ {Ae(n] cos(wo(n + m) + 8)} + £ {Ae(n + m] cos(won + 8)}
+ £ {e(n]e(n + ml}
= A2£ {cos(won + 8)cos(wo(n + m) + 8)}
+ A£ {e(n]} £ {cos(wo(n + m) + 8)} + A£ {e(n + ml}£ {cos(won + 8)}
+ £ {e(n]e(n + ml}
First, note that
1 1
cos(a) cos(b) =
2 cos(a + b) + 2 cos(a - b)
Therefore, the fust term can be re-expressed as
2
A £ {½cos (2won + wom + 211) + ½ cos(wom)}
Next, note that
£ {e(n]} =0
As a result, the two middle terms drop out. Finally, note that since e(n] is a sequence of zero-mean
variables that are uncorrelated with each other,
£ {e(n]e(n +ml}= cr:o(m], where er: = £ { e [nl}

2
Putting this together, we get
Since 2~ fo" cos(2won + wom + 211)d8 = 0, we have

A'
¢.,(m] = cos(wom) + cr:o[m]
2
(b) Since the Fourier transform of cos(wom) is .-o(w -wo) + .-o(w + wo) for !wl $ ",
10.35. (a) Plugging in the equation

1(.1:] = I(w•) = Ll JV(k]I•
into the relation
var(I(w)]::: .P;,(w)
we find that
-.a.r [½ JV(.1:]1 2
] ::: .P;,(w)
-var[!V(.1:]! 2 ] ::: L2 .P;,(w)

438
This equation can be used to find the approximate variance of JX(k]i2. We substitute the signal
X(k] for V(k], the DFT length N for L, and use the power spectrum
P.. (w) = er,

This gives
(b) The cross-correlation is found below.

N-1 N-1
£ {X[k]x·[r]} = L L £ {:z:[n,]:z:(n21} wt"'WN"''
n1=0n2=0
N-1 N-1
= L L cr,c![n1 - n2]W;'' WN"''
N-1
= L cr.w;:-,)n
......
= ,,2
z
[1 -w::<•-r)]
1-w;:-r)
= Na~o[k - r]
Note that the cross-correlation is zero everywhere except when k =
r. This is what one would
expect for white noise, since samples for which k # r are completely uncorrelated.
10.36. (a) The length of the data record is
Q = 10 seconds . 20,000 samples

second
Q = 200,000 samples
(b) To achieve a 10 Hz or less spacing between samples of the power spectrum, we require
1
:,; 10 Hz
NT
1
N ~
lOT
20,000
~
10
~ 2, 000 samples
Since N must also be a power of 2, we choose N = 2048.

(c)
K = Q
L
200,000
= 2048
= 97.66 segments
Il we zero-pad the last segment so that it amtains 2048 samples, we will have K = 98 segments.
(d) The key to reducing the variance is to use more segments. Two methods are discussed beltrw.
=
Note that in both methods, we want the segments to be length L 2048 so that we maintain the
frequency spacing.
439
(i) Decreasing the length of the segments to /oth their length, and then zero-padding them to
=
L 2048 samples will increase K by a factor of 10. Accordingly, the variance will decrease by
a factor of 10. However, the frequency resolution will be reduced.
(ii) U we increase the data record to 2,000,000 samples, we can keep the window length the same
and increase K by a factor of 10. ·
10.37. (a) Taking the expected value of
~[m] = 21
1(
1•
-•
I(w),,;"'md,.,
gives
C {¢[ml} = C { 2~ 1_: /(w),,;"'md,,1}

= ~ 1_: E {I(w)} ,;,-dw
2
Using the relation
we find
E {¢[ml} = ~1• [-1-1•

2,r -• 2,, LU -•
P,,(6)C...,(,,;c.,-•>)d8] e'"'mciu
= _1_1• [.!..1"
2,rLU -•
P,.(6)
2r -•
C...,(,,;1.,-•>j_,j"'mciu] dB
Substituting w' =w - 6 in the inner integral yields
Note we can change the limits of integration of the inner integral to be [-", ,rj because we are
integrating over the whole period. Doing this gives
E {¢[ml} = _1_ 1•
2,r LU -•
P,,(e),,;•m
2,r -•
[.!..1'
c• .,(e'"'')_,j"''md,.,'] dB
= 2
,r~U 1_: P.,(6),,;•m {c.,.,[m]}dB
= L~c,..,[m] ( 2~ 1_: P•• (e),,;•mdB]
l
= wc....lmJ;•• [ml
(b)
~p[ml = ! ....I; I[k]e'"..

N-1
"'IN
440
¢p(ml = L
..
By applying the sampling theorem to Fourier transforms, we see that
¢,,(m+rNJ
E ~p[ml} =
..
r=-oo
L E ~•• [m + rNJ}
r=-oo
1 ..
= LU L
c,..,[m+rN]¢,,[m+rNJ
--oo
which is a time aliased version of E {¢,,[ml}.
(c) N should be chosen so that no time aliasing occurs. Since ¢,,[ml is 2L-1 points long, we should
choose N ~ 2L.
10.38. (a) For O :S m :S M,

l Q-m-1
~.. [m) = Q L
..... z[nl:r[n + ml
J [M-1 2M-l KM-1 ]

= Q L :r(n]:r[n + m] + L z(n]:r[n + m] + ... + L :r[nlz[n + ml
J\=O n=M n=(K-l)M
= Ql [M-1
L :r[n]:r[n + ml
.....
M-1 M-1 ]
+ L :r[n + M]:r[n + M +ml+ ... + L :r[n + (K - l}M]:r[n + (K - l}M + m)
..... .....
= bL LK-1 JJ-1
i=O n=O
:r:[n+iM]:r[n+iM +ml
K-1
= .!. :E c.[mJ
Q.,..
where
M-1
e;(m] = L :r:[n + iM]:r[n + iM + m] forO:Sm:SM-1
.....
(b) We can rewrite the expression for e;[m] from part (a) as
M-1
e;(ml = L :r[n + iM]:r[n + iM + ml
.....
JI-J /11-1
= L :r(n+iM]z[n+iM +m)+ L 0-z[n+iM +ml
,,,_,
=<> =M
= L :z:,(n)11,[n +m)
.....
where
.r,[n) = { .r[n + iM], 0::,n::,M-1
0, M::,n:SN-1
!
441
and
11,[n] = :r[n + iM]
Thus, the correlations e;[m) can be obtained by computing N-point linear correlations. Next, we
show that for N ~ 2M - 1, circular correlation is equivalent to linear correlation.
Note that the circular correlation of :r,[n) with 11,[n],

N-1
ey,[m] = L :r,[n)y,[((n + m))N)
n=O
can be expressed as
ey.[m) = Cs,[-m]
N-1
= L :r,[((n - m))N]!l,[n)
n=O
N-l
= L :r:[((m - n))N)!f,[n]
n=O
where :r'[n] = :r[-n]. Note that this is a circular convolution of :r,[-n] with y,[n). Thus, we have
expressed the circular correlation of :r,[n) with y,[n] as a circular convolution of :r,[-n] with 11,[n].
Now recall from chapter 8 that the circular convolution of two M point signals is equivalent to
their linear convolution when N ~ 2M - l. Since we can express the circular correlation in terms
of a circular convolution, this result applies to circular correlation as well. Therefore, we see that
if N ~ 2M -1,
e;[m] c,[m) = for0SmSM-1
Thus, the minimum value of N is 2M - l.
(c} A procedure for computing ¢,.[m] is described below.
step 1: Compute X,[k] and Y;(k], which are the N ~ 2M - l point DFTs of :r,[n] and 11,[n].
=
step 2: Multiply X,[k] and Y;"[k) point by point, yielding C,[k) C,[k) X,[k]Y,•[k). =
step 3: Repeat the above two steps for all data (K times}, then compute
• J K-1
+•• [k) = Q L C,[k) for0SkSN-1
i=O
step 4: Take the N point inverse DFT of +,.[k] to get ¢,,[m).

If
Assuming that a radix-2 FFT, requiring log, N complex multiplications is used to compute the
forward and inverse DFTS, the number of complex multiplications is
If
2 · log2 N · K = KNlog2 N, for step I
KN, for step 2
N, for divide by Q operation in step 3
/f log2 N for step 4
So the total number of complex multiplications is (K + ½)Nlog2 N + (K + l)N.

(d} The procedure developed in part (c) would compute the cross-correlation estimate¢,, without any
major modifications. All we need to do is redefine 11,[n) as
11,[n) = y[n + iM),

and :i:,[n] is the same as it was before, namely
~, [n l = { 0,:i:[n + iM], 0:,n:,M-1

M:,n:,N-1
Note that form < 0, ~•• [m] =~.. [-m].

(e) For N = 2M,
11.[n] = z[n + iM], for O S n S 2M - I

= :i:[n + iM](u[n]- u[n - M]) + :i:[n + iM](u[n - M] - u[n - 2M])
= z[n + iM](u[n] - u[n - M]) + :i:[n - M + (i + l)M](u[n - M] - u[n - 2M])
= :i:,[n] + :t;+1[n - M]
Taking the DFT of this expression yields
Y;[k] = X,(k] + (-1)• X,+,[k]

A procedure for computing~.. for OS m S M - l is described below.
step I: Compute the N point DFT X,(k] for i 0,1, ... ,K. =
= =
step 2: Compute Y;[k] X;[k] + (-1)• X,+1[k] for i 0, l, ... , K - 1.
=
step 3: Let Ao[k] 0 and compute
A,[k] = A,-1[k] + X,[k]Y;"[k], i = 1, ... , K - I

step 4: Define V[k] = AK-i[k]. Compute 11{m], the N point inverse DFT of V[k).
step 5: Compute
• 1
q,,,[m] = Q11[m)
Assuming that a radix-2 FFT, requiring ~ )og2 N complex multiplications is used to compute the
forward and inverse DFTs, the number of complex multiplications is
(K + l)~ log2 N, for step I

0, for step 2
(K - l)N, for step 3
~log2N, for step 4
N, for the divide by Q in step 5
So the total number of complex multiplications is Kfl N log2 N + KN. Note that for large N and
K, this procedure requires roughly half the number of complex multiplications as the procedure
described in part (c).
10.39. (a) Using the relations,
c[n,m]
00
X[n, .\) = L :i:[n + m]w[m)e-;~.. d,\

-=-oo
443
we find
c(n,m] = 2.1•
2• -•
IX[n, .>.)i'ei'md.>.
= ! 1_: X[n, .>.)X[n, ->.)ei'md>.

= 2~ 1_: (too :i:[n + l]w[l]e-;>J) (J: :i:(n + r]w[r]ei'r) ,;>md>.
00
= f. f. :i:[n + l]w[l]:i:[n + r]w[r] ( 1-: •-i>Jei>r_,;>md>.)

l=-oor=-oo
2
~
=
00
L L
00
l=-oo r=-oo
:i:[n + l]w[l]:i:[n + r]w[r] ( 1,r
2
1· ._
"'
)
.-,>(-l+r)_,i>md>.
Using the Fourier transform relation,

o[n - no] ........ -jwn,
we find
00 00
c[n, m] = L L :i:[n + l]w[l]:i:[n + r]w[r]o[m -1 + r]

l=-oo -r=-00
The 6[m - I + r] term is zero everwhere except when m - I + r = 0. Therefore, we can replace the
two sums of land r with one sum over r, by substituting l == m + r.
00
c[n, m] = L :i:[n + m + r]w[m + r]:r[n + r]w[r]

r=-oo
00
= L :i:[n + r]w[r]:r[n + m + r]w[m + r]

r=-00
(b) First, note that
IX[n, >.)1 2 = X[n, ->.)X[n, .>.)

= IX[n, ->.)J 2
Starting with the definition of c[n, m],
c(n, m] = 21
. 1•-• IX[n, >.)I' _,;>m d>.
c[n, -m] = -21 1· IX[n, >.)J 2 .-,.,md>.

,r -·
we substitute .>.' = - >. to get
c{n,-m]
Thus, the time-dependent autocorrelation function is an even function o'"' fur n fixed. Next, we
use this fact to obtain the equivalent expression for c{n, m].
00
c[n, m] = L :r[n + r}w[r]z[m + n + r]w[m + r]

00
= L :r[n + r]w[r):r[-m + n + r)w[-m + r]

r=-oo
Substituting r' = n + r gives

00
= L :r[r']w[r' - n]:r[r' - m]w[(r' - m) - n]
00
= L :r[r']:r[r' - m]w[r' - n]w[-(m + n - r')]

'l""'=-00
00
= L :r[r'}:r[r' - m]h,,.[n - r']

r';-CC)
where
h,,.{r] = w[-r)w[-(m + r)J
(c) To compute c[n,m] by causal operations, we see that
h,,.[r] =w[-r]w[-(m + r)]
requires that w[r] must be zero for
-r < 0
r > 0
and w[r] must be zero for
-(m+r) < 0
m+r > 0
r > -m
Thus, w[r] must be zero for r > min(0, -m). If m is positive, then w[r] must be zero for r > 0.
This is equivalent to the requirement that w[-r] must be zero for r < 0.
(d) Plugging in
2: 0
w[-r} = { 0,a' ' r
r<O
into hm(r] = w[-r]w(-(m + r)], we find
r ~O,r ~-m
h,,.(r] = { 0, otherwise
Ta.king the z-transform of this expression gives
00
Hm(z) = L h,,.(r}z-•
445
Again we have assumed that mis positive. H lzl > a2, then
a'"
Hm(z) =
1- a 2 z- 1
h,,,[r] = a'"6[r] + a 2 h,,,(r - 1]
Using this in the equation for c[n, m] gives
00
c[n, m] = L :r[r]:r[r - m]h,,,(n - r]

r=-oo
00
= L :r[r]:r[r - m] (c'"6[n - r] + a 2 h,,,[n - r - 11)

r=-oo
00
= a'":r[n]:r(n - m] + a 2 L :r[r]:r[r - m]h,,,(n - r - l]
= c'":r[n]:r(n - m] + c2 c(n - l, m]
xtn] --------~ii}-----@----....------+ c[n,m]
a2
(e) Nert, consider the system
[ ] -{
w-r - ra', r;::O
0, r <0
h,,,[r] = {ra' u[r]} {(r + m)a'+'"u[r + ml}

r 2: O;r 2: -m
To get the z-transform H,.(z), recall the z-transform property: r:r(r] +-> -z•~•!_ Using this
property, we find
ra2'u[r] ~
(1- a•z-1)2
a 2 z- 1 (1 +a2 z- 1 )
(1- a•z-•)3
Again we have assumed that m is positive. Thus,

446
am+2 z- 1 (1 + a 2 z- 1 + m - ma2 z'" 1 )

= ~l- ci•z-1)3
am+2 (1 + m)z- 1 + a"'-H(l - m)z- 2
= 1-3a2 z- 1 + 3a4 z- 2 - a•z- 3
Cross-multiplying and taking the inverse z-tra.nsform gives
h,.[r] - 3a2 h,.[r - l] + 3a4 h,.[r - 2]- a 6 h,.[r -3) = am+ 2 (1 + m)6[r - 1) + a'"-H(l - m)6[r - 2)
h,.[r] = 3a2 h,.[r - 1] - 3a4 h,.[r - 2] + a 6 h,.[r - 3] + am+ 2 (1 + m)6[r - l] + a'"-H(l - m)6[r - 2)
Using this relation for h,,,[r) in
00
c{n, m] =L :r[r):r[r - m)h,,,[n - r]

r=-oo
we get
00
c{n, m] = L :r[r]:r[r - m) (3a2 h,,,[n - r - l] - 3a4 h,,,[n - r - 2] + a6 h,.[n - r - 31)

r=-oo
00
+ L z[r):r[r - m) (am+2 (I + m)6[n - r - 1) + a'"+<(l - m)6[n - r - 2])

r=-oo
= 3a2 c{n - 1, m] - 3a4 c[n - 2, m) + a 6 c[n - 3, m]
+a'"+ 2 (1 + m)z[n - l)z[n - 1 - m) + a"'H(l - m)z[n - 2)z[n - 2 - m)
y(n] ,
, .
x[n]
.
X
. '"\
-+, ,. -+ . c[n,m)
z-1 ·,I,; z-1
I,
am+2(m+ 1)z-m
-~
" 3a2
.
.. -~
I, ·v -1
-3a' 2
z-1
I ,
. X '
I,
z-1 a6
'
z-'
am+4(1-m)z-m '" " .
,'
10.40. (a) Looking at the figure, we see that

X[n, .>.) = {(:r[n]e-;>.n) • ho[nl} .,;;.n
= [ f: :r[n - m]e-;>.(n-m)ho[m]] .,;;.n
=-oo
00
= L :r[n - m]ho(m].,;;.m
m.-==-oc
Let m' = -m. Then,

-oo
X[n, .>.) = L :i:(n + m1ho[-m'J•-;>.m'
m•=oo
447
00
= L :i:[n + m']ho[-m1•-;•m•
m'=-oo
= X(n,.>.)
if ho[-m] = w[m]. Next, we show that £or.>. fixed, X[n,.>.) behaves as a linear, time-invariant
system.
Linear: Inputting the signal 4% 1(n] + b:i:2[n] into the system yields
00
L (4Z1[n + m] + b:i:2[n + ml) ho(-m],-;>m =
--oo
00 00
L <1Z1[n + m]ho[-m]e-;>m + L b:i:2(n + m]ho[-m)e-;>m = aX1 [n, .>.) + bX2 [n, .>.)
m=-co --00
The system is linear.

Time invariant: Shifting the input x[n] by an amount I yields
00
L x[n + m + l)ho[-m]e-;•m = X[n + l, .>.)
m=-oo
which is the output shifted by I samples. The system is time-invariant.
Next, we find the impulse response and frequency response of the system. To find the impulse
response, denoted as h[n], we let :i:[n] o[n].=
00
h[n] = L o[n + m]w[m],-j>m

m=-oo
= w[-n]e''n
= ho(n]e''n
Taking the DTFT gives the frequency response, denoted as H(e'"').
H(e'") = Ho(e'(w-1))
(b) We find S(e'") to be
s[n] = (:i:[n]e-;•n) • w[-n]
S(e'") = X (ei<w+>>) W(,-;")
S(e'") = X (ei<w+>)) Ho(e'")
Note that most typical window sequences are lowpass in nature, and are centered around a fre-
= =
quency of w 0. Since Ho(e'") W(,-i") is the Fourier transform of a window which is Jowpass
in nature, the signal S (e'") is also lowpass.
The signal s(n] = X[n, .>.) is mnltiplied by a oomplex exponential ei•n. This modulation shifts the
frequency response of S(e'") so that it is centered at w = >..
h{n] = s{n]e''"
H(e"") = S (,;cw->))
Since S(e'"') is lowpass filter centered at w = 0, the overall system is a bandpass filter centered at
w=>..
448
(c) First, it is shown th.at the individual outputs Y•[n] are samples (in the,\ dimension) of the time-
dependent Fourier transform.
00
Y>[n] = L :i:[n + mjw[mj,-j-'<>m

00
= L :i:[n + m]w[mje-;h>m/N
m=-oo
= X[n, ,\)J.=2d/N
Next, it is shown that the overall output is y[n] = Nw[O]:i:[n].
N-1
y[n] = L Y•[n]
N-1 oc
= L L :i:[n + m]w[m],-;2,>m/N
i:=O m.=-00
oo N-1
= L L x[n + m]w[m],-;2dm/N
oo N-1
= L :i:[n + m]w[m] L ,-;2,>m/N
m=-oo i=O
N6lmJ
= Nw[OJ:i:[n]
(d) Consider a single channel,
decimator expander
In the frequency domain, the input to the decimator is
X ( ,i(w+>,l) Ho(,;,-,)
so the output of the decimator is
½R-1
~ X (,;«w-2,1)/R+>,>) Ho (,;<w-2,1)/R)
The output of the expander is

R-1
.!_ L X (,;<w+>,-2•1/R)) Ho (,;<w-2•1/R))
R l=O
449
The output Y• (ei") is then

R-1
Y.(eiw) = ½L Go (_,i(w->,>) X (ei<w-2•1/R)) Ho (ei<w->,-2sl/R>)
l=O
The overall system output is formed hy summing these terms over k.

N-1
Y(eiw) =
....L Yk(_,iw)
R-lN-1
= ½LL Go (ei<w->,)) X (_,i(w-2•1/R)) Ho (ei<w->,-2•1/R))
h:O 1=0
To cancel the aliasing, we rewrite the equation as follows:

N-1
Y(eiw) = X(ei")½
R-1
....L Ho (ei<w->,)) Go (ei<w->,>)
N-1
+ L X (ei(w-2sl/R)) ½L Go (ei(w->,>) Ho (ei<w->,-2•1/R))
l=l k=O
Aliasing Component
Therefore, we require the following relations to he satisfied so that y(n] = :r(n]:

N-1
}:Go(ei<w->,>)no(ei<w->,-•••/R)) = 0, Vw,andl=l, ... ,R-1
k=O
N-1
L Ho (.,;cw->,)) Go ( .,;<w->,)) = R, Vw
>=O
(e) Yes, it is possible. G0 (_,iw) = NH0 (&w) will yield exact reconstruction.
(f) See chapter 7 in "Multirate Digital Signal Processing" by Crochiere and Rabiner, 1983.
(g) Once again, we consider a single channel,
decirnator expander
From Part (a), we know that the output of the filter ho(n] is
00
X[n, >.•) = L :r[m]ho[n - m],-;>,m

m=-oo
450
or, using>.•= 21rk/N,

co
X[n, k] = L :i:(m]ho(n - m]e-i•••mfN
m=-00
Therefore, the output of the decimator is
co
X(Rn, k] = L :i:(m]ho(Rn - m]e-i2"'m/N
m=-oo
Recall that in general, the output of an expander with expansion factor R is

co
:i:,(n] = L :i:(l]o(n - lR]
l=-00
This relation is given in chapter 3. Therefore, the output of the expander is

co
L X[Rl,k]o(n-lR]
t•-oo
This signal is then convolved with 9o(n], giving

co co co
L L X[Rl, k]o(m - lR]9o(n - m] = L X(Rl, k)g0 (n - lR]
m=-oo l=-o::i t=-oo
Therefore,
y,(n] = ;f,co go(n - lR] (Jco :i:(m]ho[RI - m]e-i••>m/N) ei 2•h/N
y(n] = ~ ,f;co 9o(n - lR] (mtco :i:(m]ho(RI _ m],-i2,.m/N) eJ2•h/N
N-1 cc oo
= L L 90(n - lR] L :i:(m]ho[RI - m]e-;2<•(m-n)/N
•=o l=-oo m=-oo
N-1
= 9o(n - lR]ho[RI - m]:i:[m] L eJ2•k(n-m)/N

l=-00 m=-oo •=0
Now recall that I::~•
,;z,.(n-mJ/N = No[((n- m))N], by considering it as a Fourier series ex-
pansion, or as an inverse DFT of Ne-;2 rmJ:./N. Thus,
N-1 oo
L ei•"'(n-m)/N = N L 6[n - m - rN]
k=O r=-oo
where r is an integer. Therefore,

co co co
y[n] = L L 9o(n - lR]ho(lR - m]:i:(m]N L 6(n - m - rN]
t=-oom=-oo r=-oo
CO 00
= NL L 9o[n-lR]ho[lR-n+rN]:i:(n-rN]
co 00
= N L :i:[n - rN] L 9o[n - lR]ho[lR + rN - n]

r=-oo t=-o::i
451
Therefore, if we want y[n] = z[n], we require

..
L 9o[n - lR]ho[tR + rN - n] = cS[r] ·
l=-oo
for all values n.

(h) Intuitively, we see that it is possible since we are keeping the necessary number of samples. H
9o[n] = o[n] find that
00
L cS[n - lR]ho[lR + r N - n] = ho[rNJ

l=-oo
= cS[r]
since ho[rJ\1 is zero for all values of r, except r = 0, where it is equal to 1. Thus, the condition
derived in Part (g) is satisfied.
(i) See Rabiner and Crochiere or Portnoff. (Hint: consider an overlap and add FFT algorithm.)
10.41. Note that h[n] is real in this problem.
(a) First, we express y[n] as the convolution of h[n] and :r[n].

00
y(n] = L h(k]:r(n - k]
k=-oo
The autocorrelation of y(n] is then
9'>,.[m] = £ {y[n + m]y[n]}
= £ {.too h[k]:r[n + m - k] ,too h[l]:r[n - !] }

.. 00
= L L h(k]h(1]£ {:r(n + m - k]:r(n - I]}

P-ool=-oo
.. 00
= L L h(k]h(/]9'>.. [I + m - k]
~-ool=-oo
Since :r(n] is white noise, it has the autocorrelation function
9'>.. (1 + m - k] = u;o[I + m - k]
Substituting this into the expression for 9'>,.[m] gives
00 00
4>,,[m] = ~ L L h[k]h[l]o[I + m - k]
00
= u; L h(l + m]h[I]
l=-oo
Note that 00
4>,,[m] = ~ L h[l - m]h[I]

l=-oo
is also a correct answer, since 4>,,[m] = 9'>,.(-m].

452
(b) Taking the DTFT of 1/>n[m] will give the power density spectrum t,.(w).
+.. (w) = m=f;oc { ~ ,f:.. h[I + m]h[ij} •-;.,m
oc oc
= ~ L h[ij L h[l + m],-;.,m
l=-oo m=-oo
Substituting k = l + m into the second summation gives

oc oc
+.. (w) = O'! L h[ij L h[k],-jw(t-1)
l=-oo l:=-oo
oc oc
= ~ L h[ij,j"'' L h[k],-;...
l=-oo l:=-oo
oc oc
= O'! L h[-ij,-;.., L h[k],-;.. t
l=-oo l:=-oo
= O';H"(,j"')H(,j"')
2
= ..; IH(,;"')1
(c) This problem can be approached either in the time domain or the z-transform domain.
Time domain: Since all the at 's are zero for a MA process,
JI
y[n] = L bt:[n - k]
t=O
so y[n] is nonzero for 0 :5 n :5 M. Note that the autocorrelation sequence,

oc
,t,.,[m] = L
n=-oo
y[n + m]y[n]
can be re-written as a convolution

oc
,t,,.[m] = L g[m - n]y[n]
n=-oo
where g[n] = y[-n]. Therefore,

,t,,.[n] = 11[-n] • y[n]
Since y[-n] is nomero for -M :5 n :5 0, and 11[n] is nonzero for 0 :5 n :5 M, we see that their
convolution 1/>n[m] is nomero only in the interval 1ml :5 M.
Z-transform domain: Note that
t,.(z) = ~H(z)H"(z)
If all the Ot 's = 0, then
JI
H(z) = Lb•,-•
....
JI JI
t,.(z) = Lb••-•Lb;z'
l:=O tao
453
The relation for +.. (z) above is found by multiplying two polynomials in z. The highest power
of z in +.. (z) is z>L which arises from tbe multiplication of the k = 0 and I= M coefficients.
The smallest power of z in +n(z) is z-M which arises from the multiplication of the k = M
and I= 0 coeflicents. Thus, ,.,(m] is nonzero only in the interval 1ml SM.
(d) For an AR process,
H(z) = bo
_.N a.11:z -•
1 - L....t;:=1
bo
Since
+.. (z) = a;H(z)H•(z)
+,,(z) = - N - - - -If."1" ' - - - -

nbl (1 - o.z- )(1 - o;z)
Thus, the poles for +,,(z) come in conjugate reciprocal pairs. A sample pole-zero diagram appears
below.
X X
Im
X X
Re
Nth order zero X X
Nth order zero at z = ~
X X
By performing a partial fraction expansion on +,,(z) we find that each pole pair contributes a
sequence of the form A•or' 1
~<{ml
and therefore
~·-
~ M
N
'-•(m] = L A•ol"'
k=l
1
454
(e) For an AR process, with ho= 1,

H(z) = Y(z) = 1
X(z) 1- ~ 1 "••-•
which means that

N
y[nJ = L at11[n - kJ + :r:[nJ
r-1
The autocorrelation function is then
9'>.,[mJ = q,.,[-mJ
= £ {11[n - mJy[n]}
= £ { 11[n - mJ (t.aw[n - k) + :z:[nJ)}
N
= L "•£ {y[n - m]y[n - kl} + £ {y[n - m):z:[n]}
t=t
N
= L at9'>.,[m - k] + 9'>,.[-m)
t=l
N
= L 4t¢..,,[m - kJ + ¢,,[mJ
l:=l
Form= 0,
N
9'>.,,[oJ = L ... ¢.,[-kJ + ¢.,[oJ
bl
The ¢,, [OJ term is
¢,,[OJ = £ {:z:(nJy[n]}
= £ { :r:(nJ (t. 4t!l[n - kJ + z[nJ) }

N
= L "•£ {z[nJy[n - kl}+£ {z[nJz[n]}

l:=l
N
= L "•£ {z[n]y[n - kl} + a;

t=l
Note that :r:(nJ is uncorrelaled with the y(n - k], for k = 1, ... , N. Therefore,
¢,,(OJ= a;
Thus,
N
q,.,,[OJ = L ...q,.,,[-k] + ~
1st
N
= L citq,.,,[kJ + a!
t=l
455
since ¢,,[k] = ¢.. (-k]. Form 2: 1,

,,
¢.. (m] = L a.¢.. (m - kj + ¢.,(m]
,,
t=l
= L a.¢.,(m - k]
lr-1
since ¢.,[m) is zero for all m 2: 1.

(f) By symmetry of the a.utocorrelation sequence, we know that
¢.. (m - k) = ¢yy(k - m]
= ¢.,(Im - kl]
Thus,
,, ,,
L a•¢.. [lm - kl] = L a.¢.. (m - k]
bl ,l;:l
Using the result from part (e), we get

,,
L a•¢,,(lm - kl] = ¢,.(m)
t=l
form= 1,2, ... ,N.
10.42. (a) Sampling x,(t) we get
x(n) = x,(nT)
= :6 t GY.'ej(2•/16)kn
t:-4
Define the periodic sequence Xlk] to be
1/2
••• •••
1/4
16. k
-16 -4 0 4
Then we see that we can write :r(n] in terms of X[k]:
z(n] =
•
..!_ ""' X(k]ei<•• 1••>0n
16 L,
-=-•
7
= .!. I: X(k]ei<
16 ..,_,
2•/ll)b
= IDFS{ X(k]}
456
However, since the period we use in the sum of the IDFS is unimportant we ·can also write
,.
.:i:(n] = .!_ L X[k]~(2r/16)•n
16 ....
= IDFS{X(k]}
= IDIT{Xo(k]}
where Xo[k] is the period of X[k] starting at zero, i.e.,
Xo[k] ={ X[k], k=0, ... ,15

0, otherwise
Using this information we can now find G[k]

G[k] = DIT{g(n]}
= DIT{:r[n](u[n] - u(n - 16])}
= DIT{:r[n]}
= DIT{IDIT{Xo{k]}}
= Xo[k]
Thus, G[ k j looks like
G[kj
112 112
114 1/4
118 118
1/16 1/16
k
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
(b) We want to find a sequence Q[k] such that
q[nj = a:rc (n:;r)

= ~ L• (½)1•1 ~(2r/32)h
k=-4
We can apply the same idea as we did in part (a), except now the DFS and DFT siu should be
32 instead of 16. Going through the same steps will lead us to the sequence Q(k] that looks like:
Q{kj
1/2 112
1/4
20 31 k
0 4 8 12 16 24 28
457
(Here we have assumed o = 1). We see that we can interpolate in the time domain by zero padding
in the middle of the D FT samples.
10.43. (a) Using the relation,
0$_k$.N/2
N/2$.k$.N
where N is the DFT length and T is the sampling period, the continuous-time frequencies corre-
sponding to the DFT indices k = 32 and k = 231 are
32
(2:xi){l/20, 000)
= 2500 Hz
231-256
(256)(1/20, 000)
= -1953 Hz
(b) Since
i[n] = :i:(n]wR(n]
the DTFT of :r[n] is simply the periodic convolution of X(e'"') with WR(<'"').
(c) Multiplication in the time domain corresponds to periodic convolution in the frequency domain, as
shown in pa.rt (b). To evaluate this periodic convolution at the frequency w32 = 2,r(32)/L, {where
L = N = 256) corresponding to the k = 32 DFT coeflicient, we first shift the window W0 ,,(e'"')
to "'32· Then, we multiply the shifted window with X(e'"'), and integrate the result. In order for
x••,(32] = o.X(31] + .X[32] + o.X[33]

we must therefore have
!
l, w = 0
w.,,(e'"')= o, w=±21r/L
0, 21fk/L, fork= 2,3, ... ,L-2
Note that we are only specifying W0 ,,(e'"') at the DFT frequencies w = 2,rk/ L, fork = 0, ... , L-1.
(d) Note that the L point DFT of a rectangular window of length Lis
L-1
WR(k] = ~)l)e-/2d/L
=<I
1- e-;z.i
= 1- e-j2•11L
= U(k]
W0 ,,(e'"') is only specified at DFT frequenciesw = 2rk/L, and it can take on other values between
these frequencies. Therefore, the DTFT of w.,,(e'"') can be written in terms of WR(e'"') and two
shifted versions of WR(<'"').
w••• (e'"') = LWR (ei<w+2•/L)) + ½wR(e'"') + LWR (e1<w-2•/L))

458
(e) Taking the inverse DTFT of W0 ,,(,Jw) gives w0 ,,[n].
w ••,[n]
A sketch of "'••• [n] is provided below.
2/256
1/256
0 L...,:::.__ _..,__ _ _..,__ _ _..,__ _..::::,....._

n
0 64 128 192 256
10.44. (a) After the Jowpass filter, the highest frequency in the signal is 6,,;. To avoid aliasing in the
downsampler we must have
twM $ ,r
,r
M $ 6w
N
$
2kA
N
Mma:,;=-
2k,.
(b) The Courier transform of x,[n] looks like
-lt lt/6 " {I)
so M = 6 is the largest M we can use that avoid• aliasing With this choioe of M the fourier
transform of x,[n] looks like
459
-It 0 It (I)
Taking the OFT of z,[n] gives us N samples of X,(eiw) spaced 27f/N apart in frequency. By
examining the figures above we see that these samples correspond to the desired samples of X(e;w)
which will he spaced 2.0.,,,/N apart inside the region -.0.,,, < w < t:.w.
Note that after downsampling the endpoints of the region alias. Therefore, we cannot trust the
values our new OFT provides at those points. However, the way the problem is set up we already
know the values at the endpoints from the original OFT.
(c) The system p{n] periodically replicates XN[n] to create XN[n]. Then, the upsampler inserts M -1
zeros in betweeen each sample of .XN[n]. Thus, the samples k, - I;,._ and k, + I;,._ which border
the zoom region in the original OFT map to M(k, - k,._) and M(k, + k,._). The system h[n] then
interpolates between the nonzero points filling in the "missing" samples. Since the linear phase
filter is length 513 it adds a delay of M/2 = 512/2 = 256 samples so the desired samples of XNM[n]
now lie in the region
M(k, - k,._) + 256 :, n :, M(k, + k") + 256

k;-k~ $n $ k;+k6
where
k; = Mk,+ 256
k~ = Mk,._
(d) A typical sketch of X(eiw) and XN[k] look like.
X(ei"'J
It (I)
460
0 N-1 k
After periodically replicating and upsampling by M we have a signal that looks like
~[n] alter upsampling
M-1 zeros
...
l
•••
0 M(N-1) n
Filtering by h[n] then interpolates between the samples. XNM[n] is shown below if we assume that
h[n] is the ideal zero phase filter. The points with an x correspond to the interpolated points.
~[n]
interpolated points
.. . i •••
0 M(N-1) n
Thus, we need to extract the points
M(k. - k..i.) $n$ M(k,, + k..i.)

A:~-k~ :Sn:5 1::+k~
461
where
k' = Mkc
C
k'c,. = Mkc,.
Discrete Hilbert Transforms

465
11.1. Using the fact that :t,[n] is the inverse transform of?u we get
?u{X(,;w)} = 2 _ ,.,;w - ,u-;w
:z:,(n] = 26(n] - 4<5[n + 1) - 0<5[n - 1)
Since :z:(n] is causal, we can recover it from :t,[n]
:z:(n] = 2:t,[n)u[n) - :z:,[O]o(n] = 26(n] - 2ao[n -1]

This implies that
z.[n] = :z:[n] - 2:[-n] = d(n + l] - 4<5[n - l]
and since jim{X(,;w)} is the transform of :z: 0 [n] we find
Im{X(,;w)} = 2asinw
11.2. Taking the inverse transform of ?u{X(,;"')} = 5/4- wsw, we get
5 1 1
:z:,(n] = o[n] - iln + l] -
4 2o(n - l]
Since x(n] is causal, we can rewver it from :z:,[n]
5
x(n] = 2:t,[n]u[n] - :z:,(O]o(n] = 4"[n] - o[n - l],
11.3. Note that
1
:z:[n] = o(n] - iln - l]
but this does not satisfy the conditions on z[n] given in the problem statement.
1
:.[n] =o[n - l] - -o[n - 2]
2
wbicb satisfies all the constraints. The idea behind this choice is that cascading 4 signal with an allpass
system does not change ~be magnitude squared response.
Another choice that works is X(,;w) = ½(1- :ze-;.,)•-;w for which we get
1
:z:(n) = 26(n - 1) - o(n - 2]
The idea behind this choice was to flip the r.ero to its zeciprocal location outside the unit circle. This
has the same magnitude squared response up to a scaliDg factor; hence, the ½ierm.
466
11.4. Take the DTFT of :z:,[n] to get
1 1 1
:z:,[n] = 2o(n] - ;.6fn + 2] - iln - 2]
. 1 1
X,(e"") = 2 - 2cos2w.
where X,(dw) = !(X(~) +X•(~)] is the conjugau ,vmmetric part of X(~). Since X(dw) = 0 for
-.- :S w < 0 we have
= { 2X,(&"'), 0 :S w <"'
0, otherwise
= { l-cos2w, 0:Sw<O'
0, otherwise
Thus,
and
Im{X(eiw)} = 0.
About Notation: XR(eiw) with a capital R is the real part of X(eiw). X,(e'w) with a small r is the
conjugate symmetric part of X(&"') which is complex-valued in general.
11.S. The Hilbert transform can be viewed as a filter with frequency response
0 < w < ,r,

-ir<w<0.
(a) First, take the transform of :z:,[n]
X,(ei"') = .-o(w - wo) + .-o(w + wo).

Now, filter with H(&"') and take the inverse transform to get z,(n]
X,(ei"') = H(ei"')X,(ei"')
= -j.-o(w - wo) + j,ro(w + wo)
z,(n] = sinwon
(b) Similarly, z,(n] = - cos won.
(c) ;r,[n] is the ideal low pass filter
sin(wcn) { 1, lwl :S "'•

.,, In l = '"' +-+ 0, "'• < lwl :S .-
After filtering with the Hilbert tranformer - get
0:Sw:Sw.
-we:Sw:$0
"'• :S lwl :S,,.
r. ._,. . .,_ r· ._;., . .,_

Taking the inverse transform yields
1- cosw.n
I 1 2,r1
:tin=-
-we
1e"'" uw---
1
2,r O
Jc- ur.&1=
,m
467
11.6. Using Euler's identity,
;x,(e-i"') = j(2sinw - 3sin 4w)

= 2 ( &"' _/_,.,) - 3 ( ,.;•• _/_;.,.,)
= -~e-i.., + e'" - ,-i• + ~,-,..,

2 2
Since Zo[n] is the inverse transform of jX 1 (&"') we get
3 3
z 0 [n] = -i[n + 4] + a[n + lj - a[n - 1] + i[n - 4]
Because z[n] is real and causal we can recover most of x[n], i.e.,
z[n] = 2z0 [n]u[n] + z[O]o[n]
= z[O]o[n] - U[n - lj + 35[n - 4]
The extra information given to us allows us to find z[O],
6 = X(e'"')I., ...
"" z[n]e'"(OJ
= I:
n.=-oc
= z[O]- 2 + 3
Plugging this into our equation for z[n] we find
z[n] =SJ[n] - U[n - l] + 35[n - 4)
11.7. (a) Given the imaginary part of X(&"'), we can take the inverse DTFT to find the odd part of z[n],
denoted z 0 [n].
Im {X(e'"')} = sinw + 2sin2w

= 2.,-,. - 2.,-i• + !,-,""' - !,-;:,,.,
2j 21 j j
= !,-'""' + 2_,.,., - 2.,-;. - !.-;....
j 2j 2j j
z 0 [n] = 'DF, 1 (;Im {X(e'"')}]

= 'DFT-' [e'""' + ~,-,• - ~•-;• - ,-;:,.,]
1 1
= o[n + 2] + 26[n + 1] - 2o[n - 1] - o[n - 2]
Using the formula z[n] = 2z0 [n]u(n] + z[O]o[n], we find

z[n] =-o[n - l] - 26[n - 2] + :i:[O]o[n]
Any z[O] will result in a correct solution to this problem. Setting z[O] = 0 gives the result
z[n] = -<l[n - lj - U[n - 2]
468
(b) No, the answer to part (a) is not unique, since any choice for :r(O] will result in a correct solution.
11.8. Using Euler's identity and the fact that :r0 (n] is the inverse transform of jX1(ei"') we find
jX1(~) = 3jsin2w
= 3( ,;2w -;e-;2w)
3
:r.(n] = 2(6[n + 2] - o(n - 2])
Because :r(n] is real and causal we can recover all of :r(n] except at n =0,
:r(n] = 2:r0 (n]u(n] + :r(O]o[n]
= -36(n - 2] + :i:(O]o[n]
Therefore,
:r[n] + :r(-n]
:r,(n] =
2
(-36(n - 2] + :i:(O]o[n]) + (-36[n + 2] + :r[O]o(n])
= 2
3 3
= - iln + 2] + :i:(O]o(n] - iln - 2]
Using the fact that XR(e;"') is the transform of :r,[n] we find
XR(ei"') = -~ei..,
2
+ :r(O] - ~,-;2w
2
= :r[O] - 3 cos 2w
Thus, XR2(ei"') and XR3(ei"') are possible if :r(O] = -1 and :r(O] = 0 respectively.
11.9. (a) Given the imaginary part of X(ei"'), we can take the inverse DTIT to find the odd part of :i:[n],
denoted :i:0 (n].
Im {X(ei"'l} = 3sinw + sin&.,

= ~ei"' - ~ -jw + 2_,;:,., - 2.. -;:,.,
2j 2/ 2j 2/
= 2_,;:,., + ~,;., - ~.-;.. - 2..,-;:,.,
2j 2j 2j 2j
:r0 (n] = 'D:FT 1 [;Im {X(ei"'l}]

= 'D:FT' [!.,;:,., + ~~ - ~,-;., - !e-;""']
2 2 2 2
I 3 3 I
= iln + 3) + o(n + I] - iln - I] - 2 o(n - 3]
2
Using the formula :r(n] = 2:r0 (n]u(n] + :i:(0]6[n], we find
:r(n] = -36(n - l] - o(n - 3] + :r(O]o(n]
Taking the DTIT of :i:(n] gives
469
Evaluating this at w = ,r gives

X(eiw)i..,=• = -:i,-i• - •-;b + z(O] = 3
3+l+z(O] = 3
z(O] = -1
Therefore,
z(n] = -3o(n - l] - o[n - 3] - o(n]
(h) Yes, the answer to part (a) is unique. The specification of X(eiw) at w = ,r allowed us to find a
unique z(n].
11.10. Factoring the magnitude squared response we get
· 2 ~ - COSW 1- COSW + !4 {I - !e-iw)(l - !eiw)

jH(e'w)I = s\ 4cosw = I +4cosw + 4 = (I+ ~-,w)(J + ~iw)
IH(,)1
2 = {I - ½z-1
)(1 - ½z)
(I+ 2z- 1 )(1 + 2z)
= H(z)H"(I/z")
Since h(n] is stable and causal and has a stable aod causal inverse, it must he a minimum phase system.
It therefore has all its poles and zeros inside the unit circle which allows us to uniquely identify H(z)
from JH(z)! 2 • ·
H(z) = 1+2z
izl > ½
11.11. Note that z,(n] can be written as
z,(n] = -46[n + 3] + 46(n - 3]

Taking the DTFT of z,(n] gives
X,(ei"') = -4ei.., + 4e-,..,

= -4(2jsin3w)
= -8jsin3w
Since X(ei"') = 0 for -,r $ w < 0, we cao find X(ei•) using the relation
X(ei") = { 2jX,(e'"), 0 < w < ,r

0, -11' :S w < 0
470
Thus,
0 < w < ,.
< 0
Therefore, the real part of X (&"') is
X,(&"') = ½[X(ei"') + x•(•-;"')]

= { 8sin3w, 0 < w < ..
-8sin3w, -.- :5 w < 0
11.12. (a) Factoring the magnitude squared response we get
_;"'ll2
IH( e- = -10 - -2 cosw = 1 - -2 cosw + -1 = ( 1 - 1___ ,.,
. ) ( 1 - -e'
1 ·.,)
9 3 3 9 3 3
= H(ei"')H"(ei"')
Thus, one choice for H(e;"') and h[n] is
H(ei"') = 1- !,-;.,
3
1
h[n] = o(n] - 1]
3o[n -
(b) No. We can fiud a new system by taking the zero from the original system and ftipping it to its
reciprocal location. This only changes the magnitude squared response by a scaling factor. If we
compensate for the scaling factor the two magnitude squared responses will be the same. Thus, we
find
= !c1
3
- 3,-;"'l
1
h(n) = 3"[n] - U[n - 1]
satisifies the given conditions.

11.13. Expressing XR(e 1"') in terms of complex exponentials gives
XR(e'"') = 1 + cosw + sinw- sin2w

= l + !e'"' + !,-;., + _!_.,;w _ _!_,-;., _ _!_.,;2w + _!_ 0 -j2w
2 2 2j 2j · 2j 2j
= _ _!_.,,., + !e'"' + _!_.,., + 1 + !,-jw - _!_,-,., + _!_,-j2w
2j 2 2j 2 2j 2j
Taking the inverse DTFT of XR(e 1"') gives the conjugate-symmetric part of :i:[n], denoted as :i:,(n].
1 1 1 1 1 1
:i:,[n] = - ,a(n + 2) + 2"1[n + 1) + ,a[n + 1) + 6[n) + 2o[n - 1) - ,a(n - 1) + ,a[n - 2]
2 2 2 2
Using the relation x(n] = 2x,[n]u[n] - x,[0]o[n],
:i:[n] = o[n] + 6[n - l] + jo[n - 1] - j6[n - 2]

471
We then find the conjugate-antisymmetric part, :z:0 [n] as
:i:0 (n] = !2 (z[n] - z•[-n])

= !2 (o(n] + o[n - I]+ jo(n - l] - jo(n - 2] - o(n] - o(-n - l] + jo(-n - l] - jo(-n- 2])
= 1 (o[n - I]+ jo[n - l] - jo(n - 2] - o[n + l] + jo(n + l] - jo[n + 21)

2I . .
= - 2 (o[n + l]- o[n - I])+½ (o(n + l] + o(n - 11) - ½ (o[n + 2] + o[n - 21)
Taking the DTFT of :z:0 (n] gives jX,(&'").
= _! {&w _ e-jw) + ! {&w + •-jw) _ ! (&2,,, + .-j2,,,)

2 2 2
= -jsinw+jcosw-jcos2w
So
Xr(&'") = -sinw + cosw - cos2w
11.14. First note that,

(a) The inverse transform of XR(e'w) is z,(n], the even part of z(n]. This is true for any sequence
whether it is causal, anticausal 1 or neither.
(b) jX 1 (e'w) is the transform of :z:0 [n], the odd part of z[n]. This is true for any sequence whether it
is causal, anticausal, or neither.
(c) For an anticausal sequence
z(n] = 2:z:,(n]u(-n] - z,(O)o(n]
Using Euler's identity and (a),
XR(&w) = f: (D • cos(kw)
= 1+ ~
k=O
t (~) \&tw + ,-jkw)
z,[n] = o(n] +~I;(~)• (6(n + k] + o(n - kl)

l=l
Using (c) and then taking the odd part we get,
z[n] = 2:z:,[n]u[-n] - z,[0]6[n]
= o[n] +
z[n]-z[-n]
Ler
l=l
00
2 6[n + k]
:z:0 [n] =
= 2I ~ 2 00 er
2
(o[n + k] - o[n - kl)
472
Now taking the DTFT and using (b),
jX1(ei"') = ½f: (½)' (ei.., - ,...:,..,)

1=1
j ~ (1)' sin(kw)
00
= 2
j ~ (1)' sin(kw)
00
= 2
Thus,
= L (1)'
00
X1(e'"')
_
....
2 sin(kw)
11.15. Given X,(eJ"'), we can take the inverse DTFT of jX,(,;"') to find the odd part of z(n], denoted z 0 (n].
Im {X(.-J"')} = sinw
= _!_e3"' _ 1-e-iw
2j 2j
:z: 0 (n] = v:rr- 1 [jim {X(ei"')})

= V:FT- 1 [½e'"' - ½•-;"']
= 21 o(n + l] - 21 o(n - l]
Using the formula z[n] = 2z 0 (n]u(n] + z(O]o(n),

z(n] = -o(n - l] + z(O]o[n]
Since
00
L
n=-oo
z[n]=3
-1 +z(O] = 3
z(O] = 4
Therefore,
z(n) = 4o(n] - o[n - l]
11.16. Using Euler's identity and the fact that z,[n] is the inverse transform of XR(eJ"') we have
XR(ei"') = 2 - 4cos(3w)
= 2 - 2(eJ"' + ,-;.. )
z,[n] = -2o(n + 3] + 2o(n] - 2o[n - 3]

Since z(n] is real and causal, it is fnlly determined by its eTen part z,[n],
z[n] = 23:.(n]u(n) - z,(0]6(n]
= 4o(n] - 4o(n - 3] - 2o[n]
= 26[n] - 4o(n - 3]
473
Using this information in the second condition we find

..,
xc,;wllw=• = I:
=-..,
:r[n],;•n
..,
= L :r[n](-l)n
n.=-00
= 2+4
"F 7
Thus, there is no real, causal sequence that satisfies both conditions.
11.17. There is more than one way to solve this problem. Two solutions are presented below -
Solution 1: Yes, it is possible to determine :r[n] uniquely. Note that X(k], the 2 point DFT of a real
signal :r(n], is also real, as demonstrated below.
1
X(k] = L :r(n]e-;2...•12
n=O
1
X(k] = L:r[n](-clr•
n=O
Thus,
X[O] = :r(O] + :z:[l]
X(l] = :z:[O] - :z:(l]
Clearly, if :z:[n] is real, then X[k] is real. Therefore, we can conclude that the imaginary part XI[k]
is zero.
Therefore, the inverse DFT of XR[k] is :z:[n], computed below.
1
:z:(n] = ½L XR[k],;••n>f•
k=O
1
:z:(n] = ½LXR(k](-l)n>
k=O
1
:z:[O] = 2{XR(O] + XR(l])
= -1
1
:z:(l] = 2
{XR(O] - XR(l])
= 3
Thus,
:z:(n] = -5(n] + 36(n - l]
Solution 2: Start by making the assumption that X(k] is complex, i.e., X1[k] is nonzero and XR[k] =
U(k] - 4J(k - l]. Then, because z.,.(n] is the inverse DFT of XR[k] we find
z.,.(n] = ! t
2.,..
X R[kj,;••,../2
1
= ! LXR[k]{-l)n>
2.,..
474
and
= 21 (XR[0] + XR[l])
= -1
= 21 (XR[0] - XR[l])
= 3
z,,[n] = -o[n] + 36[n - l]
Because z[n] is real and causal, we can determine it from z.,[n]
z.,[n], n=0
2:t.,[n], 0 < n<N/2
z[n] =
z.,[N/2], n=N/2
0, otherwise
With N = 2 we bave
z[n] = -o[n] + 36[n - 1)
If we began by making the assumption that X[k) was real, i.e., Xr[k) = 0 and X[k) = XR[k] =
26[k) - 46[k - 1) than by taking the inverse transform we find that
z[n] = z.,[n] = -o[k] + 36[k - 1)
This is the same answer we got before. Since there was no ambiguities in our determination of
z[n], we conclude that z[n) can be uniquely determined.
The next problem shows that when N > 2, we cannot necessarily uniquely determine z[n) from
XR[k] unless we make additional assumptions about z[n] such as periodic causality. When N > 2
the two assumptions we used above leads to two different sequences with the same XR[k].
11.18. Sequence 1: Fork= 0, 1,2 we have
XR[k] = 9o(k] + 66[k - 1) + 66[((k + l)),]
and XR[k] = 0 for any other k. Using the DFT properties and taking the inverse DFT we find for
n =•l,2,3
z,,[n) = 3 + 2 ( ,'(2•/l)n + •-j(2•/3)n)
= 3 + 4 cos(2irn/3)
= 76[n] + o[n - 1) + o[n - 2)
If we let x[n) = z,,[n) we have the desired sequence.
Sequence 2: If we assume z[n) is periodically causal, we can nse the following property to solve for
x[n] from z,,[n):
z.,[0], n = 0
z[n) = 2:t.,[n), 0 < n <
{ 0,
1
otherwise
Note that this is only true for odd N. For even N, we wowd also need to handle the n = N /2
point as shown in the chapter. We have
z.,[0J, n = 0
z[n) = 2:t.,[n), n = 1
{ 0, otherwise
= 76[n) + 26[n - 1)
475
11.19. Given the real part of X[k], we can take the inverse DIT to find the even periodic part of :i:[n],
denoted 2'cp[n].
Using the inverse DIT relation,
we find
1
:i:cp[0] = 4(4+1+2+1)=2
:i:cp[l] = !.(4+j-2-j)=!.
4 . 2
1
%cp[2] = -(4-1+2-1) = 1
4
2'cp[3] = -I (4 - ,. - 2 +1.) =-
1
4 2
Thus,
1 1
:i:cp[n] = 2o[n] + i5[n - 1] + o[n - 2] + i5[n - 3]
Next, we can relate the odd periodic and even periodic parts of :i:[n] using
:i:cp[n], 0 < n < N/2
z.,.[n] = -zcp[n], N/2 < n:, N - 1
{ 0, otherwise
Performing this operation gives
1 1
z.,.[n] = -o[n - l] - -o(n - 3]
2 2
Taking the DIT of z.,.{n] yields jX1[k]. Using the DIT relation,
N-1
jX1(k] = L :i:.,.[n]W"'
=<>
we find
iX1(0J = (o+½+o-½) =0
iX1(1J = (o-! +o-½) = -i

iX1(2] = (o+½+o-½) =0
iX1(3J = (o+½+o+~) =i
Thus,
jX,[k] = -;o[k - l] + jo[k - 3]
11.20. As the following shows, the second condition implies :i:[0] = 1.
z[0] · = !_
6.,_.
t X[k]ei<••l•l""I
-
•
= ~ LX[k]
=
....
1
. 476
This condition eliminates all choices except :t 2[n] and :t3(n].

The odd periodic. parts of :t 2(n] and :t 3(n] for n = 0, ... , 5 are
:t2(n]- :t 2[((-nll•l
= 2
1
= -3 (o(n - 4] - o[((n + 4)).]) -
.
!3 (o[n - 5] - 6[((n + 5)).])
:t3(n] - :t3(((-n)) 6 ]
:t.,.(n] = 2
1 1
= 3
(o(n - l] - 6(((n + 1))6 ]) -
3 (6(n - 2] - o[((n + 2)) 6])
For n < 0 or n > 5, these sequences are zero. Since the transform of :t.,(n] is jX,[k] we find for
k = 0, ... ,5
jXi,[k] = ~ ( ,-;<••!•>•• _ ,;<••l•l") _ ~ ( •-;C>•l•l" _ ,;c••l•l.,)

= -~j sin(4rk/3) + ~j sin(5rk/3)
= ;2- (-o(k- 2J + o[k -4])

../3
jX,,[k] = ~ (,-,<••I•>• _,;c••I•>•)- ~ (,-;c2r/6Jn _,;c••l•>2>)
= -~jsin(rk/3) + ~jsin(2rk/3)
= j_!_(-6[k-2]+6[k-4])
../3
Thus, both x 2 [n] and :t 3 (n] are consistent with the information given.
11.21. (a) Method 1:

We are given
XR(pe.iw) = U(p,w)
= l+p- 1 acosw
Since au
7ii
= ! av we have
p&.1 '
Since ~ = -¼ ~ we have,
¥.' -¼~
ap-• sinw + K'(p) = ap-• sinw
Thus,
K'(p) = 0
K(p) = C
477
Since :i:(n] is real V(p,w) is an odd function of w. Hence, V(p,O) = 0, implying that C = 0.
Therefore,
xu,e;"'l = U(p,w) + jV(p,w)

= 1 + p- 1ocos"" - jp- 1osinw
= 1 + op- 1(cosw - jsinw)
= 1 + op-•,-,-,
X(z) = 1 + oz-•
(h) Method 2: Since XR(&"') is the transform of :i:,[n] we have
XR(&"') = 1 + ocosw
= Q . Q
1 + -t:'W + -e-JW
2 2
.
0
:i:,(n] = o(n] +
Q
2o(n + l] + 2o(n - l]
Because :i:(n] is real and causal, we can recover ,: 0 (n] from x,[n] as follows
{ ,:,(n], n>O
:i: 0 [n] = 0, n=O
-:i:,(n], n<O
0 Q
= --o(n + 1] + -o[n - l]
2 2
Thus,
:i:[n] = :i:,(n] + ,: 0 [n]

= o(n] + oo(n - l]
X(z) = 1 +oz- 1
Note that we could have obtained :i:(n] directly from ,:,(n] as follows
:i:(n] = 2:i:,[n]u(n] - :i:,(O]o[n]

= (U(n] + oo[n + l] + ao[n - l])u[n] - o[n]
= o[n] + oo[n - I]
11.22. Taking the z-transform of uN[n] we get
2 2Z -N/2 1 -N/2
1-z-l l-z- 1 - +•
1- z-N/2 + z-1 _ z-1-N/2
= l-z- 1 l•I -Io
Sampling this we find
V'N(k] = UN(<2d/N)
1- (-1)• + ,-;2d/N _ ,-j2d/N(-J)t
= I - ,-;2d/N
478
When k is even but k # 0 we see that UN[k] = 0. For k odd, we get

2+ 7_e-i2d/N
1-e-;2d/N
2e-jd/N (,id/N + .-jd/N)
= e-j.-1,JN (efd/N - e-jrrlc/N)
= -2j cot(,rk/ N)
When k = 0 we get 0/0 which, if the function was continuous, you would use l'Hopital's rule. In this
case the function is disaete so that is not available to us. One route to the answer is to use the definition
oftbe DFS
17N[0] = f, iiN[n]e-i~ln1
l:=O k=O
N
= LiiN(n]
l=O
= N
Putting it all together gives us the desired answer
N, =
k 0,
UN[k) = -2j cot(rk/N), k odd,
{
0, keven,kj0
11.23. (a) Because :r,,[n] is the inverse DFT of X11(k) we ha.ve for n = 0, ... ,N - 1 and k = 0, ... ,N - 1
X[k)+ X"[k]
X11[k] = 2
:r[n] +x•[((-n))N]
:r.,[n] = 2
or equivalently, if we periodica.lly extend these sequences with period N
_[ l =
%en
z[n] + z(-n]
2
Note that since the signal is real f"(-n] = f[-n].
The first period of f[n] is zero from n = M ton= N - 1. JIN = 2(M - 1) there is no overlap of
f(n] and f[-n] except at n = 0 and n = N/2. We can therefore recover f[n] from f,[n] with the
following:
_ { ~,[n], n=l, ... ,N/2-1
:i:[n] = :r,[n], n = 0, N/2
0, n=M, ... ,N-1
If we tried to make N any smaller, the overlap of f[n] and z[-n] would prevent the recovery of :r(n].
Consequently, the smallest value of N we can use to recover X(.i:] from X11(.i:] is N = 2(M - 1).
(b) If N = 2(M - 1),
2:r.,[n] n=l, ... ,N/2-1

:r(n] = :r,,[n]uN(n] = :r.,.(n], n=0,N/2
{ 0, otherwise
479
where
2, n = 1,2, ... ,N/2-1
UN[n] = 1, n = 0, N/2
{ 0, otherwise
= 2u[n] - 2u[n - N/2] - o[n] + o[n - N/2]
Taking the DFT of :r[n] we find
where
= DFT{2u[n]-2u[n - N/2] - o[n] + 6[n -N/2]}
1-(-l)k +e-j2d/N -e-j2d/N(-l)k
= k=0, ... ,N-1
1_ e-j2d/N
N, k=0,
= -2j cot(,rk/N),
{ 0,
0 < k < N - 1, k odd
otherwise
11.24. We are given

HR(e'"') = HER(e'"') + HoR(e'"')
H1(e'"') = HEI(e'"') + Ho1(e'"')
h,.[n] .......+ H,(e'"') = H,.(e'"') + jHs(e'"')

h;[n] .......+ H,(e'"') = Hc(e'"') + jHD(e'"')
where h,.[n], h,[n], HR(e'"'}, H1(e'"'), HER(e'"'), HoR(e'"'), HE1(e'"'), and Ho1(e'"') are real.
Begin by breaking H(ei"') into its real and imaginary parts HR(ei"') and H1(ei"')
H(e"") = HR(e'"') + jH1(ei"')

= [HER(e'"') + HoR(e'"')] + j[HE1(e'"') + Hoi(e'"')]
Now solve for the conjugate symmetric and conjugate antisymmetric parts of H(e'"')
H(ei"'l + n·c•-;"'l
= 2
[HER(ei"') + HoR(e'"')] + j(HE1(•'"') + Ho,(ei"')]
= 2
[HER(ei"') - HoR(ei"')) - j[HE1(ei"') - Ho,(ei"')]
+ 2
= HER(e'"') + jH01(e'"')
H,(&"') = 2j
= [HER(•;"')+ HoR(ei"')) + j[HE1(ei"') + Ho,(ei"')]
2j
[HER(ei"') - HoR(ei"')) - ;[HE1(e'"') - Ho,(e'"'))
2j
Thus,
H,._(ei"') = HER(e'"') Hc(ei"') = BE1(e"")
Hs(e'"') = Ho1(e'"') HD(e"") = -HoR(e'"')
480
11.25. (a) By inspection,

H(,,;") = j(2Hip(,,;C.,+fl) - 1)
. I - jH(,,;<.,-tl)
H1p(e"") = 2
(b) Find h[n]:

Taking the inverse DTFT of H (,,;., ) yields
h[n] = j [2,-j(•/•Jn h1p[n] - 6[nJ]
= j [2cos(,m/2)h1p[n] - j2sin(.-n/2)h1p[n] - 6[nJ]

= 2sin(.-n/2)h1p[n]
The simplification in the last step used the fact that hip[n]
=
1/2 for n O.
...
= m(•n(•I is zero for even n and equals
.
Find h1p[n] :
Taking the inverse DTFT of H1p(,,;") yields
Using the fact that h[n] is zero for n = 0 and n even we can reduce this to
(c) The linear phase causes a delay of n• = M/2 in the responses. H nd is not an integer, then we
interpret hJp[n] and h(n] as
sin(.-(n-n•)/2)
= .-(n - nd)
2 sin2 (.-(n - nd)/2)
= .- (n - nd)
Then,
h[n] = h[n - n•Jw[n]

= 2sin(,r(n - nd)/2) h1p[n - n•Jw[n]
= 2sin(.-(n - nd)/2) i.1p(n]
where i.[n] and h1pln] are the causal FIR approrimations to h(n] and h1p[n]. Similarly,
•
h1pfn] ={ sin(,r(n - n.)/2)h.[ I
2 • n +2 n
!o[ - n,lw [nI' Meven
sin(,r(n - nd)/2)h{n}, Modd
(d) The lowpass filter com,sponding to the first filter in the example looks like
481
1.2
1 t------------
0.8 M = 18, ll = 2.629
0.6
0.4
0.2
00 0.21t 0.2lt 0.6" 0.8lt lt
The lowpass filter corresponding to the second filter in the example looks like
1.2
11--------
0.8 M=17,jl=2.44
0.6
0.4
0.2
00 0.21t 0.21t 0.6" 0.8lt lt

(I)
11.26. (a) The example shown here samples at the Nyquist rate of T = ,r /(fl, + <lfl) as in the chapter's
example, but the bandpass signal is such that <lfl/(fl, +an)= 3/5. Then, 2,r/(<lf!T) = 10/3.
482
1 sC(j!l)
nC , ,nC+.!IOC n
1/T
-2lt 2lt (J)
2/T
-2x ' / -7t
-61t -3lt ,., 6lt (II
=
(b) U 2,r/(A!lT) M + e, where Mis an integer and e some fraction, then using the Nyquist rate of
2,r /T = 2(0, + AO) will force ~ecirnalion by M. M. jnst shown, this choice for T causes 54(eP")
to have intervals of zero. Instead, choose T such that 2,r/(AOT) is the next highest integer
2,r
A!lT =M+l.
Then decimating by ( M + l) produces the desired result.

11.27. Yes, it is possible to always uniquely recover the system input from the system output. Although
483
Y(eiw) contains roughly half the frequency spectrum as X(eiw), we can reconstruct X(eiw) from Y(eiw).
We can accomplish this by recognizing that since z[n] is real, X (eiw) must be conjugate symmetric.
The output of the system, y[n], has a Fourier transform Y(eiw) that is the product of X(eiw) and
H(dw). Therefore, Y(eiw) will correspond to
At first glance, it may seem like X(e/W) = Y(eiw) + Y-(,-iw). This is close to the right answer, but it
=
doesn't take into consideration the fact that Y(eiw) is non-zero at w 0 and w ,r. Thus, the solution=
X(eiw) = Y(eiW) + rc,-;w), will be incorrect at w = O and w = .,
since Y(eiw) and Y-(eiw) will
overlap at these frequencies. It is necessary to pay special attention to these frequencies to get the right
answer. Let
Z(dw) ={
0, _ w O,w = = .-
Y(e'w), otherwise
Alternatively, we can express Z(eiw) with the constants a and b defined as
00
a = Y(eiwlL=0 = L y[n]
n=-00
00
b = Y(eiw)L=• = L y[n](-1)"
n=-00
Z(eiw) = Y(eiw) - a.l(w) - M(w - ,r)

We can construct a conjugate symmetric X(eiw) from Y(eiw) and Z(e'w) as
In the time domain, this is

z[n] = y[n] + z"[n]
Or, since
z[n] = y[n]- .!:... - b(-l)"
2,r 2,r
z[n] = y[n] + y"[n]- .!:...
2,r
- b(-l)"
2,r
11.28. Since H(z) corresponds to a real anticausal sequence h[n], F(z) =
H(l/z) corresponds to a real,
stable, causal sequence f[n]. We can apply the equation developed in the book for causal sequences to
F(z).
F(z) = - 1 . i
2'lrJ C
FR(v) (z+v)
-- -
z-v V
dv, izl 2: 1.
where v = .,;• is the integration -variable; i.e., the closed contour C is the unit circle of tlie v-plane. Now
find H(z) .
H(z) = F(l/z)
= ....!.., J HR(v- 1 ) (z-• + ") dv, lzl ~ 1
2.-J Tc z-• - v v
where HR(v) = 1u{H(ei1 )}.
484
11.29. (a) We have

1l{z[n]} = z[n] • h[n]
1l{1l{z[n]}} = z[n] • h[n] • h[n]
We need to show that h[n]•h[n] = -6(n]. Alternatively, we need to show that H(ei"')H(ei"') = -1,
which is easily seen from
(b) In Parseval's theorem,

f:
n=-oc
/[n]g•[n] = 2~ 1-• r
F(eiw)G•(eiw) dw
Let /[n] = 1l{z[n]} and g•[n] = z[n]. Then
:E
n=-oc
1l{z[n]}z[n] = 2~ 1-• •
H(eiw)X(ei"')X(e-;w) dw
where
H(eiw) = { -:i
3
O < w <,,.
_,,. <w < 0
but the integral = 0 since the integrand is an odd function over the symmetric interval.
(c) Since 1l{z[n]} = :t[n] • h[n]
1l{z[n] • y[n]} = (z[n] • y[n]) • h[n]
= (:t[n] • h[n]) • y[n]
= z[n] • (y[n] • h[n])
by the commutativity and associativity of convolution.

11.30.
h[n]
z,[n] z,[n]
h[n] is an ideal Hilbert 'Iraosformer:
h[n]
= { -j, 0 <"' < ,r

j, -,r <w < 0
(a) In the frequency domain,
Therefore, <l>z;z.[m] = t/>,.,.[m].

485
-
(b) The cross-correlation between input and output is just the convolution of 4',.,.(m] and h(m],
00
4',.,.(m] = L h(k]4',.,.(m- k]
l=-oo
The following shows that it is an odd function of m:

00
4', •.,[-m] = L h(k]4'•••• [-m - k]

b-oo
00
L h(-t]4', ••• (-m + l]

l=-00
00
= L h(-l]¢,.,.(m- l]
l=-oo
00
= - L h(l]¢•• ,.(m - l]
l=-co
= -¢,.,,(m]
since h(n] = -h(-n] and ¢,.,.(m] = ¢,••• (-m).
{c) Starting from the definition of the autocorrelation and using the linearity of the expectation oper-
ator we get
¢,,[m) = £(:r(n)x"(n + ml]

= £((:r,(n) + j:r;(n))(:r,(n + m] - j:r,(n + ml))
= ¢••,.[m) + ¢., •• (m) + j(¢•. ,.(m) - 4',•• , (ml)
= u •.•. (m) - 2j¢•••• (m)
The last line was found using the results from parts (a) and {b).
(d) Taking the transform of both sides of the equality from part (c) we find
P,,(w) = 2t,.,.(e""') - 2jt,.,,(e""')

= 2[t•••• (e""') - jH(e""')t,.,.(e'"'))
= 2t•••• (e""')(l - jH(e""')]
Since
we get
0, O<w< .-
P.,(w) = { 4t,.-.(e'"'), -.- < w < 0
11.31. (a) As shown in the figure below, the system recoutructs the original bandpass signal. As in the
example, T =.-/(rt,+ Art) and M = 5.
486
2/(ST)
V.<e"'J
(I)
21T
1/T Y,(e"'J
-It ......... - - 1t (I)
1 y C(jO) = s C(j!l)
-nC
(b) In the frequency domain

H,(ei"')
f < w < ,r
= { O,5, otherwise
Note that H,(e'"') = SG(ei<w-47/ 5 !), where
1, lwl < i
= { o. otherwise
487
sin(,m/5)
g(n] = ,m
We can therefore write h;(n] as
h;(n] = 5sin(Jn) ,.;Y.n

,m
5cos(~n)sin(fn) +. 5sin(~n)sin(fn)
= ,rn 1 ,m
h,.;(n]
(e) Using the information from part (b) we find
11(n] = 11,(n] • h;(n]
= (11,.(n] + ;11,.[n]) • (h,.;(n] + jh;,[n])
= (11,.(n] • h,.;(n] -11,.(n] • h;;[n]) +j(y,.[n] • h,.;[n] + 11,.[n] • h;;[n))
Jlr[n]
We can now redraw the figure using only real operations:
yJnJ - tM
Y,.(n]
hJnJ
y)n]
Ideal
DIC
Convener -
yJnJ
- tM
Y.,(n]
l>Jn]
-
• -1
(d) From comparing the top and bottom figures in the answer to part (a), it is evident that the desired
complex system response is given by:
H(eiw)={ 1, -1r<w<O
0, 0:, w $1f
11.32. (a) We know

X(z) = log(X(z)]
When X(z) has a zero or a pole, the term log(X (z)] goes to negative infinity or infinity respectively.
Therefore, X(z) has a pole at these locations.
If :r[n] is causal, X (z) has a region of convergence that is the outside of a circle correspon~ to its
largest pole. However, we require the region of convergence to include the unit circle, i.e., X (eiw)
is defined. These two conditions imply that the poles of X(z) must be inside the unit circle.
But the pole locations for X(z) correspond to the pole and zero locations for X(z). We conclude
the poles and zeros of X ( z) must be inside the unit circle, i.e., o;[n] must be minimum phase.
(b) This argument is similar to the last, but in reverse. Start with the fact that o;(n] is minimum phase
and must have its poles and zeros inside the unit circle. Then, as shown in part {a), the poles of
X(z) must also be inside the unit circle. Becanse the region of convergence mnst include the unit
circle, we know it lies outside the circle defined by its wgest pole. Thus, z(n] must be causal.
(c)
X(z>
488
JI; J,I~
= log{A) + L log{l - ... ,- + L log(l - b••l

1
)
k=l i:=l
II; N.
- Llog{l - •••-')- Llog{l -d••l
bl A=l
{d) Using the power series expansion

oo n
log(l - z) = - L :
n=l
we find
log{l -ctz- 1) = - f: nz
ctn -n
n=I
1 1•1 > lal
00 /3"
log(l - .Bz) = - L nz",
n=l
l•I > I.B- 1 1
-1
.B-n
= I: -n z-n' l•I > I.B-'I
n=-00
From the equations above we can identify the following z-transform pain;
an
--u[n -1] +-+ log(l - a,- 1 ), l•I > lal
n
.B-n
-u[-n - l] +-+ log(l -
n
.Bz), l•I > I.B- 1 1
We~ now take the invene transform af .X(z).
log{A), n=O
n>O
i[n] =
n<O
(e) From the results of part (d), we see if i(n] is causal, all the b1 and d1 terms must be zero. But the
expression for X (z) shows these terms correspond to the zeros and poles outside the unit circle.
We conclude that all the zeros and poles af X(z) are inside the unit circle, i.e., :z:[n] is a minimum
phase sequence.

(Solutions Manual) Oppenheim, Discrete Time Signal Processing Text

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

(Solutions Manual) Oppenheim, Discrete Time Signal Processing Text

Uploaded by

Copyright:

Available Formats

1

Discrete-Time Signals and Systems

2.1. (a) T(z[n]) = g(n]z[n]

T(az 1 [n] + bz2[n]) = g[n](=, [n] + b:z:2[n]

T(z[n - no]) = g(n]z[n - no]

which is not Tl.

T(az 1[n] + b:z:2[n]l = L• az 1 [k] + bz 2 [k]

= L a :z: 1 (n] +b L z2[n]

• Tl: T(:z:(n - no)) = a:r(n - no] + b = 11(n - no]. It is Tl.

T(az 1 (n] + b:r 2(n]) = a:ri[-n] + b:r2:z:(-n]

T(:z:(n - no)) = :z:[-n - no]

(h) T(:z:[n]) = :z:[n] + u(n + l]

T(a:z:,(n] + b:z:2(n]) = a:r,(n] + b:z:2(n] + 3u[n + 1]

T(:r[n - no] = :r[n - no]+ 3u(n + 1]

(a) Since h[k] 'F 0, for (No $ n $ N1 ),

The input, r(n] 'F 0, for (N2 $ n $ N3), so

Using a similar argument,

Therefore, the output is nonzero for

(No +N2) $ n $ (N, + N3).

2.3. We desire the step response to a system whose impulse response is

h[n] =.,-nu[-n], for 0 < 4 < 1.

The convolution sum: 00

Substitution into the convolution sum yields

2.4. The difference equation:

The system function is given by:

2.5. (a) The homogeneous difference equation:

y[n] - 5y[n - l] + 6y[n - 2] =0

!lh[n] = Ai (2)" + A2(3)".

Y(z)[l - sz- 1 + 6z- 2 ] = 2,- 1 X(z)

h(n] = -2(2)"u(n] + 2(3)"u(n].

(c) Let :i:[n] = u[n] (unit step), then

Y(z) = X(z) • H(z)

11[n] = u[n] - 4(2)"u[n] + 3{3)"u[n].

2.6. (ar The difference equation:

(b) A system with frequency response:

Y(eiw)[l + ½•-;w + ~.-,-....] = X(,;w)[l - ½•-;w + •-;:a..,],

and the inverse transform gives

(b) :r[n] is periodic with period 8:

eJ( 'l-n) = eJ( 'l-Hn+N) = eJ( 'tn+2d)

= N = ~k,for integers k,N

= N = 2V2k, for some.integers k, N

2.9. (a) First the frequency response:

Y(e'w) _ ~,-iwY(e'w) + ! 0 -2;wY(e'w) = !,-2;w X(e'w)

For the step response s[n]:

1/h[n] =A,(~)•+ A2(½)"

y[n] = h(n] • z[n]

y[n] = u(n - 4] • u(n]

(d) Again, we use u[n] and w[n] to help us.

y[n] = r[n] • h[n]

2.11. First we re-write :r[n] as a sum of complex erponentials:

Since compleii: exponentials are eigenfunctions of LTI systems,

Evaluating the frequency response at w = ±-rr/4:

2.12. The difference equation:

(a) Suppose z(n] = 6(n]:

z[n] = ao[n] + bo[n]

h(n - l] = (n - l)!u(n - 1] -# y(nJl,[n]=l{n-1]

Y(z)(l - .!z- 1 - .!,- 2) = 3X(z)

(c) he(n] is absolutely summable, while h...,(n] grows without bounds.

Taking the Fourier transform

We note that, 1 2,m

L Jh[n]I = L 3" =L(l/3)" = 1/2 < oo

(d) Not stable. Notice that

h[nj = (l/a)"- 1 u(n - l]