Sign in

username:

password:



Not a member?

Search Online Books



Search tips

Free Online Books

Sponsor

NEW! TMS320C6474: 3x the performance. 1/3 the cost. Three 1 GHz cores on 1 chip.

Chapters

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?

  

DFT Sinusoids

The sampled sinusoids generated by integer powers of the $ N$ roots of unity are plotted in Fig.6.2. These are the sampled sinusoids $ (W_N^k)^n = e^{j 2 \pi k n / N} = e^{j\omega_k nT}$ used by the DFT. Note that taking successively higher integer powers of the point $ W_N^k$ on the unit circle generates samples of the $ k$th DFT sinusoid, giving $ [W_N^k]^n$, $ n=0,1,2,\ldots,N-1$. The $ k$th sinusoid generator $ W_N^k$ is in turn the $ k$th $ N$th root of unity ($ k$th power of the primitive $ N$th root of unity $ W_N$).

Figure 6.2: Complex sinusoids used by the DFT for $ N=8$.
\includegraphics[width=\textwidth]{eps/dftsines}

Note that in Fig.6.2 the range of $ k$ is taken to be $ [-N/2,N/2-1] = [-4,3]$ instead of $ [0,N-1]=[0,7]$. This is the most ``physical'' choice since it corresponds with our notion of ``negative frequencies.'' However, we may add any integer multiple of $ N$ to $ k$ without changing the sinusoid indexed by $ k$. In other words, $ k\pm
mN$ refers to the same sinusoid $ \exp(j\omega_k nT)$ for all integers $ m$.


Order a Hardcopy of Mathematics of the DFT

Previous: Nth Roots of Unity
Next: Orthogonality of the DFT Sinusoids

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