# 5.14: Filtering in the Frequency Domain

- Page ID
- 1836

Learning Objectives

- Investigation of different aspects of filtering in the frequency domain, particularly the use of discrete Fourier transforms.

Because we are interested in actual computations rather than analytic calculations, we must consider the details of the discrete Fourier transform. To compute the length-**N** DFT, we assume that the signal has a duration less than or equal to **N**. Because frequency responses have an explicit frequency-domain specification in terms of filter coefficients, we don't have a direct handle on which signal has a Fourier transform equaling a given frequency response. Finding this signal is quite easy. First of all, note that the discrete-time Fourier transform of a unit sample equals one for all frequencies. Since the input and output of linear, shift-invariant systems are related to each other by

\[Y\left ( e^{i2\pi f} \right )=H\left ( e^{i2\pi f} \right )X\left ( e^{i2\pi f} \right )\]

**A unit-sample input, which has **

\[X\left ( e^{i2\pi f} \right )=1\]

**results in the output's Fourier transform equaling the system's transfer function**.

Exercise \(\PageIndex{1}\)

The above statement is a very important result. Derive it yourself.

**Solution**

The DTFT of the unit sample equals a constant (equaling 1). Thus, the Fourier transform of the output equals the transfer function.

In the time-domain, the output for a unit-sample input is known as the system's **unit-sample response**, and is denoted by** h(n)**. Combining the frequency-domain and time-domain interpretations of a linear, shift-invariant system's unit-sample response, we have that **h(n) **and the transfer function are Fourier transform pairs **in terms of the discrete-time Fourier transform**.

\[h(n)\leftrightarrow H\left ( e^{i2\pi f} \right )\]

Returning to the issue of how to use the DFT to perform filtering, we can analytically specify the frequency response, and derive the corresponding length-**N **DFT by sampling the frequency response.

\[\forall k,k=\left \{ 0,...,N-1 \right \}:\left ( H(k)=H\left ( e^{\frac{i2\pi k}{N}}\right ) \right )\]

