Reduction of Switching Noise in Digital CMOS Circuits by Pin Swapping of Library Cells 1

Size: px
Start display at page:

Download "Reduction of Switching Noise in Digital CMOS Circuits by Pin Swapping of Library Cells 1"

Transcription

1 Redution of Swithing Noise in Digitl CMOS Ciruits y Pin Swpping of Lirry Cells 1 Pilr Prr, Antonio Aost, nd Mnuel Vleni Instituto de Miroeletróni de Sevill-CNM / Universidd de Sevill Avd. Rein Meredes s/n, Sevill, SPAIN Phone: ; Fx: ; e-mil: ojim@imse.nm.es Astrt. The ojetive of this pper is to explore the ppliility of very speifi design tehnique t gte-level to hieve redution of swithing noise in onventionl CMOS digitl iruits. The proposed tehnique optimies swithing noise mintining opertion speed, power onsumption nd trnsistor ount. Bsilly, we will show how the seletion of the suited pin in gte for implementing logi funtion, n ring importnt dvntges in terms of swithing noise redution. The hrterition of some CMOS 0.35 µm lirry ell shows different ehvior regrding swithing noise depending on wht trnsitions in whih input pin tkes ple. This hs een used s the sis for noise optimition methodology, verified through some design exmples showing the noise redution produed y the use of the proposed tehnique. 1 Introdution In modern mixed-signl nlog-digitl Integrted Ciruits, swithing noise is eoming limiting ftor, sine it limits the performne of the glol system [1-3]. Within onventionl digitl design methodologies, some tivities n e onsidered to redue swithing noise. Bsilly, swithing of digitl gtes injets rriers through the sustrte, eing responsile of the resistive-pitive oupling (Fig 1). Also, pkge prsitis indue noise in the on-hip supply-ground plnes (Fig 1). Sine these prolem limit the performne of the nlog prt, nd hene, the whole system, is importnt, on one hnd, to mesure swithing noise, monitoring the mximum -pek vlue- of dynmi urrent provided y the supply soure (i VDD ), tht is proportionl to the rrier injetion [1], [3]. On the other hnd, the use of noise redution tehniques in the nlog domin is importnt to llevite the influene of swithing noise [2]. Conerning digitl design methodologies, some low-swithing-noise digitl CMOS fmilies hve een reported: Current Steering Logi [4], Folded Soure-Coupled Logi [1] nd NMOS Current-Blned Logi [5], mong others. These urrent-mode strutures work with supply urrent lmost onstnt, thus reduing vrition in supply ur- 1. This work hs een sponsored y the Spnish MCYT TIC MODEL Projet.

2 Redution of Swithing Noise in Digitl CMOS Ciruits Noise genertion re Noise sensile re R 1 R ) R2 _on_hip in Gnd Lpin i VDD in Lpin PMOS NMOS out C vdd C gnd out Gnd Gnd Gnd_on_hip i VDD 1mA _on_hip 0 C vdd _on_hip Lpin PMOS i VDD in out Gnd -50mV Lpin NMOS C gnd t Gnd_on_hip 1 ns ) Figure 1 ) Crrier injetion through the sustrte: resistive-pitive oupling. ) Pkge prsitis indue noise in the on-hip supply-ground plnes rent nd, hene, swithing noise. However, stti power onsumption is the min penlty of suh strutures, mking them strongly unsuited for low-power pplitions. Thus, lrge logi iruits should e implemented with onventionl CMOS design styles, eing interesting the seletion of the most suited CMOS digitl struture for n speifi low-noise, low-voltge nd low-power digitl pplition. When designing lrge logi iruit using modern CMOS methodologies, topdown pproh is ommonly used. A high-level desription like VHDL or Verilog serves s input of synthesis tools, generting n shemti desription of the iruit, or diretly the lyout. There re some wys of swithing noise optimition onsidering the level of desription, like when optimiing in power, speed or re. In generl, tions t system level n ring lot of dvntges, for instne lterntive rhiteturl llotion nd sheduling [3], nd the right hoie of the loking sheme [6], ut the provided solutions re often very dependent of the speifi system. On the other hnd, tions t lowest levels, like lyout or trnsistor level [1], [3-5], [7], re very fr from the stndrd digitl designer. In this wy, optimition t gte level n offer the

