Professional Documents
Culture Documents
2
cosn j sin n x(n) y(n)
LTI System
e jn H ( )e jn
y ( n) x ( k ) h( n k ) h( k ) x ( n k )
k k
H ( ) h(k )e jk
k
j ( n k )
y ( n) h ( k )e ( h(k )e jk )e jn Frequency
k k
response
y(n) H ()e jn
jn
H ( ) magnifies the input e based on freq ω.
Clarification: Some textbooks use j instead of H (e ) H(w ).
3
H ( ) h(k )e jk 1
k
H ( 2 ) h(k )e j ( 2 ) k h(k )e jk e j 2k H ( )
k k
4
cos0 n :
• Existence of DTFT:
x ( n) x(n) is absolutely summable.
n
j n
• Inverse DTFT: x ( n) X ( )e d
1
2
Fourier analysis considers signals to be constructed from a sum of complex
exponentials with appropriate frequencies, amplitudes and phase.
Frequency components are the complex exponentials which, when added
together, make up the signal.
1 c
X ( )
0 c
c
x(n) 1 X ( )e jn d 1 e jn d
2 2
c
1 jn c e jc n e jc n sinc n
x ( n) [e ]c x ( n)
j 2n j 2n n
X ( ) a en jn
(ae j ) n 1
What happens if a>1?
n 0 n0 1 ae j
1 a cos a sin
X ( ) j
1 a 2 2a cos 1 a 2 2a cos
X R ()
X I ()
X ( ) X ( ) e jX ( )
2
X () X () X * () a sin
X ( ) arctan( )
1 a cos
1
1 a 2 2a cos
• Convolution :
•Parseval’s Theorem:
* 1 * ( )d
x ( n ) y ( n )
2
X ( )Y
2 2
y ( n) x ( n) x(n) 21 X ( )
• Multiplication:
x1(n) x2 (n) X 1 ( )X 2 ( )d
1
2
x* (n) X * ( )
X e ( ) 12 [ X () X * ( )]
X () X e () X o ()
X o () 12 [ X () X * ()]
x* (n) X * ( )
x* (n) X * ( )
Re{ x(n)} X e ()
X ( ) 12 [ X ( ) X * ( )] X ( ) X * ( )
j 1
X (e )
(1 ae j )(1 be j )
j a /(a b ) b /(a b )
X (e ) j
1 ae 1 be j
a b
x [n ] ( )a (
n
)b n u [n ]
a b a b
x[n] a nu[n 5]
1
a u[n]
n
1 ae j
j 5
e
a n5u[n 5]
1 ae j
a 5e j 5
a u[n 5]
n
1 ae j