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

Size: px
Start display at page:

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

Transcription

1 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 of Eletril & Eletroni Engineering Imperil ollege London X Y Y = X if nd Reding: Weste & Rey pp189-10, -34 X Y Y = X if OR URL: E-mil: p.heung@i..uk NMOS Trnsistors pss strong 0 ut wek 1 Leture 6-1 Leture 6 - PMOS Trnsistors in Series/Prllel onnetion PMOS swith loses when swith ontrol input is low Stti MOS iruit si MOS omintionl iruits onsist of: omplementry pull-up (p-type) nd pull-down (n-type) X Y Y = X if N = + X Y Y = X if OR = PMOS Trnsistors pss strong 1 ut wek 0 Leture 6-3 Leture 6-4

2 Stti MOS Emple Gte: NN Leture 6-5 Leture 6-6 Emple Gte: NOR omple Gte We n form omple omintionl iruit funtion in omplementry tree. The proedure to onstrut omplementry tree is s follow:- Epress the oolen epression in n inverted form or the n-trnsistor tree, working from the innermost rket to the outer-most term, onnet the OR term trnsistors in prllel, nd the N term trnsistors in series or the p-trnsistor tree, working from the innermost rket to the outer-most term, onnet the OR term trnsistors in series, nd the N term trnsistors in prllel Leture 6-7 Leture 6-8

3 Emple Gte: OMPLEX MOS GTE Properties of omplementry MOS Gtes OUT = + (+) 1) High noise mrgins : V OH nd V OL re t nd, respetively. ) No stti power onsumption : There never eists diret pth etween nd () in stedy-stte mode. 3) omprle rise nd fll times: (under the pproprite sling onditions) Leture 6-9 Leture 6-10 Trnsistor Sizing Propgtion ely nlysis - The Swith Model for symmetril response (d, ) for performne = R ON Input ependent ous on worst-se ssume µ n =3* µ p (i.e. n-hnnel trnsistors hs 3 times the trnsondutne s tht of p- hnnel.) V R R p R p R p p R R p n R n L R n R n R n () Inverter () -input NN () -input NOR t p = 0.69 R on (ssuming tht domintes!) Leture 6-11 Leture 6-1

4 Wht is the Vlue of R on? Numeril Emples of Resistnes for 1.µm MOS or this proess, Wp = 3*Wn for the sme resistne Leture 6-13 Leture 6-14 nlysis of Propgtion ely esign for Worst se R p R p R n R n -input NN 1. ssume R n =R p = resistne of minimum sized NMOS inverter. etermine Worst se Input trnsition (ely depends on input vlues) 3. Emple: t plh for input NN - Worst se when only ONE PMOS Pulls up the output node - or PMOS devies in prllel, the resistne is lower t plh = 0.69R p 4. Emple: t phl for input NN - Worst se : TWO NMOS in series t phl = 0.69(R n ) Here it is ssumed tht R p = R n Leture 6-15 Leture 6-16

5 st omple Gte - esign Tehniques Trnsistor Sizing: s long s n-out pitne domintes st omple Gte - esign Tehniques () Trnsistor Ordering Progressive Sizing: ritil pth ritil pth In N MN M3 M1 M1 > M > M3 > MN M3 3 istriuted R-line In M In M In M M1 1 n Redue ely with more thn 30%! M1 1 () M3 3 () Leture 6-17 Leture 6-18 st omple Gte - esign Tehniques (3) Improved Logi esign st omple Gte - esign Tehniques (4) uffering: Isolte n-in from n-out Leture 6-19 Leture 6-0

6 Emple: ull dder Revised dder iruit X o S "0"-Propgte "1"-Propgte Kill o Generte S o = + (+) 8 trnsistors 4 trnsistors Leture 6-1 Leture 6 - Rtioed Logi Rtioed Logi Resistive Lod In R L epletion Lod In V T < 0 PMOS Lod In Resistive Lod R L N trnsistors + Lod V OH = V OL = R PN R PN + R L () resistive lod () depletion lod NMOS () pseudo-nmos In ssymetril response Stti power onsumption Gol: to redue the numer of devies over omplementry MOS t pl = 0.69 R L Leture 6-3 Leture 6-4

7 tive Lods Psuedo NMOS epletion Lod V T < 0 PMOS Lod isdvntges of previous iruit : lmost twie s mny trnsistors s equivlent NMOS implementtion. If there re too mny series trnsistors in the tree, swithing speed is redued. Try pseudo NMOS iruit:- In In depletion lod NMOS pseudo-nmos The pull-up p-hnnel trnsistor is lwys onduting. isdvntges: high d.. dissiption & slow rise time. Leture 6-5 Leture 6-6 Pseudo-NMOS NN Gte Improved Lods (1) M1 M 1 ul sode Voltge Swith Logi (VSL) Leture 6-7 Leture 6-8

