0% fanden dieses Dokument nützlich (0 Abstimmungen)
6 Ansichten8 Seiten

DSP 3

Discrete

Hochgeladen von

robegirma4
Copyright
© All Rights Reserved
Wir nehmen die Rechte an Inhalten ernst. Wenn Sie vermuten, dass dies Ihr Inhalt ist, beanspruchen Sie ihn hier.
Verfügbare Formate
Als PDF herunterladen oder online auf Scribd lesen
0% fanden dieses Dokument nützlich (0 Abstimmungen)
6 Ansichten8 Seiten

DSP 3

Discrete

Hochgeladen von

robegirma4
Copyright
© All Rights Reserved
Wir nehmen die Rechte an Inhalten ernst. Wenn Sie vermuten, dass dies Ihr Inhalt ist, beanspruchen Sie ihn hier.
Verfügbare Formate
Als PDF herunterladen oder online auf Scribd lesen
1.52 Digital Signat Processing 1.18 Diserete-time System A diseretectime system is a device or an algorithm that operates on & discrete-time input signal z(n), according to some well defined rule, 10 produce another discrete- time signal y(n) called the output signal, ‘The relation is (1.88) richip between a(n) and y(n) erete-time systems reir general properties and charac 1.19 Classification of Dis Diserete-time systems are classified according 10 th teristics. They are — 1, Static and B: — 2, Causal ans Pi 3, Linear and Nenlineat oyetenis ced) + age (1.107) The outpat dite to weighted! sui of inputs is yale) = Eforrr ir) teeny] = lapey fn) bagea(ey® (10ST Bq. (1.107) and By. (1.108) are not equal and the superposition prineiple is not 5 aon-finear alisfied. So, the syster fi) y(n} re) Scanned by GamScanner 1.56 Dig Digital Signal Processing we hav 1 ela) = Thaey(n)} n)) = wnt) 109) wane) = Tlegln)] = ncale) 119) The weighted sum of outputs is ay Peg (nA egT feglon)] = ener (me) areal) ay The output due to weighted sum of inputs is (12) aloe) = Flayay (a) ob agraQie)] maura (d + nagey(") 1g. CLL an Eg, (1-112) avo wqual, Superposition prineiple satisfied. Hence the systour is inoar 1 the aystem characterised by (7) = Nonlinear tice Problem 1.7 (i) Check whethe 1 hr a(n) 4 Wey) iy linear (ii) Chock whethur thy following syster i nearer nonlinear ln) = ae" (r4) (MU Apr’98, ECE) An Nonlinear invariant Systems to be time-invariant OF shift invariant if the characteristics of the For a time-invariant system if y(n) isthe response rouse of a system to the input 2(7 — ) ce is shifted by k samples, the gener hifted by k samples. This concept is 1194 Pinte variant and Times! A system is said system do not elange with time Oh the system to the input a), then the resp is y(n ~ &). tw other words, if the input sequen’ jaed output sequence is the original sequence s intwsnated iu Big. 1.55. 1 wn fas} yey i é ime-invariant System Fig. 1.95 4 vit canned by CamScanner gary 2st Diserevestine nls and Linear Systems. 1,57 To test if any given 9 r(n) and find y(n), scaquenice, denote it ny atom Is timesi twvarlant, linst apply an arbitrary sequence Now delay the inp ut sequence by fe samples and find output WB) = Phone bi} (1.113) Delay the output sequenee by fy Sinmuples, denote it ay y(n ~ ke) Af wash) ~ yuk) (tay ‘or all possible value off, the system is tine ‘ivvarlant; on the otherhond if the output wish) A yl by hts) ven Tor ONG value OFA ts ayatean in time-variant £ linea tone-invasan (111) discoteine ay the ime invasianes proportion, item satisfies both the linearity and ne variant Pxample 19 Determine if the Followhng systems © YM) = a0)-bein~1) iy ave timiesinvati un) = x(n) Solution Givon ule) = TEs(n)] se w(n) 4 al ~ ty AE thie inpat is delayed by fy amity in tne we have U(r hme Pelt hy) cote ~ bi) ble k ~ ) Jf we delay the ourpiat by & unite i thaie then Uli h) eal k) etn k= ty Here gla, b) = yl hy Therefore, the nystoun is tinesinvariaut uln) o Pje(n)) fn) Ft input is delayed by A units in tane unl applied to the system, we have s at lt, k) Tlie AY) a(n» b) ote et HH the output is delayed by & sunples nes wre Hi) aC A) oe alone 4) go? Here (r,t) 6 y(n ky Therefore, the system is tlne-var lant Vractior Problem 1,8 Determine if the following: systems ure time invariant, (0) ya) = «(3) Gi) yon) se ua (a) Ato (1) tine variunt (ii time-variant canned by Gams nner 158 pi, Hal Signal Processing 1.20 Representation of an Arbitrary Sequence Any arbitra Dlse scone tence #(%) can be represented in terms of delayed and sealed im. Tp uence Mn). Let n(n) bean infinite sequence as sown in Fig. 1568 impine able 20) ean be obtained by muliplying x(0). the mageitnde, with unit pulse S(r.) as shown in Fig, 1.56e 2(0) forn =O i.e., 9(0)6(n) = “(On 0 forn #0 | so ly |i y | we | | jee | oe LLP Sob ot ad nw a na ” gus x0) 06@) fae) te qh XeD eed | @ 1 Fig. 1.56 Hepiezentation of @ kequsiice as 2 eum of delayed Inpulses Diserete-time Signals and Linear Systems 15° Similarly, the samp tude, with one samphe 4 f ‘©(~-1) can be obtained by multiplying :e(—1) the magn’ «lvanced unit impulse 6(n + 1) as shown in Fig. 1.56d. ie, a(<1)s(ak © w(~1) forn= 1 0 forn # ~1 Jn the same way nf-2}0(n 42) = (or treet oder {5 tne (n° forn = 2 #(2)4(n ~ 0 torn #2 1: Fig, 1.56(6) (0 1,56(8) givon by Thio sum of the five sequences shown fron (2)5(n = 2) 2 2) eae 1h 1) ob 0(0)5(H) + a(1)0(n = 1) + a a write e(n) for -00 Sn < 00s equals s(n) for ~2 = m = 2, In gona we am ar(~B)O(n eB) ob af 2)8(a 42) 4 a(~1)8(n + 1) + ©(0)5(") a(n) » 4 (1) (n = 1) + 0(2)8(0e ~ 2) + 0(8)8(n 3) + ” (1.116) wf a(n =) k sens (10 in unily for ve Aan eto forall eo terms “1, 1)38,2)1,5} as sum of Example 1.10 Represent the sequence (n) = (4,2, hified unit inmpuloes. Sulu Olen alu) {4B oh jd bod pee eee fre) a -3)a(a YT wo 26C dB) a(DOCVCT Vb e(0)9(H) 4 af ie WA w(a)oln 2) 4 w(B)A(e 3) ob 0(4) O(n 4) 12) dub Lb dln) 4 30(n = 1) es dS(n bd) POET? pgo(n = 2) Slaw Bt ddl AY

Das könnte Ihnen auch gefallen