3 9.3.3 P. Prr et l. possiility of otining redution of swithing noise t low ost, if suited proedures like the one presented in this pper is used. The present ommunition inludes n speifi solution t gte-level, tht optimie swithing noise mintining opertion speed, power onsumption nd trnsistor ount. Bsilly, we will show how the seletion of the suited pin in gte for implementing logil funtion, n ring importnt dvntges in terms of swithing noise redution. The orgnition of the ommunition is s follows: Setion 2 shows the hrterition of some lirry ells onerning swithing noise nd input pins, s well s some onsidertions out mesuring swithing noise. Setion 3 inludes the design methodology oriented to low swithing noise genertion y pin swpping. Setion 4 summries some design exmples, showing the dvntges of the proposed methodology. Finlly, Setion 5 presents the min onlusions. 2 Chrterition of Lirry Cells for Swithing Noise Mesurement As n indiret mesurement of the swithing noise, the urrent supply pek hs een onsidered. Tking the shemti t the gte-level desription of the iruit under hrterition, we hve performed omplete eletril simultion (using SPECTRE) of multiple-input gtes, inluded in the AMS stndrd 0.35 µm CMOS lirry [8]. We hve onsidered, s interest prmeters, vritions in urrent supply due to input slope nd input seletion. Although it is not n exhustive hrterition, with these prmeter under onsidertion we wnt to demonstrte tht the onsidered effets hve lot of influene on supply urrent, nd hene on noise genertion, in suh wy tht they n led to swithing noise redution, if suited optimition proedures of pin swpping re tken into ount [9]. For the ske of simpliity, only results for the 3-input NAND, 2-input XOR nd 2-input OR gtes re shown. 2.1 Influene of input seletion on swithing-noise genertion SPECTRE simultions of multiple-input gtes show tht noise generted y swithing inputs depends on the speifi input onsidered, due to symmetry in the implementtion of gtes (input pitne, sustrte effet, lyout, et). For instne, let us onsider the 3-input NAND gte of Fig 2 nd the swithing noise mesurements in the Tle of Fig 2. As illustrtive dt, for the trnsition : 111 -> 110, : 0->1, pek in supply urrent is µa, while for trnsition : 111 -> 011, : 0->1, pek in supply urrent is µa. Vrition is round 25%, eing the logi opertion the sme in oth ses. Equivlent results n e otined for the 2-input XOR (Fig 2 nd tle in Fig 2d) nd 2-input OR (Fig 2e nd tle in Fig 2f) gtes. 2.2 Influene of the slope of input wveforms on swithing noise genertion Let us onsider the iruit in Fig 3, ontining the gtes of Fig 2. The influene of input slope hs een inluded y hnging the drive-strength of the input inverters. Tles in

4 Redution of Swithing Noise in Digitl CMOS Ciruits Trnsition in: (=11) (=11) (=11) rises flls ) ) Trnsition in: (=0) (=0) rises flls ) d) Trnsition in: (=0) (=0) rises flls e) f) Figure 2 ) 3-input NAND, ) 2-input XOR nd e) 2-input OR gtes. ), d) nd f) Pek in supply urrent produed y isolted trnsitions in respetive inputs Fig 3 inlude the pek of supply urrent orresponding to the NAND, XOR nd OR gtes when drive-strength of inverters is sled y 1 nd 8. Dt indite tht noise inreses with input slope inrements, even mking tht, for the NAND gte, the originlly less noisy input for drive-strength 1 (out 25% less noise in pin ) eomes the most noisy (out 8% more noise) for drive-strength 8, due to higher input slope. 3 Low Swithing Noise Oriented Design Methodology The results presented in lst Setion lerly show how the ehvior of lirry ells regrding swithing noise strongly depends on the pin seletion. To tke dvntge of this dependene, our min purpose is to optimie given gte-level shemti to redue the pek of urrent supply vi pin swpping. For n speifi funtionlity, the suited mpping of suh funtionlity on hrdwre tking into ount the hoie of onnetivity in ells, s well s dynmi spets relted to wveforms nd swithing tivity re of importnt onern when designing digitl iruits for low-noise pplitions. In this wy, our design tem is urrently involved in developing forml optimition methodologies nd lgorithms le to detet situtions worthy of optimition nd to perform suh op-

5 9.3.5 P. Prr et l. Drive-Strength x1 x8 ) timition. The proposed tehniques, n e onsidered s guidelines for the design for low-noise prdigm. Furthermore, other stti nd dynmi onsidertions, mny of them depending on swithing tivity, should e tken into ount s, for instne, the influene of supply voltge, glithes, et., nd will e lso onsidered in future work. Fig 4 shows glol representtion of the flow for the proposed optimition methodology. The strting point is gte-level shemti otined from either silion ompiler or n humn designer (y hnd). Suh shemti is firstly nlyed to otin informtion out onnetivity, fnin nd fnout of gtes, in order to estimte the input slope of wveforms. Suh informtion will e used for pin swpping optimition. Logi simultion provides us dditionl informtion out simultneous swithing tivity in nodes, very importnt sine simultneous trnsitions re the min ontriution to inresing swithing noise. The nlysis of the otined informtion is used to detet the situtions tht re worthy of optimition, through heking the nodes with higher tivity nd mpping suh nodes to the less noisy pins in the lirry ells. The estimtion of noise redution is performed through the evlution of the opertion ondition, nd the omprison with the noise models of the ells. One the pins re swpped if im Trnsition in: (=11) (=11) (=11) rises / / /411.9 flls 293 / / /359.7 ) Drive-Strength x1 x8 ) Trnsition in: (=0) (=0) rises / / flls / / 1047 d) Trnsition in: (=0) (=0) rises / / flls / / Drive-Strength x1 x8 e) f) Figure 3 ) Ciruit using 3-input NAND gte. ) Pek in supply urrent when the inputs swith nd when drive-strength of input inverters re x1 nd x8 (x1 / x8). )-d) The sme for 2-input XOR gte. e)-f) The sme for 2-input OR gte

