overlap–add method

{{about|the convolution method|the "Weight, OverLap, Add" channelization method|Discrete-time Fourier transform#Sampling the DTFT{{!}}Sampling the DTFT}}

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]$ :

{{Equation box 1

|indent= |cellpadding= 0 |border= 0 |background colour=white

|equation={{NumBlk|:|

$y[n] = x[n] * h[n]
\ \triangleq\ \sum_{m=-\infty}^{\infty} h[m] \cdot x[n - m]
= \sum_{m=1}^{M} h[m] \cdot x[n - m],$

|{{EquationRef|Eq.1}}}}}}

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).

Image:Overlap-add algorithm.svg

The concept is to divide the problem into multiple convolutions of $h[n]$ with short segments of $x[n]$ :

: $x_k[n]\ \triangleq\ \begin{cases}
x[n + kL], & n = 1, 2, \ldots, L\\
0, & \text{otherwise},
\end{cases}$

where $L$ is an arbitrary segment length. Then:

: $x[n] = \sum_{k} x_k[n - kL],\,$

and $y[n]$ can be written as a sum of short convolutions:

: $\begin{align}
y[n] = \left(\sum_{k} x_k[n - kL]\right) * h[n]
&= \sum_{k} \left(x_k[n - kL] * h[n]\right)\\
&= \sum_{k} y_k[n - kL],
\end{align}$

where the linear convolution $y_k[n]\ \triangleq\ x_k[n] * h[n]\,$ is zero outside the region $[1,L+M-1].$ And for any parameter $N \ge L + M - 1,\,$ {{efn-ua

|This condition implies that the $x_k$ segment has at least $M-1$ appended zeros, which prevents circular overlap of the output rise and fall transients.

}} it is equivalent to the $N$ -point circular convolution of $x_k[n]\,$ with $h[n]\,$ in the region $[1,N].$ The advantage is that the circular convolution can be computed more efficiently than linear convolution, according to the circular convolution theorem:

{{Equation box 1

|indent= |cellpadding= 0 |border= 0 |background colour=white

|equation={{NumBlk|:|

$y_k[n]\ =\ \scriptstyle \text{IDFT}_N \displaystyle (\ \scriptstyle \text{DFT}_N \displaystyle (x_k[n])\cdot\ \scriptstyle \text{DFT}_N \displaystyle (h[n])\ ),$

|{{EquationRef|Eq.2}}}}}}

where:

DFT_N and IDFT_N refer to the Discrete Fourier transform and its inverse, evaluated over $N$ discrete points, and
$L$ is customarily chosen such that $N=L+M-1$ is an integer power-of-2, and the transforms are implemented with the FFT algorithm, for efficiency.

Pseudocode

The following is a pseudocode of the algorithm:

(Overlap-add algorithm for linear convolution)

h = FIR_filter

M = length(h)

Nx = length(x)

N = 8 × 2^ceiling( log2(M) ) (8 times the smallest power of two bigger than filter length M. See next section for a slightly better choice.)

step_size = N - (M-1) (L in the text above)

H = DFT(h, N)

position = 0

y(1 : Nx + M-1) = 0

while position + step_size ≤ Nx do

y(position+(1:N)) = y(position+(1:N)) + IDFT(DFT(x(position+(1:step_size)), N) × H)

position = position + step_size

end

Efficiency considerations

Image:FFT_size_vs_filter_length_for_Overlap-add_convolution.svg

When the DFT and IDFT are implemented by the FFT algorithm, the pseudocode above requires about {{nowrap|N (log₂(N) + 1)}} complex multiplications for the FFT, product of arrays, and IFFT.{{efn-ua

|1=Cooley–Tukey FFT algorithm for N=2^k needs (N/2) log₂(N) – see FFT – Definition and speed

}} Each iteration produces {{nowrap|N-M+1}} output samples, so the number of complex multiplications per output sample is about:

{{Equation box 1

|indent= |cellpadding= 0 |border= 0 |background colour=white

|equation={{NumBlk|:|

$\frac{N (\log_2(N) + 1)}{N-M+1}.\,$

|{{EquationRef|Eq.3}}}}}}

For example, when $M=201$ and $N=1024,$ {{EquationNote|Eq.3}} equals $13.67,$ whereas direct evaluation of {{EquationNote|Eq.1}} would require up to $201$ complex multiplications per output sample, the worst case being when both $x$ and $h$ are complex-valued. Also note that for any given $M,$ {{EquationNote|Eq.3}} has a minimum with respect to $N.$ Figure 2 is a graph of the values of $N$ that minimize {{EquationNote|Eq.3}} for a range of filter lengths ( $M$ ).

Instead of {{EquationNote|Eq.1}}, we can also consider applying {{EquationNote|Eq.2}} to a long sequence of length $N_x$ samples. The total number of complex multiplications would be:

: $N_x\cdot (\log_2(N_x) + 1).$

Comparatively, the number of complex multiplications required by the pseudocode algorithm is:

: $N_x\cdot (\log_2(N) + 1)\cdot \frac{N}{N-M+1}.$

Hence the cost of the overlap–add method scales almost as $O\left(N_x\log_2 N\right)$ while the cost of a single, large circular convolution is almost $O\left(N_x\log_2 N_x \right)$ . The two methods are also compared in Figure 3, created by Matlab simulation. The contours are lines of constant ratio of the times it takes to perform both methods. When the overlap-add method is faster, the ratio exceeds 1, and ratios as high as 3 are seen.

Image:gain oa method.png

Notes

References

{{reflist|refs=

{{Cite book

| author1=Rabiner, Lawrence R.

| author2=Gold, Bernard

| title=Theory and application of digital signal processing

| year=1975

| publisher=Prentice-Hall

| location=Englewood Cliffs, N.J.

| isbn=0-13-914101-4

| chapter=2.25

| pages=[https://archive.org/details/theoryapplicatio00rabi/page/63 63–65]

| chapter-url-access=registration

| chapter-url=https://archive.org/details/theoryapplicatio00rabi/page/63

}}

overlap–add method

Pseudocode

Efficiency considerations

See also

Notes

References

Further reading