Finite impulse response explained

In signal processing, a finite impulse response (FIR) filter is a filter whose impulse response (or response to any finite length input) is of finite duration, because it settles to zero in finite time. This is in contrast to infinite impulse response (IIR) filters, which may have internal feedback and may continue to respond indefinitely (usually decaying).

The impulse response (that is, the output in response to a Kronecker delta input) of an N^th-order discrete-time FIR filter lasts exactly

N +1 samples (from first nonzero element through last nonzero element) before it then settles to zero.

FIR filters can be discrete-time or continuous-time, and digital or analog.

Definition

For a causal discrete-time FIR filter of order N, each value of the output sequence is a weighted sum of the most recent input values:

\begin{align} y[n] & = b _{0} x[n] + b _{1} x[n -1 ] + … + b _{N} x[n - N] \\ & = \sum ^{N} _{i =0} b _{i ⋅} x[n - i], \end{align}

where:

• $x[n]$ is the input signal,
• $y[n]$ is the output signal,
• $N$ is the filter order; an $N$^th-order filter has $N\; +\; 1$ terms on the right-hand side
• $b\_i$ is the value of the impulse response at the ith instant for $0\; \backslash le\; i\; \backslash le\; N$ of an $N^\backslash text$-order FIR filter. If the filter is a direct form FIR filter then $b\_i$ is also a coefficient of the filter.

This computation is also known as discrete convolution.

The $x[n-i]$ in these terms are commonly referred to as s, based on the structure of a tapped delay line that in many implementations or block diagrams provides the delayed inputs to the multiplication operations. One may speak of a 5th order/6-tap filter, for instance.

The impulse response of the filter as defined is nonzero over a finite duration. Including zeros, the impulse response is the infinite sequence:

h[n] = \sum ^{N} _{i =0} b _{i ⋅} \delta[n - i] = \begin{cases} b _{n} & 0 \le n \le N\\ 0 & otherwise . \end{cases}

If an FIR filter is non-causal, the range of nonzero values in its impulse response can start before

n =0 , with the defining formula appropriately generalized.

Properties

An FIR filter has a number of useful properties which sometimes make it preferable to an infinite impulse response (IIR) filter. FIR filters:

• Require no feedback. This means that any rounding errors are not compounded by summed iterations. The same relative error occurs in each calculation. This also makes implementation simpler.
• Are inherently stable, since the output is a sum of a finite number of finite multiples of the input values, so can be no greater than $\backslash sum\; |b\_i|$ times the largest value appearing in the input.
• Can easily be designed to be linear phase by making the coefficient sequence symmetric. This property is sometimes desired for phase-sensitive applications, for example data communications, seismology, crossover filters, and mastering.

The main disadvantage of FIR filters is that considerably more computation power in a general purpose processor is required compared to an IIR filter with similar sharpness or selectivity, especially when low frequency (relative to the sample rate) cutoffs are needed. However, many digital signal processors provide specialized hardware features to make FIR filters approximately as efficient as IIR for many applications.

Frequency response

The filter's effect on the sequence

x[n] is described in the frequency domain by the convolution theorem:\underbrace{ l{F}\{x*h\}} _{Y(\omega)} = \underbrace{ l{F}\{x\}} _{X(\omega)} ⋅ \underbrace{ l{F}\{h\}} _{H(\omega)}     and     y[n] = x[n]*h[n] = l{F} ^{-1} \ {X(\omega) ⋅ H(\omega) \ },

where operators

l{F} and l{F} ^{-1} respectively denote the discrete-time Fourier transform (DTFT) and its inverse. Therefore, the complex-valued, multiplicative function H(\omega) is the filter's frequency response. It is defined by a Fourier series:H _{2\pi} (\omega) \triangleq \sum ^{inf ty} _{n =-inf ty} h[n] ⋅ \left({e ^{i} }\right)^ = \sum_^b_n\cdot \left(\right)^,

where the added subscript denotes