6 Redution of Swithing Noise in Digitl CMOS Ciruits Humn Designer Silion Compiler Shemti Logi Simultion Stti Anlysis Ativity Mp Lirry Models Pin Swpping Simultneous Trnsitions Input Slope Fnin Fnout Optimition Noise Evlution Eletril or Swith-level Simultion Optimied Shemti Figure 4 Proposed low swithing noise optimition methodology. The utomtion of this proedure is urrently under development provement is expeted, the glol noise is evluted through eletril or swith-level simultion (in our se Spetre nd Mh-PA hve een used). The itertion in the optimition proess yields in finl shemti optimied for low swithing noise genertion. Let us show now two simple nd illustrtive exmples: Exmple 1: From the results presented in Setion 2 for the 3-input NAND gte, onneting the input with higher tivity to pin yields in lol redution of swithing noise. The exmple of Fig 5 shows two possile logi implementtions of the omintionl funtion =uvw+x +y using two 3-input NAND gtes. Supposing tht ll inputs (u,v,w,x,y) swith with the sme proility, node t hs less swithing proility thn x nd y, nd hene, less noise is generted if t is onneted to pin of the output NAND thn if onneted to pin. Vrition in pek of supply urrent is out 5% for simultion with 200 rndom ptterns. Exmple 2: Simultion dt presented in Setion 2 indited tht noise inreses with input slope. In the exmple of Fig 6, two speed optimied implementtions of the u v w x y t u v w x y t Figure 5 Two equivlent implementtions, with 3-input NAND gtes, of the funtion =uvw+x +y, ut the left produing 5% more noise

7 9.3.7 P. Prr et l. u v w x8 x x8 y x8 t u v w x8 x x8 y x8 t Figure 6 Implementtions of =uvw+x +y using 3-input NAND gtes funtion =uvw+x +y using 3-input NAND gtes re onsidered. In the left implementtion, node t hs less trnsitions nd the less noisy implementtion onnets suh node to pin of NAND gte (see Tle in Fig 3 for drive-strength x8). However, if node t hs dditionl onnetions, the pitne of node t inreses, nd input slope dereses. In suh se, the less noisy solution is the onnetion of node t to pin, s shown in the right of Fig 6. The redution of pek in supply urrent is out 3% in the left se nd 8% in the right se. Note tht proposed solutions in oth exmples do not modify the hrdwre resoures involved, thus the redution of swithing noise is otined without re ost. 4 Demonstrtor Exmple The proposed methodology hs een pplied to more omplited exmple: modulr implementtion of n unsigned-to-signed dt onverter. The output is given in two somplement nd one s-omplement formts, depending on the vlue of signl. The omintionl funtion implemented is represented in eq. (1): i = XOR( i, i ) (1) If =1, eq. (1) is onverted into eq. (2), eing the one s-omplement of input : i = i If =0, eq. (1) is onverted into eq. (3), eing the two s-omplement of input : i = XOR( i, i ) (3) A modulr representtion of suh funtionlity is shown in Fig 7. It is ler tht mximum prllelism is in opertion of XOR gtes, swithing the output s result of hnges in, swithing ll the XOR gtes (lmost) simultneously. This simultneous (2)

8 Redution of Swithing Noise in Digitl CMOS Ciruits k+1 k k k k k+1 Figure 7 Modulr implementtion of n unsigned-to-signed dt onverter. If =0 (1), the output is given in two s(one s)-omplement formt hnge is the min ontriution to swithing noise. Otherwise, the trnsmission of the first i =1 to the most signifitive ells, through the OR hin, mkes the trnsitions onseutive in time. Itertion in the proedure of Fig 4, hs given the following results: When =1, the hoie of pin input in XOR gtes is ruil. Sine pin onneted to i is the more proly to hnge (50%), i should e onneted to less noisy pin in XOR gte ( in the hrteried lirry ell). On the other hnd, when =0, the outputs of the OR gtes hve less proility of hnge (25%), nd gin, the less noisy input pin of XOR gtes should e onneted to i signls. Sine fnout of OR gtes (2) is the sme of gtes loded y inputs i, similr slope is expeted for oth inputs of XOR gtes, thus there will not e signifint dependene of noise on input slope. As we hve lredy disussed, the OR gtes ontriution to the totl noise of the dt sign onverter is less signifint thn XORs, however, suited hoie in input seletion n ontriute to mke less noisy the dt omplementer. One of the inputs in eh OR gte is onneted to the dt it i while the other input is fed y the preedent stge OR gte. Although the pin onneted to i is the more proly to hnge, the only hnge tht ffets the vlue of the OR gte output is the hnge 0->1 nd this is trnsmitted long the OR pth through the other pin, hene, for noise redution we should onnet the most noisy pin to i. As summry of simultion results, Tle 1 inludes the dt otined for three different possiilities of pin swpping in gtes of the unsigned-to-signed onverter of Fig 7. The verge of peks in supply urrent, s well s the vrine, mesured through the pplition of vrile-length (from 200 to 2000) rndom ptterns hve een onsidered s indiret mesurement of swithing noise. For eh se, three opertion modes hve een onsidered, one s omplement onversion (=0), two s omplement onversion (=1), nd rndom opertion ( rnd). The energy onsumption per trnsition in eh of them hs lso een omputed. Simultion tool is MACH PA, from Mentor Grphis. The opertion with =0 (two s omplement) provides the most noisy solutions. Tle 1 lso shows tht se i -> (XOR), i -> (OR) is the est from the point of view of noise, eing the worst se when i -> (XOR) nd i -> (OR), s it ws expeted

