TABLE 2.2, Sequence xt] vial 1. x(n) + byl} 2. xln—nal_ (xg an integer) 3. el0"sIn] 4. x[-n] 5. nxlal 6. xin} + yin 7. xtnlyin) Parseval’s theorem: 8 i= te SF soya tf FOURIER TRANSFORM THEOREMS: Fourier Transform xe) Yel) aX (e)) + bY(e!”) eviiona x (ei) X eile-ao) xe) X*(el%) if x{n) real AX (el) 1 Te X (Fei) ay [Xeric ae [L moma Xela Fourier Transform TABLE 23 FOURIER TRANSFORM PAIRS Sequence 1. a) o 2. Bla nol ion Rl Cwenen) 4, aatal Gal <1) Salo) 6. (et Datalel dal < sina +) ala] del =D 1, Ocn=M Pale To. otherwise 10, efaon 1 costogn +9) Y 2r8@+200) L +S mlot2nb sino 419/21 2 YS 2rdw wy 4200) & trel#s(e~ 09 42a) +2650 bay +226)TABLE 3.1 SOME COMMON /- TRANSFOR PRIRS “Transform Sequence ala) 2. win} 3. -ul-n = 11 4 Slam 5. otalnl 2 adalah 8 -naat-n— 1} 8. costo) 10, sna 11, costoun at 12, snag alah OS" S NHL. 0,” otherwise ROC 1 ostan)z Ta Preontage ert I> sino Hee TB eostun)e TABLES.2._ SOME TRANSFORM PROPERTIES Property Section Number _ Reference 1 34 2 342 3 343 4 344 s BAS 6 7 8 9 Sequence Transform xin saln) alm] Xa(2) axyln)+braln) aX y(2) + 6X2) xl = nol maxtey ale) natn sta] Relxtnl) mixta xa) sxuln]# xabr] Roc ® Ry Ry Contains Ry Rss Rg, except forthe possible ‘Addition or deletion of the origin or 26 leads Ry Ry Contains Ry Contains Ry UR, Contains Ry, Ris