L14-15

There are only certain values of for which ej n 1 we

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ≤ Ω < π . If the sequence is now also periodic with period N , Ω must satisfy an additional constraint. To see this, consider ej Ω(n+N ) = ej Ωn ej ΩN , ∀n ∈ (−∞, ∞) (14.3) and therefore ej ΩN = 1. There are only certain values of Ω for which ej ΩN = 1. We can now say that an N -periodic sine or cosine must have a frequency in the set ￿ ￿ 2 2π N 2π Ω ∈ {0, ± , ±2 , . . . , ± −1 , ± π }. (14.4) N N 2 N ￿ 14.3.2 The Fourier Series Any periodic function can be exactly represented with a Fourier series, a statement we will not prove here (the proof is given in the annotated slides of lecture 14). Instead, we will state the Fourier Series Theorem in the form we will find most useful. For any periodic sequence, X , with period N , there exists a representation of that sequence as a sum of complex exponentials. That is, x [ n] = K −1 ￿ 2π N , 2 (14.5) 2π k, N (14.6) X [k ]ej N kn K = k =− K or to simplify notation, x [ n] = K −1 ￿ k = −K X [ k ] e j Ωk n Ωk = where the complex number, X [k ], is the referred to as the Fourier coefficient associated with Ωk . Note that the Fourier series has 2K = N complex coefficients, X [k ], − N ≤ K ≤ N − 1, but 2 2 5 SECTION 14.4. MODULATION AND DEMODULATION there are only N unique real values for X , x[0], ..., x[N − 1]. It may seem like there are too many Fourier coefficients (because the Fourier coefficients have a real and an imaginary part), but that is not the case. As shown in the Lecture 14 annotated notes, the real part of the Fourier coefficients are an even function of k , and the imaginary part of the Fourier coefficients is an odd function of k , real(X [k ]) = real(X [−k ]) imag (X [k ]) = −imag (X [−k ]). ￿ 14.4 (14.7) Modulation and Demodulation Modulating is defined as multiplying our input X (whose nth value is x[n]) by a cosine (or sine) sequence. If we multiply x[n] by a cosine of frequency...
View Full Document

This document was uploaded on 02/26/2014 for the course CS 6.02 at MIT.

Ask a homework question - tutors are online