<< Chapter < Page Chapter >> Page >
Proper coefficient quantization is essential for IIR filters. Sensitivity analysis shows that second-order cascade-form implementations have much lower sensitivity than higher-order direct-form or transpose-form structures. The normal form is even less sensitive, but requires more computation.

Coefficient quantization is an important concern with IIR filters, since straigthforward quantization often yields poor results, and becausequantization can produce unstable filters.

Sensitivity analysis

The performance and stability of an IIR filter depends on the pole locations, so it is important to know howquantization of the filter coefficients a k affects the pole locations p j . The denominator polynomial is D z 1 k N 1 a k z k i N 1 1 p i z We wish to know a k p i , which, for small deviations, will tell us that a change in a k yields an a k p i change in the pole location. a k p i is the sensitivity of the pole location to quantization of a k . We can find a k p i using the chain rule. z p i a k A z z p i z A z a k z a k p i z p i a k A z i z p i z A z i which is

a k p i z p i z k z j j i N 1 1 p j z p i N k j j i 1 N p j p i
Note that as the poles get closer together, the sensitivity increases greatly. So as the filter order increases and more polesget stuffed closer together inside the unit circle, the error introduced by coefficient quantization in the pole locationsgrows rapidly.

How can we reduce this high sensitivity to IIR filter coefficient quantization?

Solution

Cascade or parallel form implementations! The numerator and denominator polynomials can be factored off-line at very high precision and grouped intosecond-order sections, which are then quantized section by section. The sensitivity of the quantization is thus thatof second-order, rather than N -th order, polynomials. This yields major improvements in the frequency response of theoverall filter, and is almost always done in practice.

Note that the numerator polynomial faces the same sensitivity issues; the cascade form also improves the sensitivity of the zeros, because they arealso factored into second-order terms. However, in the parallel form, the zeros are globally distributed across the sections, so they suffer fromquantization of all the blocks. Thus the cascade form preserves zero locations much better than the parallel form, which typically meansthat the stopband behavior is better in the cascade form, so it is most often used in practice.

On the basis of the preceding analysis, it would seem important to use cascade structures in FIR filterimplementations. However, most FIR filters are linear-phase and thus symmetric or anti-symmetric. As long as the quantization isimplemented such that the filter coefficients retain symmetry, the filter retains linear phase. Furthermore, since allzeros off the unit circle must appear in groups of four for symmetric linear-phase filters, zeropairs can leave the unit circle only by joining with another pair. This requires relatively severe quantizations (enough tocompletely remove or change the sign of a ripple in the amplitude response). This "reluctance" of pole pairs to leave theunit circle tends to keep quantization from damaging the frequency response as much as might be expected, enough sothat cascade structures are rarely used for FIR filters.

What is the worst-case pole pair in an IIR digital filter?

The pole pair closest to the real axis in the z-plane, since the complex-conjugate poles will be closest together and thus have thehighest sensitivity to quantization.

Got questions? Get instant answers now!

Quantized pole locations

In a direct-form or transpose-form implementation of a second-order section, the filter coefficients are quantized versions of the polynomial coefficients. D z z 2 a 1 z a 2 z p z p p a 1 a 1 2 4 a 2 2 p r D z z 2 2 r r 2 So a 1 2 r a 2 r 2 Thus the quantization of a 1 and a 2 to B bits restricts the radius r to r k B , and a 1 2 p k B The following figure shows all stable pole locations after four-bit two's-complement quantization.

Note the nonuniform distribution of possible polelocations. This might be good for poles near r 1 , 2 , but not so good for poles near the origin or the Nyquist frequency.

In the "normal-form" structures, a state-variable based realization, the poles are uniformly spaced.

This can only be accomplished if the coefficients to bequantized equal the real and imaginary parts of the pole location; that is, 1 r r 2 r p This is the case for a 2nd-order system with the state matrix A 1 2 1 1 : The denominator polynomial is
z I A z 1 2 2 2 z 2 2 1 z 1 2 2 2 z 2 2 r z r 2 2 2 z 2 2 r z r 2
Given any second-order filter coefficient set, we can write itas a state-space system , find a transformation matrix T such that A ^ T A T is in normal form, and then implement the second-order section using a structure corresponding tothe state equations.

The normal form has a number of other advantages; both eigenvalues are equal, so it minimizes the norm of A x , which makes overflow less likely, and it minimizes the output variance due to quantization of the statevalues. It is sometimes used when minimization of finite-precision effects is critical.

What is the disadvantage of the normal form?

It requires more computation. The general state-variable equation requires nine multiplies, rather than the five used by the Direct-Form II or Transpose-Form structures.

Got questions? Get instant answers now!

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Digital signal processing: a user's guide. OpenStax CNX. Aug 29, 2006 Download for free at http://cnx.org/content/col10372/1.2
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Digital signal processing: a user's guide' conversation and receive update notifications?

Ask