Metraipolis › archive › dc_0fb5217bf84f
Overlap–save method — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Overlap%E2%80%93save_method
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T18:26:38.378Z
- SHA-256 of the archived text
2f7d029547d78396ea77c4ca4d45a16ff98c165601139788c49a611cb49fd019- Stable URL of this page
https://metraipolis.com/documento/dc_0fb5217bf84f
How to cite
Overlap–save method — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Overlap%E2%80%93save_method (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_0fb5217bf84f (Metraipolis archive dc_0fb5217bf84f, sha256 2f7d029547d78396ea77c4ca4d45a16ff98c165601139788c49a611cb49fd019)
BibTeX
@misc{dc0fb5217bf84f,
title = {Overlap–save method — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Overlap%E2%80%93save_method},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_0fb5217bf84f; sha256 2f7d029547d78396ea77c4ca4d45a16ff98c165601139788c49a611cb49fd019},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Overlap%E2%80%93save_method. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 ] {\displaystyle x[n]} and a finite impulse response (FIR) filter h [ n ] {\displaystyle 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 ) , {\textstyle y(t)=x(t)*h(t),} or y ( t ) = H { x ( t ) } , {\textstyle 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 {\textstyle 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 ] ≜ { x [ n + k L ] , 1 ≤ n ≤ L + M − 1 0 , otherwise . {\displaystyle x_{k}[n]\ \triangleq {\begin{cases}x[n+kL],&1\leq n\leq L+M-1\\0,&{\textrm {otherwise}}.\end{cases}}} y k [ n ] ≜ x k [ n ] ∗ h [ n ] = ∑ m = 1 M h [ m ] ⋅ x k [ n − m ] . {\displaystyle y_{k}[n]\ \triangleq \ x_{k}[n]*h[n]=\sum _{m=1}^{M}h[m]\cdot x_{k}[n-m].} Then, for k L + M + 1 ≤ n ≤ k L + L + M {\displaystyle kL+M+1\leq n\leq kL+L+M} , and equivalently M + 1 ≤ n − k L ≤ L + M {\displaystyle M+1\leq n-kL\leq L+M} , we can write: y [ n ] = ∑ m = 1 M h [ m ] ⋅ x k [ n − k L − m ] ≜ y k [ n − k L ] . {\displaystyle y[n]=\sum _{m=1}^{M}h[m]\cdot x_{k}[n-kL-m]\ \ \triangleq \ \ y_{k}[n-kL].} With the substitution j = n − k L {\displaystyle j=n-kL} , the task is reduced to computing y k [ j ] {\displaystyle y_{k}[j]} for M + 1 ≤ j ≤ L + M {\displaystyle M+1\leq j\leq L+M} . These steps are illustrated in the first 3 traces of Figure 1, except that the desired portion of the output (third trace) corresponds to 1 ≤ j ≤ L. If we periodically extend xk[n] with period N ≥ L + M − 1, according to: x k , N [ n ] ≜ ∑ ℓ = − ∞ ∞ x k [ n − ℓ N ] , {\displaystyle x_{k,N}[n]\ \triangleq \ \sum _{\ell =-\infty }^{\infty }x_{k}[n-\ell N],} the convolutions ( x k , N ) ∗ h {\displaystyle (x_{k,N})*h\,} and x k ∗ h {\displaystyle x_{k}*h\,} are equivalent in the region M + 1 ≤ n ≤ L + M {\displaystyle M+1\leq n\leq L+M} . It is therefore sufficient to compute the N-point circular (or cyclic) convolution of x k [ n ] {\displaystyle x_{k}[n]\,} with h [ n ] {\displaystyle h[n]\,} in the region [1, N]. The subregion [M + 1, L + M] is appended to the output stream, and the other values are discarded. The advantage is that the circular convolution can be computed more efficiently than linear convolution, according to the circular convolution theorem: where: DFTN and IDFTN refer to
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Numerical analysis»).
Fonte: Wikipedia in inglese, voce «Overlap–save method» — https://en.wikipedia.org/wiki/Overlap%E2%80%93save_method
Wikidata Q1791834: «Method in signal processing» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1791834
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Overlap%E2%80%93save_method?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1359311869, consultata il 2026-10-07T17:55:05.137Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 71b093219747c80b5b80f8e88913cc1c8447eaa194c359979dcf4747ce6e9323