Lesson plan
Overlap–add method
In signal processing, the overlap–add method is an efficient way to evaluate the discrete convolution of a very long signal x[n] with a finite impulse response (FIR) filter h[n] : where h[m] = 0 for m outside the region [1,M]. This article uses common abstract notations, such as y(t) = x(t) * h(t), or y(t) = \mathcal{H}\{x(t)\}, in which it is understood that the functions should be thought of in their totality, rather than at specific instants t (see Convolution#Notation).
Article summary
In signal processing, the overlap–add method is an efficient way to evaluate the discrete convolution of a very long signal x[n] with a finite impulse response (FIR) filter h[n] : where h[m] = 0 for m outside the region [1,M]. This article uses common abstract notations, such as y(t) = x(t) * h(t), or y(t) = \mathcal{H}\{x(t)\}, in which it is understood that the functions should be thought of in their totality, rather than at specific instants t (see Convolution#Notation).
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.