Digital filters are formed by a standard set of resources, memory or delays, summing junctions, multipliers, and resamplers. Architectures that combine these resources build a variety of filtering systems. This chapter presents these filters and discusses their performance under finite arithmetic.
This chapter is from the book

### This chapter is from the book 

Digital filters are formed by a standard set of resources, memory or delays, summing junctions, multipliers, and resamplers. Architectures that combine these resources build a variety of filtering systems. When faced with two or more contending filtering architectures to solve a given problem, we compare their relative cost as well as their relative performance. In the early days of digital signal processing (DSP) the number of multiplies and data transfers per data sample were standard cost measures. Another comparative cost is sensitivity to finite precision coefficients and required register and accumulator widths. A delight to application specific integrated circuit (ASIC) designers, and to a lesser extent field programmable gate array (FPGA) designers, is a class of filters that does not require multipliers, requires few data transfers, and further exhibits an easy to derive relationship between filter specifications and accumulator widths. These filters are variants of a structure based on the sliding average filter. This chapter presents these filters and discusses their performance under finite arithmetic.

## 11.1 A Multiply-free Filter

A filter with a rectangle-shaped impulse response is called a boxcar or a sliding average filter. It is a simple FIR filter with unit-valued coefficients that performs a filtering task without multiplies. The quality of the filtering is actually not very good since the spectral response of the boxcar filter, as shown in (11.1) and illustrated in Figure 11.1, exhibits only 13-dB attenuation. The simplicity of one form of implementation is so attractive we are drawn to this filter even though the filtering performance is not very good. We will simply have to find a way to improve its performance.

Equation 11.1

Figure 11.1 Boxcar Filter Impulse Response and Frequency Response

The FIR filter implementation of the boxcar filter is shown in Figure 11.2.

Figure 11.2 FIR Filter Implementation of Boxcar Filter

Conceptually, the filter computes an output as follows: An input arrives, and the data in the register shifts one place to the right to accommodate the new arrival. The filter forms the sum of the contents of the registers and outputs this sum. This is shown in (11.2).

Equation 11.2

The process is repeated upon the arrival of each new input sample. If we think about it, this is not a very efficient implementation of the filter. When the new input arrives, the shift to the right of the register contents discards the sample that had arrived M-samples ago to make room for the latest input sample. The new output sum differs from the previous sum by the addition of the new data point and the removal of the M-sample old data point. A recursive form of the boxcar filter can be implemented by altering the previous sum by the known difference. This form of the sum is shown in (11.3).

Equation 11.3

This form of the filter is known as the CIC. The block diagram of this filter is shown in Figure 11.3. The integrator is the "I" in the name CIC, and it is easily identified as the recursive accumulator. By default, the M-units of delay and the subtraction preceding the integrator must be the comb filter, the second "C" in the name CIC. This section has a simple impulse response a 1 at time index 0 followed by a –1 at time index M. The Z-transform of this impulse response is shown in (11.4). The reason this filter is called a comb filter can be traced to its frequency response, which as shown in (11.5) is a sinusoid. The magnitude response of the filter, shown in Figure 11.4, has the appearance of a rectified sine wave with M-periodic zeros spanning the frequency axis. The periodic zeros remind us of the teeth of a comb, hence the name, comb filter.

Equation 11.4

Equation 11.5

Figure 11.3 Cascade Integrator Comb Filter

Figure 11.4 Frequency Response of 10-tap Comb Filter

Notice from Figure 11.3 that in this form of the filter only two summations are required to form the filter output while in the direct implementation, indicated in Figure 11.2, M-additions are required to form the filter output. This is valid for any M. We are thus able to replace 100 adds with 2 adds if we implement the boxcar filter as a CIC filter. Both implementations require the same amount of memory but modifications yet to come will reduce the memory required for the CIC.

An alternate derivation of the CIC structure is available from the Z-transform of the boxcar filter's impulse response. This is shown in (11.6), which we recognize as the first M-terms of the geometric series as shown in (11.7).

Equation 11.6

Equation 11.7

The closed form of this series is shown in (11.8).

Equation 11.8

Equation (11.8) can be cast as a polynomial in Z as in (11.9).

Equation 11.9

In this form of the Z-transform we can easily see that the zeros, the numerator roots, are uniformly distributed around the unit circle at the M-roots of unity and that the zero at z = 1 is canceled by the pole, a denominator root, at the same location. This pole zero cancellation is certainly valid in the ratio of polynomial representation of the filter but may not be in the following partition.

Returning to (11.8) we perform a questionable step and then examine the consequences of that maneuver. We treat the numerator and denominator of (11.8) as if they reside in different filters. Normally we are free to do this; what we have to question here is are we able to separate the numerator and denominator when they contain canceling roots? Technically we cannot place canceling roots in separate filters. I once had a student get angry with me for separating them. We will shortly see why we are not permitted do so and then find a work around. The separated form of the filter is shown in (11.10).

