Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Finite impulse response
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==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 [[BIBO stability|stable]], since the output is a sum of a finite number of finite multiples of the input values, so can be no greater than <math display="inline"> \sum |b_i|</math> 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]], [[Audio crossover|crossover filters]], and [[Audio mastering|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 (radio)|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.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)