8 Emple ynmi Logi There is nother lss of logi gtes whih relies on the use of lok signl. This lss of iruit is known s dynmi iruits. The lok signl is used to divide the gte opertion into two hlves. In the first hlf, the output node is pre-hrged to high or low logi stte. In the seond hlf of lok yle, the iruit evlutes the orret output stte. When Ø is low, Z is hrged to high. When Ø is high, n logi lok evlutes input, nd onditionlly dishrges Z. This iruit dds series resistne to the pull-down n-hnnel trnsistor, therefore the fll time is inresed slightly. This iruit is dynmi euse during evlution, the output high level t Z is mintined y the stry pitne t the output node. If Ø stys high (i.e. evlution period) for long time, Z my eventully dishrge to low logi level. XOR-NXOR gte Leture 6-9 Leture 6-30 Prolem with sding ynmi Logi MOS omino Logi Prolem with sding suh s iruit:- Inputs n only e hnged when Ø is low nd must e stle when Ø is high. When Ø is low, oth P1 nd P re prehrged to high voltge. However when Ø is high, dely through on the output P1 my erroneously dishrge P. Solution to the ove prolem:- dd n inverter to ensure tht the output is low during prehrge, nd prevent the net stge from evluting, until the urrent stge hs finished evlution. This ensures tht eh stge (t the output of the inverter) will mke t most single trnsition from 0 -> 1. When mny stges re sded, evlution proeeds from one stge to the net - similr to dominos flling one fter nother. isdvntges of domino logi:- Only non-inverting logi is possile, i.e. output lso high tive Eh gte needs n inverter; hene more trnsistors Suffer from hrge shring effet (onsidered lter) Leture 6-31 Leture 6-3

9 lternting dynmi logi (1) lternting dynmi logi () nother possile sheme is to use lternte n nd p logi loks s shown elow. In this sheme, eh lternte stge is pre-hrged high nd low. Eh stge uses lternte n nd p trnsistors to implement the gte funtion. Stge 1 mkes t most one high to low trnsition, while stge mkes t most one low to high trnsition for eh evlution. Sine the p logi lok will only hnge stte if input is low, this iruit ehves like the domino logi. slight vrition of this iruit is show elow, where n inverter is dded per stge to inrese fleiility. Here eh stge n drive either n or p loks nd oth low tive nd high tive logi n e implemented. Leture 6-33 Leture 6-34 Mking ynmi Gte stti Pss Trnsistor Logi inlly, y dding feedk pullup, we n mke the iruit stti. This iruit turns the originlly dynmi gte into stti gte euse the feedk trnsistor n mintin logi high level t the node Z for n indefinite length of time. Without this feedk trnsistor, the hrge stored t the node Z will eventully lek wy. n lterntive design style is to use pss trnsistors. The following is n emple of multipleer. omplementry trnsmission gtes re used here euse n-hnnel pss trnsistors will pss 0 logi level well ut, 1 logi level poorly. This is euse in order for the n-trnsistor to e ON, V gs must e greter thn V th. Therefore eh series n trnsistor will degrde the 1 logi level y V th. The opposite is true with p-hnnel pss trnsistors: 0 logi level is pssed poorly. Leture 6-35 Leture 6-36

10 Pss Trnsistor Logi with feedk Pss Trnsistor XOR gte This iruit uses only n trnsistors, therefore it is eonomil on trnsistor ount. In order to ensure tht the 1 logi level is pssed properly, p pull-up trnsistor is dded. This restores the 1 logi level t the input of the inverter. Pss trnsistor logi n sometimes e very eonomil in implementing logi funtions. or emple, n XOR gte n e implemented with just two trnsmission gtes:- Leture 6-37 Leture input NN Gte Stndrd ell Lyout Methodology Vdd In In 4 metl1 Well In In 4 In1 In In3 In4 signls Routing hnnel polysilion Leture 6-39 Leture 6-40

11 Two Versions of (+). Logi Grph PUN j i () Input order { } () Input order { } i j Leture 6-41 Leture 6-4 onsistent Euler Pth Emple: = +d i d d () Logi grphs for (+d) () Euler Pths { d} j { } d () stik digrm for ordering { d} Leture 6-43 Leture 6-44

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

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005 RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).

More information

SOLUTIONS TO ASSIGNMENT NO The given nonrecursive signal processing structure is shown as