Equation 11.10

An obvious, but as just mentioned perhaps incorrect, conclusion to be drawn from this partitioned form of the boxcar filter is that the filter can be implemented as the cascade of two filters, an integrator and a comb. This is the structure shown in Figure 11.3, a structure arrived at from a different perspective.

Figure 11.5 presents two filter structures that we now compare to the original boxcar filter. The two structures are reordered versions of the comb filter and the integrator. This reordering is standard fare for linear systems since linear time invariant systems commute. Shown by each of the three filters is its impulse response. The impulse response of the tapped delay line version of the boxcar is simple and obvious.

Figure 11.5 Structures and Associated Impulse Responses of Boxcar, of Cascade Comb and of Integrator, and Cascade Integrator and Comb

The impulse response of the comb and integrator cascade is formed in two phases. We first see the comb response, which is a sequence of two impulses separated by M-samples. The first impulse applied to the integrator circulates around the integrator, outputting the same unit valued samples. When the second impulse arrives at the integrator it cancels the circulating first impulse, and the integrator response goes to zero. The composite response of the cascade filters matches the response of the boxcar. No surprise yet!

The impulse response of the integrator and comb cascade is also formed in two phases. We first see the integrator response, which is a recirculating copy of the input impulse that is a step or DC response. This step is delivered directly to the output and matches the boxcar response. M samples into the response, and an M-unit delayed version of the output step arrives at the output summing junction where they subtract from the direct path output of the integrator and set each output sample to zero. This output sequence also matches the response of the boxcar filter. If an observer joined us now and examined only the input and output of this filter she would see zero input and zero output and might conclude that the filter is at rest, a standard attribute of a stable system. In fact it isn't; it is circulating the original input impulse in the integrator and delivering pairs of samples via the comb filter to sum to zero and give the impression the system is at rest. What we are witnessing is the effect of an internal state of the system, the integrator that is neither observable nor controllable from external ports. Remember that this state did not exist in the original boxcar filter, it is the denominator root canceled by a zero of the numerator.

Figure 11.6 presents the same filter structures we just examined but this time we compare their responses to an input step. Shown by each of the three filters is its step response. The step response of the tapped delay line version of the boxcar contains two distinct intervals. The first interval of length M is a ramping transient response that lasts until the filter is filled. The second interval is the steady state response to the step of constant level M.

Figure 11.6 Structures and Associated Step Responses of Boxcar, of Cascade Comb and of Integrator, and Cascade Integrator and Comb

The step response of the comb and integrator cascade is also formed in two phases. We first see the comb response, which is a square wave sequence of length M-samples. The square wave forms the transient ramp in the integrator. At the end of M-samples the comb response goes to zero and the integrator stops accumulating inputs. At this point the integrator output has reached steady state and circulates and outputs its constant level of M. The composite response of the cascade filters matches the response of the boxcar. Still no surprise yet!

The step response of the integrator and comb cascade is also formed in two phases. We first see the integrator response, which is a ramp sequence formed by integrating the input step. This ramp is delivered directly to the output as the start of the boxcar response. M samples into the response, an M-unit delayed version of the output ramp arrives at the output summing junction where they subtract from the direct path delivered by the integrator to form a constant difference of amplitude M for each output sample. This output sequence also matches the response of the boxcar filter. If an observer joined us now and examined only the input and output of this filter she would see a finite input and a finite output and conclude that the filter is stable, an alternate definition of a stable system. In fact it is not stable in this sense since the integrator is on the way to infinity. The difference between the ramp and the M-unit delayed ramp formed in the comb filter is a constant even as the ramp climbs without bound. Here again we are witnessing the effect of an internal state of the system that is neither observable nor controllable. Any finite state machine that tries to implement this structure is bound to overflow its accumulator.

### InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

## Overview

Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

## Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

### Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

### Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

### Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

### Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

### Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

### Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

## Other Collection and Use of Information

### Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

### Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

### Do Not Track

This site currently does not respond to Do Not Track signals.

## Security

Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

## Children

This site is not directed to children under the age of 13.

## Marketing

Pearson may send or direct marketing communications to users, provided that

• Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
• Such marketing is consistent with applicable law and Pearson's legal obligations.
• Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
• Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

## Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

## Choice/Opt-out

Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

## Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

## Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

## Sharing and Disclosure

Pearson may disclose personal information, as follows:

• As required by law.
• With the consent of the individual (or their parent, if the individual is a minor)
• In response to a subpoena, court order or legal process, to the extent permitted or required by law
• To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
• In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
• To investigate or address actual or suspected fraud or other illegal activities
• To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
• To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
• To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.