02.10.2019 Views

UploadFile_6417

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Round-off Effects in FIR Digital Filters 579<br />

10.3.1 FIXED-POINT ARITHMETIC<br />

We will consider the effects on two realizations: direct-form and cascadeform.<br />

There is no parallel-form realization for FIR filters since we do<br />

not have a partial fraction expansion, except for the frequency sampling<br />

realization, which can be analyzed using IIR filter techniques. The analysis<br />

of FIR filters is much simpler than that for IIR because there are no<br />

feedback paths. One consequence of this is the absence of limit cycles.<br />

Direct-form realization Consider an FIR filter of length M (i.e.,<br />

there are M samples in the impulse response), which is realized using the<br />

direct form as shown in Figure 10.26a. The filter coefficients are the samples<br />

of the impulse response h(n). We have to introduce quantizers in the<br />

vertical branches. If we use the implementation in which each multiplier<br />

output is quantized, then we obtain the model shown in Figure 10.26b.<br />

On the other hand if we implement the filter in a typical DSP chip, then<br />

the final sum is quantized as shown in Figure 10.26c. We will separately<br />

consider the effects of round-off noise and scaling (to avoid overflow).<br />

Round-off noise Let the output of the filter in Figure 10.26b due to<br />

round-off errors be ŷ(n) =y(n)+q(n). Then<br />

q(n) =<br />

M−1<br />

∑<br />

k=0<br />

e k (n) (10.80)<br />

where e k (n) are the noise sources introduced in each vertical branch to<br />

account for the rounding operations. Since these noise sources are all<br />

independent and identical, the noise power in q(n) isgiven by<br />

σ 2 q =<br />

M−1<br />

∑<br />

0<br />

σ 2 e k<br />

( ) 2<br />

= Mσe 2 −2B<br />

= M = M 12 3 2−2(B+1) (10.81)<br />

In Figure 10.26c the output due to the rounding operation is ŷ(n) =<br />

y(n)+e(n). Hence the noise power in this case is given by<br />

σ 2 q = σ 2 e = 1 3 2−2(B+1) (10.82)<br />

which is smaller by a factor of M compared to (10.81) as expected.<br />

Scaling to avoid overflow We assume that the fixed-point numbers<br />

have the two’s-complement form representation, which is a reasonable<br />

assumption. Then we will have to check only the overflow of the total sum.<br />

Thus, this analysis is the same for both implementations in Figure 10.26<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!