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.

Lattice Filter Structures 239<br />

1.0000 1.8478 1.0000<br />

1.0000 1.9616 1.0000<br />

1.0000 -1.0000 0<br />

1.0000 1.0000 0<br />

Note that only 4 gain coefficients are nonzero. Hence the frequency sampling<br />

form is<br />

⎡<br />

−0.9952 + 0.9952z−1<br />

H (z) = 1 − z−32<br />

32<br />

⎢<br />

⎣<br />

⎤<br />

0.9808 − 0.9808z−1<br />

2 +2<br />

1 − 1.9616z −1 + z−2 1 − 1.8478z −1 + z + −2 ⎥<br />

⎦<br />

−0.9569 + 0.9569z −1<br />

1 − 1.6629z −1 + z + 1<br />

−2 1 − z −1<br />

To determine the computational complexity, note that since H (0) = 1, the 1storder<br />

section requires no multiplication, whereas the three 2nd-order sections<br />

require 3 multiplications each for a total of 9 multiplications per output sample.<br />

The total number of additions is 13. To implement the linear-phase structure<br />

would require 16 multiplications and 31 additions per output sample. Therefore<br />

the frequency sampling structure of this FIR filter is more efficient than the<br />

linear-phase structure.<br />

□<br />

6.4 LATTICE FILTER STRUCTURES<br />

The lattice filter is extensively used in digital speech processing and in<br />

the implementation of adaptive filters. It is a preferred form of realization<br />

over other FIR or IIR filter structures because in speech analysis and in<br />

speech synthesis the small number of coefficients allows a large number of<br />

formants to be modeled in real time. The all-zero lattice is the FIR filter<br />

representation of the lattice filter, while the lattice ladder is the IIR filter<br />

representation.<br />

6.4.1 ALL-ZERO LATTICE FILTERS<br />

An FIR filter of length M (or order M − 1) has a lattice structure with<br />

M −1 stages as shown in Figure 6.18. Each stage of the filter has an input<br />

and output that are related by the order-recursive equations [23]:<br />

f m (n) =f m−1 (n)+K m g m−1 (n − 1), m =1, 2,...,M − 1<br />

g m (n) =K m f m−1 (n)+g m−1 (n − 1), m =1, 2,...,M − 1<br />

(6.16)<br />

where the parameters K m , m = 1, 2,...,M − 1, called the reflection<br />

coefficients, are the lattice filter coefficients. If the initial values of f m (n)<br />

and g m (m) are both the scaled value (scaled by K 0 )ofthe filter input<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!