{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lec20 - 6.003 Signals and Systems Relations among Fourier...

Info iconThis preview shows pages 1–11. Sign up to view the full content.

View Full Document Right Arrow Icon
6.003: Signals and Systems Relations among Fourier Representations November 19, 2009
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Fourier Representations We’ve seen a variety of Fourier representations: CT Fourier series CT Fourier transform DT Fourier series One more today: DT Fourier transform ... and relations among all four representations.
Background image of page 2
DT Fourier transform Representing aperiodic DT signals as sums of complex exponentials. DT Fourier transform X ( e j )= n = −∞ x [ n ] e j n (“analysis” equation) x [ n ]= 1 2 π < 2 π> X ( e j ) e j n d (“synthesis” equation)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Comparison to DT Fourier Series From periodic to aperiodic. DT Fourier Series a k = a k + N = 1 N n = <N> x [ n ] e j 0 kn ; Ω 0 = 2 π N (“analysis” equation) x [ n ]= x [ n + N ] = k = <N> a k e j 0 kn (“synthesis” equation) DT Fourier transform X ( e j )= n = −∞ x [ n ] e j n (“analysis” equation) x [ n ]= 1 2 π < 2 π> X ( e j ) e j n d (“synthesis” equation)
Background image of page 4
Comparison to DT Fourier Series Sum over an infinite number of time samples instead of N . DT Fourier Series a k = a k + N = 1 N n = <N> x [ n ] e j 0 kn ; Ω 0 = 2 π N (“analysis” equation) x [ n ]= x [ n + N ] = k = <N> a k e j 0 kn (“synthesis” equation) DT Fourier transform X ( e j )= n = −∞ x [ n ] e j n (“analysis” equation) x [ n ]= 1 2 π < 2 π> X ( e j ) e j n d (“synthesis” equation)
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Comparison to DT Fourier Series Sum over an infinite number of frequency components ( ). DT Fourier Series a k = a k + N = 1 N n = <N> x [ n ] e j 0 kn ; Ω 0 = 2 π N (“analysis” equation) x [ n ]= x [ n + N ] = k = <N> a k e j 0 kn (“synthesis” equation) DT Fourier transform X ( e j )= n = −∞ x [ n ] e j n (“analysis” equation) x [ n ]= 1 2 π < 2 π> X ( e j ) e j n d (“synthesis” equation)
Background image of page 6
DT Fourier Series and Transform Example of series. Let x [ n ] represent the following periodic DT signal. n x [ n ] = x [ n + 8] 1 1 8 8 a k = 1 N n = <N> x [ n ] e j 0 kn ; 0 = 2 π N = 1 8 1 + 1 2 e j 2 π 8 k + 1 2 e j 2 π 8 k = 1 + cos πk 4 8 k a k 1 1 8 8 1 4
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
DT Fourier Series and Transform Example of transform. Let x [ n ] represent the aperiodic base of the previous signal. n x [ n ] 1 1 H ( e j ) = n = −∞ x [ n ] e j n = 1 + 1 2 e j + 1 2 e j = 1 + cos Ω X ( e j ) 2 π 2 π 2
Background image of page 8
DT Fourier Series and Transform Similarities. DT Fourier series k a k 1 1 8 8 1 4 DT Fourier transform X ( e j ) 2 π 2 π 2
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Relations among Fourier Representations Different Fourier representations are related because they apply to signals that are related.
Background image of page 10
Image of page 11
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}