9 9.3.9 P. Prr et l. Tle 1: Pek of supply urrent (ma) s noise mesurement nd energy onsumption per trnsition (fj) for the pin seletion nd for onverter length 8-it 16-it 32-it energy noise energy noise energy noise i->(xor) i -> (OR) i->(xor) i -> (OR) = ± ± ±1.029 = ± ± ±0.960 rnd ± ± ±1.002 = ± ± ±1.123 = ± ± ±1.123 rnd ± ± ±1.081 = ± ± ±1.181 i ->(XOR) i -> (OR) = ± ± ±1.129 rnd ± ± ±1.157 from the ove resoning, nd from dt of Fig 2. We n see tht noise inrese with the length of the sign onverter, ut if we ompre with the worst se ( i -> (XOR), i -> (OR)), the gin in noise is lso inresing, out 12.7% for the 8-it, 16.2% for the 16-it nd 18.5% for the 32-it version, hving onsidered rndom opertion for perentge omputtion. Also it n e notied tht for given length, for exmple 8 its, the gin in noise is different for eh opertion mode, eing 9.6% for =0, 18.3% for =1 nd 12.7% for rndom. An dditionl disussion should e mde in order to hek if deresing noise mens deresing performnes. Tle 1 shows tht se i -> (XOR), i -> (OR) is the est from the point of view of noise nd lso of energy, so the improvement in noise tht we get y pin swpping does not ffet the performne in power onsumption. On the other hnd, onerning speed degrdtion, the pin swpping in gtes ffet the performne of the dt sign onverter. For the XOR gte, the dely through pins nd is similr when the other input is 1, (vrying etween 110 nd 115 ps when output rises nd etween 120 nd 113 ps when output flls), however, when the onstnt input is 0 the dely through pin is higher thn through pin (vrying etween 263 nd 203 ps when output rises nd etween 275 nd 248 ps when output flls). As in the less noisy omplementer we mke i -> (XOR) nd i hs 50% proility of hnge, we re mking the worst seletion for dely riteri. Although this n seem loss in performne, the XOR dely does not ffet the opertion frequeny for the dt sign onverter eing the OR hin dely the limiting ftor. If we ompute the mximum dely se for the less noisy nd for the more noisy dt sign onverters, we found different results sine the pin seletion in OR gtes is the ontrry for oth. In the se of the more noisy

10 Redution of Swithing Noise in Digitl CMOS Ciruits iruit we find higher delys: 3360 ps for the 8-it, 6992 ps for the 16-it nd ps for the 32-it omplementer, while for the less noisy iruit we find 2900 ps for the 8- it, 6052 ps for the 16-it nd ps for the 32-it. This is euse, in the OR gte, the dely through pin is greter thn through pin, nd in the less noisy dt sign onverter we mke -> (OR), so we re mking the est seletion for dely riteri. 5 Conlusions In the mixed-signl ommunity is widely epted the importne of deresing swithing noise to improve the performne of the A/D integrted iruits. This ommunition nlyes nd presents some solutions to redue the swithing noise in onventionl CMOS digitl designs. Suh tions tke ple t gte-level, very lose to most of digitl designer nd simply onsists in finding equivlent iruits nd strutures with less peks in supply urrent. More speifilly, design methodology sed in pin swpping hs een proposed, lso onsidering the effets of input slope in noise generted. The proposed tehniques hve een vlidted through seleted exmples, showing the improvement in terms of swithing noise. It hs lso een demonstrted tht deresing swithing noise does not neessrily mens degrdtion of performnes. Future work will e devoted to utomte the optimition of iruit t gte level onsidering the swithing noise redution s trget. Finlly, n dditionl ojetive is the design of lirry ell oriented towrds low swithing noise genertion to e used in mixed-signl designs. Referenes 1. D.J. Allstot, S-H. Chee nd M. Shrivstw, Folded Soure-Coupled Logi vs. CMOS Stti Logi for Low-Noise Mixed-Signl ICs, IEEE Trns. Ciruits nd Systems I, 40, pp , Sept Y. Tsividis, Mixed Anlog-Digitl VLSI Design nd Tehnology. MGrw-Hill, X. Argonès, J. L. Gonále nd A. Ruio, Anlysis nd Solutions for Swithing Noise Coupling in Mixed-Signl ICs. Kluwer Ademi Pulishers, H-T. Ng nd D.J. Allstot, CMOS Current Steering Logi for Low-Voltge Mixed-Signl Integrted Ciruit, IEEE Trns. VLSI Systems, 5, pp , Sept E. Aluquerque, J. Fernndes nd M. Silv, NMOS Current-Blned Logi, Eletronis Letters, 32, pp , My A.J. Aost, R. Jiméne, J., M. J. Jun, Bellido, nd M. Vleni, Influene of loking strtegies on the design of low swithing-noise digitl nd mixed-signl VLSI iruits, in 10th PATMOS, pp , Göttingen, Sept R. Jiméne, A.J. Aost, J. Jun, M.J. Bellido nd M. Vleni, Study nd Anlysis of Low- Voltge Low-Power CMOS Logi Fmilies for Redution of Swithing Noise, in 9th PAT- MOS, pp , Kos Islnd, Otoer Dtsheets of 0.35 µm Stndrd Cells, Austri Miro Systems in produts/tehnology/index_035.html 9. A.J. Aost, P. Prr, J. Jun, M. Vleni, nd R. Jiméne, Redution of Swithing Noise in Low-Power CMOS Digitl Ciruits y Gte-level Optimition, Interntionl Workshop on Logi nd Synthesis, pp June 2001.