Computing the inverse DFT yields a length-**N **signal **no matter what the actual duration of the unit-sample response might be**. If the unit-sample response has a duration less than or equal to **N **(it's a FIR filter), computing the inverse DFT of the sampled frequency response indeed yields the unit-sample response. If, however, the duration exceeds **N**, errors are encountered. The nature of these errors is easily explained by appealing to the Sampling Theorem. By sampling in the frequency domain, we have the potential for aliasing in the time domain (sampling in one domain, be it time or frequency, can result in aliasing in the other) unless we sample fast enough. Here, the duration of the unit-sample response determines the minimal sampling rate that prevents aliasing. For FIR systems — they by definition have finite-duration unit sample responses — the number of required DFT samples equals the unit-sample response's duration:

\[N\geq q\]

Exercise \(\PageIndex{1}\)

Derive the minimal DFT length for a length-**q **unit-sample response using the Sampling Theorem. Because sampling in the frequency domain causes repetitions of the unit-sample response in the time domain, sketch the time-domain result for various choices of the DFT length **N**.

**Solution**

In sampling a discrete-time signal's Fourier transform **L **times equally over **[0,****2π)** to form the DFT, the corresponding signal equals the periodic repetition of the original signal.

\[S(k)\leftrightarrow \sum_{i=-\infty }^{\infty }s(n-iL)\]

To avoid aliasing (in the time domain), the transform length must equal or exceed the signal's duration.

Exercise \(\PageIndex{1}\)

Express the unit-sample response of a FIR filter in terms of difference equation coefficients. Note that the corresponding question for IIR filters is far more difficult to answer: Consider the example.

**Solution**

The difference equation for an FIR filter has the form

\[y(n)=\sum_{m=0}^{q}b_{m}x(n-m)\]

The unit-sample response equals

\[h(n)=\sum_{m=0}^{q}b_{m}\delta (n-m)\]

which corresponds to the representation described in a problem of a length-**q** boxcar filter.

For IIR systems, we cannot use the DFT to find the system's unit-sample response: aliasing of the unit-sample response will **always** occur. Consequently, we can only implement an IIR filter accurately in the time domain with the system's difference equation. **Frequency-domain implementations are restricted to FIR filters.**

Another issue arises in frequency-domain filtering that is related to time-domain aliasing, this time when we consider the output. Assume we have an input signal having duration **N _{x}** that we pass through a FIR filter having a length-

**q+1**unit-sample response. What is the duration of the output signal? The difference equation for this filter is

\[y(n)=b_{0}x(n)+...+b_{q}x(n-q)\]

This equation says that the output depends on current and past input values, with the input value **q **samples previous defining the extent of the filter's **memory** of past input values. For example, the output at index **N _{x}** depends on

**x(**

**N**(which equals zero),

_{x})\[x(N_{x}-1)\; through\; x(N_{x}-q)\]

Thus, the output returns to zero only after the last input value passes through the filter's memory. As the input signal's last value occurs at index **N _{x}**

**- 1**, the last nonzero output value occurs when

\[n-q=N_{x}-1 \; or\; n=q+N_{x}-1\]

Thus, the output signal's duration equals **N _{x}**.

Exercise \(\PageIndex{1}\)

In words, we express this result as "The output's duration equals the input's duration plus the filter's duration minus one.". Demonstrate the accuracy of this statement.

**Solution**

The unit-sample response's duration is and the signal's **N _{x} . **Thus the statement is correct.

The main theme of this result is that a filter's output extends longer than either its input or its unit-sample response. Thus, to avoid aliasing when we use DFTs, the dominant factor is not the duration of input or of the unit-sample response, but of the output. Thus, the number of values at which we must evaluate the frequency response's DFT must be at least **N _{x}** and we must compute the same length DFT of the input. To accommodate a shorter signal than DFT length, we simply

**zero-pad**the input: Ensure that for indices extending beyond the signal's duration that the signal is zero. Frequency-domain filtering, as shown in Fig. 5.14.1 below, is accomplished by storing the filter's frequency response as the DFT computing the input's DFT

**X(k)**, multiplying them to create the output's DFT

\[Y(k)=H(k)X(k)\]

and computing the inverse DFT of the result to yield

*Fig. 5.14.1 To filter a signal in the frequency domain, first compute the DFT of the input, multiply the result by the sampled frequency response, and finally compute the inverse DFT of the product. The DFT's length must be at least the sum of the input's and unit-sample response's duration minus one. We calculate these discrete Fourier transforms using the fast Fourier transform algorithm, of course. *

Before detailing this procedure, let's clarify why so many new issues arose in trying to develop a frequency-domain implementation of linear filtering. The frequency-domain relationship between a filter's input and output is **always** true:

\[Y(e^{i2\pi f})=H(e^{i2\pi f})X(e^{i2\pi f})\]

The Fourier transforms in this result are discrete-time Fourier transforms; for example,

\[X(e^{i2\pi f})=\sum_{n}x(n)e^{-(i2\pi fn)}\]

Unfortunately, using this relationship to perform filtering is restricted to the situation when we have analytic formulas for the frequency response and the input signal. The reason why we had to "invent" the discrete Fourier transform (DFT) has the same origin: The spectrum resulting from the discrete-time Fourier transform depends on the **continuous** frequency variable **f**. That's fine for analytic calculation, but computationally we would have to make an uncountably infinite number of computations.

Note

Did you know that two kinds of infinities can be meaningfully defined? A **countably infinite** quantity means that it can be associated with a limiting process associated with integers. An **uncountably infinite** quantity cannot be so associated. The number of rational numbers is countably infinite (the numerator and denominator correspond to locating the rational by row and column; the total number so-located can be counted, voila!); the number of irrational numbers is uncountably infinite. Guess which is "bigger?"

The DFT computes the Fourier transform at a finite set of frequencies — samples the true spectrum — which can lead to aliasing in the time-domain unless we sample sufficiently fast. The sampling interval here is for a length-**K** DFT: faster sampling to avoid aliasing thus requires a longer transform calculation. Since the longest signal among the input, unit-sample response and output is the output, it is that signal's duration that determines the transform length. We simply extend the other two signals with zeros (zero-pad) to compute their DFTs.

Example \(\PageIndex{1}\):

Suppose we want to average daily stock prices taken over last year to yield a running weekly average (average over five trading sessions). The filter we want is a length-5 averager (as shown in the unit-sample response), and the input's duration is 253 (365 calendar days minus weekend days and holidays). The output duration will be:

\[253+5-1=257\]

This determines the transform length we need to use. Because we want to use the FFT, we are restricted to power-of-two transform lengths. We need to choose any FFT length that exceeds the required DFT length. As it turns out, 256 is a power of two

\[2^{8}=256\]

This length just undershoots our required length. To use frequency domain techniques, we must use length-512 fast Fourier transforms.

*Fig. 5.14.2 The blue line shows the Dow Jones Industrial Average from 1997, and the red one the length-5 boxcar-filtered result that provides a running weekly of this market index. Note the "edge" effects in the filtered output. *

Fig. 5.14.2 above, shows the input and the filtered output. The MATLAB programs that compute the filtered output in the time and frequency domains are:

Note

The `filter`

program has the feature that the length of its output equals the length of its input. To force it to produce a signal having the proper length, the program zero-pads the input appropriately.

MATLAB's `fft`

function automatically zero-pads its input if the specified transform length (its second argument) exceeds the signal's length. The frequency domain result will have a small imaginary component — largest value is — because of the inherent finite precision nature of computer arithmetic. Because of the unfortunate misfit between signal lengths and favored FFT lengths, the number of arithmetic operations in the time-domain implementation is far less than those required by the frequency domain version: 514 versus 62,271. If the input signal had been one sample shorter, the frequency-domain computations would have been more than a factor of two less (28,696), but far more than in the time-domain implementation.

An interesting signal processing aspect of this example is demonstrated at the beginning and end of the output. The ramping up and down that occurs can be traced to assuming the input is zero before it begins and after it ends. The filter "sees" these initial and final values as the difference equation passes over the input. These artifacts can be handled in two ways: we can just ignore the edge effects or the data from previous and succeeding years' last and first week, respectively, can be placed at the ends.

## Contributor

- ContribEEOpenStax