Sign in

username:

password:



Not a member?

Search Online Books



Search tips

Free Online Books

Ads

Chapters

Mathematics of the DFT
    Fourier Theorems for the DFT
       Signal Operators
          Convolution
             Commutativity of Convolution

Chapter Contents:

Search Mathematics of the DFT

  

Book Index | Global Index

Would you like to be notified by email when Julius Orion Smith III publishes a new entry into his blog?

  

Commutativity of Convolution

Convolution (cyclic or acyclic) is commutative, i.e.,

$\displaystyle \zbox {x\circledast y = y\circledast x .} $



Proof:

\begin{eqnarray*} (x\circledast y)_n &\isdef & \sum_{m=0}^{N-1}x(m) y(n-m) = \s... ...=& \sum_{l=0}^{N-1}y(l) x(n-l) \\ &\isdef & (y \circledast x)_n \end{eqnarray*}

In the first step we made the change of summation variable $ l\isdeftext n-m$, and in the second step, we made use of the fact that any sum over all $ N$ terms is equivalent to a sum from 0 to $ N-1$.

Order a Hardcopy of Mathematics of the DFT

Previous: Convolution
Next: Convolution as a Filtering Operation
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.


Comments

No comments yet for this page


Add a Comment
You need to login before you can post a comment (best way to prevent spam). ( Not a member? )