Multiply Out Using DeMorgan and K-Maps
|
|
- Neal Preston
- 5 years ago
- Views:
Transcription
1 Multiply Out Using emorgan and K-Maps Method III: Using K-Maps Step : Find F using General emorgan Step 2: Plot F on a K-Map Step 3: Plot F using the 0 Squares Step 4: Get expression for F from map Example: () Find the inverse using general emorgan F = ( + + )( + )( + + )( + ) F dual = () + ( ) + () + () F = (2) Plot F on a K-map (3) Plot the F on a K-map; Put s where F was 0 s. (4) ircle F on K-map F = + + Map of function, F Map of function, F Map of inverse, F dig4factoringh.fm p. 44 Revised; January 28, 2009 Slide 9 Multiply Out Using emorgan and K-Maps The Easy Way to Multiply Out The Easy Way to Multiply Out F is easy to find using emorgan s law. F is easy to find from a K-map of F. The above are the two essential facts used for multiplying out using a K-map. When is the K-map the best method? For most problems done by hand is by far the easiest way to factor. Six or more variables will give a problem too big for a K-map. Using algebra may be easier if all the variables, or almost all, are different.see omment on Slide 5. lgebra may be easier for converting small partial expression inside a long expression PROLEM: Multiply out using emorgan s Law and a Karnaugh map, to get two terms of 2 letters and one of 3 letters. ( + + )( + )( + + )( + )( + + ) 4-5. PROLEM (Solution to a later factoring problem,and an earlier algebraic problem) Multiply out to get an expression with eight letters. Use a Karnaugh map. ( + )( + + )( + + )( + + )( + + ) 4-6. PROLEM (Remember Simplify, simplify, simplify!) multiply out problem using,,,,e and F as variables. ( + )( + + )(E + + )( + + )(E + + )( + F) arleton University dig4factoringh.fm p. 45, Revised; January 28, 2009 omment on Slide 9
2 Multiply Out: Using emorgan and K-Maps Example Using a Karnaugh Map Steps: () Given F = (Π of Σ expression) F = ( + )( + + )( + + )( + + ) (2) Invert F using emorgan s law to get F as Σ of Π F = (3) Plot it on a map. (4) Make a map for F, It has where F had 0 (5) ircle the F map (6) Write out the equation for F F = dig4factoringh.fm p. 46 Revised; January 28, 2009 Slide 0 Multiply Out: Using emorgan and K-Maps Multiply Out With d s Multiply Out With d s If some input combinations are never used, these become don t care outputs. o the normal steps up through finding F () Make the map for F (2) Make the map for F from that of F. Then identify the d s on the map of F. Finally circle the map normally to find the minimum Σ of Π expression PROLEM: Find the minimum Σ of Π expression for F using the don t cares to best advantage. F = (W+X+Y)(W+X+Z)(X+Y+Z) The input combinations W XYZ, and WXYZ never happen, so these map squares are d s. Z YZ WX d 0 X W 0 d Y Helpful map 4-8. PROLEM: Find the minimum Σ of Π expression for G using the don t cares to best advantage. G = ( + )( + + )( + + )( + + ) The input combinations, and never happen. arleton University dig4factoringh.fm p. 47, Revised; January 28, 2009 omment on Slide 0
3 Factoring Factoring, the ual of Multiplying Out hange Σ of Π Π of Σ Example I ( ) + ( ) + ( ) ( )( )( ) Methods of Factoring I. Use the 2nd distributive law x + ab = (x + a)(x + b) - lways works, but - very long and slow. II. Take the dual Use a multiply-out method Take the dual back - hanges unfamiliar 2 to familar - In theory the same amount of work, but easier to grasp. III. Plot F on a K-map Plot F using the 0 squares Find F using emorgan - Easiest to do. - Gives the simplest Π of Σ answer. - Very messy for 5 variables or more. + + Use (2) = (+)(+) + Use (2) = [(+)(+) + ][(+)(+) + ] Use (2) = [(+) + ][(+) + ][(+) + ][(+) + ] Use (2) = [ + ][++ ][++ ][+ + ] and a+a=a = [ + ][+ + ] Use x(x+y) = x Example II F = + + F = ( + )+ F = {( + )}+ F UL = {+ )} F UL = + (ual) 2 = F = (+)( + + ) Example III F = + Plot on Map Get F from Map F = + Use (em) F=( + )( + ) Use () Take ual Use () Take ual ack F F dig4factoringh.fm p. 48 Revised; January 28, 2009 Slide Factoring Four methods of factoring Four methods of factoring I) Using 2 Using 2 many times is the brute force way. Unfortunately students find 2 hard to use, and the expansion may get very long. It helps to use simplification X (X+y) = X and absorption X (X+y) = Xy at every chance, but these rules are also more difficult than their dual rules. If all the letters are different, then all one can use is 2. II) Using duality and This in theory, is just as difficult as the previous method, but the more familiar rules makes it seem easier. IIa) Using a bit, then use duality and, as in II) above can do some factoring and often helps at the start. Example I above, using before 2, can be done in two lines. ++ =(+) + (using first) ={+}{+(+)} (using 2) III) Using Karnaugh maps This is the easiest method for four or five inputs, it always gives the smallest answer, it easily handles don t cares, but it gets very messy for over five inputs. It is the method of choice for most small problems. Three methods of multiplying out (compare with factoring) Using Using many times is the straightforward way, is very easy to use. Unfortunately the result can get very long. Using simplification (X + Xy =X) and absorption (X + Xy = X y) frequently will help. Using 2 (or equ) and Swap before using Use 2 or the equivalent (take the dual and use ) and the Swap rule can do initial consolidation before using. In most cases one must use for final cleanup. Using Karnaugh maps This is quite easy for four variables, but more complex for over five input variables. Easily handles d s arleton University dig4factoringh.fm p. 49, Revised; January 28, 2009 omment on Slide
4 Factoring Using 2 Method III: Using 2 Step : Simplify, Use 2 Repeat: Step until done... Unless the problem is very simple the other methods will be easier. 2nd istributive Law (2) X + cd = (X+c)(X+d) Example + X Use (2) ( + X) ( + X) Use (2) again ( + X)( + X)( + X) Get extended (2) + X = ( + X)( + X)( + X) Example + Use (2) again ( + ) ( + ) Use (2) again, twice ( + ) ( + )( + ) ( + ) dig4factoringh.fm p. 50 Revised; January 28, 2009 Slide 2 Factoring Using 2 Factoring Using 2 Factoring Using 2 The expression proven on the slide is: The extended (2) + X = ( + X)( + X)( + X) The dual is the extended () ( + + )X = X + X + X Example + (2) ( + ) ( + ) (2) (2) ( + ) ( + )( + ) ( + ) ( + )( + ) ( + ) ( + = ) If we had started by using the Swap rule, we would have a simpler answer in one step PROLEM Factor + + arleton University dig4factoringh.fm p. 5, Revised; January 28, 2009 omment on Slide 2
5 Factoring Using uality Method II: Factoring Using uality Step. Simplify and use if possible ut for F dual Step 2. Take the dual; get a factored, or semi factored form Step 3. Multiply out the dual to get sum-of products. The right one Step 4. Take the dual back to get the factored form. Factoring Using uality The expression to factor is Σ of Π F = + + () Use F = ( + ) + (2) Take its dual to get Π of Σ. F = [ ( + { })] + { } racket LL N terms F UL = [ + ( { + })] { + } (3) Multiply out to get Σ of Π. See box F UL = (4) Take the dual back F = ( + )( + )( + )( + ) Get the desired Π of Σ. + + = F = ( + )( + )( + )( + ) Multiply Out etails F UL =[ + { + }] { + } () = [ + + ] { + } = [ + + ] () +[ + + ] bdx+bd=bd F UL = Multiplying out is based on (). Easier for people, than factoring based on (2). lgebra of one is the dual of the algebra of the other dig4factoringh.fm p. 52 Revised; January 28, 2009 Slide 3 Factoring Using uality hanging Factoring into Multiplying Out hanging Factoring into Multiplying Out Factoring is onverted to Multiplying Out, its ual Problem We take a factoring problem which is confusing, because factoring is based on (2). This law is not a familiar high-school type algebraic law and is harder to work with. In the dual space, the dual expression is already factored. The problem is transformed into multiplying out, which is based on the first distributive law (). () is more familiar, and hence multiplying out is usually easier than factoring. Multiplying out in the dual space does not give the answer. One take the dual to get the answer. This will then be the factored form of the original expression PROLEM Show algebraically that F = takes only 8 letters or 2 gate inputs in factored form. arleton University dig4factoringh.fm p. 53, Revised; January 28, 2009 omment on Slide 3
6 Factoring Using uality Method II: Factoring Using uality Example: equal F = First use () F = ( + ) + ( + ) F =[ ({ } + { })] + [ ({ } + )] Take dual F dual = [ + ({ + } { + })] [+ ({ + } )] Multiply out = [ + ( + )( + )] [ + ( + )] Sw = ( + )) + ( + )( + ) Sw = ( + )) + ( + ) = First use () twice Put brakets around all the N terms Minus 25% if you don t differentiate between F and F dual Rearrange to use Swap Use Swap (+stuff)(+junk)= junk+ stuff Use Swap (+)(+)= + Use () F dual = heck on map Take dual back OK on map F = ( + + )( + + )( + + )( + + ) Factored form -> F = ( + + )( + + )( + + )( + + ) map of F dual dig4factoringh.fm p. 54 Revised; January 28, 2009 Slide 4 Factoring Using uality Method II: Factoring In the ual Space Method II: Factoring In the ual Space Example; Factor F = F = ( +) + ( + ) F = ( +) + ( + ) F = [+ ( + )] [+( + )] F = [+{ ( + )}] [+({ } + { })] Put brackets around all Ns ready to take dual Take the dual F d = [ {+( )}] + [ ({+} {+})] Remove extra brackets F d = {+( )} + {+} {+} Use () In General F d = + + {+} {+} Simplify, use F Use Swap d = + + [ + ] and maybe Swap after taking the Use () F d = dual F d = Map shows no more simplifications Take the dual back F = ( + ) ( + + )( + + )( + + ) 4-. PROLEM Factor EF + E + E + EF Use () Use () Use Swap In General Simplify, use and maybe Swap before taking the dual arleton University dig4factoringh.fm p. 55, Revised; January 28, 2009 omment on Slide 4
7 Factoring Karnaugh Maps and emorgan Method III: Factoring Using a K-Map Step. Plot function F on a K-map Step 2. Plot F by interchanging 0 on the map. Step 3. ircle the map to get F. Step 4. Write out the expression for F. Step 5. Use emorgan to get back F in factored form. Example: Given F = ( Σ of Π expression) F = () Plot it on a map. (2) Make a map for F, It has where F had 0 (3) ircle the F map (4) Write out the equation for F F = (5) Invert F using emorgan s law to get F as Π of Σ F = ( + )( + + )( + + )( + + ) dig4factoringh.fm p. 56 Revised; January 28, 2009 Slide 5 Factoring Karnaugh Maps and emorgan Method III: Factoring Using Karnaugh Method III: Factoring Using Karnaugh Maps This method is probably the easiest, and least error prone, for up to four variables. Five variables is at least twice the work of four. bove 5 it gets very messy. It is very easy to incorporate don t cares with this method PROLEM Factor EF + E + E + EF Using a Karnaugh map and compare your answer with the previous problem if you did it PROLEM Factor Use a Karnaugh map and obtain the minimum Π of Σ expression PROLEM Show, using a Karnaugh map, that F = takes only 8 letters or 2 gate inputs in factored form. ompare with Problem 4-0. arleton University dig4factoringh.fm p. 57, Revised; January 28, 2009 omment on Slide 5
8 Factoring Using K-Maps and emorgan Factoring Using Karnaugh Maps Steps: Given F = ( Σ of Π expression) F = Not the minimum but it doesn t matter () Plot it on a map. (2) Make a map for F, It has where F had 0 (3) ircle the F map (4) Write out the equation for F F = + + (5) Invert F using emorgan s law to get F as Π of Σ F = ( + )( + + )( + ) dig4factoringh.fm p. 58 Revised; January 28, 2009 Slide 6 Factoring Using K-Maps and emorgan Method III: Factoring Using Karnaugh Example: Factoring a 5-Variable Expression without using a map! Method II: uses initially, then duality and swap before the final cleanup. Take dual Multiply Out Factor F = E Use F = ( + + E) + ( +) F = [ ( +{ } +{ E})] +[ ({ } +)] F dual = [ + ( { + } { + E})] [ + ({ + } )] F dual = [ { + } ] + [ { + } { + E}] F dual = [ { + } ] + [{ + } { + E}] [{ E} + { }] Use ut brackets around LL N terms + Use Swap Ready to use Swap Use Swap F dual = [ { + } ] + [{ E} + { }] F dual = + + E + Use () twice Take dual back get (dual) 2 = F = (++)(++)(+++E)(+++) arleton University dig4factoringh.fm p. 59, Revised; January 28, 2009 omment on Slide 6
9 Warnings on t say (a+b+c)(e+ab)(a+d) is already Π of Σ lways simplify. Look for x+xz = x, x + xy = x + Y, xy + xy = Y before and after each step. Pick the best method: ) for 5 variables or under use general emorgan and a map. ) for 6 variables or more, use algebra or find a computer program. For multiplying out algebraically Take the dual. Simplify and use Take the reverse dual. Look for complemented letters, use swap, and simplify. Use for what is left. For factoring algebraically EFORE you take the dual Simplify and use Take the dual use Look possible Swap, simplify Use and simplify Take the reverse dual Taking the dual The hard part is getting the brackets around the LL the N terms. Try: (+ + E ) + ( +) dig4factoringh.fm p. 60 Revised; January 28, 2009 Slide 7 Original the slide above said, on t say (a+b+c)ab(a+d) is already Π of Σ." ctually it was Π of Σ, and the slide embarrased the lecturer PROLEM Explain why the (a+b+c)ab(a+d) is Π of Σ. Hint: take the dual. Method III: Factoring Using Karnaugh 4-6. PROLEM ON ULS Take the dual of F = ( + + E ) + ( + ) To check your answer look in the omment on Slide 6 I ll bet you can t get it right the first time without looking. arleton University dig4factoringh.fm p. 6, Revised; January 28, 2009 omment on Slide 7
10 dig4factoringh.fm p. 62 Revised; January 28, 2009 Slide 8 Method III: Factoring Using Karnaugh arleton University dig4factoringh.fm p. 63, Revised; January 28, 2009 omment on Slide 8
Boolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation
oolean lgebra asic mathematics for the study of logic design is oolean lgebra asic laws of oolean lgebra will be implemented as switching devices called logic gates. Networks of Logic gates allow us to
More informationKarnaugh Maps Objectives
Karnaugh Maps Objectives For Karnaugh Maps of up to 5 variables Plot a function from algebraic, minterm or maxterm form Obtain minimum Sum of Products and Product of Sums Understand the relationship between
More informationCARLETON UNIVERSITY Final rev EXAMINATION Fri, April 22, 2005, 14:00
LTON UNIVSITY Final rev MINTION Fri, pril 22, 25, 4: Name: Number: Signature: UTION: 3 HOUS No. of Students: 258 epartment Name & ourse Number: lectronics L 267, and ourse Instructor(s) T..ay and J. Knight
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev. Section 2: Boolean Algebra & Logic Gates
Digital Circuits & Systems Lecture Transparencies (Boolean lgebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean lgebra & Logic Gates Major topics Boolean algebra NND & NOR gates Boolean algebra
More informationCARLETON UNIVERSITY Final EXAMINATION April 16, 2003
LTN UNIVSIT Final MINTIN pril 6, 23 Name: Number: Signature: UTIN: HUS No. of Student: epartment Name & ourse Number: ourse Instructor(s) UTHI MMN 3 4 lectronic ngineering L267, and Profs. N. Tait and
More informationAlgebra Year 10. Language
Algebra Year 10 Introduction In Algebra we do Maths with numbers, but some of those numbers are not known. They are represented with letters, and called unknowns, variables or, most formally, literals.
More informationGetting Started with Communications Engineering. Rows first, columns second. Remember that. R then C. 1
1 Rows first, columns second. Remember that. R then C. 1 A matrix is a set of real or complex numbers arranged in a rectangular array. They can be any size and shape (provided they are rectangular). A
More informationA-Level Notes CORE 1
A-Level Notes CORE 1 Basic algebra Glossary Coefficient For example, in the expression x³ 3x² x + 4, the coefficient of x³ is, the coefficient of x² is 3, and the coefficient of x is 1. (The final 4 is
More informationAlgebra Year 9. Language
Algebra Year 9 Introduction In Algebra we do Maths with numbers, but some of those numbers are not known. They are represented with letters, and called unknowns, variables or, most formally, literals.
More informationAlgebra. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This document was written and copyrighted by Paul Dawkins. Use of this document and its online version is governed by the Terms and Conditions of Use located at. The online version of this document is
More informationNumber System conversions
Number System conversions Number Systems The system used to count discrete units is called number system. There are four systems of arithmetic which are often used in digital electronics. Decimal Number
More informationQuadratic Equations Part I
Quadratic Equations Part I Before proceeding with this section we should note that the topic of solving quadratic equations will be covered in two sections. This is done for the benefit of those viewing
More informationE&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev
E&CE 223 Digital Circuits & Systems Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean Algebra & Logic Gates Major topics Boolean algebra NAND & NOR gates Boolean
More informationENG2410 Digital Design Combinational Logic Circuits
ENG240 Digital Design Combinational Logic Circuits Fall 207 S. Areibi School of Engineering University of Guelph Binary variables Binary Logic Can be 0 or (T or F, low or high) Variables named with single
More informationMath 138: Introduction to solving systems of equations with matrices. The Concept of Balance for Systems of Equations
Math 138: Introduction to solving systems of equations with matrices. Pedagogy focus: Concept of equation balance, integer arithmetic, quadratic equations. The Concept of Balance for Systems of Equations
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationSTEP Support Programme. Hints and Partial Solutions for Assignment 1
STEP Support Programme Hints and Partial Solutions for Assignment 1 Warm-up 1 You can check many of your answers to this question by using Wolfram Alpha. Only use this as a check though and if your answer
More informationMEI Core 1. Basic Algebra. Section 1: Basic algebraic manipulation and solving simple equations. Manipulating algebraic expressions
MEI Core Basic Algebra Section : Basic algebraic manipulation and solving simple equations Notes and Examples These notes contain subsections on Manipulating algebraic expressions Collecting like terms
More informationCombinational Logic (mostly review!)
ombinational Logic (mostly review!)! Logic functions, truth tables, and switches " NOT, N, OR, NN, NOR, OR,... " Minimal set! xioms and theorems of oolean algebra " Proofs by re-writing " Proofs by perfect
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal
More informationCHAPTER 2 BOOLEAN ALGEBRA
CHAPTER 2 BOOLEAN ALGEBRA This chapter in the book includes: Objectives Study Guide 2.1 Introduction 2.2 Basic Operations 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative,
More informationCHAPTER 3 BOOLEAN ALGEBRA
CHAPTER 3 BOOLEAN ALGEBRA (continued) This chapter in the book includes: Objectives Study Guide 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operations 3.3 The Consensus
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 informationII. COMBINATIONAL LOGIC DESIGN. - algebra defined on a set of 2 elements, {0, 1}, with binary operators multiply (AND), add (OR), and invert (NOT):
ENGI 386 Digital Logic II. COMBINATIONAL LOGIC DESIGN Combinational Logic output of digital system is only dependent on current inputs (i.e., no memory) (a) Boolean Algebra - developed by George Boole
More informationCHAPTER 12 Boolean Algebra
318 Chapter 12 Boolean Algebra CHAPTER 12 Boolean Algebra SECTION 12.1 Boolean Functions 2. a) Since x 1 = x, the only solution is x = 0. b) Since 0 + 0 = 0 and 1 + 1 = 1, the only solution is x = 0. c)
More informationCS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman
CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions
More informationLecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions
EE210: Switching Systems Lecture 5: NAND, NOR and XOR Gates, Simplification of Algebraic Expressions Prof. YingLi Tian Feb. 15, 2018 Department of Electrical Engineering The City College of New York The
More informationECE 238L Boolean Algebra - Part I
ECE 238L Boolean Algebra - Part I August 29, 2008 Typeset by FoilTEX Understand basic Boolean Algebra Boolean Algebra Objectives Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand
More informationLearning Objectives. Boolean Algebra. In this chapter you will learn about:
Ref. Page Slide /78 Learning Objectives In this chapter you will learn about: oolean algebra Fundamental concepts and basic laws of oolean algebra oolean function and minimization Logic gates Logic circuits
More informationLogic Simplification. Boolean Simplification Example. Applying Boolean Identities F = A B C + A B C + A BC + ABC. Karnaugh Maps 2/10/2009 COMP370 1
Digital Logic COMP370 Introduction to Computer Architecture Logic Simplification It is frequently possible to simplify a logical expression. This makes it easier to understand and requires fewer gates
More informationKarnaugh Maps ف ر آ ا د : ا ا ب ا م آ ه ا ن ر ا
Karnaugh Maps مخطط آارنوف اعداد:محمد اسماعيل آلية علوم الحاسوب جامعة امدرمان الاهلية الاهداء الي آل من يسلك طريق العلم والمعرفة في هذا المجال Venn Diagrams Venn diagram to represent the space of minterms.
More informationCS/EE 181a 2010/11 Lecture 4
CS/EE 181a 21/11 Lecture 4 General topic of today s lecture: Logic Optimization Karnaugh maps. Quine-McCluskey tabulation method (not in detail). Non series-parallel networks (some care is required). Reference
More informationFinding Limits Graphically and Numerically
Finding Limits Graphically and Numerically 1. Welcome to finding limits graphically and numerically. My name is Tuesday Johnson and I m a lecturer at the University of Texas El Paso. 2. With each lecture
More informationSlide Set 3. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary
Slide Set 3 for ENEL 353 Fall 2016 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 2016 SN s ENEL 353 Fall 2016 Slide Set 3 slide
More informationFunctions. Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways:
Boolean Algebra (1) Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: An expression is finite but not unique f(x,y)
More informationSystems I: Computer Organization and Architecture
Systems I: Computer Organization and Architecture Lecture 6 - Combinational Logic Introduction A combinational circuit consists of input variables, logic gates, and output variables. The logic gates accept
More informationContents. Chapter 3 Combinational Circuits Page 1 of 36
Chapter 3 Combinational Circuits Page of 36 Contents Combinational Circuits...2 3. Analysis of Combinational Circuits...3 3.. Using a Truth Table...3 3..2 Using a Boolean Function...6 3.2 Synthesis of
More informationﻮﻧﺭﺎﮐ ﺔﺸﻘﻧ ﺎﺑ ﻱﺯﺎﺳ ﻪﻨﻴﻬﺑ
بهينه سازي با نقشة کارنو Karnaugh Map Karnaugh Map Method of graphically representing the truth table that helps visualize adjacencies 2-variable K-map 3-variable K-map 2 3 2 3 6 7 4 5 D 3 2 4 5 7 6 2
More informationSimplifying Logic Circuits with Karnaugh Maps
Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified
More informationELC224C. Karnaugh Maps
KARNAUGH MAPS Function Simplification Algebraic Simplification Half Adder Introduction to K-maps How to use K-maps Converting to Minterms Form Prime Implicants and Essential Prime Implicants Example on
More informationWeek-I. Combinational Logic & Circuits
Week-I Combinational Logic & Circuits Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other logic operators IC families and
More informationLogic Gate Level. Part 2
Logic Gate Level Part 2 Constructing Boolean expression from First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result column of the truth table Works best for table with relatively
More informationSTEP Support Programme. Hints and Partial Solutions for Assignment 5
STEP Support Programme Hints and Partial Solutions for Assignment 5 Warm-up 1 (i) As always, a diagram might be useful: cos θ b c and sin θ a c, so (using Pythagoras Theorem), cos 2 θ + sin 2 θ b2 + a
More informationAdding and Subtracting Terms
Adding and Subtracting Terms 1.6 OBJECTIVES 1.6 1. Identify terms and like terms 2. Combine like terms 3. Add algebraic expressions 4. Subtract algebraic expressions To find the perimeter of (or the distance
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationBoolean Algebra and Digital Logic
All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types
More informationReview Solutions, Exam 2, Operations Research
Review Solutions, Exam 2, Operations Research 1. Prove the weak duality theorem: For any x feasible for the primal and y feasible for the dual, then... HINT: Consider the quantity y T Ax. SOLUTION: To
More informationChapter 2: Princess Sumaya Univ. Computer Engineering Dept.
hapter 2: Princess Sumaya Univ. omputer Engineering Dept. Basic Definitions Binary Operators AND z = x y = x y z=1 if x=1 AND y=1 OR z = x + y z=1 if x=1 OR y=1 NOT z = x = x z=1 if x=0 Boolean Algebra
More informationLecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University
Lecture 6: Gate Level Minimization Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Aby K George, ECE Department, Wayne State University Contents The Map method Two variable
More informationECE/Comp Sci 352 Digital System Fundamentals Quiz # 1 Solutions
Last (Family) Name: KIME First (Given) Name: Student I: epartment of Electrical and omputer Engineering University of Wisconsin - Madison EE/omp Sci 352 igital System Fundamentals Quiz # Solutions October
More informationGetting Started with Communications Engineering
1 Linear algebra is the algebra of linear equations: the term linear being used in the same sense as in linear functions, such as: which is the equation of a straight line. y ax c (0.1) Of course, if we
More informationSample Marking Scheme
Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2008 Midterm Examination # 1 B Wednesday, November 5, 2008 Sample Marking Scheme Duration of examination:
More informationMidterm Examination # 1 Wednesday, February 25, Duration of examination: 75 minutes
Page 1 of 10 School of Computer Science 60-265-01 Computer Architecture and Digital Design Winter 2009 Semester Midterm Examination # 1 Wednesday, February 25, 2009 Student Name: First Name Family Name
More informationDIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA
DIGITAL CIRCUIT LOGIC BOOLEAN ALGEBRA 1 Learning Objectives Understand the basic operations and laws of Boolean algebra. Relate these operations and laws to circuits composed of AND gates, OR gates, INVERTERS
More informationCh 2. Combinational Logic. II - Combinational Logic Contemporary Logic Design 1
Ch 2. Combinational Logic II - Combinational Logic Contemporary Logic Design 1 Combinational logic Define The kind of digital system whose output behavior depends only on the current inputs memoryless:
More informationLearning Objectives:
Learning Objectives: t the end of this topic you will be able to; draw a block diagram showing how -type flip-flops can be connected to form a synchronous counter to meet a given specification; explain
More informationCARLETON UNIVERSITY. X = Y 0 0 X > Y 1 0 X < Y 0 1 never 1 1 happens. Examples
CARLETON UNIVERSITY Deparment of Electronics ELEC 2607 Switching Circuits January 17, 2005 Laboratory 1. Overview; A 4-Bit Binary Comparator X 3 X 2 X 1 X 0 COMPARATOR Y 3 Y 2 Y 1 Y 0 4 DATA BITS LEAST
More informationChapter-2 BOOLEAN ALGEBRA
Chapter-2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.
More informationGoals for Lecture. Binary Logic and Gates (MK 2.1) Binary Variables. Notation Examples. Logical Operations
Introduction to Electrical Engineering, II LETURE NOTES #2 Instructor: Email: Telephone: Office: ndrew. Kahng (lecture) abk@ucsd.edu 858-822-4884 office 3802 P&M lass Website: http://vlsicad.ucsd.edu/courses/ece20b/wi04/
More informationLogic Design. Chapter 2: Introduction to Logic Circuits
Logic Design Chapter 2: Introduction to Logic Circuits Introduction Logic circuits perform operation on digital signal Digital signal: signal values are restricted to a few discrete values Binary logic
More informationUNIVERSITI TENAGA NASIONAL. College of Information Technology
UNIVERSITI TENAGA NASIONAL College of Information Technology BACHELOR OF COMPUTER SCIENCE (HONS.) FINAL EXAMINATION SEMESTER 2 2012/2013 DIGITAL SYSTEMS DESIGN (CSNB163) January 2013 Time allowed: 3 hours
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More informationRoberto s Notes on Linear Algebra Chapter 4: Matrix Algebra Section 7. Inverse matrices
Roberto s Notes on Linear Algebra Chapter 4: Matrix Algebra Section 7 Inverse matrices What you need to know already: How to add and multiply matrices. What elementary matrices are. What you can learn
More informationEE 209 Spiral 1 Exam Solutions Name:
EE 29 Spiral Exam Solutions Name:.) Answer the following questions as True or False a.) A 4-to- multiplexer requires at least 4 select lines: true / false b.) An 8-to- mux and no other logic can be used
More informationMITOCW MITRES18_005S10_DiffEqnsMotion_300k_512kb-mp4
MITOCW MITRES18_005S10_DiffEqnsMotion_300k_512kb-mp4 PROFESSOR: OK, this lecture, this day, is differential equations day. I just feel even though these are not on the BC exams, that we've got everything
More informationL2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and oolean lgebra) cknowledgements: Materials in this lecture are courtesy of the following people and used with permission. - Randy H. Katz (University of
More informationUnit 2 Boolean Algebra
Unit 2 Boolean Algebra 1. Developed by George Boole in 1847 2. Applied to the Design of Switching Circuit by Claude Shannon in 1939 Department of Communication Engineering, NCTU 1 2.1 Basic Operations
More informationECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN. Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Week 2 Dr. Srinivas Shakkottai Dept. of Electrical and Computer Engineering Boolean Algebra Boolean Algebra A Boolean algebra is defined with: A set of
More information211: Computer Architecture Summer 2016
211: Computer Architecture Summer 2016 Liu Liu Topic: Storage Project3 Digital Logic - Storage: Recap - Review: cache hit rate - Project3 - Digital Logic: - truth table => SOP - simplification: Boolean
More informationWhy digital? Overview. Number Systems. Binary to Decimal conversion
Why digital? Overview It has the following advantages over analog. It can be processed and transmitted efficiently and reliably. It can be stored and retrieved with greater accuracy. Noise level does not
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationChapter 2. Mathematical Reasoning. 2.1 Mathematical Models
Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................
More informationCALCULUS I. Review. Paul Dawkins
CALCULUS I Review Paul Dawkins Table of Contents Preface... ii Review... 1 Introduction... 1 Review : Functions... Review : Inverse Functions...1 Review : Trig Functions...0 Review : Solving Trig Equations...7
More informationReview for Test 1 : Ch1 5
Review for Test 1 : Ch1 5 October 5, 2006 Typeset by FoilTEX Positional Numbers 527.46 10 = (5 10 2 )+(2 10 1 )+(7 10 0 )+(4 10 1 )+(6 10 2 ) 527.46 8 = (5 8 2 ) + (2 8 1 ) + (7 8 0 ) + (4 8 1 ) + (6 8
More information8.4. Systems of Equations in Three Variables. Identifying Solutions 2/20/2018. Example. Identifying Solutions. Solving Systems in Three Variables
8.4 Systems of Equations in Three Variables Copyright 2010 Pearson Education, Inc. Publishing as Pearson Addison- Wesley Identifying Solutions Solving Systems in Three Variables Dependency, Inconsistency,
More informationLecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps
EE210: Switching Systems Lecture 6: Manipulation of Algebraic Functions, Boolean Algebra, Karnaugh Maps Prof. YingLi Tian Feb. 21/26, 2019 Department of Electrical Engineering The City College of New York
More informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationGCSE MATHEMATICS HELP BOOKLET School of Social Sciences
GCSE MATHEMATICS HELP BOOKLET School of Social Sciences This is a guide to ECON10061 (introductory Mathematics) Whether this guide applies to you or not please read the explanation inside Copyright 00,
More informationCHAPTER1: Digital Logic Circuits Combination Circuits
CS224: Computer Organization S.KHABET CHAPTER1: Digital Logic Circuits Combination Circuits 1 PRIMITIVE LOGIC GATES Each of our basic operations can be implemented in hardware using a primitive logic gate.
More informationMathematics Revision Guide. Algebra. Grade C B
Mathematics Revision Guide Algebra Grade C B 1 y 5 x y 4 = y 9 Add powers a 3 a 4.. (1) y 10 y 7 = y 3 (y 5 ) 3 = y 15 Subtract powers Multiply powers x 4 x 9...(1) (q 3 ) 4...(1) Keep numbers without
More informationCOLLEGE ALGEBRA. Paul Dawkins
COLLEGE ALGEBRA Paul Dawkins Table of Contents Preface... iii Outline... iv Preliminaries... 7 Introduction... 7 Integer Exponents... 8 Rational Exponents...5 Radicals... Polynomials...30 Factoring Polynomials...36
More informationCalculus II. Calculus II tends to be a very difficult course for many students. There are many reasons for this.
Preface Here are my online notes for my Calculus II course that I teach here at Lamar University. Despite the fact that these are my class notes they should be accessible to anyone wanting to learn Calculus
More informationMAXIMUM AND MINIMUM 2
POINT OF INFLECTION MAXIMUM AND MINIMUM Example 1 This looks rather simple: x 3 To find the stationary points: = 3x So is zero when x = 0 There is one stationary point, the point (0, 0). Is it a maximum
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Lines and Their Equations
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 017/018 DR. ANTHONY BROWN. Lines and Their Equations.1. Slope of a Line and its y-intercept. In Euclidean geometry (where
More informationVectors Part 1: Two Dimensions
Vectors Part 1: Two Dimensions Last modified: 20/02/2018 Links Scalars Vectors Definition Notation Polar Form Compass Directions Basic Vector Maths Multiply a Vector by a Scalar Unit Vectors Example Vectors
More informationBinary logic consists of binary variables and logical operations. The variables are
1) Define binary logic? Binary logic consists of binary variables and logical operations. The variables are designated by the alphabets such as A, B, C, x, y, z, etc., with each variable having only two
More informationAlgebra II. Slide 1 / 276. Slide 2 / 276. Slide 3 / 276. Polynomials: Operations and Functions. Table of Contents
Slide 1 / 276 lgebra II Slide 2 / 276 Polynomials: Operations and Functions 2014-10-22 www.njctl.org Table of ontents click on the topic to go to that section Slide 3 / 276 Properties of Exponents Review
More information14:332:231 DIGITAL LOGIC DESIGN
:: DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering Fall Lecture #: Combinational Circuit Synthesis II hat if we have input variables? V = V = of Example with variables
More informationTheorem/Law/Axioms Over (.) Over (+)
material prepared by: MUKESH OHR Follow me on F : http://www.facebook.com/mukesh.sirji4u OOLEN LGER oolean lgebra is a set of rules, laws and theorems by which logical operations can be mathematically
More informationUC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits
2 Wawrzynek, Garcia 2004 c UCB UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits 1 Introduction Original document by J. Wawrzynek (2003-11-15) Revised
More informationIsomorphisms and Well-definedness
Isomorphisms and Well-definedness Jonathan Love October 30, 2016 Suppose you want to show that two groups G and H are isomorphic. There are a couple of ways to go about doing this depending on the situation,
More informationIf f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C
Examples: If f 5 = AB + AB then f 5 = A B + A B = f 10 If f = ABC + ABC + A B C then f = AB C + A BC + AB C + A BC + A B C In terms of a truth table, if f is the sum (OR) of all the minterms with a 1 in
More informationVector calculus background
Vector calculus background Jiří Lebl January 18, 2017 This class is really the vector calculus that you haven t really gotten to in Calc III. Let us start with a very quick review of the concepts from
More informationProve that if not fat and not triangle necessarily means not green then green must be fat or triangle (or both).
hapter : oolean lgebra.) Definition of oolean lgebra The oolean algebra is named after George ool who developed this algebra (854) in order to analyze logical problems. n example to such problem is: Prove
More informationCHAPTER III BOOLEAN ALGEBRA
CHAPTER III- CHAPTER III CHAPTER III R.M. Dansereau; v.. CHAPTER III-2 BOOLEAN VALUES INTRODUCTION BOOLEAN VALUES Boolean algebra is a form of algebra that deals with single digit binary values and variables.
More informationNotes on the Z-transform, part 4 1
Notes on the Z-transform, part 4 5 December 2002 Solving difference equations At the end of note 3 we saw how to solve a difference equation using Z-transforms. Here is a similar example, solve x k+2 6x
More informationMA 1128: Lecture 08 03/02/2018. Linear Equations from Graphs And Linear Inequalities
MA 1128: Lecture 08 03/02/2018 Linear Equations from Graphs And Linear Inequalities Linear Equations from Graphs Given a line, we would like to be able to come up with an equation for it. I ll go over
More informationDigital Circuit Engineering
Digital Circuit Engineering 2nd Distributive ( A)( B) = AB Circuits that work in a sequence of steps Absorption A = A A= THESE CICUITS NEED STOAGE TO EMEMBE WHEE THEY AE STOAGE D MU G M MU G S CLK D Flip
More informationBridging the gap between GCSE and A level mathematics
Bridging the gap between GCSE and A level mathematics This booklet is designed to help you revise important algebra topics from GCSE and make the transition from GCSE to A level a smooth one. You are advised
More informationSAMPLE ANSWERS MARKER COPY
Page 1 of 12 School of Computer Science 60-265-01 Computer Architecture and Digital Design Fall 2012 Midterm Examination # 1 Tuesday, October 23, 2012 SAMPLE ANSWERS MARKER COPY Duration of examination:
More information