Lecture 6. CMOS Static & Dynamic Logic Gates. Static CMOS Circuit. PMOS Transistors in Series/Parallel Connection

Lecture 6. CMOS Static & Dynamic Logic Gates. Static CMOS Circuit. PMOS Transistors in Series/Parallel Connection NMOS Trnsistors in Series/Prllel onnetion Leture 6 MOS Stti & ynmi Logi Gtes Trnsistors n e thought s swith ontrolled y its gte signl NMOS swith loses when swith ontrol input is high Peter heung eprtment

More information

Unit 4. Combinational Circuits

Unit 4. Combinational Circuits Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute

More information

Engr354: Digital Logic Circuits

Engr354: Digital Logic Circuits Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost

More information

ANALYSIS AND MODELLING OF RAINFALL EVENTS

ANALYSIS AND MODELLING OF RAINFALL EVENTS Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.

More information

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000

Dorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000 orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

More information

COMPARATIVE STUDY OF ENCODERS FOR PARALLEL-TYPE ADCS

COMPARATIVE STUDY OF ENCODERS FOR PARALLEL-TYPE ADCS OMPAATIVE TUDY OF ENODE FO PAALLEL-TYPE AD Pul Pereir (,3), Jorge. Fernndes (2,3) () Deptº Engª Eletroténi, Esol uperior de Tenologi, I.P..B., Av. Empresário, 6000-767 stelo Brno, Portugl Phone (35)272339357

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

Appendix C Partial discharges. 1. Relationship Between Measured and Actual Discharge Quantities

Appendix C Partial discharges. 1. Relationship Between Measured and Actual Discharge Quantities Appendi Prtil dishrges. Reltionship Between Mesured nd Atul Dishrge Quntities A dishrging smple my e simply represented y the euilent iruit in Figure. The pplied lternting oltge V is inresed until the

More information

Generalization of 2-Corner Frequency Source Models Used in SMSIM

Generalization of 2-Corner Frequency Source Models Used in SMSIM Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville

More information

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions

Activities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd

More information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

Research Article Comparative Studies of Different Switching Patterns for Direct and Indirect Space Vector Modulated Matrix Converter

Research Article Comparative Studies of Different Switching Patterns for Direct and Indirect Space Vector Modulated Matrix Converter dvnes in Power Eletronis Volume, rtile ID 854, 8 pges doi:.55//854 Reserh rtile omprtive Studies of Different Swithing Ptterns for Diret nd Indiret Spe Vetor Modulted Mtrix onverter min Shnpour, Ssn Gholmi,

More information

NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE

NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE NEW CIRCUITS OF HIGH-VOLTAGE PULSE GENERATORS WITH INDUCTIVE-CAPACITIVE ENERGY STORAGE V.S. Gordeev, G.A. Myskov Russin Federl Nuler Center All-Russi Sientifi Reserh Institute of Experimentl Physis (RFNC-VNIIEF)

More information

Part 4. Integration (with Proofs)

Part 4. Integration (with Proofs) Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1

More information

Algorithms for MIS Vector Generation and Pruning

Algorithms for MIS Vector Generation and Pruning Algorithms for MS Vetor Genertion nd Pruning Kenneth S. Stevens Eletril nd Computer Engineering University of Uth Slt Lke City, Uth kstevens@ee.uth.edu ABSTRACT Florentin Drtu Synopsys, n. Advned Tehnology

More information

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

Review Topic 14: Relationships between two numerical variables

Review Topic 14: Relationships between two numerical variables Review Topi 14: Reltionships etween two numeril vriles Multiple hoie 1. Whih of the following stterplots est demonstrtes line of est fit? A B C D E 2. The regression line eqution for the following grph

More information

TIME AND STATE IN DISTRIBUTED SYSTEMS

TIME AND STATE IN DISTRIBUTED SYSTEMS Distriuted Systems Fö 5-1 Distriuted Systems Fö 5-2 TIME ND STTE IN DISTRIUTED SYSTEMS 1. Time in Distriuted Systems Time in Distriuted Systems euse eh mhine in distriuted system hs its own lok there is

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

Chapter 4 State-Space Planning

Chapter 4 State-Space Planning Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into

More information

Exercise 3 Logic Control

