18.07.2013 Views

LR Rabiner and RW Schafer, June 3

LR Rabiner and RW Schafer, June 3

LR Rabiner and RW Schafer, June 3

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

DRAFT: L. R. <strong>Rabiner</strong> <strong>and</strong> R. W. <strong>Schafer</strong>, <strong>June</strong> 3, 2009<br />

BIBLIOGRAPHY 493<br />

Assume that all the poles of H(z) are inside the unit circle. Use.<br />

Eq. (8.85) to obtain a recursion relation between the complex cepstrum,<br />

ˆ h[n], <strong>and</strong> the coefficients {αk}. (Hint: How is the complex<br />

cepstrum of 1/H(z) related to ˆ h[n]?)<br />

8.5 Consider a finite length minimum phase sequence x[n] with complex<br />

cepstrum ˆx[n], <strong>and</strong> a sequence<br />

with complex cepstrum ˆy[n].<br />

y[n] = α n x[n]<br />

(a) If 0 < α < 1, how will ˆy[n] be related to ˆx[n]?<br />

(b) How should α be chosen so that y[n] would no longer be minimum<br />

phase?<br />

(c) How should α be chosen so that y[n] is maximum phase?<br />

8.6 Show that if x[n] is minimum phase, then x[−n] is maximum phase.<br />

8.7 Consider a sequence, x[n], with complex cepstrum ˆx[n]. The ztransform<br />

of ˆx[n] is<br />

ˆX(z) = log[X(z)] =<br />

∞<br />

m=−∞<br />

ˆx[m]z −m<br />

where X(z) is the z-transform of x[n]. The z-transform ˆ X(z) is<br />

sampled at N equally spaced points on the unit circle, to obtain<br />

ˆXp[k] = ˆ 2π j<br />

X(e N k ) 0 ≤ k ≤ N − 1<br />

Using the inverse DFT, we compute<br />

ˆxp[n] = 1<br />

N−1 <br />

2π<br />

ˆXp[k]e<br />

j N<br />

N<br />

k=0<br />

kn<br />

0 ≤ n ≤ N − 1<br />

which serves as an approximation to the complex cepstrum.<br />

(a) Express ˆ Xp[k] in terms of the true complex cepstrum, ˆx[m].<br />

(b) Substitute the expression obtained in (a) into the inverse DFT<br />

expression for ˆxp[n] <strong>and</strong> show that<br />

ˆxp[n] =<br />

∞<br />

ˆx[n + rN]<br />

r=−∞

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!