Next  |  Top  |  JOS Index  |  JOS Pubs  |  JOS Home  |  Search

Frequency-Domain Convolution

\epsfig{file=eps/blackbox.eps,width=\textwidth }

In discrete time,

$\displaystyle y(n) \isdefs (x\ast h)(n) \isdefs \sum_{m=0}^{\infty} x(m)h(n-m), \quad n=0,1,2,\ldots
$

where $ x$ and $ h$ are assumed causal

Convolution Theorem:

$\displaystyle (h\ast x) \;\longleftrightarrow\;H \cdot X
$

or

   DTFT$\displaystyle _{\omega}(h\ast x)=H(\omega)X(\omega)
$

where $ H$ and $ X$ are the DTFTs of $ h$ and $ x$ , respectively.


Next  |  Top  |  JOS Index  |  JOS Pubs  |  JOS Home  |  Search

[Comment on this page via email]

``FFT Signal Processing: The Overlap-Add (OLA) Method for Fourier Analysis, Modification, and Resynthesis'', by Julius O. Smith III, (From Lecture Overheads, Music 421).
Copyright © 2020-06-27 by Julius O. Smith III
Center for Computer Research in Music and Acoustics (CCRMA),   Stanford University
CCRMA  [Automatic-links disclaimer]