Circular convolution

From Wikipedia, the free encyclopedia
Jump to: navigation, search

The circular convolution, also known as cyclic convolution, of two aperiodic functions (i.e. Schwartz functions) occurs when one of them is convolved in the normal way with a periodic summation of the other function.  That situation arises in the context of the Circular convolution theorem.  The identical operation can also be expressed in terms of the periodic summations of both functions, if the infinite integration interval is reduced to just one period.  That situation arises in the context of the discrete-time Fourier transform (DTFT) and is also called periodic convolution.  In particular, the DTFT of the product of two discrete sequences is the periodic convolution of the DTFTs of the individual sequences.[1]

Let x be a function with a well-defined periodic summation, xT, where:

 x_T(t) \ \stackrel{\mathrm{def}}{=} \ \sum_{k=-\infty}^\infty  x(t - kT) = \sum_{k=-\infty}^\infty  x(t + kT).

If h is any other function for which the convolution xTh exists, then the convolution xTh is periodic and identical to:


\begin{align}
(x_T * h)(t)\quad &\stackrel{\mathrm{def}}{=} \ \int_{-\infty}^\infty h(\tau)\cdot x_T(t - \tau)\,d\tau \\
&\equiv \int_{t_o}^{t_o+T} h_T(\tau)\cdot x_T(t - \tau)\,d\tau,
\end{align}
[2]

where to is an arbitrary parameter and hT is a periodic summation of h.

The second integral is called the periodic convolution[3][4] of functions xT and hT and is sometimes normalized by 1/T.[5] When xT is expressed as the periodic summation of another function, x, the same operation may also be referred to as a circular convolution[4][6] of functions h and x.

Discrete sequences[edit]

Similarly, for discrete sequences and period N, we can write the circular convolution of functions h and x as:


\begin{align}
(x_N * h)[n] \ &\stackrel{\mathrm{def}}{=} \ \sum_{m=-\infty}^\infty  h[m] \cdot x_N[n-m] \\
&= \sum_{m=-\infty}^\infty  \left( h[m] \cdot \sum_{k=-\infty}^\infty  x[n -m -kN] \right).
\end{align}

For the special case that the non-zero extent of both x and h are ≤ N, this is reducible to matrix multiplication where the kernel of the integral transform is a circulant matrix.

Example[edit]

Circular convolution example.png

A case of great practical interest is illustrated in the figure. The duration of the x sequence is N (or less), and the duration of the h sequence is significantly less. Then many of the values of the circular convolution are identical to values of x∗h,  which is actually the desired result when the h sequence is a finite impulse response (FIR) filter. Furthermore, the circular convolution is very efficient to compute, using a fast Fourier transform (FFT) algorithm and the circular convolution theorem.

There are also methods for dealing with an x sequence that is longer than a practical value for N. The sequence is divided into segments (blocks) and processed piecewise. Then the filtered segments are carefully pieced back together. Edge effects are eliminated by overlapping either the input blocks or the output blocks. To help explain and compare the methods, we discuss them both in the context of an h sequence of length 201 and an FFT size of N = 1024.

Overlapping input blocks

This method uses a block size equal to the FFT size (1024). We describe it first in terms of normal or linear convolution. When a normal convolution is performed on each block, there are start-up and decay transients at the block edges, due to the filter latency (200-samples). Only 824 of the convolution outputs are unaffected by edge effects. The others are discarded, or simply not computed. That would cause gaps in the output if the input blocks are contiguous. The gaps are avoided by overlapping the input blocks by 200 samples. In a sense, 200 elements from each input block are "saved" and carried over to the next block. This method is referred to as overlap-save,[7] although the method we describe next requires a similar "save" with the output samples.

When the DFT or FFT is used, we don't have the option of not computing the affected samples, but the leading and trailing edge-effects are overlapped and added because of circular convolution. Consequently, the 1024-point inverse FFT (IFFT) output contains only 200 samples of edge effects (which are discarded) and the 824 unaffected samples (which are kept). To illustrate this, the fourth frame of the figure at right depicts a block that has been periodically (or "circularly") extended, and the fifth frame depicts the individual components of a linear convolution performed on the entire sequence. The edge effects are where the contributions from the extended blocks overlap the contributions from the original block. The last frame is the composite output, and the section colored green represents the unaffected portion.

Overlapping output blocks

This method is known as overlap-add.[8] In our example, it uses contiguous input blocks of size 824 and pads each one with 200 zero-valued samples. Then it overlaps and adds the 1024-element output blocks. Nothing is discarded, but 200 values of each output block must be "saved" for the addition with the next block. Both methods advance only 824 samples per 1024-point IFFT, but overlap-save avoids the initial zero-padding and final addition.

See also[edit]

Notes[edit]

  1. ^ If a sequence, x[n], represents samples of a continuous function, x(t), with Fourier transform X(ƒ), its DTFT is a periodic summation of X(ƒ).  (see Discrete-time_Fourier_transform#Relationship_to_sampling)
  2. ^ Proof:
    \int_{-\infty}^\infty  h(\tau)\cdot x_T(t - \tau)\,d\tau
    
\begin{align}
&= \sum_{k=-\infty}^\infty  \left[\int_{t_o+kT}^{t_o+(k+1)T} h(\tau)\cdot x_T(t - \tau)\ d\tau\right] \\
&\stackrel{\tau \rightarrow \tau+kT}{=}\  \sum_{k=-\infty}^\infty \left[\int_{t_o}^{t_o+T} h(\tau+kT)\cdot x_T(t - \tau -kT)\ d\tau\right] \\
&= \int_{t_o}^{t_o+T} \left[\sum_{k=-\infty}^\infty h(\tau+kT)\cdot \underbrace{x_T(t - \tau-kT)}_{X_T(t - \tau), \text{ by periodicity}}\right]\ d\tau\\
&= \int_{t_o}^{t_o+T} \underbrace{\left[\sum_{k=-\infty}^\infty  h(\tau+kT)\right]}_{\stackrel{\mathrm{def}}{=} \ h_T(\tau)}\cdot x_T(t - \tau)\ d\tau \quad \quad \scriptstyle{(QED)}
\end{align}
  3. ^ Jeruchim 2000, pp 73-74.
  4. ^ a b Udayashankara 2010, p 189.
  5. ^ Oppenheim, pp 388-389
  6. ^ Priemer 1991, pp 286-289.
  7. ^ Rabiner 1975, pp 65–67.
  8. ^ Rabiner 1975, pp 63–65.

References[edit]

  • Rabiner, Lawrence R.; Gold, Bernard (1975). Theory and application of digital signal processing. Englewood Cliffs, N.J.: Prentice-Hall. pp 63–67. ISBN 0139141014
  • Oppenheim, Alan V.; Schafer, Ronald W.; Buck, John A. (1999). Discrete-time signal processing. Upper Saddle River, N.J.: Prentice Hall. ISBN 0137549202.
  • Priemer, Roland (July 1991). Introductory Signal Processing (Advanced Series in Electrical and Computer Engineering) (v. 6). Teaneck, N.J.: World Scientific Pub Co Inc. ISBN 9971509199.
  • Jeruchim, Michel C.; Philip Balaban, K. Sam Shanmugan (October 2000). Simulation of Communication Systems: Modeling, Methodology and Techniques (2nd ed.). New York: Kluwer Academic Publishers. ISBN 0306462672.
  • Udayashankara, V. (June 2010). Real Time Digital Signal Processing. India: Prentice-Hall. ISBN 8120340493.
  • Oppenheim, Alan V.; Willsky, with S. Hamid (1998). Signals and Systems. Pearson Education. ISBN 0-13-814757-4. .