Lesson plan
Nonrecursive filter
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.
Article summary
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.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.