Exercise 3 Logic Control Exerise 3 Logi Control OBJECTIVE The ojetive of this exerise is giving n introdution to pplition of Logi Control System (LCS). Tody, LCS is implemented through Progrmmle Logi Controller (PLC) whih is lled

More information

y1 y2 DEMUX a b x1 x2 x3 x4 NETWORK s1 s2 z1 z2

y1 y2 DEMUX a b x1 x2 x3 x4 NETWORK s1 s2 z1 z2 BOOLEAN METHODS Giovnni De Miheli Stnford University Boolen methods Exploit Boolen properties. { Don't re onditions. Minimiztion of the lol funtions. Slower lgorithms, etter qulity results. Externl don't

More information

Lecture 27: Diffusion of Ions: Part 2: coupled diffusion of cations and

Lecture 27: Diffusion of Ions: Part 2: coupled diffusion of cations and Leture 7: iffusion of Ions: Prt : oupled diffusion of tions nd nions s desried y Nernst-Plnk Eqution Tody s topis Continue to understnd the fundmentl kinetis prmeters of diffusion of ions within n eletrilly

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

Behavior Composition in the Presence of Failure

Behavior Composition in the Presence of Failure Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re

More information

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09 Metodologie di progetto HW Tehnology Mpping Lst updte: 19/03/09 Tehnology Mpping 2 Tehnology Mpping Exmple: t 1 = + b; t 2 = d + e; t 3 = b + d; t 4 = t 1 t 2 + fg; t 5 = t 4 h + t 2 t 3 ; F = t 5 ; t

More information

Nondeterministic Automata vs Deterministic Automata

Nondeterministic Automata vs Deterministic Automata Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n

More information

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

Electromagnetism Notes, NYU Spring 2018

Electromagnetism Notes, NYU Spring 2018 Eletromgnetism Notes, NYU Spring 208 April 2, 208 Ation formultion of EM. Free field desription Let us first onsider the free EM field, i.e. in the bsene of ny hrges or urrents. To tret this s mehnil system

More information

University of Sioux Falls. MAT204/205 Calculus I/II

University of Sioux Falls. MAT204/205 Calculus I/II University of Sioux Flls MAT204/205 Clulus I/II Conepts ddressed: Clulus Textook: Thoms Clulus, 11 th ed., Weir, Hss, Giordno 1. Use stndrd differentition nd integrtion tehniques. Differentition tehniques

More information

Iowa Training Systems Trial Snus Hill Winery Madrid, IA

Iowa Training Systems Trial Snus Hill Winery Madrid, IA Iow Trining Systems Tril Snus Hill Winery Mdrid, IA Din R. Cohrn nd Gil R. Nonneke Deprtment of Hortiulture, Iow Stte University Bkground nd Rtionle: Over the lst severl yers, five sttes hve een evluting

More information

Table of Content. c 1 / 5

Table of Content. c 1 / 5 Tehnil Informtion - t nd t Temperture for Controlger 03-2018 en Tble of Content Introdution....................................................................... 2 Definitions for t nd t..............................................................

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

THE PYTHAGOREAN THEOREM

THE PYTHAGOREAN THEOREM THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this

More information

Electronic Circuits I Revision after midterm

Electronic Circuits I Revision after midterm Eletroni Ciruits I Revision fter miterm Dr. Ahme ElShfee, ACU : Fll 2018, Eletroni Ciruits I -1 / 14 - MCQ1 # Question If the frequeny of the input voltge in Figure 2 36 is inrese, the output voltge will

More information

Nondeterministic Finite Automata

Nondeterministic Finite Automata Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)

More information

= state, a = reading and q j

= state, a = reading and q j 4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those

More information

Implication Graphs and Logic Testing

Implication Graphs and Logic Testing Implition Grphs n Logi Testing Vishwni D. Agrwl Jmes J. Dnher Professor Dept. of ECE, Auurn University Auurn, AL 36849 vgrwl@eng.uurn.eu www.eng.uurn.eu/~vgrwl Joint reserh with: K. K. Dve, ATI Reserh,

More information

AC/DC/AC Converters: Two-Level and Multilevel VSI

AC/DC/AC Converters: Two-Level and Multilevel VSI Sortes Ersmus Visit A/D/A onerters: Two-Leel nd Multileel VSI Josep Pou Antoni Aris Pge 1 Sortes Ersmus Visit Outline 1. Two-Leel Inerter 2. Multileel Inerters - sde H-Bridge Inerter - Flying-pitor Inerter

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their

More information

Alpha Algorithm: Limitations

Alpha Algorithm: Limitations Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t

More information

Comparing the Pre-image and Image of a Dilation

Comparing the Pre-image and Image of a Dilation hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1. Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of

More information

Automatic Synthesis of New Behaviors from a Library of Available Behaviors

Automatic Synthesis of New Behaviors from a Library of Available Behaviors Automti Synthesis of New Behviors from Lirry of Aville Behviors Giuseppe De Giomo Università di Rom L Spienz, Rom, Itly degiomo@dis.unirom1.it Sestin Srdin RMIT University, Melourne, Austrli ssrdin@s.rmit.edu.u

More information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points: Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer

More information

