Digital filter
filter with n stages, each with an independent delay, d i , and amplification gain, a i .
≈ 7 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
filter with n stages, each with an independent delay, d i , and amplification gain, a i . In signal processing, a digital filter is a system that performs mathematical operations on a sampled, discrete-time signal to reduce or enhance certain aspects of that signal. This is in contrast to the other major type of electronic filter, the analog filter, which is typically an electronic circuit operating on continuous-time analog signals.
A digital filter system usually consists of an analog-to-digital converter (ADC) to sample the input signal, followed by a microprocessor and some peripheral components such as memory to store data and filter coefficients etc. Program Instructions (software) running on the microprocessor implement the digital filter by performing the necessary mathematical operations on the numbers received from the ADC. In some high performance applications, an FPGA or ASIC is used instead of a general purpose microprocessor, or a specialized digital signal processor (DSP) with specific paralleled architecture for expediting operations such as filtering.
Digital filters may be more expensive than an equivalent analog filter due to their increased complexity, but they make practical many designs that are impractical or impossible as analog filters.…
filter with n stages, each with an independent delay, d i , and amplification gain, a i . In signal processing, a digital filter is a system that performs mathematical operations on a sampled, discrete-time signal to reduce or enhance certain aspects of that signal. This is in contrast to the other major type of electronic filter, the analog filter, which is typically an electronic circuit operating on continuous-time analog signals.
A digital filter system usually consists of an analog-to-digital converter (ADC) to sample the input signal, followed by a microprocessor and some peripheral components such as memory to store data and filter coefficients etc. Program Instructions (software) running on the microprocessor implement the digital filter by performing the necessary mathematical operations on the numbers received from the ADC. In some high performance applications, an FPGA or ASIC is used instead of a general purpose microprocessor, or a specialized digital signal processor (DSP) with specific paralleled architecture for expediting operations such as filtering.
Digital filters may be more expensive than an equivalent analog filter due to their increased complexity, but they make practical many designs that are impractical or impossible as analog filters. Digital filters can often be made very high order, and are often finite impulse response filters, which allows for linear phase response.
When used in the context of real-time analog systems, digital filters sometimes have problematic latency (the difference in time between the input and the response) due to the associated analog-to-digital and digital-to-analog conversions and anti-aliasing filters, or due to other delays in their implementation. Digital filters are commonplace and an essential element of everyday electronics such as radios, cellphones, and AV receivers.
H(z) = \frac{B(z)}{A(z)} = \frac , where the order of the filter is the greater of N or M. See for further discussion of this transfer function. This is the form for a recursive filter, which typically leads to an infinite impulse response (IIR) behaviour, but if the denominator is made equal to unity, i.e. no feedback, then this becomes a finite impulse response (FIR) filter.
The impulse response, often denoted h[k] or h_k , is a measurement of how a filter will respond to the Kronecker delta function. For example, given a difference equation, one would set x_0 = 1 and x_k = 0 for k \ne 0 and evaluate. The impulse response is a characterization of the filter's behavior.
Digital filters are typically considered in two categories: infinite impulse response (IIR) and finite impulse response (FIR). In the case of linear time-invariant FIR filters, the impulse response is exactly equal to the sequence of filter coefficients, and thus: \ y_n= \sum_{k=0}^{N} b_{k} x_{n-k} =\sum_{k=0}^{N} h_{k} x_{n-k} IIR filters on the other hand are recursive, with the output depending on both current and previous inputs as well as previous outputs.
The general form of an IIR filter is thus: \ \sum_{m=0}^{M} a_{m}y_{n-m} = \sum_{k=0}^{N} b_{k} x_{n-k} Plotting the impulse response reveals how a filter responds to a sudden, momentary disturbance. An IIR filter is always recursive. While it is possible for a recursive filter to have a finite impulse response, a non-recursive filter always has a finite impulse response.
An example is the moving average (MA) filter, which can be implemented both recursively and non recursively. H(z) = \frac{(z+1)^2} {(z-\frac{1}{2}) (z+\frac{3}{4})} This is expanded: H(z) = \frac{z^2+ 2z +1} {z^2 +\frac{1}{4} z - \frac{3}{8}} and to make the corresponding filter causal, the numerator and denominator are divided by the highest order of z : H(z) = \frac{1 + 2z^{-1} +z^{-2}} {1 +\frac{1}{4} z^{-1} - \frac{3}{8} z^{-2}} = \frac{Y(z)}{X(z)} The coefficients of the denominator, a_{k} , are the 'feed-backward' coefficients and the coefficients of the numerator are the 'feed-forward' coefficients, b_{k} .
The resultant linear difference equation is: y[n] = -\sum_{k=1}^{M} a_{k} y[n-k] + \sum_{k=0}^{N} b_{k} x[n-k] or, for the example above: \frac{Y(z)}{X(z)} = \frac{1 + 2z^{-1} +z^{-2}} {1 +\frac{1}{4} z^{-1} - \frac{3}{8} z^{-2}} rearranging terms: \Rightarrow (1 +\frac{1}{4} z^{-1} - \frac{3}{8} z^{-2}) Y(z) = (1 + 2z^{-1} +z^{-2}) X(z) then by taking the inverse z-transform: \Rightarrow y[n] + \frac{1}{4} y[n-1] - \frac{3}{8} y[n-2] = x[n] + 2x[n-1] + x[n-2] and finally, by solving for y[n] : y[n] = - \frac{1}{4} y[n-1] + \frac{3}{8} y[n-2] + x[n] + 2x[n-1] + x[n-2] This equation shows how to compute the next output sample, y[n] , in terms of the past outputs, y[n-p] , the present input, x[n] , and the past inputs, x[n-p] . Applying the filter to an input in this form is equivalent to a Direct Form I or II (see below) realization, depending on the exact order of evaluation. In plain terms, for example, as used by a computer programmer implementing the above equation in code, it can be described as follows: y = the output, or filtered value x = the input, or incoming value n = the sample number, iteration number, or time period number and therefore: y[n] = the current filtered (output) value y[n-1] = the last filtered (output) value y[n-2] = the 2nd-to-last filtered (output) value x[n] = the current input value x[n-1] = the last input value x[n-2] = the 2nd-to-last input value
Text derived from https://en.wikipedia.org/w/index.php?oldid=1373886481 under CC BY-SA 4.0; modifications have been made.