Sign in

username:

password:



Not a member?

Search Online Books



Search tips

Free Online Books



Chapters

See Also

Embedded SystemsFPGAElectronics
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?

  

Orthogonality of Sinusoids

A key property of sinusoids is that they are orthogonal at different frequencies. That is,

$\displaystyle \omega_1 \neq \omega_2 \implies
A_1\sin(\omega_1 t + \phi_1) \perp
A_2\sin(\omega_2 t + \phi_2).
$

This is true whether they are complex or real, and whatever amplitude and phase they may have. All that matters is that the frequencies be different. Note, however, that the durations must be infinity (in general).

For length $ N$ sampled sinusoidal signal segments, such as used by the DFT, exact orthogonality holds only for the harmonics of the sampling-rate-divided-by-$ N$, i.e., only for the frequencies (in Hz)

$\displaystyle f_k = k \frac{f_s}{N}, \quad k=0,1,2,3,\ldots,N-1.
$

These are the only frequencies that have a whole number of periods in $ N$ samples (depicted in Fig.6.2 for $ N=8$).6.1

The complex sinusoids corresponding to the frequencies $ f_k$ are

$\displaystyle s_k(n) \isdef e^{j\omega_k nT},
\quad \omega_k \isdef k \frac{2\pi}{N}f_s,
\quad k = 0,1,2,\ldots,N-1.
$

These sinusoids are generated by the $ N$th roots of unity in the complex plane.



Subsections

Order a Hardcopy of Mathematics of the DFT

Previous: Geometric Series
Next: Nth Roots of Unity

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