SOLUTIONS TO ASSIGNMENT NO The given nonrecursive signal processing structure is shown as SOLUTIONS TO ASSIGNMENT NO.1 3. The given nonreursive signl proessing struture is shown s X 1 1 2 3 4 5 Y 1 2 3 4 5 X 2 There re two ritil pths, one from X 1 to Y nd the other from X 2 to Y. The itertion

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

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

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

Section 1.3 Triangles

Section 1.3 Triangles Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior

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

Digital Integrated Circuits A Design Perspective

Digital Integrated Circuits A Design Perspective Designing ombinational Logic ircuits dapted from hapter 6 of Digital Integrated ircuits Design Perspective Jan M. Rabaey et al. opyright 2003 Prentice Hall/Pearson 1 ombinational vs. Sequential Logic In

More information

Based on slides/material by. Topic 3-4. Combinational Logic. Outline. The CMOS Inverter: A First Glance

Based on slides/material by. Topic 3-4. Combinational Logic. Outline. The CMOS Inverter: A First Glance ased on slides/material by Topic 3 J. Rabaey http://bwrc.eecs.berkeley.edu/lasses/icook/instructors.html Digital Integrated ircuits: Design Perspective, Prentice Hall D. Harris http://www.cmosvlsi.com/coursematerials.html

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

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

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

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

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

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

Logarithms LOGARITHMS.

Logarithms LOGARITHMS. Logrithms LOGARITHMS www.mthletis.om.u Logrithms LOGARITHMS Logrithms re nother method to lulte nd work with eponents. Answer these questions, efore working through this unit. I used to think: In the

More information

COMBINATIONAL LOGIC. Combinational Logic

COMBINATIONAL LOGIC. Combinational Logic COMINTIONL LOGIC Overview Static CMOS Conventional Static CMOS Logic Ratioed Logic Pass Transistor/Transmission Gate Logic Dynamic CMOS Logic Domino np-cmos Combinational vs. Sequential Logic In Logic

More information

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES

PAIR OF LINEAR EQUATIONS IN TWO VARIABLES PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep

More information

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

Reduction of Switching Noise in Digital CMOS Circuits by Pin Swapping of Library Cells 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

More information

Spacetime and the Quantum World Questions Fall 2010

Spacetime and the Quantum World Questions Fall 2010 Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1

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

expression simply by forming an OR of the ANDs of all input variables for which the output is

expression simply by forming an OR of the ANDs of all input variables for which the output is 2.4 Logic Minimiztion nd Krnugh Mps As we found ove, given truth tle, it is lwys possile to write down correct logic expression simply y forming n OR of the ANDs of ll input vriles for which the output

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

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

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

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

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

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

, 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

SECTION A STUDENT MATERIAL. Part 1. What and Why.?

SECTION A STUDENT MATERIAL. Part 1. What and Why.? SECTION A STUDENT MATERIAL Prt Wht nd Wh.? Student Mteril Prt Prolem n > 0 n > 0 Is the onverse true? Prolem If n is even then n is even. If n is even then n is even. Wht nd Wh? Eploring Pure Mths Are

More information

Properties of CMOS Gates Snapshot

Properties of CMOS Gates Snapshot MOS logic 1 Properties of MOS Gates Snapshot High noise margins: V OH and V OL are at V DD and GND, respectively. No static power consumption: There never exists a direct path between V DD and V SS (GND)

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

CIT 596 Theory of Computation 1. Graphs and Digraphs

CIT 596 Theory of Computation 1. Graphs and Digraphs CIT 596 Theory of Computtion 1 A grph G = (V (G), E(G)) onsists of two finite sets: V (G), the vertex set of the grph, often enote y just V, whih is nonempty set of elements lle verties, n E(G), the ege

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

21.1 Using Formulae Construct and Use Simple Formulae Revision of Negative Numbers Substitution into Formulae

21.1 Using Formulae Construct and Use Simple Formulae Revision of Negative Numbers Substitution into Formulae MEP Jmi: STRAND G UNIT 1 Formule: Student Tet Contents STRAND G: Alger Unit 1 Formule Student Tet Contents Setion 1.1 Using Formule 1. Construt nd Use Simple Formule 1.3 Revision of Negtive Numers 1.4

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

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

Solutions - Homework 1 (Due date: September 9:30 am) Presentation and clarity are very important!

Solutions - Homework 1 (Due date: September 9:30 am) Presentation and clarity are very important! ECE-238L: Computer Logi Design Fll 23 Solutions - Homework (Due dte: Septemer 2th @ 9:3 m) Presenttion nd lrity re very importnt! PROBLEM (5 PTS) ) Simpliy the ollowing untions using ONLY Boolen Alger

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

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

