Minimierung. Wintersemester 2018/19. Folien basierend auf Material von F. Vahid und S. Werner Vorlesender: Dr. Ing.
|
|
- Morgan Matthews
- 5 years ago
- Views:
Transcription
1 Minimierung Grundlagen der technischen Informatik Wintersemester 28/9 Folien basierend auf Material von F. Vahid und S. Werner Wintersemester 28/9
2 Review - Boolean Algebra Properties Commutative (Kommutativgesetz) a + b = b + a a * b = b * a Distributive (Distributivgesetz) a * (b + c) = a * b + a * c Can write as: a(b+c) = ab + ac a + (b * c) = (a + b) * (a + c) Can write as: a+(bc) = (ab)(ac) Associative (Assoziativgesetz) (a + b) + c = a + (b + c) (a * b) * c = a * (b * c) Identity (Neutrale Elemente) + a = a + = a * a = a * = a Complement (Komplement) a + a = a * a = To prove, just evaluate all possibilities Wintersemester 28/9 2
3 Review - Representations of Boolean Functions English : F outputs when a is and b is, or when a is and b is. English 2: F outputs when a is, regardless of b s value Equation : F(a,b) = a b + a b Equation 2: F(a,b) = a a b F a b F Circuit a F Truth table Circuit 2 Function F A function can be represented in different ways Above shows seven representations of the same functions F(a,b), using four different methods: English, Equation, Circuit, and Truth Dr. Ing. Table Frank Sill Torres Wintersemester 28/9 3
4 Review - Standard Representation: Truth Table How can we determine if two functions are the same? Recall automatic door eample Same as f = hc + h pc? Used algebraic methods But if we failed, does that prove not equal? No. Solution: Convert to truth tables Only ONE truth table representation of a given function Standard representation for given function, only one version in standard form eists f = c hp + c hp + c h f = c h(p + p ) + c h p f = c h() + c h p f = c h + c h p (what if we stopped here?) f = hc + h pc Q: Determine if F=ab+a is same function as F=a b +a b+ab, by converting each to truth table first F = ab + a' a b F Wintersemester 28/9 F = a b + a b + ab a b F 4
5 Review - Canonical Form Sum of Minterms Truth tables too big for numerous inputs Use standard form of equation instead Known as canonical form Regular algebra: group terms of polynomial by power a 2 + b + c ( > ) Boolean algebra: create sum of minterms (also: Disjunctive normal form - DNF) Minterm: product term with every function literal appearing eactly once, in true or complemented form Just multiply-out equation until sum of product terms Then epand each term until all terms are minterms Q: Determine if F(a,b)=ab+a is equivalent to F(a,b)=a b +a b+ab, by converting first equation to canonical form (second already is) F = ab + a (already sum of products) F = ab + a (b+b ) (epanding term) F = ab + a b + a b (Equivalent Grundlagen der Technische same three Informatikterms as other equation) 5 Wintersemester 28/9
6 Alternatives Original Circuit Disjunctive Form Conjunctive Form AND XOR OR Which circuit is the best implementation? What is the BEST? Wintersemester 28/9 6
7 Circuit select Original Circuit Disjunctive Form Conjunctive Form AND XOR OR C A = Area C S = Stages Result: chose circuit or 3 for a compact solution chose circuit 2 or 3 for a fast solution Wintersemester 28/9 7
8 Karnaugh-Veich Maps (KV-Maps) Graphical method for finding terms that can be combined to eliminate variables in order to obtain the minimum Minterms differing from one variable are adjacent (neighbors) on the map We can clearly visualize the possible cases of combination of terms Note that it is not sorted binary F z = F = z = y z y z y z y z KV-map y = Reminder: y = Consider left and right neighbors too `, y`, y Wintersemester 28/9 z`, z 8
9 KV-maps - Styles A line indicates where a variable is Map for more variables: mirroring of basic structure a = b = c = Different versions for a KV-map Important for optimization: Neighboring fields can only differ in eactly one variable Wintersemester 28/9 9
10 KV-maps - Styles Compact representation of KV-maps via numbers KV-map with 2 variables A B A B = Nº 2 A B = Nº AB = Nº 2 AB = Nº 3 KV-map with 3 variables 3 A B C = Nº, A B C = Nº, A BC = Nº 2, A BC = Nº 3, AB C = Nº 4, AB C = Nº 5, ABC = Nº 6, ABC = Nº 7 AB C 2 3 B = A= Wintersemester 28/9
11 KV-maps - Styles KV-map with 4 variables Nº A B C D A = AB CD C= B = D = Wintersemester 28/9
12 Review - Compact DNF Representation List each minterm as a number Number determined from the binary representation of its variables values a'bcde corresponds to, or 5 abcde' corresponds to, or 3 abcde corresponds to, or 3 Thus, H = a'bcde + abcde' + abcde can be written as: H = m(5,3,3) "H is the sum of minterms 5, 3, and 3" Wintersemester 28/9 2
13 C AB CD C F(A,B,C)=A BC + AB C + ABC + ABC = Σm(3,5,6,7) A B A B A B D F(A,B,C,D)=Σm(,2,3,5,6,7,8,,,4,5) Wintersemester 28/9 A B C 3 F
14 KV-Maps Application: Draw circle, write term that has all the literals ecept the one that changes in the circle Circle y, = & y= in both cells of the circle, but z changes (z= in one cell, in the other) Top-left circle generates reduction of y z + y z = y (z +z) = y () = y Minimized function: OR of found terms Easier than the algebraic method: F = + + y z + y z F = y(z + z ) + y (z + z ) F = y* + y * F = y + y Wintersemester 28/9 F = y z y z F F y y F = y + y 4
15 KV-Maps Four adjacent s means two variables can be eliminated Makes intuitive sense those two variables appear in all combinations, so one must be true Draw one big circle shorthand for the algebraic transformations above G = y z + y z + + G = (y z + y z + + ) (must be true) G = (y (z +z) + y(z+z )) G = (y +y) G = G Draw the biggest circle possible, or you ll have more terms than really needed G y Wintersemester 28/9 y 5
16 KV-maps Four adjacent cells can be in shape of a square OK to cover a twice Just like duplicating a term Remember, c + d = c + d + d No need to cover s more than once Yields etra terms not minimized H H = y z + + y z + (y appears in all combinations) I y z z J y y z z The two circles are shorthand for: I = y z + y z + y z + + I = y z + y z + y z + y z + + I = ( y z + y z) + (y z + y z + + ) I = (y z) + () Wintersemester 28/9 6
17 KV-maps Circles can cross left/right sides K y z Remember, edges are adjacent Minterms differ in one variable only Circles must have, 2, 4, or 8 cells 3, 5, or 7 not allowed 3/5/7 doesn t correspond to algebraic transformations that combine terms to eliminate a variable Circling all the cells is OK Function just equals L E z Wintersemester 28/9 7
18 KV-maps for Four Variables Four-variable K-map follows same principle Adjacent cells differ in one variable Left/right adjacent Top/bottom also adjacent 5 and 6 variable maps eist But hard to use (see net slide) Two-variable maps eist But not very useful easy to do algebraically by hand F y z F w w y G w Grundlagen der Technische Informatik Wintersemester 28/9 z F=w y + G=z 8
19 KV-maps with 5 variables F(A,B,C,D)=Σm(2,5,7,8,,3,5,7,9,2,23,24,29,3) A= DE BC 3 2 DE BC A= BC DE A= DE BC A= Wintersemester 28/9 9
20 KV-maps with 6 variables AB= AB = AB = AB = CD EF CD EF CD EF CD EF AB= AB = AB = AB = CD EF CD EF CD EF CD EF Wintersemester 28/9 2
21 Two-Level Size Minimization Using KV-maps General KV-map method. Convert the function s equation into sum-of-products form* 2. Place s in the appropriate KVmap cells for each term 3. Cover all s by drawing the fewest largest circles, with every included at least once; write the corresponding term for each circle 4. OR all the resulting terms to create the minimized function. Eample: Minimize: G = a + a b c + b*(c + bc ). Convert to sum-of-products G = a + a b c + bc + bc 2. Place s in appropriate cells G bc bc a b c 3. Cover s a G a bc a c * hint: could also be DNF 4. OR terms: G = a + c 2 Wintersemester 28/9 a
22 Two-Level Size Minimization Using KV-maps Four Variable Eample Minimize: H = a b (cd + c d ) + ab c d + ab cd + a bd + a bcd. Convert to sum-of-products: H = a b cd + a b c d + ab c d + ab cd + a bd + a bcd 2. Place s in K-map cells 3. Cover s 4. OR resulting terms H ab a b c d a b cd ab c d a bd a bcd cd b d a bc a bd ab cd H = b d + a bc + a bd Funny-looking circle, but remember that left/right adjacent, and top/bottom adjacent Wintersemester 28/9 22
23 KV-Maps from Thruth Table Fill the map s fields with a where the function s value equals Wintersemester 28/9 23
24 Don t Care Input Combinations What if particular input combinations can never occur? e.g., Minimize F = y z, given that y z (=) can never be true, and that y z (=) can never be true So it doesn t matter what F outputs when y z or y z is true, because those cases will never occur Thus, make F be or for those cases in a way that best minimizes the equation On KV-map Draw Xs for don t care combinations Include X in circle ONLY if minimizes equation Don t include other Xs F y z X X Good use of don t cares F y z unneeded X X y Unnecessary use of don t cares; results in etra term Wintersemester 28/9 24
25 Minimizization Eample using Don t Cares Minimize: F = a bc + abc + a b c Given don t cares: a bc, abc F a bc a c b X Note: Use don t cares with caution Must be sure that we really don t care what the function outputs for that input combination If we do care, even the slightest, then it s probably safer to set the output to X F = a c + b Wintersemester 28/9 25
26 Minimization with Don t Cares Eample: Sliding Switch Switch with 5 positions 3-bit value gives position in binary Want circuit that y z 2,3,4, detector G Outputs when switch is in position 2, 3, or 4 Outputs when switch is in position or 5 Note that the 3-bit input can never output binary, 6, or 7 Treat as don t care input combinations Without don t cares: F = y + y z G G Wintersemester 28/9 y X X X z y With don t cares: F = y + z y z 26
27 Automating Two-Level Logic Size Minimization Minimizing by hand Is hard for functions with 5 or more variables May not yield minimum cover depending on order we choose Is error prone Minimization thus typically done by automated tools Eact algorithm: finds optimal solution Heuristic: finds good solution, but not necessarily optimal I (a) I (b) Wintersemester 28/9 y z y y z 4 terms z y y Only 3 terms 27
28 Basic Concepts Underlying Automated Two-Level Logic Minimization Definitions On-set: All minterms that define when F= Off-set: All minterms that define when F= Implicant: Any product term (minterm or other) that when causes F= On KV-map: any legal (but not necessarily largest) circle Cover: Implicant y covers minterms and Epanding a term: removing a variable (like larger KV-map circle) y is an epansion of F Wintersemester 28/9 y z 4 implicants of F y Note: We use KV-maps here just for intuitive illustration of concepts; automated tools do not use K-maps. Prime implicant (PI): Maimally epanded implicant any epansion would cover s not in on-set y z, and y, above But not or they can be epanded 28
29 Basic Concepts Underlying Automated Two-Level Logic Minimization Definitions (cont) Essential prime implicant: The only prime implicant that covers a particular minterm in a function s on-set Importance: We must include all essential PIs in a function s cover In contrast, some, but not all, non-essential PIs will be included G y essential z not essential not essential y z y essential Wintersemester 28/9 29
30 Eample of Automated Two-Level Minimization. Determine all prime implicants 2. Add essential PIs to cover Italicized s are thus already covered Only one uncovered remains 3. Cover remaining minterms with non-essential PIs z Pick among the two possible PIs I (a) I (b) I (c) z y z z y z y y z z y z Wintersemester 28/9 z 3
31 Was haben Sie heute gelernt? Karnaugh-Veich Diagramme sind eine graphische Methode zur Minimierung digitaler Schaltungen Indentifizierung von Literalen, die entfernt werden können Anwendung von don t care -Ausdrücken Grundlagen automatischer Lösungen Wintersemester 28/9 3
Karnaugh 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 informationUNIT 5 KARNAUGH MAPS Spring 2011
UNIT 5 KRNUGH MPS Spring 2 Karnaugh Maps 2 Contents Minimum forms of switching functions Two- and three-variable Four-variable Determination of minimum expressions using essential prime implicants Five-variable
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 informationfor Digital Systems Simplification of logic functions Tajana Simunic Rosing Sources: TSR, Katz, Boriello & Vahid
SE140: omponents and Design Techniques for Digital Systems Simplification of logic functions Tajana Simunic Rosing 1 What we covered thus far: Number representations Where we are now inary, Octal, Hex,
More informationDIGITAL ELECTRONICS & it0203 Semester 3
DIGITAL ELECTRONICS & it0203 Semester 3 P.Rajasekar & C.M.T.Karthigeyan Asst.Professor SRM University, Kattankulathur School of Computing, Department of IT 8/22/2011 1 Disclaimer The contents of the slides
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 informationUnit 2 Session - 6 Combinational Logic Circuits
Objectives Unit 2 Session - 6 Combinational Logic Circuits Draw 3- variable and 4- variable Karnaugh maps and use them to simplify Boolean expressions Understand don t Care Conditions Use the Product-of-Sums
More informationDigital Logic Design. Combinational Logic
Digital Logic Design Combinational Logic Minterms A product term is a term where literals are ANDed. Example: x y, xz, xyz, A minterm is a product term in which all variables appear exactly once, in normal
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active
More informationLecture 7: Karnaugh Map, Don t Cares
EE210: Switching Systems Lecture 7: Karnaugh Map, Don t Cares Prof. YingLi Tian Feb. 28, 2019 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) 1
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 informationCS/EE 181a 2008/09 Lecture 4
CS/EE 181a 28/9 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 informationCHAPTER 5 KARNAUGH MAPS
CHAPTER 5 1/36 KARNAUGH MAPS This chapter in the book includes: Objectives Study Guide 5.1 Minimum Forms of Switching Functions 5.2 Two- and Three-Variable Karnaugh Maps 5.3 Four-Variable Karnaugh Maps
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 informationIntroduction to Karnaugh Maps
Introduction to Karnaugh Maps Review So far, you (the students) have been introduced to truth tables, and how to derive a Boolean circuit from them. We will do an example. Consider the truth table for
More informationReview. EECS Components and Design Techniques for Digital Systems. Lec 06 Minimizing Boolean Logic 9/ Review: Canonical Forms
Review EECS 150 - Components and Design Techniques for Digital Systems Lec 06 Minimizing Boolean Logic 9/16-04 David Culler Electrical Engineering and Computer Sciences University of California, Berkeley
More informationSimplification of Boolean Functions. Dept. of CSE, IEM, Kolkata
Simplification of Boolean Functions Dept. of CSE, IEM, Kolkata 1 Simplification of Boolean Functions: An implementation of a Boolean Function requires the use of logic gates. A smaller number of gates,
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 informationEECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive
EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive March 30, 2010 John Wawrzynek Spring 2010 EECS150 - Lec19-cl1 Page 1 Boolean Algebra I (Representations of Combinational
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 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 informationLogical Design of Digital Systems
Lecture 4 Table of Content 1. Combinational circuit design 2. Elementary combinatorial circuits for data transmission 3. Memory structures 4. Programmable logic devices 5. Algorithmic minimization approaches
More informationThis form sometimes used in logic circuit, example:
Objectives: 1. Deriving of logical expression form truth tables. 2. Logical expression simplification methods: a. Algebraic manipulation. b. Karnaugh map (k-map). 1. Deriving of logical expression from
More informationAdvanced Digital Design with the Verilog HDL, Second Edition Michael D. Ciletti Prentice Hall, Pearson Education, 2011
Problem 2-1 Recall that a minterm is a cube in which every variable appears. A Boolean expression in SOP form is canonical if every cube in the expression has a unique representation in which all of the
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 informationCombinational Logic. Review of Combinational Logic 1
Combinational Logic! Switches -> Boolean algebra! Representation of Boolean functions! Logic circuit elements - logic gates! Regular logic structures! Timing behavior of combinational logic! HDLs and combinational
More informationCSE 140: Components and Design Techniques for Digital Systems
Lecture 4: Four Input K-Maps CSE 4: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University of California, San Diego Outlines Boolean Algebra
More informationDigital Circuit And Logic Design I. Lecture 4
Digital Circuit And Logic Design I Lecture 4 Outline Combinational Logic Design Principles (2) 1. Combinational-circuit minimization 2. Karnaugh maps 3. Quine-McCluskey procedure Panupong Sornkhom, 2005/2
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 informationGate-Level Minimization
Gate-Level Minimization Dr. Bassem A. Abdullah Computer and Systems Department Lectures Prepared by Dr.Mona Safar, Edited and Lectured by Dr.Bassem A. Abdullah Outline 1. The Map Method 2. Four-variable
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 informationThe Karnaugh Map COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals
The Karnaugh Map COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals Presentation Outline Boolean Function Minimization The Karnaugh Map (K-Map) Two, Three,
More informationOptimizations and Tradeoffs. Combinational Logic Optimization
Optimizations and Tradeoffs Combinational Logic Optimization Optimization & Tradeoffs Up to this point, we haven t really considered how to optimize our designs. Optimization is the process of transforming
More informationLecture 4: Four Input K-Maps
Lecture 4: Four Input K-Maps CSE 4: Components and Design Techniques for Digital Systems Fall 24 CK Cheng Dept. of Computer Science and Engineering University of California, San Diego Outlines Boolean
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 informationELCT201: DIGITAL LOGIC DESIGN
ELCT2: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 2 Following the slides of Dr. Ahmed H. Madian ذو الحجة 438 ه Winter
More informationELECTRICAL AND COMPUTER ENGINEERING DEPARTMENT, OAKLAND UNIVERSITY ECE-2700: Digital Logic Design Winter Notes - Unit 2
ECE-7: Digital Logic Design Winter 8 Notes - Unit OPTIMIZED IMPLEMENTATION OF LOGIC FUNCTIONS BASIC TECHNIQUES: We can alas minimie logic unctions using the Boolean theorems. Hoever, more poerul methods
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 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 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 informationQuine-McCluskey (Tabular) Minimization
Quine-McCluskey (Tabular) Minimization Two step process utilizing tabular listings to: Identify prime implicants (implicant tables) Identify minimal PI set (cover tables) All work is done in tabular form
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 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 informationMidterm1 Review. Jan 24 Armita
Midterm1 Review Jan 24 Armita Outline Boolean Algebra Axioms closure, Identity elements, complements, commutativity, distributivity theorems Associativity, Duality, De Morgan, Consensus theorem Shannon
More informationUNIT 4 MINTERM AND MAXTERM EXPANSIONS
UNIT 4 MINTERM AND MAXTERM EXPANSIONS Spring 2 Minterm and Maxterm Expansions 2 Contents Conversion of English sentences to Boolean equations Combinational logic design using a truth table Minterm and
More informationBoolean Algebra, Gates and Circuits
Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von
More informationCombinatorial Logic Design Principles
Combinatorial Logic Design Principles ECGR2181 Chapter 4 Notes Logic System Design I 4-1 Boolean algebra a.k.a. switching algebra deals with boolean values -- 0, 1 Positive-logic convention analog voltages
More informationKarnaugh Maps ف ر آ ا د : ا ا ب ا م آ ه ا ن ر ا
Karnaugh Maps مخطط آارنوف اعداد:محمد اسماعيل آلية علوم الحاسوب جامعة امدرمان الاهلية الاهداء الي آل من يسلك طريق العلم والمعرفة في هذا المجال Venn Diagrams Venn diagram to represent the space of minterms.
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 informationWEEK 3.1 MORE ON KARNAUGH MAPS
WEEK 3. MORE ON KARNAUGH MAPS Don t Cares Sometimes, we might have inputs and it doesn t matter what the output is; i.e., we don t care what the output is. These situations are called don t cares. Rather
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 informationChapter 2 Combinational logic
Chapter 2 Combinational logic Chapter 2 is very easy. I presume you already took discrete mathemtics. The major part of chapter 2 is boolean algebra. II - Combinational Logic Copyright 24, Gaetano Borriello
More informationWorking with Combinational Logic. Design example: 2x2-bit multiplier
Working with ombinational Logic Simplification two-level simplification exploiting don t cares algorithm for simplification Logic realization two-level logic and canonical forms realized with NNs and NORs
More informationStandard Expression Forms
ThisLecture will cover the following points: Canonical and Standard Forms MinTerms and MaxTerms Digital Logic Families 24 March 2010 Standard Expression Forms Two standard (canonical) expression forms
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 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 informationTotal Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18
University of Waterloo Department of Electrical & Computer Engineering E&CE 223 Digital Circuits and Systems Midterm Examination Instructor: M. Sachdev October 23rd, 2007 Total Time = 90 Minutes, Total
More informationLogic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 2 Circuit Optimization
Logic and omputer Design Fundamentals hapter 2 ombinational Logic ircuits Part 2 ircuit Optimization harles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode)
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 informationEEE130 Digital Electronics I Lecture #4
EEE130 Digital Electronics I Lecture #4 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi Topics to be discussed 4-1 Boolean Operations and Expressions 4-2 Laws and Rules of Boolean
More informationIntroduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps
Introduction to Digital Logic Missouri S&T University CPE 2210 Karnaugh Maps Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology
More informationMinimization techniques
Pune Vidyarthi Griha s COLLEGE OF ENGINEERING, NSIK - 4 Minimization techniques By Prof. nand N. Gharu ssistant Professor Computer Department Combinational Logic Circuits Introduction Standard representation
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 information14:332:231 DIGITAL LOGIC DESIGN. Combinational Circuit Synthesis
:: DIGITAL LOGIC DESIGN Ivan Marsic, Rutgers University Electrical & Computer Engineering all Lecture #: Combinational Circuit Synthesis I Combinational Circuit Synthesis Recall: Combinational circuit
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 informationBoolean cubes EECS150. Mapping truth tables onto cubes. Simplification. The Uniting Theorem. Three variable example
EES5 Section 5 Simplification and State Minimization Fall 2 -cube X oolean cubes Visual technique for indentifying when the uniting theorem can be applied n input variables = n-dimensional "cube" Y 2-cube
More informationKarnaugh Map & Boolean Expression Simplification
Karnaugh Map & Boolean Expression Simplification Mapping a Standard POS Expression For a Standard POS expression, a 0 is placed in the cell corresponding to the product term (maxterm) present in the expression.
More informationKarnaugh Maps (K-Maps)
Karnaugh Maps (K-Maps) Boolean expressions can be minimized by combining terms P + P = P K-maps minimize equations graphically Put terms to combine close to one another B C C B B C BC BC BC BC BC BC BC
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 informationCombinational Logic Fundamentals
Topic 3: Combinational Logic Fundamentals In this note we will study combinational logic, which is the part of digital logic that uses Boolean algebra. All the concepts presented in combinational logic
More informationECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture) Email: abk@ucsd.edu Telephone: 858-822-4884 office, 858-353-0550 cell Office: 3802
More informationLogic Design I (17.341) Fall Lecture Outline
Logic Design I (17.341) Fall 2011 Lecture Outline Class # 06 October 24, 2011 Dohn Bowden 1 Today s Lecture Administrative Main Logic Topic Homework 2 Course Admin 3 Administrative Admin for tonight Syllabus
More informationCOM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 1 of 12
COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 6 -- page 1 of 12 Karnaugh Maps In this lecture, we will discuss Karnaugh maps (K-maps) more formally than last time and discuss a more
More informationSpiral 1 / Unit 5. Karnaugh Maps
-. Spiral / Unit Karnaugh Maps -. Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least technique to improve
More informationBoolean Algebra and logic gates
Boolean Algebra and logic gates Luis Entrena, Celia López, Mario García, Enrique San Millán Universidad Carlos III de Madrid 1 Outline l Postulates and fundamental properties of Boolean Algebra l Boolean
More informationCSC9R6 Computer Design. Practical Digital Logic
CSC9R6 Computer Design Practical Digital Logic 1 References (for this part of CSC9R6) Hamacher et al: Computer Organization App A. In library Floyd: Digital Fundamentals Ch 1, 3-6, 8-10 web page: www.prenhall.com/floyd/
More informationCSE 140 Midterm I - Solution
CSE 140 Midterm I - Solution 1. Answer the following questions given the logic circuit below. (15 points) a. (5 points) How many CMOS transistors does the given (unsimplified) circuit have. b. (6 points)
More informationChap 2. Combinational Logic Circuits
Overview 2 Chap 2. Combinational Logic Circuits Spring 24 Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 Circuit Optimization Two-Level Optimization
More informationOutcomes. Spiral 1 / Unit 5. Logic Function Synthesis KARNAUGH MAPS. Karnaugh Maps
-. -. Spiral / Unit Mark Redekopp Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least technique to improve
More informationCombinational Logic Circuits Part II -Theoretical Foundations
Combinational Logic Circuits Part II -Theoretical Foundations Overview Boolean Algebra Basic Logic Operations Basic Identities Basic Principles, Properties, and Theorems Boolean Function and Representations
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part
More informationPossible logic functions of two variables
ombinational logic asic logic oolean algebra, proofs by re-writing, proofs by perfect induction logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,..., minimal set Logic realization
More informationLogic and Computer Design Fundamentals. Chapter 2 Combinational Logic Circuits. Part 1 Gate Circuits and Boolean Equations
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 28 Pearson Education, Inc. (Hperlinks are active in
More informationL4: Karnaugh diagrams, two-, and multi-level minimization. Elena Dubrova KTH / ICT / ES
L4: Karnaugh diagrams, two-, and multi-level minimization Elena Dubrova KTH / ICT / ES dubrova@kth.se Combinatorial system a(t) not(a(t)) A combinatorial system has no memory - its output depends therefore
More informationK-map Definitions. abc
K-map efinitions b a bc Implicant ny single or any group of s is called an implicant of F. ny possible grouping of s is an implicant. b a Prime Implicant implicant that cannot be combined with some other
More informationLecture 2. Notes. Notes. Notes. Boolean algebra and optimizing logic functions. BTF Electronics Fundamentals August 2014
Lecture 2 Electronics ndreas Electronics oolean algebra and optimizing logic functions TF322 - Electronics Fundamentals ugust 24 Exercise ndreas ern University of pplied Sciences Rev. 946f32 2. of oolean
More informationTextbook: Digital Design, 3 rd. Edition M. Morris Mano
: 25/5/ P-/70 Tetbook: Digital Design, 3 rd. Edition M. Morris Mano Prentice-Hall, Inc. : INSTRUCTOR : CHING-LUNG SU E-mail: kevinsu@yuntech.edu.tw Chapter 3 25/5/ P-2/70 Chapter 3 Gate-Level Minimization
More informationMC9211 Computer Organization
MC92 Computer Organization Unit : Digital Fundamentals Lesson2 : Boolean Algebra and Simplification (KSB) (MCA) (29-2/ODD) (29 - / A&B) Coverage Lesson2 Introduces the basic postulates of Boolean Algebra
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 informationOutcomes. Spiral 1 / Unit 5. Logic Function Synthesis KARNAUGH MAPS. Karnaugh Maps
-. -. Spiral / Unit Mark Redekopp Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least technique to improve
More informationExact and heuristic minimization of Boolean functions
Eact and heuristic minimization of Boolean functions Quine a McCluskey Method a) Generation of all prime implicants b) Selection of a minimum subset of prime implicants, which will represent the original
More informationBOOLEAN ALGEBRA. Introduction. 1854: Logical algebra was published by George Boole known today as Boolean Algebra
BOOLEAN ALGEBRA Introduction 1854: Logical algebra was published by George Boole known today as Boolean Algebra It s a convenient way and systematic way of expressing and analyzing the operation of logic
More informationUniversity of Technology
University of Technology Lecturer: Dr. Sinan Majid Course Title: microprocessors 4 th year معالجات دقيقة المرحلة الرابعة ھندسة الليزر والبصريات االلكترونية Lecture 3 & 4 Boolean Algebra and Logic Gates
More informationFundamentals of Boolean Algebra
UNIT-II 1 Fundamentals of Boolean Algebra Basic Postulates Postulate 1 (Definition): A Boolean algebra is a closed algebraic system containing a set K of two or more elements and the two operators and
More informationChapter 2 Boolean Algebra and Logic Gates
Ch1: Digital Systems and Binary Numbers Ch2: Ch3: Gate-Level Minimization Ch4: Combinational Logic Ch5: Synchronous Sequential Logic Ch6: Registers and Counters Switching Theory & Logic Design Prof. Adnan
More informationUnit 6. Quine-McClusky Method. Unit 6 1
Unit 6 Quine-McClusky Method Unit 6 1 Outline Determination of prime implicants The prime implicant chart Petrick s method Simplification of incompletely specified functions Unit 6 2 Overview (1/2) A systematic
More informationChapter 2. Digital Logic Basics
Chapter 2 Digital Logic Basics 1 2 Chapter 2 2 1 Implementation using NND gates: We can write the XOR logical expression B + B using double negation as B+ B = B+B = B B From this logical expression, we
More informationPrinciples of Computer Architecture. Appendix B: Reduction of Digital Logic. Chapter Contents
B-1 Principles of Computer Architecture Miles Murdocca and Vincent Heuring Appendix B: Reduction of Digital Logic B-2 Chapter Contents B.1 Reduction of Combinational Logic and Sequential Logic B.2 Reduction
More informationChapter 2 Combinational Logic Circuits
Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. Overview Part 1 Gate
More informationAdministrative Notes. Chapter 2 <9>
Administrative Notes Note: New homework instructions starting with HW03 Homework is due at the beginning of class Homework must be organized, legible (messy is not), and stapled to be graded Chapter 2
More information