Polyphase Systems. Objectives 23.1 INTRODUCTION

Polyphase Systems. Objectives 23.1 INTRODUCTION Polyphse Systems 23 Ojetives eome fmilir with the opertion of threephse genertor nd the mgnitude nd phse reltionship etween the three phse voltges. e le to lulte the voltges nd urrents for three-phse Y-onneted

More information

THE INFLUENCE OF MODEL RESOLUTION ON AN EXPRESSION OF THE ATMOSPHERIC BOUNDARY LAYER IN A SINGLE-COLUMN MODEL

THE INFLUENCE OF MODEL RESOLUTION ON AN EXPRESSION OF THE ATMOSPHERIC BOUNDARY LAYER IN A SINGLE-COLUMN MODEL THE INFLUENCE OF MODEL RESOLUTION ON AN EXPRESSION OF THE ATMOSPHERIC BOUNDARY LAYER IN A SINGLE-COLUMN MODEL P3.1 Kot Iwmur*, Hiroto Kitgw Jpn Meteorologil Ageny 1. INTRODUCTION Jpn Meteorologil Ageny

More information

Technology Mapping Method for Low Power Consumption and High Performance in General-Synchronous Framework

Technology Mapping Method for Low Power Consumption and High Performance in General-Synchronous Framework R-17 SASIMI 015 Proeeings Tehnology Mpping Metho for Low Power Consumption n High Performne in Generl-Synhronous Frmework Junki Kwguhi Yukihie Kohir Shool of Computer Siene, the University of Aizu Aizu-Wkmtsu

More information

CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation

CS12N: The Coming Revolution in Computer Architecture Laboratory 2 Preparation CS2N: The Coming Revolution in Computer Architecture Lortory 2 Preprtion Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes

More information

6.3.2 Spectroscopy. N Goalby chemrevise.org 1 NO 2 H 3 CH3 C. NMR spectroscopy. Different types of NMR

6.3.2 Spectroscopy. N Goalby chemrevise.org 1 NO 2 H 3 CH3 C. NMR spectroscopy. Different types of NMR 6.. Spetrosopy NMR spetrosopy Different types of NMR NMR spetrosopy involves intertion of mterils with the lowenergy rdiowve region of the eletromgneti spetrum NMR spetrosopy is the sme tehnology s tht

More information

Discrete Structures Lecture 11

Discrete Structures Lecture 11 Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.

More information

Compiler Design. Spring Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz University of Southern Cliforni Computer Siene Deprtment Compiler Design Spring 7 Lexil Anlysis Smple Exerises nd Solutions Prof. Pedro C. Diniz USC / Informtion Sienes Institute 47 Admirlty Wy, Suite

More information

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.

Lesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem. 27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we

More information

Polyphase Systems 22.1 INTRODUCTION

Polyphase Systems 22.1 INTRODUCTION 22 Polyphse Systems 22.1 INTRODUTION n genertor designed to develop single sinusoidl voltge for eh rottion of the shft (rotor) is referred to s single-phse genertor. If the numer of oils on the rotor is

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix

Matrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri

More information

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths

Intermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

12.4 Similarity in Right Triangles

12.4 Similarity in Right Triangles Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right

More information

Chapter 8 Roots and Radicals

Chapter 8 Roots and Radicals Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi

More information

Introduction to Olympiad Inequalities

Introduction to Olympiad Inequalities Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................

More information

(h+ ) = 0, (3.1) s = s 0, (3.2)

(h+ ) = 0, (3.1) s = s 0, (3.2) Chpter 3 Nozzle Flow Qusistedy idel gs flow in pipes For the lrge vlues of the Reynolds number typilly found in nozzles, the flow is idel. For stedy opertion with negligible body fores the energy nd momentum

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1) Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 22 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

Damping of Power System Oscillations using Unified Power Flow Controller (UPFC)

Damping of Power System Oscillations using Unified Power Flow Controller (UPFC) INDIAN INSTITUTE OF TECHNOLOGY, KHARAGPUR 73, DECEMBER 7-9, 47 of Power System Osilltions using Unified Power Flow Controller (UPFC) Neelim Tmey M. L. Kothri Astrt--This pper presents systemti pproh for

More information

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then

For a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,

More information

Learning Partially Observable Markov Models from First Passage Times

Learning Partially Observable Markov Models from First Passage Times Lerning Prtilly Oservle Mrkov s from First Pssge s Jérôme Cllut nd Pierre Dupont Europen Conferene on Mhine Lerning (ECML) 8 Septemer 7 Outline. FPT in models nd sequenes. Prtilly Oservle Mrkov s (POMMs).

More information

I 3 2 = I I 4 = 2A

I 3 2 = I I 4 = 2A ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents

More information

6.3.2 Spectroscopy. N Goalby chemrevise.org 1 NO 2 CH 3. CH 3 C a. NMR spectroscopy. Different types of NMR

6.3.2 Spectroscopy. N Goalby chemrevise.org 1 NO 2 CH 3. CH 3 C a. NMR spectroscopy. Different types of NMR 6.. Spetrosopy NMR spetrosopy Different types of NMR NMR spetrosopy involves intertion of mterils with the lowenergy rdiowve region of the eletromgneti spetrum NMR spetrosopy is the sme tehnology s tht