Digital Integrated Circuits A Design Perspective

Digital Integrated Circuits A Design Perspective igital Integrated Circuits esign Perspective esigning Combinational Logic Circuits 1 Combinational vs. Sequential Logic In Combinational Logic Circuit Out In Combinational Logic Circuit Out State Combinational

More information

UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer Sciences

UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Department of Electrical Engineering and Computer Sciences UNIVERSITY OF CALIFORNIA, BERKELEY College of Engineering Deprtment of Electricl Engineering nd Computer Sciences Eld Alon Homework #3 Solutions EECS4 PROBLEM : CMOS Logic ) Implement the logic function

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

EE141. Administrative Stuff

EE141. Administrative Stuff -Spring 2004 Digital Integrated ircuits Lecture 15 Logical Effort Pass Transistor Logic 1 dministrative Stuff First (short) project to be launched next Th. Overall span: 1 week Hardware lab this week Hw

More information

Fault Modeling. EE5375 ADD II Prof. MacDonald

Fault Modeling. EE5375 ADD II Prof. MacDonald Fult Modeling EE5375 ADD II Prof. McDonld Stuck At Fult Models l Modeling of physicl defects (fults) simplify to logicl fult l stuck high or low represents mny physicl defects esy to simulte technology

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

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

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

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

Mathematics SKE: STRAND F. F1.1 Using Formulae. F1.2 Construct and Use Simple Formulae. F1.3 Revision of Negative Numbers

Mathematics SKE: STRAND F. F1.1 Using Formulae. F1.2 Construct and Use Simple Formulae. F1.3 Revision of Negative Numbers Mthemtis SKE: STRAND F UNIT F1 Formule: Tet STRAND F: Alger F1 Formule Tet Contents Setion F1.1 Using Formule F1. Construt nd Use Simple Formule F1.3 Revision of Negtive Numers F1.4 Sustitution into Formule

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

a) Read over steps (1)- (4) below and sketch the path of the cycle on a P V plot on the graph below. Label all appropriate points.

a) Read over steps (1)- (4) below and sketch the path of the cycle on a P V plot on the graph below. Label all appropriate points. Prole 3: Crnot Cyle of n Idel Gs In this prole, the strting pressure P nd volue of n idel gs in stte, re given he rtio R = / > of the volues of the sttes nd is given Finlly onstnt γ = 5/3 is given You

More information

Boolean Algebra cont. The digital abstraction

Boolean Algebra cont. The digital abstraction Boolen Alger ont The igitl strtion Theorem: Asorption Lw For every pir o elements B. + =. ( + ) = Proo: () Ientity Distriutivity Commuttivity Theorem: For ny B + = Ientity () ulity. Theorem: Assoitive

More information

1. Logic verification

1. Logic verification . Logi verifition Bsi priniples of OBDD s Vrile ordering Network of gtes => OBDD s FDD s nd OKFDD s Resoning out iruits Struturl methods Stisfiility heker Logi verifition The si prolem: prove tht two iruits

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

Exam Review. John Knight Electronics Department, Carleton University March 2, 2009 ELEC 2607 A MIDTERM

Exam Review. John Knight Electronics Department, Carleton University March 2, 2009 ELEC 2607 A MIDTERM riting Exms: Exm Review riting Exms += riting Exms synhronous iruits Res, yles n Stte ssignment Synhronous iruits Stte-Grph onstrution n Smll Prolems lso Multiple Outputs, n Hrer omintionl Prolem riting

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 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

Test Generation from Timed Input Output Automata

Test Generation from Timed Input Output Automata Chpter 8 Test Genertion from Timed Input Output Automt The purpose of this hpter is to introdue tehniques for the genertion of test dt from models of softwre sed on vrints of timed utomt. The tests generted

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

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

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

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

CMOS Digital Integrated Circuits Lec 10 Combinational CMOS Logic Circuits

CMOS Digital Integrated Circuits Lec 10 Combinational CMOS Logic Circuits Lec 10 Combinational CMOS Logic Circuits 1 Combinational vs. Sequential Logic In Combinational Logic circuit Out In Combinational Logic circuit Out State Combinational The output is determined only by

More information

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph.

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph. nlyzing Dmped Oscilltions Prolem (Medor, exmple 2-18, pp 44-48): Determine the eqution of the following grph. The eqution is ssumed to e of the following form f ( t) = K 1 u( t) + K 2 e!"t sin (#t + $

More information

332:221 Principles of Electrical Engineering I Fall Hourly Exam 2 November 6, 2006

