02.10.2019 Views

UploadFile_6417

Create successful ePaper yourself

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

Sampling and Reconstruction in the z-Domain 153<br />

Consider<br />

Let<br />

Then<br />

1 − e −jωN<br />

N { 1 − e j2πk/N e −jω} =<br />

2πk<br />

1 − e−j(ω−<br />

{<br />

N )N<br />

}<br />

2πk<br />

N 1 − e−j(ω− N )<br />

= e−j N 2πk<br />

2 (ω− N )<br />

e − 1 2πk<br />

2 j(ω− N<br />

N ) N 2<br />

{ [<br />

sin (ω −<br />

2πk<br />

) N sin [ (ω − 2πk<br />

]<br />

N ) 1 2<br />

Φ(ω) = △ sin( ωN 2 )<br />

N−1<br />

N sin( ω 2 ) :aninterpolating function (5.18)<br />

2<br />

)e−jω(<br />

X(e jω )=<br />

N−1<br />

∑<br />

k=0<br />

(<br />

˜X(k)Φ ω − 2πk )<br />

N<br />

]<br />

}<br />

(5.19)<br />

This is the DTFT interpolation formula to reconstruct X(e jω ) from its<br />

samples ˜X (k). Since Φ(0) = 1, we have that X(e j2πk/N )= ˜X(k), which<br />

means that the interpolation is exact at sampling points. Recall the<br />

time-domain interpolation formula (3.33) for analog signals:<br />

∞∑<br />

x a (t) = x(n) sinc [F s (t − nT s )] (5.20)<br />

n=−∞<br />

The DTFT interpolating formula (5.19) looks similar.<br />

However, there are some differences. First, the time-domain formula<br />

(5.20) reconstructs an arbitrary nonperiodic analog signal, while the<br />

frequency-domain formula (5.19) gives us a periodic waveform. Second, in<br />

(5.19) we use a sin(Nx) interpolation function instead of our more familiar<br />

sin x<br />

x<br />

N sin x<br />

(sinc) function. The Φ(ω) function is a periodic function and hence<br />

is known as a periodic-sinc function. It is also known as the Dirichlet<br />

function. This is the function we observed in Example 5.2.<br />

5.2.3 MATLAB IMPLEMENTATION<br />

The interpolation formula (5.19) suffers the same fate as that of (5.20)<br />

while trying to implement it in practice. One has to generate several interpolating<br />

functions (5.18) and perform their linear combinations to obtain<br />

the discrete-time Fourier transform X(e jω ) from its computed samples<br />

˜X(k). Furthermore, in MATLAB we have to evaluate (5.19) on a finer grid<br />

over 0 ≤ ω ≤ 2π. This is clearly an inefficient approach. Another approach<br />

is to use the cubic spline interpolation function as an efficient approximation<br />

to (5.19). This is what we did to implement (5.20) in Chapter 3.<br />

However, there is an alternate and efficient approach based on the DFT,<br />

which we will study in the next section.<br />

Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).<br />

Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.

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

Saved successfully!

Ooh no, something went wrong!