More information

Available online at ScienceDirect. Procedia Engineering 120 (2015 ) EUROSENSORS 2015

Available online at  ScienceDirect. Procedia Engineering 120 (2015 ) EUROSENSORS 2015 Aville online t www.sienediret.om SieneDiret Proedi Engineering 10 (015 ) 887 891 EUROSENSORS 015 A Fesiility Study for Self-Osillting Loop for Three Degreeof-Freedom Coupled MEMS Resontor Fore Sensor

More information

Context model automata for text compression (published in The ComputerJournal, 41 (7), , 1998)

Context model automata for text compression (published in The ComputerJournal, 41 (7), , 1998) Context model utomt for text ompression (pulished in The ComputerJournl, 41 (7), 474-485, 1998) Psi Fränti Deprtment of Computer Siene, University of Joensuu, Box 111, FIN-80101 Joensuu, FINLAND Timo Htkk

More information

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting.

Instructions. An 8.5 x 11 Cheat Sheet may also be used as an aid for this test. MUST be original handwriting. ID: B CSE 2021 Computer Orgniztion Midterm Test (Fll 2009) Instrutions This is losed ook, 80 minutes exm. The MIPS referene sheet my e used s n id for this test. An 8.5 x 11 Chet Sheet my lso e used s

More information

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.

April 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then. pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm

More information

Robustness of Evolvable Hardware in the Case of Fault and Environmental Change

Robustness of Evolvable Hardware in the Case of Fault and Environmental Change Proeedings of the IEEE Interntionl Conferene on Rootis nd Biomimetis Deemer -,, Guilin, Chin Roustness of Evolvle Hrdwre in the Cse of Fult nd Environmentl Chnge Jin Gong, Mengfei Yng Astrt The ontroller

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing

More information

Symmetrical Components 1

Symmetrical Components 1 Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

Chapter Gauss Quadrature Rule of Integration

Chapter Gauss Quadrature Rule of Integration Chpter 7. Guss Qudrture Rule o Integrtion Ater reding this hpter, you should e le to:. derive the Guss qudrture method or integrtion nd e le to use it to solve prolems, nd. use Guss qudrture method to

More information

Magnetically Coupled Coil

Magnetically Coupled Coil Mgnetilly Coupled Ciruits Overview Mutul Indutne Energy in Coupled Coils Liner Trnsformers Idel Trnsformers Portlnd Stte University ECE 22 Mgnetilly Coupled Ciruits Ver..3 Mgnetilly Coupled Coil i v L

More information

EE 108A Lecture 2 (c) W. J. Dally and P. Levis 2

EE 108A Lecture 2 (c) W. J. Dally and P. Levis 2 EE08A Leture 2: Comintionl Logi Design EE 08A Leture 2 () 2005-2008 W. J. Dlly n P. Levis Announements Prof. Levis will hve no offie hours on Friy, Jn 8. Ls n setions hve een ssigne - see the we pge Register

More information

EECS 141 Due 04/19/02, 5pm, in 558 Cory

EECS 141 Due 04/19/02, 5pm, in 558 Cory UIVERSITY OF CALIFORIA College of Engineering Deprtment of Electricl Engineering nd Computer Sciences Lst modified on April 8, 2002 y Tufn Krlr (tufn@eecs.erkeley.edu) Jn M. Rey, Andrei Vldemirescu Homework

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

The Double Integral. The Riemann sum of a function f (x; y) over this partition of [a; b] [c; d] is. f (r j ; t k ) x j y k

The Double Integral. The Riemann sum of a function f (x; y) over this partition of [a; b] [c; d] is. f (r j ; t k ) x j y k The Double Integrl De nition of the Integrl Iterted integrls re used primrily s tool for omputing double integrls, where double integrl is n integrl of f (; y) over region : In this setion, we de ne double

More information

Propositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches.

Propositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches. Propositionl models Historil models of omputtion Steven Lindell Hverford College USA 1/22/2010 ISLA 2010 1 Strt with fixed numer of oolen vriles lled the voulry: e.g.,,. Eh oolen vrile represents proposition,

More information

Adaptive Controllers for Permanent Magnet Brushless DC Motor Drive System using Adaptive-Network-based Fuzzy Interference System

Adaptive Controllers for Permanent Magnet Brushless DC Motor Drive System using Adaptive-Network-based Fuzzy Interference System Amerin Journl of Applied Sienes 8 (8): 810-815, 2011 ISSN 1546-9239 2011 Siene Pulitions Adptive Controllers for Permnent Mgnet Brushless DC Motor Drive System using Adptive-Network-sed Fuzzy Interferene

More information

Note 12. Introduction to Digital Control Systems

Note 12. Introduction to Digital Control Systems Note Introduction to Digitl Control Systems Deprtment of Mechnicl Engineering, University Of Ssktchewn, 57 Cmpus Drive, Ssktoon, SK S7N 5A9, Cnd . Introduction A digitl control system is one in which the

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, Games & Hennessy Milner logic Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory

More information

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt

More information