2 \pi -periodicity. Here \omega represents frequency in normalized units (radians per sample). The function H _{2\pi} ( 2 \pi f') has a periodicity of 1 with f' in units of cycles per sample, which is favored by many filter design applications.  The value \omega = \pi , called Nyquist frequency, corresponds to f' = \tfrac{ 1 }{ 2 }.   When the sequence x[n] has a known sampling-rate f _{s} (in samples per second), ordinary frequency is related to normalized frequency by f = f' ⋅ f _{s} = \tfrac{\omega}{ 2 \pi} ⋅ f _{s} cycles per second (Hz). Conversely, if one wants to design a filter for ordinary frequencies f _{1,} f _{2,} etc., using an application that expects cycles per sample, one would enter f _{1/f} _{s,}   f _{2/f} _{s,}   etc.H _{2\pi} (\omega) can also be expressed in terms of the Z-transform of the filter impulse response:\widehat H(z) \triangleq \sum ^{inf ty} _{n =-inf ty} h[n] ⋅ z ^{-n} . H _{2\pi} (\omega) = \left. \widehat H(z) \right| _{z = e ^{j}} = \widehat H(e ^{j} ).

Filter design

FIR filters are designed by finding the coefficients and filter order that meet certain specifications, which can be in the time domain (e.g. a matched filter) or the frequency domain (most common). Matched filters perform a cross-correlation between the input signal and a known pulse shape. The FIR convolution is a cross-correlation between the input signal and a time-reversed copy of the impulse response. Therefore, the matched filter's impulse response is "designed" by sampling the known pulse-shape and using those samples in reverse order as the coefficients of the filter.^[1]

When a particular frequency response is desired, several different design methods are common:

1. Window design method
2. Frequency sampling method
3. Least MSE (mean square error) method
4. Parks–McClellan method (also known as the equiripple, optimal, or minimax method). The Remez exchange algorithm is commonly used to find an optimal equiripple set of coefficients. Here the user specifies a desired frequency response, a weighting function for errors from this response, and a filter order N. The algorithm then finds the set of $N\; +\; 1$ coefficients that minimize the maximum deviation from the ideal. Intuitively, this finds the filter that is as close as possible to the desired response given that only $N\; +\; 1$ coefficients can be used. This method is particularly easy in practice since at least one text^[2] includes a program that takes the desired filter and N, and returns the optimum coefficients.
5. Equiripple FIR filters can be designed using the DFT algorithms as well.^[3] The algorithm is iterative in nature. The DFT of an initial filter design is computed using the FFT algorithm (if an initial estimate is not available, h[n]=delta[n] can be used). In the Fourier domain, or DFT domain, the frequency response is corrected according to the desired specs, and the inverse DFT is then computed. In the time-domain, only the first N coefficients are kept (the other coefficients are set to zero). The process is then repeated iteratively: the DFT is computed once again, correction applied in the frequency domain and so on.

Software packages such as MATLAB, GNU Octave, Scilab, and SciPy provide convenient ways to apply these different methods.

Window design method

In the window design method, one first designs an ideal IIR filter and then truncates the infinite impulse response by multiplying it with a finite length window function. The result is a finite impulse response filter whose frequency response is modified from that of the IIR filter. Multiplying the infinite impulse by the window function in the time domain results in the frequency response of the IIR being convolved with the Fourier transform (or DTFT) of the window function. If the window's main lobe is narrow, the composite frequency response remains close to that of the ideal IIR filter.

The ideal response is often rectangular, and the corresponding IIR is a sinc function. The result of the frequency domain convolution is that the edges of the rectangle are tapered, and ripples appear in the passband and stopband. Working backward, one can specify the slope (or width) of the tapered region (transition band) and the height of the ripples, and thereby derive the frequency-domain parameters of an appropriate window function. Continuing backward to an impulse response can be done by iterating a filter design program to find the minimum filter order. Another method is to restrict the solution set to the parametric family of Kaiser windows, which provides closed form relationships between the time-domain and frequency domain parameters. In general, that method will not achieve the minimum possible filter order, but it is particularly convenient for automated applications that require dynamic, on-the-fly, filter design.

The window design method is also advantageous for creating efficient half-band filters, because the corresponding sinc function is zero at every other sample point (except the center one). The product with the window function does not alter the zeros, so almost half of the coefficients of the final impulse response are zero. An appropriate implementation of the FIR calculations can exploit that property to double the filter's efficiency.

Least mean square error (MSE) method

Goal:

To design FIR filter in the MSE sense, we minimize the mean square error between the filter we obtained and the desired filter.

MSE = f ^{-1} _{s} \int ^{f _{s/2}} _{- f _{s/2}} |H(f) - H ^{2 df} _{d(f)|} , where f _{s} is sampling frequency, H(f) is the spectrum of the filter we obtained, and H _{d(f)} is the spectrum of the desired filter.

Method:

Given an N-point FIR filter

h[n] , and r[n] = h[n + k], k = ((N -1 ))/(2) .

Step 1: Suppose

h[n] even symmetric. Then, the discrete time Fourier transform of r[n] is defined as R(F) = e ^{j2} H(F) = \sum ^{k} _{n =0} s[n] \cos ( 2 \pi nF)

Step 2: Calculate mean square error.

MSE = \int ^{1 / 2} _{-1 / 2} |R(F) - H ^{2 dF} _{d(F)|}

Therefore,

MSE = \int ^{1 / 2} _{-1 / 2} \sum ^{k} _{n =0} s[n] \cos ( 2 \pi nF) \sum ^{k} _{\tau =0} s[\tau] \cos ( 2 \pi \tau F)dF -2 \int ^{1 / 2} _{-1 / 2} \sum ^{k} _{n =0} s[n] \cos ( 2 \pi nF) H _{ddF} + \int ^{1 / 2} _{-1 / 2} H ^{2 dF} _{d(F)}

Step 3: Minimize the mean square error by doing partial derivative of MSE with respect to

s[n] (\partial MSE)/(\partial s[n]) = 2 \sum ^{k} _{\tau =0} s[\tau] \int ^{1 / 2} _{-1 / 2} \cos ( 2 \pi nF) \cos ( 2 \pi \tau F) dF - 2 \int ^{1 / 2} _{-1 / 2} H ^{2} _{d(F)} \cos ( 2 \pi nF)dF = 0

After organization, we have

s[ 0 ] = \int ^{1 / 2} _{-1 / 2} H _{d(F)} dF s[n] = \int ^{1 / 2} _{-1 / 2} \cos ( 2 \pi nF) H _{d(F)} dF, for n \ne 0

Step 4: Change

s[n] back to the presentation of h[n] h[k] = s[ 0 ], h[k + n] = s[n]/ 2 , h[k - n] = s[n]/ 2 , for n =1 , 2 , 3 , \ldots, k, where k = (N -1 )/ 2 and h[n] =0 for n < 0 and n \ge N

In addition, we can treat the importance of passband and stopband differently according to our needs by adding a weighted function,

W(f) Then, the MSE error becomesMSE = \int ^{1 / 2} _{-1 / 2} W(F)|R(F) - H ^{2 dF} _{d(F)|}

Moving average example

A moving average filter is a very simple FIR filter. It is sometimes called a boxcar filter, especially when followed by decimation, or a sinc-in-frequency. The filter coefficients, $b\_0,\; \backslash ldots,\; b\_N$, are found via the following equation:

b _{i = (1)/(N +1)}

To provide a more specific example, we select the filter order:

N = 2

The impulse response of the resulting filter is:

h[n] = (1)/(3) \delta[n] + (1)/(3) \delta[n -1 ] + (1)/(3) \delta[n -2 ]

The block diagram on the right shows the second-order moving-average filter discussed below. The transfer function is:

H(z) = (1)/(3) + (1)/(3) z ^{-1} + (1)/(3) z ^{-2} = (1)/(3) (z ^{2} + z +1)/(z ^{2}) .

The next figure shows the corresponding pole–zero diagram. Zero frequency (DC) corresponds to (1, 0), positive frequencies advancing counterclockwise around the circle to the Nyquist frequency at (−1, 0). Two poles are located at the origin, and two zeros are located at $z\_1\; =\; -\backslash frac\; +\; j\backslash frac$, $z\_2\; =\; -\backslash frac\; -\; j\; \backslash frac$.

The frequency response, in terms of normalized frequency ω, is:

\begin{align} H\left(e ^{j\omega} \right) & = (1)/(3) + (1)/(3) e ^{-j\omega} + (1)/(3) e ^{-j2\omega} \\ & = (1)/(3) e ^{-j\omega} \left( 1+2 \cos(\omega)\right). \end{align}

The magnitude and phase components of $H\backslash left(e^\backslash right)$ are plotted in the figure. But plots like these can also be generated by doing a discrete Fourier transform (DFT) of the impulse response. And because of symmetry, filter design or viewing software often displays only the [0, π] region. The magnitude plot indicates that the moving-average filter passes low frequencies with a gain near 1 and attenuates high frequencies, and is thus a crude low-pass filter. The phase plot is linear except for discontinuities at the two frequencies where the magnitude goes to zero. The size of the discontinuities is π, representing a sign reversal. They do not affect the property of linear phase, as illustrated in the final figure.

See also

• Cascaded integrator–comb filter
• Compact support
• Digital delay line
• Electronic filter
• Filter (signal processing)
• Filter design
• FIR transfer function
• Infinite impulse response (IIR) filter
• Z-transform (specifically Linear constant-coefficient difference equation)

References

1. Oppenheim, Alan V., Willsky, Alan S., and Young, Ian T.,1983: Signals and Systems, p. 256 (Englewood Cliffs, New Jersey: Prentice-Hall, Inc.)
2. Rabiner, Lawrence R., and Gold, Bernard, 1975: Theory and Application of Digital Signal Processing (Englewood Cliffs, New Jersey: Prentice-Hall, Inc.)
3. A. E. Cetin, O.N. Gerek, Y. Yardimci, "Equiripple FIR filter design by the FFT algorithm," IEEE Signal Processing Magazine, pp. 60–64, March 1997.