<< Chapter < Page
  Dspa   Page 1 / 1
Chapter >> Page >
The direct-form and transpose-form structures are most commonly used to implement FIR filters. For certain special filters, recursive implementations require less computation. Lattice and cascade structures are occasionally also used.

Consider causal FIR filters: y n k M 1 0 h k x n k ; this can be realized using the following structure

or in a different notation
This is called the direct-form FIR filter structure .

There are no closed loops (no feedback) in this structure, so it is called a non-recursive structure . Since any FIR filter can be implemented using the direct-form, non-recursivestructure, it is always possible to implement an FIR filter non-recursively. However, it is also possible to implement anFIR filter recursively , and for some special sets of FIR filter coefficients this is much moreefficient.

y n k M 1 0 x n k where h k 0 0 1 k = 0 1 1 1 k = M - 1 0 0 0 But note that y n y n 1 x n x n M This can be implemented as

Instead of costing M 1 adds/output point, this comb filter costs only two adds/output.

Is this stable, and if not, how can it be made so?

IIR filters must be implemented with a recursive structure, since that's the only way a finite number of elements can generate aninfinite-length impulse response in a linear, time-invariant (LTI) system. Recursive structures have the advantages of beingable to implement IIR systems, and sometimes greater computational efficiency, but the disadvantages ofpossible instability, limit cycles, and other deletorious effects that we will study shortly.

Transpose-form fir filter structures

The flow-graph-reversal theorem says that if one changes the directions of all the arrows, and inputs at theoutput and takes the output from the input of a reversed flow-graph, the new system has an identical input-outputrelationship to the original flow-graph.

Direct-form fir structure

Reverse = transpose-form fir filter structure

Or redrawn

Cascade structures

The z-transform of an FIR filter can be factored into a cascade of short-length filters b 0 b 1 z b 2 z -3 b m z m b 0 1 z 1 z 1 z 2 z 1 z m z where the z i are the zeros of this polynomial. Since the coefficients of the polynomial are usually real, the rootsare usually complex-conjugate pairs, so we generally combine 1 z i z 1 z i z into one quadratic (length-2) section with real coefficients 1 z i z 1 z i z 1 2 z i z z i 2 z -2 H i z The overall filter can then be implemented in a cascade structure.

This is occasionally done in FIR filter implementation when one or more of the short-length filters can beimplemented efficiently.

Lattice structure

It is also possible to implement FIR filters in a lattice structure: this is sometimes used in adaptive filtering

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Dspa. OpenStax CNX. May 18, 2010 Download for free at http://cnx.org/content/col10599/1.5
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Dspa' conversation and receive update notifications?

Ask