332:221 Principles of Electrical Engineering I Fall Hourly Exam 2 November 6, 2006 2:221 Principles of Electricl Engineering I Fll 2006 Nme of the student nd ID numer: Hourly Exm 2 Novemer 6, 2006 This is closed-ook closed-notes exm. Do ll your work on these sheets. If more spce is required,

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

A SVC Based Control Algorithm for Load Balancing

A SVC Based Control Algorithm for Load Balancing Proeedings of the 7th WSEAS nterntionl onferene on Power Systems, eijing, hin, September 5-7, 7 A S sed ontrol Algorithm for od lning AHAD KAZEM kzemi@iust..ir A. MORAD KOOH Arshmordi@ee.iust..ir Ele.

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

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

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

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

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

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

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

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

EE 560 INTRODUCTION. Kenneth R. Laker, University of Pennsylvania

EE 560 INTRODUCTION. Kenneth R. Laker, University of Pennsylvania 1 EE 560 ITROUTIO Kenneth R. Lker, University of ennsylvni ORERIG OF TOIS 2 MOS Friction MOS Trnsistor Model Two Trnsistor ircuits (Inverters) Logic ircuits, Gtes, Ltches Regulr Structures ROMs, RMs, Ls

More information

5.4 The Quarter-Wave Transformer

5.4 The Quarter-Wave Transformer 3/4/7 _4 The Qurter Wve Trnsformer /.4 The Qurter-Wve Trnsformer Redg Assignment: pp. 73-76, 4-43 By now you ve noticed tht qurter-wve length of trnsmission le ( = λ 4, β = π ) ppers often microwve engeerg

More information

CS 347 Parallel and Distributed Data Processing

CS 347 Parallel and Distributed Data Processing CS 347 Prllel nd Distriuted Dt Proessing Spring 06 Network Prtitions Susets of nodes m e isolted or nodes m e slow in responding Notes 8: Network Prtitions CS 347 Notes 8 Network Prtitions Cuses ired network

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

Thermodynamics. Question 1. Question 2. Question 3 3/10/2010. Practice Questions PV TR PV T R

Thermodynamics. Question 1. Question 2. Question 3 3/10/2010. Practice Questions PV TR PV T R /10/010 Question 1 1 mole of idel gs is rought to finl stte F y one of three proesses tht hve different initil sttes s shown in the figure. Wht is true for the temperture hnge etween initil nd finl sttes?

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

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

1 From NFA to regular expression

1 From NFA to regular expression Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

Exercise sheet 6: Solutions

Exercise sheet 6: Solutions Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd

More information

Calculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx

Calculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx Clulus Chet Sheet Integrls Definitions Definite Integrl: Suppose f ( ) is ontinuous Anti-Derivtive : An nti-derivtive of f ( ) on [, ]. Divide [, ] into n suintervls of is funtion, F( ), suh tht F = f.

More information

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment

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

Probability. b a b. a b 32.

Probability. b a b. a b 32. Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,

More information

Outline Last time: Deriving the State Diagram & Datapath (Cont.) Mapping the Datapath onto Control

Outline Last time: Deriving the State Diagram & Datapath (Cont.) Mapping the Datapath onto Control Outline Lst time: Deriving the Stte Digrm & Dtpth (Cont.) Mpping the Dtpth onto Control This lecture: Comintionl Testility nd Test-pttern Genertion Fults in digitl circuits Wht is test? : Controllility

More information

Lecture 11 Binary Decision Diagrams (BDDs)

Lecture 11 Binary Decision Diagrams (BDDs) C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et

More information

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)

CS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.) CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts

More information

3 Angle Geometry. 3.1 Measuring Angles. 1. Using a protractor, measure the marked angles.

3 Angle Geometry. 3.1 Measuring Angles. 1. Using a protractor, measure the marked angles. 3 ngle Geometry MEP Prtie ook S3 3.1 Mesuring ngles 1. Using protrtor, mesure the mrked ngles. () () (d) (e) (f) 2. Drw ngles with the following sizes. () 22 () 75 120 (d) 90 (e) 153 (f) 45 (g) 180 (h)

More information

Similar Right Triangles

Similar Right Triangles Geometry V1.noteook Ferury 09, 2012 Similr Right Tringles Cn I identify similr tringles in right tringle with the ltitude? Cn I identify the proportions in right tringles? Cn I use the geometri mens theorems

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

Digital EE141 Integrated Circuits 2nd Combinational Circuits

Digital EE141 Integrated Circuits 2nd Combinational Circuits Digital Integrated Circuits Designing i Combinational Logic Circuits 1 Combinational vs. Sequential Logic 2 Static CMOS Circuit t every point in time (except during the switching transients) each gate

More information