ECE 5650/4650 Tables for Exam I

Sequence Sum Formulas

Sum
N2 k = N1 n k =0 n k =0 k =0 k =0

Condition ak =
a N1 a N2 +1 1a

none none none |a | < 1 |a | < 1

ak =

1a n +1 1a a 1(n +1)a n +na n +1 (1a )2

ka k = ak =

1 1a a (1a )2

ka k =

Fourier Transform Symmetry Properties

Sequence x [n ] 1. x [n ] 2. x [n ] 3. Re{x [n ]} 4. Im{x [n ]} 5. xe [n ] 6. xo [n ] Real x [n ] only 7. Any real x [n ] 8. Any real x [n ] 9. Any real x [n ] 10. Any real x [n ] 11. Any real x [n ] 12. xe [n ] (even part) 13. xo [n ] (odd part) Fourier Transform X (e j ) X (e j ) X (e j ) X e (e j ) (conjugate symmetric part of X (e j )) X o (e j ) (conjugate anti - symmetric part of X (e j )) X R (e j ) j X I (e j ) X (e j ) = X (e j ) (FT is conjuugate symmetric) X R (e j ) = X R (e j ) (real part is even) X I (e j ) = X I (e j ) (imaginary part is odd) X (e j ) = X (e j ) (magnitude is even) X (e j ) = X (e j ) X R (e j ) j X I (e j )

ECE 5650/4650 Modern DSP

Summary of Fourier Transform Theorems

Sequence x [n ], y [n ] 1. ax [n ] + by [n ] 2. x [n n d ] (n d an integer) 3. e j 0 n x [n ] 4. x [n ] 5. nx [n ] 6. x [n ] y [n ] 7. x [n ] y [n ] Parsevals Theorem 8. 9.
n = n =

Fourier Transform X (e j ), Y (e j ) a X (e j ) + bY (e j ) e j n d X (e j ) X (e j (0 ) ) X (e j ) if x [n ] real X (e j ) (e j ) j d Xd X (e j )Y (e j ) 1 j j () )d 2 X (e )Y (e

|x [n ]|2 =

1 2

1 2

X (e j ) d

x [n ] y [n ] =

X (e j )Y (e j )d

Useful Fourier Transform Pairs

Sequence 1. [n ] 2. [n n 0 ] 3. 1 ( < n < ) 4. a n u [n ] (|a | < 1) 5. u [n ] 6. (n + 1)a n u [n ] 7. 8.
rn sin p (n +1) u [n ] sin p

Fourier Transform 1 e j n 0
k = 1 1ae j 1 + 1e j

2 ( + 2 k )
k =

( + 2 k )

(|r | < 1)

1 (1ae j )2

1 12r cos p e j +r 2 e j 2

sin c n n

X (e j ) = 1, 0 n M 0, otherwise

1, || < c 0, c < || <

9. x [n ] = 10. e j 0 n

11. cos(0 n + )

sin[( M +1)/2] j M /2 e sin(/2) 2 ( 0 + 2 k ) k = e j ( 0 + 2 k ) + e j ( k =

+ 0 + 2 k )

ECE 5650/4650 Modern DSP

A Summary of z -Transform Theorems

Sequence 1. ax1 [n ] + bx2 [n ] 2. x [n n 0 ] 3. zn 0 x [n ] 4. nx [n ] 5. x [n ] 6. Re{x [n ]} 7. Im{x [n ]} 8. x [n ] 9. x1 [n ] x2 [n ] 10. Initial value theorem: x [n ] = 0, n < 0 Transform a X 1 (z ) + bX 2 (z ) z n 0 X (z ) X (z /z 0 )
(z ) z d X dz

X (z ) 1 2 X (z ) + X (z ) 1 2 j X (z ) X (z ) X (1/z ) X 1 (z ) X 2 (z )
z

ROC R x1 R x2 Rx , except possibly zero or innity |z 0 | R x Rx , except possibly zero or innity Rx Contains Rx Contains Rx 1/ Rx Contains Rx1 Rx2

lim X (z ) = x [0]

Useful z -Transform Pairs

x [n ] [n ] [n m ] a n u [n ] a n u [n 1] na n u [n ] na n u [n 1] (n + 1)a n u [n ]
(n +1)(n +2)(n +k 1) n a u [n ] (k 1)! r n cos(o n )u [n ]

X (z ) 1 z m
1 1az 1 1 1az 1 az 1 (1az 1 )2 az 1 (1az 1 )2 1 (1az 1 )2 1 (1az 1 )k 1(r cos o )z 1 1(2r cos o )z 1 +r 2 z 2 (r sin o )z 1 1(2r cos o )z 1 +r 2 z 2 1(cosh b)z 1 1(2 cosh b)z 1 +z 2 (sinh b)z 1 1(2 cosh b)z 1 +z 2 1a N z N 1az 1

ROC all z all z except z = 0 if m > 0 and |z | = if m < 0 |z | > |a | |z | < |a | |z | > |a | |z | < |a | |z | > |a | |z | > |a | |z | > r |z | > r |z | > max{|eb |, |eb |} |z | > max{|eb |, |eb |} |z | > 0

r n sin(o n )u [n ] cosh(nb)u [n ] sinh(nb)u [n ] an , 0 n N 1 0, otherwise

ECE 5650/4650 Modern DSP