Cascaded integrator–comb filter

In digital signal processing, a cascaded integrator–comb (CIC) is an optimized class of finite impulse response (FIR) filter combined with an interpolator or decimator.^[1]^[2]

A CIC filter consists of one or more integrator and comb filter pairs. In the case of a decimating CIC, the input signal is fed through one or more cascaded integrators, then a down-sampler, followed by one or more comb sections (equal in number to the number of integrators). An interpolating CIC is simply the reverse of this architecture, with the down-sampler replaced with a zero-stuffer (up-sampler).^[2]

The CIC filter

CIC interpolator by factor R, Hogenauer non-pipelined form

CIC filters were invented by Eugene B. Hogenauer, and are a class of FIR filters used in multi-rate digital signal processing. The CIC filter finds applications in interpolation and decimation. Unlike most FIR filters, it has a decimator or interpolator built into the architecture. The figure at the right shows the Hogenauer architecture for a CIC interpolator.^[2]

The system function for the composite CIC filter referenced to the high sampling rate, f_s is:

{\begin{aligned}H(z)&=\left[\sum _{{k=0}}^{{RM-1}}z^{{-k}}\right]^{N}\\&=\left({\frac {1-z^{{-RM}}}{1-z^{{-1}}}}\right)^{N}\end{aligned}}

Where:

R = decimation or interpolation ratio

M = number of samples per stage (usually 1 but sometimes 2)

N = number of stages in filter

Characteristics of CIC Filters

Linear phase response;
Utilize only delay and addition and subtraction; that is, it requires no multiplication operations;

CIC as a moving average filter

A CIC filter is an efficient implementation of a moving-average filter. To see this, consider how a moving average filter can be implemented recursively by adding the newest sample $x[n]$ to the previous result $y[n-1]$ and subtracting the oldest sample. Omitting the division by $RM$ , we have:

{\begin{aligned}y[n]&=\sum _{{k=0}}^{{RM-1}}x[n-k]\\&=y[n-1]+x[n]-x[n-RM].\end{aligned}}

The second equality corresponds to a comb ( $c[n]=x[n]-x[n-RM]$ ) followed by an integrator ( $y[n]=y[n-1]+c[n]$ ). The conventional CIC structure is obtained by cascading $N$ identical moving average filters, then rearranging the sections to place all integrators first (decimator) or combs first (interpolator). Such rearrangement is possible because both combs and integrators are LTI. For an interpolator, the upsampler which normally precedes the interpolation filter can be passed through the comb sections using a Noble identity, reducing the number of delay elements needed by a factor of $R$ . Similarly, for a decimator, the downsampler which normally follows the decimation filter can be moved before the comb sections.

The equivalence of a CIC to moving average filter allows us to trivially calculate its bit growth as $N\log _{2}(RM)$ .^[3]

Comparison with other filters

CIC filters are used in multi-rate processing. An FIR filter is used in a wide array of applications, and can be used in multi-rate processing in conjunction with an interpolator or decimator. CIC filters have low pass frequency characteristics,^[2] while FIR filters can have low-pass, high-pass, or band-pass frequency characteristics. CIC filters use only addition and subtraction.^[2] FIR filters use addition, subtraction, but most FIR filters also require multiplication. CIC filters have a specific frequency roll-off,^[2] while low pass FIR filters can have an arbitrarily sharp frequency roll-off.

CIC filters are in general much more economical than general FIR filters,^[2] but tradeoffs are involved. In cases where only a small amount of interpolation or decimation are needed, FIR filters generally have the advantage. However, when rates change by a factor of 10 or more, achieving a useful FIR filter anti-aliasing stop band requires many FIR taps.

For large rate changes, a CIC has a significant advantage over a FIR filter with respect to architectural and computational efficiency.^[2] Additionally, CIC filters can typically be reconfigured for different rates by changing nothing more than the decimation/interpolation section assuming the bit width of the integrators and comb sections meets certain mathematical criteria based on the maximum possible rate change.

Whereas a FIR filter can use fixed or floating point math, a CIC filter uses only fixed point math.^[2] This is necessary because, as a recursively implemented FIR filter, a CIC filter relies on exact cancellation of poles from the integrator sections by zeros from the comb sections. While the reasons are less than intuitive, an inherent characteristic of the CIC architecture is that if fixed bit length overflows occur in the integrators, they are corrected in the comb sections.^[2]

The range of filter shapes and responses available from a CIC filter is somewhat limited. Larger amounts of stopband rejection can be achieved by increasing the number of poles.^[2] However, doing so requires an increase in bit width in the integrator and comb sections which increases filter complexity. The shape of the filter response provides even fewer degrees of design freedom.^[2] For this reason, many real-world filtering requirements cannot be met by a CIC filter alone. However, a CIC filter followed by a short to moderate length FIR or IIR proves highly applicable. Additionally, the FIR filter shape is normalized relative to the CIC's sampling rate at the FIR/CIC interface so one set of FIR coefficients can be used over a range of CIC interpolation and decimation rates.^[2]

References

↑ Donadio, Matthew (2000) CIC Filter Introduction "Hogenauer introduced an important class of digital filters called 'Cascaded Integrator-Comb', or 'CIC' for short (also sometimes called 'Hogenauer filters').
1 2 3 4 5 6 7 8 9 10 11 12 13 Hogenauer, Eugene B. (April 1981). "An economical class of digital filters for decimation and interpolation". IEEE Transactions on Acoustics, Speech and Signal Processing. 29 (2): 155–162. doi:10.1109/TASSP.1981.1163535.
↑ Hogenauer 1981, Eq. 11

External links

This article is issued from Wikipedia - version of the 6/21/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.