Convolution Theorem for the DTFT

The convolution of discrete-time signals and is defined as

This is sometimes called acyclic convolution to distinguish it from the cyclic convolution used for length sequences in the context of the DFT [243]. Convolution is cyclic in the time domain for the DFT and FS cases (i.e., whenever the time domain has a finite length), and acyclic for the DTFT and FT cases.^3.4.

The convolution theorem is then

That is, convolution in the time domain corresponds to multiplication in the frequency domain.

Proof: The result follows immediately from interchanging the order of summations associated with the convolution and DTFT:

---

Order a Hardcopy of Spectral Audio Signal Processing

Previous: Shift Theorem for the DTFT
Next: Correlation Theorem for the DTFT

---

written by Julius Orion Smith III
Julius Smith's background is in electrical engineering (BS Rice 1975, PhD Stanford 1983). He is presently Professor of Music and Associate Professor (by courtesy) of Electrical Engineering at Stanford's Center for Computer Research in Music and Acoustics (CCRMA), teaching courses and pursuing research related to signal processing applied to music and audio systems. See http://ccrma.stanford.edu/~jos/ for details.