nonrecursive filter

{{Short description|Technique in mathematics and signal processing}}

{{Multiple issues|

{{context|date=May 2015}}

{{refimprove|date=August 2020}}

}}

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].{{Cite web |last=Helms |first=H |date=September 1, 1968 |title=Nonrecursive digital filters: Design methods for achieving specifications on frequency response |url=https://ieeexplore.ieee.org/document/1161999 |url-status=live |archive-url=https://web.archive.org/web/20240810171133/https://ieeexplore.ieee.org/document/1161999 |archive-date=August 10, 2024 |access-date=August 10, 2024 |website=IEEE Xplore}}

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.