Lesson plan

Overlap–save method

In signal processing, overlap–save is the traditional name for an efficient way to evaluate the discrete convolution between a very long signal x[n] and a finite impulse response (FIR) filter h[n] : where for m outside the region . 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). The concept is to compute short segments of y[n] of an arbitrary length L, and concatenate the segments together. That requires longer input segments that overlap the next input segment. The overlapped data gets "saved" and used a second time. First we describe that process with just conventional convolution for each output segment. Then we describe how to replace that convolution with a more efficient method. Consider a segment that begins at n = kL + M, for any integer k, and define: : x_k[n] \ \triangleq \begin{cases} x[n+kL], & 1 \le n \le L+M-1\\ 0, & \textrm{otherwise}. \end{cases} : y_k[n] \ \triangleq \ x_k[n]*h[n] = \sum_{m=1}^{M} h[m] \cdot x_k[n-m]. Then, for kL+M+1 \le n \le kL+L+M , and equivalently M+1 \le n-kL \le L+M , we can write: : y[n] = \sum_{m=1}^{M} h[m] \cdot x_k[n-kL-m] \ \ \triangleq \ \ y_k[n-kL].…

Back to article

Article summary

In signal processing, overlap–save is the traditional name for an efficient way to evaluate the discrete convolution between a very long signal x[n] and a finite impulse response (FIR) filter h[n] : where for m outside the region . 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). The concept is to compute short segments of y[n] of an arbitrary length L, and concatenate the segments together. That requires longer input segments that overlap the next input segment. The overlapped data gets "saved" and used a second time. First we describe that process with just conventional convolution for each output segment. Then we describe how to replace that convolution with a more efficient method. Consider a segment that begins at n = kL + M, for any integer k, and define: : x_k[n] \ \triangleq \begin{cases} x[n+kL], & 1 \le n \le L+M-1\\ 0, & \textrm{otherwise}. \end{cases} : y_k[n] \ \triangleq \ x_k[n]*h[n] = \sum_{m=1}^{M} h[m] \cdot x_k[n-m]. Then, for kL+M+1 \le n \le kL+L+M , and equivalently M+1 \le n-kL \le L+M , we can write: : y[n] = \sum_{m=1}^{M} h[m] \cdot x_k[n-kL-m] \ \ \triangleq \ \ y_k[n-kL].…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. 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.