Nonrecursive filter

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (May 2015) (Learn how and when to remove this message) This article needs more citations. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Nonrecursive filter" – news · newspapers · books · scholar · JSTOR (August 2020) (Learn how and when to remove this message) (Learn how and when to remove this message)

In mathematics, a nonrecursive filter only uses input values like x[n − 1], unlike recursive filter where it uses previous output values like y[n − 1].

In signal processing, non-recursive digital filters are often known as Finite Impulse Response (FIR) filters, as a non-recursive digital filter has a finite number of coefficients in the impulse response h[n].

Examples:

• Non-recursive filter: y[n] = 0.5x[n − 1] + 0.5x[n]
• Recursive filter: y[n] = 0.5y[n − 1] + 0.5x[n]

An important property of non-recursive filters is, that they will always be stable. This is not always the case for recursive filters.

References