Digital Control of Electric Drives
|
|
- Hector Montgomery
- 5 years ago
- Views:
Transcription
1 igitl Control o Electric rives Logic Circuits - Comintionl Boolen Alger, escription Form Czech Technicl University in Prgue Fculty o Electricl Engineering Ver.. J. Zdenek
2 Logic Comintionl Circuit Logic Comintionl Circuit (LCC) is deined y logic unction Inputs nd Outputs tke on only two possile vlues, or. y n y m At every time instnt vlues o ll output vriles re deined y vlues o input vriles only t the sme time instnt. (The LCC hs no memory, i.e. the LCC does not rememer its pst sttes) BEMEP igitl Control o Electric rives -
3 Logic Circuit Binry signls nd only igitl design igitl circuit logic circuit Logic circuit description Boolen lger, logic unctions igitl computer design generlly digitl system design esign o sic unctionl locks esign o inter-lock communiction Logic comintionl circuits (LCC) Logic sequentil circuits (LSC) LCC versus LSC LCC unction output depends on immedite unction input only LSO unction output depends on immedite inputs nd pst sttes (inner sttes) The ppliction o up-to-dt CA design tools (ls) BEMEP igitl Control o Electric rives -
4 esign prolems to e solved Function speciiction wht hs to e implemented? Hve to operte s deined in speciiction (irst ojective) esign optimliztion dierent spects (second ojective) Size Speed Power requirement Working conditions (temperture, virtion, ) Reliility Cost including design tools urtion o design phse Testility (T design or testility) BEMEP igitl Control o Electric rives -
5 Logic Comintionl Function Comintionl unction: yk (,,,..., n ), k,,..., m y y n y m BEMEP igitl Control o Electric rives -
6 igitl System esign Phses Speciiction Input nd output deinition Truth tles Boolen equtions Minimiztion esign t gte level HL - Hrdwre escription Lnguge Schem t gte level VHL, Verilog Hrdwre escription Lnguge Synthesis Behviourl (unctionl) simultion Post-route simultion igitl circuit implementtion esign veriiction Progrmmin g File Genertion BEMEP igitl Control o Electric rives -
7 Sotwre Hrdwre BASYS FPGA evice BEMEP igitl Control o Electric rives -
8 Boolen Alger Boolen lger inite set o elements which contins: logic vriles two inry opertion (logic conjuction nd disjunction) unry opertion negtion two logic sttes (logic constnts) Aioms:..,, c,... AN (.), OR ( ) NOT ( ),.. Aiom sttement without proo, it is considered s vlid BEMEP igitl Control o Electric rives - 8
9 Boolen Alger Lws: ( ) c ( c) (. ). c.(. c).( c).. c (. c) ( )( c).... (. ).( )..( ). Commuttive Associtive istriutive Idempotency Complementrity Aggressivenes Neutrlity Asortion Negtion sortion Involution BEMEP igitl Control o Electric rives - 9
10 Lws:.. Boolen Alger.... c. c.. c ( ).( c).( c) ( ).( c) emorgn s Consensus sortion. (,, c,...). (,, c,...). (,, c,...) impliction (,, c,...). (, c,...). (, c,...) ecomposition (Shnnon s) Every logic unction cn e deined using only AN, OR nd NOT unctions ulity principle (emorgn s dulity):. Boolen lger is unchnged when ll dul pirs re interchnged. ( OR AN). ( AN OR) BEMEP igitl Control o Electric rives -
11 Gte Functions (Inverter) AN OR NOT written down AN. s : OR written down s : written down NOT s : BEMEP igitl Control o Electric rives -
12 Gte Functions NAN NOR XOR written down NAN. s : NOR written down s : written down XOR s : BEMEP igitl Control o Electric rives -
13 BEMEP igitl Control o Electric rives - Gte Functions (Multi-input devices) c c c AN OR XOR Odd numer o (Odd prity) c c c c
14 Generl Comintionl Gte, ely VIH VIL VOH VOL Comintionl gte description includes: Behviour (logic unction) Truth tle Logic eqution Outputs n-out (how mny net gtes inputs cn e connected to gte output) Propgtion ely (gte input to output signl time dely, to nd to trnsitions my hve dierent vlues) Input nd output nd logic levels (dierent technologies dierent levels) Power consumption Fstest nd smllest gtes (hve ewest trnsistors) re: inverter (NOT)(CMOS trnsistors), NAN NOR (), AN OR () tilh tihl BEMEP igitl Control o Electric rives -
15 Inde, Minterm, Mterm Truth tle ( c,, ) c,, Minterm (m) c.. c.. c.. c.. c.. c.. c.. c.. Mterm (M) c c c c c c c c Inde Independent vriles Minterms Functionl vlue Mterms n d i i... d d d... d d d i BEMEP igitl Control o Electric rives -
16 SoP nd PoS Stndrd Form SoP Sum-o-Products stndrd orm m i( ) m (,,, ) i ( c,, ) c.. c.. c.. c.. PoS Product-o-Sums stndrd orm Mj() M(,,, ) j ( c,, ) ( c ).( c ).( c ).( c ) BEMEP igitl Control o Electric rives -
17 Logic Function Minimiztion Why? Implementtion nd economic resons smller numer o gtes How? Minimiztion methods: ) Logic unction modiiction using oolen lger lws ) K-mp (Krnugh mp) ) Tle method connection o terms (Quine-McCluskey method) BEMEP igitl Control o Electric rives -
18 Logic Function Minimiztion (,, ) Minimlize unction with truth tle elow: m (,,,, ) SoP Sum o Products m(,,,, ) ) M (,, PoS Product o Sums M (,,) ( )( )( ) BEMEP igitl Control o Electric rives - 8
19 BEMEP igitl Control o Electric rives - 9 Logic Function Minimiztion ) ( ) ( ) ( ()() () () () () () ()() ()() ()() ()() ()() ( ) m( ) minterm( ) th solution ) Minimiztion using oolen lger lws:
20 BEMEP igitl Control o Electric rives - Logic Function Minimiztion ( ) m( ) minterm( ) nd solution ) ( ) ( ) ( () () () () () ()() ()() ()() ()() ()() ()() ) Minimiztion using oolen lger lws (cont.):
21 Logic Function Minimiztion ) Minimiztion using oolen lger lws (cont.): Two solutions: th solution nd solution Essentil prime implicnts hve to e included in solution BEMEP igitl Control o Electric rives -
22 BEMEP igitl Control o Electric rives - Logic Function Minimiztion ) Minimiztion using K-mps (Krnugh mp): ) m(,,,, th solution nd solution Compre with method )
23 Logic Function Minimiztion ) Tle method connection o terms (Quine-McCluskey) (Suitle or computer processing) m(,,,, ) (... ) (... ) (... )( ) (... Tle connection o terms ) m step m Step m step, () (,) - - () (,) - - () (,) - - () (,) - - () Minterm coverge Mrked lines were connected together nd resulting term ws got to net step BEMEP igitl Control o Electric rives -
24 Logic Function Minimiztion ) Tle method connection o terms (cont.): Tle connection o terms m Step m Step m Step, () (,) - - () (,) - - () (,) - - () (,) - - () Tle implicnts coverge Implicnts / m BEMEP igitl Control o Electric rives -
25 BEMEP igitl Control o Electric rives - Logic Function Minimiztion A B Implicnts / m ) Tle method connection o terms (cont.): Coverge tle evlution A B th solution nd solution Essentil prime implicnts hve to e included in solution Compre with methods ) nd ) th solution nd solution
26 BEMEP igitl Control o Electric rives - Logic Function Implementtion
27 BEMEP igitl Control o Electric rives - Logic Function Implementtion A NAN gtes only
28 BEMEP igitl Control o Electric rives - 8 Logic Function Implementtion ) )( ( B
29 BEMEP igitl Control o Electric rives - 9 Logic Function Implementtion ) ( ) ( ) ( ) ( ) ( ) ( ) ) ( ( B C NOR gtes only
30 BEMEP igitl Control o Electric rives - K-mp (Krnugh mp) K mp grphics representtion o truth tle Used or quick grphics minimiztion o logic unctions Only single input vrile chnges in djoining K-mp cells Overr ove relevnt K-mp re mens vrile vlue is K-mp cells numering (indeing) is suitle id or quick logic vlues trnser rom stndrd truth tle to K-mp K mp is pplicle or unctions with to () input vriles K - mp Truth tle Truth tle indeing () suitle id
31 K-mp, Minimiztion Procedure In K mp identiy n groups o djcent vlues (mrk ech group y ovl) Choose mimum re o s nd minimum numer o res elete vriles which in mrked re chnge vlue Vriles which does not chnge vlue in mrked re crete minimlized logic unction in SoP (Sum-o-Product) ormt (,,...) m (...,...,... ) BEMEP igitl Control o Electric rives -
32 BEMEP igitl Control o Electric rives - K-mp, Minimiztion Procedure XOR m(,) M (,) ) )( (
33 BEMEP igitl Control o Electric rives - K-mp, Minimiztion Procedure XOR ) )( ( M (,) m(,) ) ( ) ( ) )( ( ) )( (
34 K-mp, Minimiztion Procedure BEMEP igitl Control o Electric rives -
35 K-mp, Minimiztion Procedure Ais o symmetry BEMEP igitl Control o Electric rives -
36 K-mps Indeed Templtes BEMEP igitl Control o Electric rives -
37 Logic Function Minimiztion Using K-mp or minimiztion o logic unction my e unsuccessull in some cses See net emple: Binry Adder BEMEP igitl Control o Electric rives -
38 Adder Wht? How to dd??? Result ormt? BEMEP igitl Control o Electric rives - 8
39 Adder Binry numers, How? inry Binry numer s BEMEP igitl Control o Electric rives - 9
40 Adder (Hl-dder) Binry numers (vriles), re single it now??? s Truth tle s s d Where is crry to higher order? BEMEP igitl Control o Electric rives -
41 Hl Adder Truth Tle nd Implementtion q s Hl Adder s m (, ) q m ( ) BEMEP igitl Control o Electric rives -
42 Full Adder p s q Crry rom lower order Crry to higher order BEMEP igitl Control o Electric rives -
43 BEMEP igitl Control o Electric rives - Full Adder Truth Tle nd SoP q s p p p p p s ),, m (, p p p p q ),, m (,
44 Full Adder No Minimiztion s.. p.. p.. p.. p SoP - no minimiztion, too comple circuit q.. p.. p.. p.. p BEMEP igitl Control o Electric rives -
45 Full Adder Attempt to Minimlize rom K-Mp Attempt to minimlize using K-mp s p s.. p.. p.. p.. p s.. p.. p.. p.. p No simpliiction q p q.. p.. p.. p.. p q. p. p. Prtilly simpliied BEMEP igitl Control o Electric rives -
46 Full Adder Logic unction modiiction using oolen lws XOR XNOR s.. p.. p.. p.. p p ( ) p ( ) p ( ) p ( ) p ( ) Hl Adder s XNOR XOR K-mp, choice o etter res q.. p.. p.. p.. p q p p p( ) p( ) q p Hl Adder q BEMEP igitl Control o Electric rives -
47 Full Adder using two hl dders BEMEP igitl Control o Electric rives -
48 Bit Full Adder - using our it ull dders BEMEP igitl Control o Electric rives - 8
49 Comintionl versus Sequentil Circuits Comintionl circuits At every time instnt vlues o ll output vriles re deined y vlues o input vriles only t the sme time instnt. (The LCC hs no memory, i.e. the LCC does not rememer its pst sttes). Sequentil circuits Output vriles depend on time sequence o input vriles. The sequentil circuit LSC hs memory, i.e. it rememer its pst sttes. Sequentil circuit ehviour is implemented y so clled closed loop principle. Mthemtic tools: Stte chrt, stte vrile, Logic unctions, ecittion unction, output unction, Finite Stte Mchine model (FSM) or Finite Stte Automton (FSA), Trnsition tle, Output tle. BEMEP igitl Control o Electric rives - 9
50 igitl Control o Electric rives Logic Circuits Comintionl Boolen Alger, escription Form EN Czech Technicl University in Prgue Fculty o Electricl Engineering
ELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-2700: Digital Logic Design Fall Notes - Unit 1
INTRODUTION TO LOGI IRUITS Notes - Unit 1 OOLEN LGER This is the oundtion or designing nd nlyzing digitl systems. It dels with the cse where vriles ssume only one o two vlues: TRUE (usully represented
More informationBoolean algebra.
http://en.wikipedi.org/wiki/elementry_boolen_lger Boolen lger www.tudorgir.com Computer science is not out computers, it is out computtion nd informtion. computtion informtion computer informtion Turing
More informationELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-378: Computer Hardware Design Winter Notes - Unit 1
ELETRIL ND OMPUTER ENGINEERING DEPRTMENT, OKLND UNIVERSIT EE-78: omputer Hrdwre Design Winter 016 INTRODUTION TO LOGI IRUITS Notes - Unit 1 OOLEN LGER This is the oundtion or designing nd nlyzing digitl
More informationBoolean Algebra. Boolean Algebra
Boolen Alger Boolen Alger A Boolen lger is set B of vlues together with: - two inry opertions, commonly denoted y + nd, - unry opertion, usully denoted y ˉ or ~ or, - two elements usully clled zero nd
More informationCombinational Logic. Precedence. Quick Quiz 25/9/12. Schematics à Boolean Expression. 3 Representations of Logic Functions. Dr. Hayden So.
5/9/ Comintionl Logic ENGG05 st Semester, 0 Dr. Hyden So Representtions of Logic Functions Recll tht ny complex logic function cn e expressed in wys: Truth Tle, Boolen Expression, Schemtics Only Truth
More informationexpression 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 informationCS12N: 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 informationFachgebiet Rechnersysteme1. 1. Boolean Algebra. 1. Boolean Algebra. Verification Technology. Content. 1.1 Boolean algebra basics (recap)
. Boolen Alger Fchgeiet Rechnersysteme. Boolen Alger Veriiction Technology Content. Boolen lger sics (recp).2 Resoning out Boolen expressions . Boolen Alger 2 The prolem o logic veriiction: Show tht two
More informationOverview of Today s Lecture:
CPS 4 Computer Orgniztion nd Progrmming Lecture : Boolen Alger & gtes. Roert Wgner CPS4 BA. RW Fll 2 Overview of Tody s Lecture: Truth tles, Boolen functions, Gtes nd Circuits Krnugh mps for simplifying
More informationBoolean Algebra. Boolean Algebras
Boolen Algebr Boolen Algebrs A Boolen lgebr is set B of vlues together with: - two binry opertions, commonly denoted by + nd, - unry opertion, usully denoted by or ~ or, - two elements usully clled zero
More informationIntroduction to Electrical & Electronic Engineering ENGG1203
Introduction to Electricl & Electronic Engineering ENGG23 2 nd Semester, 27-8 Dr. Hden Kwok-H So Deprtment of Electricl nd Electronic Engineering Astrction DIGITAL LOGIC 2 Digitl Astrction n Astrct ll
More informationFast Boolean Algebra
Fst Boolen Alger ELEC 267 notes with the overurden removed A fst wy to lern enough to get the prel done honorly Printed; 3//5 Slide Modified; Jnury 3, 25 John Knight Digitl Circuits p. Fst Boolen Alger
More informationChapter 6 Continuous Random Variables and Distributions
Chpter 6 Continuous Rndom Vriles nd Distriutions Mny economic nd usiness mesures such s sles investment consumption nd cost cn hve the continuous numericl vlues so tht they cn not e represented y discrete
More informationUnit 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 informationControl with binary code. William Sandqvist
Control with binry code Dec Bin He Oct 218 10 11011010 2 DA 16 332 8 E 1.1c Deciml to Binäry binry weights: 1024 512 256 128 64 32 16 8 4 2 1 71 10? 2 E 1.1c Deciml to Binäry binry weights: 1024 512 256
More informationLogic Optimization 1. Logic Optimization. Optimization vs. Tradeoff. Two-level Logic Optimization. ECE 474A/57A Computer-Aided Logic Design
ECE 474A/57A Computer-Aided Logic Design Logic Optimition Logic Optimition We now know how to build digitl circuits How cn we build better circuits? Let s consider two importnt design criteri Del the time
More informationEE 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 informationOutline 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 informationCS344: Introduction to Artificial Intelligence
CS344: Introduction to Artiicil Intelligence Lecture: 22-23 Herbrnd s Theorem roving stisibilit o logic ormule using semntic trees rom Smbolic logic nd mechnicl theorem proving B Runk ilni Under the guidnce
More informationEngr354: 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 informationIST 4 Information and Logic
IST 4 Informtion nd Logic T = tody x= hw#x out x= hw#x due mon tue wed thr 28 M1 oh 1 4 oh M1 11 oh oh 1 2 M2 18 oh oh 2 fri oh oh = office hours oh 25 oh M2 2 3 oh midterms oh Mx= MQx out 9 oh 3 T 4 oh
More informationChapter 3 Single Random Variables and Probability Distributions (Part 2)
Chpter 3 Single Rndom Vriles nd Proilit Distriutions (Prt ) Contents Wht is Rndom Vrile? Proilit Distriution Functions Cumultive Distriution Function Proilit Densit Function Common Rndom Vriles nd their
More informationBoolean 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 informationSolutions - 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 information1 2 : 4 5. Why Digital Systems? Lesson 1: Introduction to Digital Logic Design. Numbering systems. Sample Problems 1 5 min. Lesson 1-b: Logic Gates
Leon : Introduction to Digitl Logic Deign Computer ided Digitl Deign EE 39 meet Chvn Fll 29 Why Digitl Sytem? ccurte depending on numer of digit ued CD Muic i digitl Vinyl Record were nlog DVD Video nd
More informationFault 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 informationCS 330 Formal Methods and Models
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2017 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 2 1. Prove ((( p q) q) p) is tutology () (3pts) y truth tle. p q p q
More informationCMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014
CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA
More informationFinite Field Arithmetic and Implementations. Xinmiao Zhang Case Western Reserve University
Finite Field Arithmetic nd Implementtions Xinmio Zhng Cse Western Reserve University Applictions of Finite Field Arithmetic Error-correcting codes Hmming codes BCH codes Reed-Solomon codes Low-density
More informationEECS 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 informationReasoning and programming. Lecture 5: Invariants and Logic. Boolean expressions. Reasoning. Examples
Chir of Softwre Engineering Resoning nd progrmming Einführung in die Progrmmierung Introduction to Progrmming Prof. Dr. Bertrnd Meyer Octoer 2006 Ferury 2007 Lecture 5: Invrints nd Logic Logic is the sis
More informationCARLETON 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 informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More information6.004 Computation Structures Spring 2009
MIT OpenCourseWre http://ocw.mit.edu 6.004 Computtion Structures Spring 009 For informtion out citing these mterils or our Terms of Use, visit: http://ocw.mit.edu/terms. Cost/Performnce Trdeoffs: cse study
More informationAUTOMATA AND LANGUAGES. Definition 1.5: Finite Automaton
25. Finite Automt AUTOMATA AND LANGUAGES A system of computtion tht only hs finite numer of possile sttes cn e modeled using finite utomton A finite utomton is often illustrted s stte digrm d d d. d q
More informationLecture 6. Notes. Notes. Notes. Representations Z A B and A B R. BTE Electronics Fundamentals August Bern University of Applied Sciences
Lecture 6 epresenttions epresenttions TE52 - Electronics Fundmentls ugust 24 ern University of pplied ciences ev. c2d5c88 6. Integers () sign-nd-mgnitude representtion The set of integers contins the Nturl
More informationComputer System Structures cz:struktury počítačových systémů
4..25 omputer System Structures cz:struktury počítčových systémů Version:. Lecturer: Richrd Šust ČVUT-FEL in Prgue, R suject 35SPS Mini-question: Minimize KM of prime detector F(w,x,y,z) = S(,2,3,5,7,,3)
More informationIntroduction to Algebra - Part 2
Alger Module A Introduction to Alger - Prt Copright This puliction The Northern Alert Institute of Technolog 00. All Rights Reserved. LAST REVISED Oct., 008 Introduction to Alger - Prt Sttement of Prerequisite
More informationCOMPUTER SCIENCE TRIPOS
CST.2011.2.1 COMPUTER SCIENCE TRIPOS Prt IA Tuesdy 7 June 2011 1.30 to 4.30 COMPUTER SCIENCE Pper 2 Answer one question from ech of Sections A, B nd C, nd two questions from Section D. Submit the nswers
More informationIST 4 Information and Logic
IST 4 Informtion nd Logic mon tue wed thr fri sun T = tody 3 M1 oh 1 x= hw#x out 10 oh M1 17 oh oh 1 2 M2 oh oh x= hw#x due 24 oh oh 2 oh = office hours oh 1 oh M2 8 3 oh midterms oh oh Mx= MQx out 15
More informationM A T H F A L L CORRECTION. Algebra I 2 1 / 0 9 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #1 CORRECTION Alger I 2 1 / 0 9 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O 1. Suppose nd re nonzero elements of field F. Using only the field xioms,
More informationEE 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 information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationState Minimization for DFAs
Stte Minimiztion for DFAs Red K & S 2.7 Do Homework 10. Consider: Stte Minimiztion 4 5 Is this miniml mchine? Step (1): Get rid of unrechle sttes. Stte Minimiztion 6, Stte is unrechle. Step (2): Get rid
More information8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.
8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the
More informationShape and measurement
C H A P T E R 5 Shpe nd mesurement Wht is Pythgors theorem? How do we use Pythgors theorem? How do we find the perimeter of shpe? How do we find the re of shpe? How do we find the volume of shpe? How do
More informationElements of Computing Systems, Nisan & Schocken, MIT Press. Boolean Logic
Elements of Computing Systems, Nisn & Schocken, MIT Press www.idc.c.il/tecs Usge nd Copyright Notice: Boolen Logic Copyright 2005 Nom Nisn nd Shimon Schocken This presenttion contins lecture mterils tht
More informationNote 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 informationI1 = 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 informationTime in Seconds Speed in ft/sec (a) Sketch a possible graph for this function.
4. Are under Curve A cr is trveling so tht its speed is never decresing during 1-second intervl. The speed t vrious moments in time is listed in the tle elow. Time in Seconds 3 6 9 1 Speed in t/sec 3 37
More informationDigital Circuit Engineering
Digitl Circuit Engineering DIGITAL st Distriutive XA + XB = X(A + B) 2nd Distriutive (X + A)(X + B) = X + AB (X + A)(X + B)(X + C) = X + ABC VLSI DESIGN Simplifiction Asorption YX + X = X Y + XY = X +
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationLecture 3. Introduction digital logic. Notes. Notes. Notes. Representations. February Bern University of Applied Sciences.
Lecture 3 Ferury 6 ern University of pplied ciences ev. f57fc 3. We hve seen tht circuit cn hve multiple (n) inputs, e.g.,, C, We hve lso seen tht circuit cn hve multiple (m) outputs, e.g. X, Y,, ; or
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. NFA for (a b)*abb.
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationDigital Circuit Engineering
igitl ircuit Engineering #$&@ ^ ' fctoring IGITL st istributive X + X = X( + ) 2nd istributive (X + )(X + ) = X + (X + )(X + )(X + ) = X + Swp (X + )(X + ) = X + X VLSI ESIGN The Most ommon Stupid Errors
More informationECE223. R eouven Elbaz Office room: DC3576
ECE223 R eouven Elz reouven@uwterloo.c Office room: DC3576 Outline Decoders Decoders with Enle VHDL Exmple Multiplexers Multiplexers with Enle VHDL Exmple From Decoder to Multiplexer 3-stte Gtes Multiplexers
More informationEE273 Lecture 15 Asynchronous Design November 16, Today s Assignment
EE273 Lecture 15 Asynchronous Design Novemer 16, 199 Willim J. Dlly Computer Systems Lortory Stnford University illd@csl.stnford.edu 1 Tody s Assignment Term Project see project updte hndout on we checkpoint
More informationARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac
REVIEW OF ALGEBRA Here we review the bsic rules nd procedures of lgebr tht you need to know in order to be successful in clculus. ARITHMETIC OPERATIONS The rel numbers hve the following properties: b b
More informationSIMPLIFICATION OF BOOLEAN ALGEBRA. Presented By: Ms. Poonam Anand
SIMPLIFITION OF OOLEN LGER Presented y: Ms. Poonam nand SIMPLIFITION USING OOLEN LGER simplified oolean expression uses the fewest gates possible to implement a given expression. ()() SIMPLIFITION USING
More informationSignal Flow Graphs. Consider a complex 3-port microwave network, constructed of 5 simpler microwave devices:
3/3/009 ignl Flow Grphs / ignl Flow Grphs Consider comple 3-port microwve network, constructed of 5 simpler microwve devices: 3 4 5 where n is the scttering mtri of ech device, nd is the overll scttering
More informationSection 6.1 INTRO to LAPLACE TRANSFORMS
Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform
More informationTypes of Finite Automata. CMSC 330: Organization of Programming Languages. Comparing DFAs and NFAs. Comparing DFAs and NFAs (cont.) Finite Automata 2
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 Types of Finite Automt Deterministic Finite Automt () Exctly one sequence of steps for ech string All exmples so fr Nondeterministic Finite Automt
More informationCMSC 330: Organization of Programming Languages
CMSC 330: Orgniztion of Progrmming Lnguges Finite Automt 2 CMSC 330 1 Types of Finite Automt Deterministic Finite Automt (DFA) Exctly one sequence of steps for ech string All exmples so fr Nondeterministic
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT
SCHOOL OF ENGINEERING & BUIL ENVIRONMEN MARICES FOR ENGINEERING Dr Clum Mcdonld Contents Introduction Definitions Wht is mtri? Rows nd columns of mtri Order of mtri Element of mtri Equlity of mtrices Opertions
More information5 Probability densities
5 Probbility densities 5. Continuous rndom vribles 5. The norml distribution 5.3 The norml pproimtion to the binomil distribution 5.5 The uniorm distribution 5. Joint distribution discrete nd continuous
More informationBasics of Digital Logic
ECE-78: Computer Hrdre Design Winter 7 Bsics o Digitl Logic BOOLEAN ALGEBRA AND LOGIC GATES This is the oundtion or design nd nlsis o digitl sstems. It dels ith the cse here vriles ssume onl one o to vlues:
More informationCHAPTER 3 LOGIC GATES & BOOLEAN ALGEBRA
CHPTER 3 LOGIC GTES & OOLEN LGER C H P T E R O U T C O M E S Upon completion of this chapter, student should be able to: 1. Describe the basic logic gates operation 2. Construct the truth table for basic
More informationContinuous Random Variable X:
Continuous Rndom Vrile : The continuous rndom vrile hs its vlues in n intervl, nd it hs proility distriution unction or proility density unction p.d. stisies:, 0 & d Which does men tht the totl re under
More informationLet's start with an example:
Finite Automt Let's strt with n exmple: Here you see leled circles tht re sttes, nd leled rrows tht re trnsitions. One of the sttes is mrked "strt". One of the sttes hs doule circle; this is terminl stte
More informationCS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p
More informationINF1383 -Bancos de Dados
3//0 INF383 -ncos de Ddos Prof. Sérgio Lifschitz DI PUC-Rio Eng. Computção, Sistems de Informção e Ciênci d Computção LGER RELCIONL lguns slides sedos ou modificdos dos originis em Elmsri nd Nvthe, Fundmentls
More informationDIGITAL TECHNICS I. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute 5. LECTURE: LOGIC SYNTHESIS
202.0.5. DIGITL TECHNICS I Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 5. LECTURE: LOGIC SYNTHESIS st year BSc course st (utumn) term 202/203 5. LECTURE. Karnaugh map applications
More informationChapter 9 Definite Integrals
Chpter 9 Definite Integrls In the previous chpter we found how to tke n ntiderivtive nd investigted the indefinite integrl. In this chpter the connection etween ntiderivtives nd definite integrls is estlished
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationThe practical version
Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht
More informationThomas Whitham Sixth Form
Thoms Whithm Sith Form Pure Mthemtics Unit C Alger Trigonometry Geometry Clculus Vectors Trigonometry Compound ngle formule sin sin cos cos Pge A B sin Acos B cos Asin B A B sin Acos B cos Asin B A B cos
More informationCISC 4090 Theory of Computation
9/6/28 Stereotypicl computer CISC 49 Theory of Computtion Finite stte mchines & Regulr lnguges Professor Dniel Leeds dleeds@fordhm.edu JMH 332 Centrl processing unit (CPU) performs ll the instructions
More informationIntroduction to Group Theory
Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements
More informationGNFA GNFA GNFA GNFA GNFA
DFA RE NFA DFA -NFA REX GNFA Definition GNFA A generlize noneterministic finite utomton (GNFA) is grph whose eges re lele y regulr expressions, with unique strt stte with in-egree, n unique finl stte with
More informationPropositional 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 informationChapter 1: Boolean Logic
Elements of Computing Systems, Nisn & Schocken, MIT Press, 2005 www.idc.c.il/tecs Chpter 1: Boolen Logic Usge nd Copyright Notice: Copyright 2005 Nom Nisn nd Shimon Schocken This presenttion contins lecture
More informationa,b a 1 a 2 a 3 a,b 1 a,b a,b 2 3 a,b a,b a 2 a,b CS Determinisitic Finite Automata 1
CS4 45- Determinisitic Finite Automt -: Genertors vs. Checkers Regulr expressions re one wy to specify forml lnguge String Genertor Genertes strings in the lnguge Deterministic Finite Automt (DFA) re nother
More informationGenetic Programming. Outline. Evolutionary Strategies. Evolutionary strategies Genetic programming Summary
Outline Genetic Progrmming Evolutionry strtegies Genetic progrmming Summry Bsed on the mteril provided y Professor Michel Negnevitsky Evolutionry Strtegies An pproch simulting nturl evolution ws proposed
More informationSpecial Numbers, Factors and Multiples
Specil s, nd Student Book - Series H- + 3 + 5 = 9 = 3 Mthletics Instnt Workooks Copyright Student Book - Series H Contents Topics Topic - Odd, even, prime nd composite numers Topic - Divisiility tests
More informationDesigning finite automata II
Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of
More informationGood Review book ( ) ( ) ( )
7/31/2011 34 Boolen (Switching) Algebr Review Good Review book BeBop to the Boolen Boogie: An Unconventionl Guide to Electronics, 2 nd ed. by Clive Mxwell Hightext Publictions Inc. from Amzon.com for pprox.
More informationLecture Solution of a System of Linear Equation
ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville - D. Keffer, 5/9/98 (updted /) Lecture 8- - Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner
More informationIn Mathematics for Construction, we learnt that
III DOUBLE INTEGATION THE ANTIDEIVATIVE OF FUNCTIONS OF VAIABLES In Mthemtics or Construction, we lernt tht the indeinite integrl is the ntiderivtive o ( d ( Double Integrtion Pge Hence d d ( d ( The ntiderivtive
More informationMathematics Number: Logarithms
plce of mind F A C U L T Y O F E D U C A T I O N Deprtment of Curriculum nd Pedgogy Mthemtics Numer: Logrithms Science nd Mthemtics Eduction Reserch Group Supported y UBC Teching nd Lerning Enhncement
More informationCS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More information7.1 Integral as Net Change and 7.2 Areas in the Plane Calculus
7.1 Integrl s Net Chnge nd 7. Ares in the Plne Clculus 7.1 INTEGRAL AS NET CHANGE Notecrds from 7.1: Displcement vs Totl Distnce, Integrl s Net Chnge We hve lredy seen how the position of n oject cn e
More informationSection 4: Integration ECO4112F 2011
Reding: Ching Chpter Section : Integrtion ECOF Note: These notes do not fully cover the mteril in Ching, ut re ment to supplement your reding in Ching. Thus fr the optimistion you hve covered hs een sttic
More informationOperations with Polynomials
38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: How to identify the leding coefficients nd degrees of polynomils How to dd nd subtrct polynomils How to multiply polynomils
More informationPreview 11/1/2017. Greedy Algorithms. Coin Change. Coin Change. Coin Change. Coin Change. Greedy algorithms. Greedy Algorithms
Preview Greed Algorithms Greed Algorithms Coin Chnge Huffmn Code Greed lgorithms end to e simple nd strightforwrd. Are often used to solve optimiztion prolems. Alws mke the choice tht looks est t the moment,
More informationExperiments, Outcomes, Events and Random Variables: A Revisit
Eperiments, Outcomes, Events nd Rndom Vriles: A Revisit Berlin Chen Deprtment o Computer Science & Inormtion Engineering Ntionl Tiwn Norml University Reerence: - D. P. Bertseks, J. N. Tsitsiklis, Introduction
More information1B40 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 informationRegular expressions, Finite Automata, transition graphs are all the same!!
CSI 3104 /Winter 2011: Introduction to Forml Lnguges Chpter 7: Kleene s Theorem Chpter 7: Kleene s Theorem Regulr expressions, Finite Automt, trnsition grphs re ll the sme!! Dr. Neji Zgui CSI3104-W11 1
More informationCS 267: Automated Verification. Lecture 8: Automata Theoretic Model Checking. Instructor: Tevfik Bultan
CS 267: Automted Verifiction Lecture 8: Automt Theoretic Model Checking Instructor: Tevfik Bultn LTL Properties Büchi utomt [Vrdi nd Wolper LICS 86] Büchi utomt: Finite stte utomt tht ccept infinite strings
More informationMathematics. Area under Curve.
Mthemtics Are under Curve www.testprepkrt.com Tle of Content 1. Introduction.. Procedure of Curve Sketching. 3. Sketching of Some common Curves. 4. Are of Bounded Regions. 5. Sign convention for finding
More informationScanner. Specifying patterns. Specifying patterns. Operations on languages. A scanner must recognize the units of syntax Some parts are easy:
Scnner Specifying ptterns source code tokens scnner prser IR A scnner must recognize the units of syntx Some prts re esy: errors mps chrcters into tokens the sic unit of syntx x = x + y; ecomes
More information