COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 1 of 12
|
|
- Melvyn Knight
- 5 years ago
- Views:
Transcription
1 COM111 Introduction to Computer Engineering (Fall ) 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 orderly method for optaining the minimal sum. Literal A variable or the complement of a variable. Examples: A, B', C', D Normal Product Term A product term in which no variable appears more than once. Examples: ABC, AB'C', A'B'C' Counter Examples: AA'BC, AB'B'C', ABCC n-variable Minterm A normal product term with n literals. There are 2 n such terms. Example: A B 0 0 A'B' 0 1 A'B 1 0 AB' 1 1 AB Each of the product terms corresponding to a row in the truth table is a minterm. Minimal Sum Implicant A sum of products (SOP) expression such that no SOP expression for Y has fewer product terms and any SOP expression with the same number of product terms has at least as many literals. This is what we are trying to produce through the use of Karnaugh maps. A normal product term that implies Y. Example: For the function Y = AB + ABC + BC, the implicants are AB, ABC, and BC because if any one of those terms are true, then Y is true. Prime Implicant An implicant of Y such that if any variable is removed from the implicant, the resulting term does not imply Y. Example: Y = AB + ABC + BC Prime Implicants: AB, BC Not a prime implicant: ABC ABC is not a prime implicant because the literal A can be removed to give BC and BC still implies Y. Conversely AB is not a prime implicant because you can't remove either A or B and have the remaining term still imply Y. In truth tables the prime implicants are represented by the largest rectangular groups of ones that can be circled. If a smaller subgroup is circled, the smaller group is an implicant, but not a prime implicant. PI Theorem A minimal sum is a sum of prime implicants. Distinguished 1-Cell An input combination that is covered by 1 prime implicant. In terms of Karnaugh maps, distinguished 1-cells are 1's that are circled by only 1 prime implicant.
2 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 2 of 12 Essential Prime Implicant A prime implicant that that includes one or more distinguished one cells. Essential prime implicants are important because a minimal sum contains all essential prime implicants. Karnaugh Map Examples In the following examples the distinguished 1-cells are marked in the upper left corner of the cell with an asterisk (*). The essential prime implicants are circled in blue, the prime implicants are circled in black, and the non-essential prime implicants included in the minimal sum are shown in red. Example 1 Prime Implicants: 5 Distinguished 1-Cells: 2 Essential Prime Implicants: 2 Minimal Sums: 1
3 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 3 of 12 Y = A'CD' + AC'D + BCD Example 2 Prime Implicants: 7 Distinguished 1-Cells: 2 Essential Prime Implicants: 2 Minimal Sums: 1 Y = B'D' + AD' + A'C'D + BCD
4 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 4 of 12 Example 3 Prime Implicants: 6 Distinguished 1-Cells: 2 Essential Prime Implicants: 2 Minimal Sums: 3 Y = AB'C' + A'CD' + AC'D + BCD Y = AB'C' + A'CD' + ABD + A'BC
5 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 5 of 12 Y = AB'C' + A'CD' + ABD + BCD Example 4 Prime Implicants: 5 Distinguished 1-Cells: 3 Essential Prime Implicants: 3 Minimal Sums: 1 Y = A'B' + A'C' + ABC + A'D Example 5 Prime Implicants: 4 Distinguished 1-Cells: 4 Essential Prime Implicants: 4 Minimal Sums: 1
6 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 6 of 12 Y = A'C + A'B + BD + CD Example 6 Prime Implicants: 5 Distinguished 1-Cells: 3 Essential Prime Implicants: 3 Minimal Sums: 1 Y = B'D + BC' + AB Example 7 Prime Implicants: 8 Distinguished 1-Cells: 0 Essential Prime Implicants: 0 Minimal Sums: 2
7 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 7 of 12 Y = A'B'C + A'BD + ABC' + AB'D' Y = B'CD' + A'CD + BC'D + AC'D' Example 8 Prime Implicants: 3 Distinguished 1-Cells: 8 Essential Prime Implicants: 3 Minimal Sums: 1
8 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 8 of 12 Y = B'C + D + BC' 5-Variable Karnaugh Maps For these you must circle the prime implicants on each map individually and then the prime implicants on the joint map. The joint essential prime implicants are shown in green. Prime Implicants: 7 Distinguished 1-Cells: 7 Essential Prime Implicants: 4 Minimal Sums: 2 Y = A'B'C' + BE + ABC' + ACE + A'DE
9 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 9 of 12 Y = A'B'C' + BE + ABC' + ACE + CDE Note that the joint map can help you identify the joint prime implicants.
10 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 10 of 12 6-Variable Karnaugh Maps The prime implicants unique to each map are shown in black. The prime implicants shared between maps 0 and 1 (A=0) are shown in aqua. The prime implicants shared between maps 0 and 2 (B=0) are shown in violet. The prime implicants shared between maps 1 and 3 (B=1) are shown in olive. The prime implicants shared between maps 2 and 3 (A=1) are shown in brown. The prime implicants shared between all 4 maps are shown in orange. To find the prime implicants shared among maps it may help to draw out each of the 5 joint maps. Distinguished 1-Cells: 10 Essential Prime Implicants: 5 Minimal Sums: 2 Essential Prime Implicants
11 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 11 of 12 A'EF (Maps 0 & 1) BCD' (Maps 1 & 3) B'D'F' (Maps 0 & 2) ACE' (Maps 2 & 3) ABDE' (Map 3) Y = A'EF + BCD' + B'D'F' + ACE' + ABDE' + B'DE'F + A'B'C'F
12 COM111 Introduction to Computer Engineering (Fall ) NOTES 6 -- page 12 of 12 Y = A'EF + BCD' + B'D'F' + ACE' + ABDE' + B'DE'F + A'B'C'D'
Lecture 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationCHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES This chapter in the book includes: Objectives Study Guide 7.1 Multi-Level Gate Circuits 7.2 NAND and NOR Gates 7.3 Design of Two-Level Circuits Using
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 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 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 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 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 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 informationComputer Organization I. Lecture 13: Design of Combinational Logic Circuits
Computer Organization I Lecture 13: Design of Combinational Logic Circuits Overview The optimization of multiple-level circuits Mapping Technology Verification Objectives To know how to optimize the multiple-level
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 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 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 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 informationLecture (02) NAND and NOR Gates
Lecture (02) NAND and NOR Gates By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 2018, CSE303 Logic design II NAND gates and NOR gates In this section we will define NAND and NOR gates. Logic
More informationThe One-Quarter Fraction
The One-Quarter Fraction ST 516 Need two generating relations. E.g. a 2 6 2 design, with generating relations I = ABCE and I = BCDF. Product of these is ADEF. Complete defining relation is I = ABCE = BCDF
More informationUNIT 3 BOOLEAN ALGEBRA (CONT D)
UNIT 3 BOOLEAN ALGEBRA (CONT D) Spring 2011 Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic
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 informationBoolean Algebra and Digital Logic 2009, University of Colombo School of Computing
IT 204 Section 3.0 Boolean Algebra and Digital Logic Boolean Algebra 2 Logic Equations to Truth Tables X = A. B + A. B + AB A B X 0 0 0 0 3 Sum of Products The OR operation performed on the products of
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 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 informationMultilevel Logic Synthesis Algebraic Methods
Multilevel Logic Synthesis Algebraic Methods Logic Circuits Design Seminars WS2010/2011, Lecture 6 Ing. Petr Fišer, Ph.D. Department of Digital Design Faculty of Information Technology Czech Technical
More informationKarnaugh Maps ف ر آ ا د : ا ا ب ا م آ ه ا ن ر ا
Karnaugh Maps مخطط آارنوف اعداد:محمد اسماعيل آلية علوم الحاسوب جامعة امدرمان الاهلية الاهداء الي آل من يسلك طريق العلم والمعرفة في هذا المجال Venn Diagrams Venn diagram to represent the space of minterms.
More informationBoolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE
Boolean Algebra and Logic Design (Class 2.2 1/24/2013) CSE 2441 Introduction to Digital Logic Spring 2013 Instructor Bill Carroll, Professor of CSE Today s Topics Boolean algebra applications in logic
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 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 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 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 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 informationReduction of Logic Equations using Karnaugh Maps
Reduction of Logic Equations using Karnaugh Maps The design of the voting machine resulted in a final logic equation that was: z = (a*c) + (a*c) + (a*b) + (a*b*c) However, a simple examination of this
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 informationECE 2300 Digital Logic & Computer Organization
ECE 23 Digital Logic & Computer Organization Spring 28 Combinational Building Blocks Lecture 5: Announcements Lab 2 prelab due tomorrow HW due Friday HW 2 to be posted on Thursday Lecture 4 to be replayed
More informationFractional Replications
Chapter 11 Fractional Replications Consider the set up of complete factorial experiment, say k. If there are four factors, then the total number of plots needed to conduct the experiment is 4 = 1. When
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 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 informationAdvanced Boolean Logic and Applications to Control Systems
Advanced Boolean Logic and Applications to Control Systems Course No: E0-0 Credit: PDH Jeffrey Cwalinski, P.E. Continuing Education and Development, Inc. 9 Greyridge Farm Court Stony Point, NY 0980 P:
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 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 informationChapter 7 Logic Circuits
Chapter 7 Logic Circuits Goal. Advantages of digital technology compared to analog technology. 2. Terminology of Digital Circuits. 3. Convert Numbers between Decimal, Binary and Other forms. 5. Binary
More information23. Fractional factorials - introduction
173 3. Fractional factorials - introduction Consider a 5 factorial. Even without replicates, there are 5 = 3 obs ns required to estimate the effects - 5 main effects, 10 two factor interactions, 10 three
More informationPI = { a.b.c, ac d, b cd, ab d, bd} cd
Digital Logic Design: Principles and Practices ELG5195 (EACJ5705 ), Carleton CRN: 18371 Assignment #1 Question 1: a) Using iterated consensus find all the prime implicants of the following function: F(
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 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 informationST3232: Design and Analysis of Experiments
Department of Statistics & Applied Probability 2:00-4:00 pm, Monday, April 8, 2013 Lecture 21: Fractional 2 p factorial designs The general principles A full 2 p factorial experiment might not be efficient
More informationChapter 3. Boolean Algebra. (continued)
Chapter 3. Boolean Algebra (continued) Algebraic structure consisting of: set of elements B binary operations {+, -} unary operation {'} Boolean Algebra such that the following axioms hold:. B contains
More informationCHAPTER 7. Solutions for Exercises
CHAPTER 7 Solutions for Exercises E7.1 (a) For the whole part we have: Quotient Remainders 23/2 11 1 11/2 5 1 5/2 2 1 2/2 1 0 1/2 0 1 Reading the remainders in reverse order we obtain: 23 10 = 10111 2
More informationChapter 4 BOOLEAN ALGEBRA AND THEOREMS, MINI TERMS AND MAX TERMS
Chapter 4 BOOLEAN ALGEBRA AND THEOREMS, MINI TERMS AND MAX TERMS Lesson 4 BOOLEAN EXPRESSION, TRUTH TABLE and SUM OF THE PRODUCTS (SOPs) [MINITERMS] 2 Outline SOP two variables cases SOP for three variable
More informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris Combinational Logic Design Chapter
More informationCHAPTER 7. Exercises 17/ / /2 2 0
CHAPTER 7 Exercises E7. (a) For the whole part, we have: Quotient Remainders 23/2 /2 5 5/2 2 2/2 0 /2 0 Reading the remainders in reverse order, we obtain: 23 0 = 0 2 For the fractional part we have 2
More informationCDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012
CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Combinational Logic Design Using a Truth Table Minterm and Maxterm Expansions General Minterm and
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 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 informationConstruction of Mixed-Level Orthogonal Arrays for Testing in Digital Marketing
Construction of Mixed-Level Orthogonal Arrays for Testing in Digital Marketing Vladimir Brayman Webtrends October 19, 2012 Advantages of Conducting Designed Experiments in Digital Marketing Availability
More informationDesign theory for relational databases
Design theory for relational databases 1. Consider a relation with schema R(A,B,C,D) and FD s AB C, C D and D A. a. What are all the nontrivial FD s that follow from the given FD s? You should restrict
More informationLecture 5. Karnaugh-Map
Lecture 5 - Lecture 5 Karnaugh-Map Lecture 5-2 Karnaugh-Map Set Logic Venn Diagram K-map Lecture 5-3 K-Map for 2 Variables Lecture 5-4 K-Map for 3 Variables C C C Lecture 5-5 Logic Expression, Truth Table,
More informationT02 Tutorial Slides for Week 6
T02 Tutorial Slides for Week 6 ENEL 353: Digital Circuits Fall 2017 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 17 October, 2017
More informationFractional Factorial Designs
Fractional Factorial Designs ST 516 Each replicate of a 2 k design requires 2 k runs. E.g. 64 runs for k = 6, or 1024 runs for k = 10. When this is infeasible, we use a fraction of the runs. As a result,
More informationGeometry Problem Solving Drill 08: Congruent Triangles
Geometry Problem Solving Drill 08: Congruent Triangles Question No. 1 of 10 Question 1. The following triangles are congruent. What is the value of x? Question #01 (A) 13.33 (B) 10 (C) 31 (D) 18 You set
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 informationChapter 4 Optimized Implementation of Logic Functions
Chapter 4 Optimized Implementation of Logic Functions Logic Minimization Karnaugh Maps Systematic Approach for Logic Minimization Minimization of Incompletely Specified Functions Tabular Method for Minimization
More informationThe hypergeometric distribution - theoretical basic for the deviation between replicates in one germination test?
Doubt is the beginning, not the end, of wisdom. ANONYMOUS The hypergeometric distribution - theoretical basic for the deviation between replicates in one germination test? Winfried Jackisch 7 th ISTA Seminar
More informationT9: Covering. Prove true by: Method 1: Perfect induction Method 2: Using other theorems and axioms. Number Theorem. T9 B (B+C) = B Covering
T9: Covering Number Theorem Name T9 B (B+C) = B Covering Prove true by: Method 1: Perfect induction Method 2: Using other theorems and axioms Chapter 2 T9: Covering Number Theorem Name T9 B (B+C)
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 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 informationREPRESENTATION AND MINIMIZATION OF BOOLEAN FUNCTIONS. Part II Minimization of Boolean Functions.
Bulletin of the Marathwada Mathematical Society Vol.5, No.1, June 2004, Pages 35-44 REPRESENTATION AND MINIMIZATION OF BOOLEAN FUNCTIONS. Part II Minimization of Boolean Functions. S.R. Joshi 3, Accharya
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 informationSlides for Lecture 16
Slides for Lecture 6 ENEL 353: Digital Circuits Fall 203 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 6 October, 203 ENEL 353 F3 Section
More informationLecture 12: Feb 16, 2017
CS 6170 Computational Topology: Topological Data Analysis Spring 2017 Lecture 12: Feb 16, 2017 Lecturer: Prof Bei Wang University of Utah School of Computing Scribe: Waiming Tai This
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 information19. Blocking & confounding
146 19. Blocking & confounding Importance of blocking to control nuisance factors - day of week, batch of raw material, etc. Complete Blocks. This is the easy case. Suppose we run a 2 2 factorial experiment,
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 informationCPE100: Digital Logic Design I
Chapter 2 Professor Brendan Morris, SEB 326, brendan.morris@unlv.edu http://www.ee.unlv.edu/~bmorris/cpe/ CPE: Digital Logic Design I Section 4: Dr. Morris Combinational Logic Design Chapter 2 Chapter
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 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 information1. Expand each of the following functions into a canonical sum-of-products expression.
CHAPTER 4 PROLEMS 1. Expand each of the following functions into a canonical sum-of-products expression. (a) F(x, y, z) = xy + y z + x (b) F(w, x, y, z) = x y + wxy + w yz (c) F(A,,C,D) = AC + CD + C D
More informationSuppose we needed four batches of formaldehyde, and coulddoonly4runsperbatch. Thisisthena2 4 factorial in 2 2 blocks.
58 2. 2 factorials in 2 blocks Suppose we needed four batches of formaldehyde, and coulddoonly4runsperbatch. Thisisthena2 4 factorial in 2 2 blocks. Some more algebra: If two effects are confounded with
More informationSolutions to Assignment No 5 Digital Techniques Fall 2007
Solutions to Assignment No 5 Digital Techniques Fall 2007 André Deutz October 19, 2007 1 Simplifying and Manipulating Boolean Expressions 1. Simplification (a) Simplify each of the following expressions,
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 informationPart 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...
Part 1: Digital Logic and Gates Analog vs Digital waveforms An analog signal assumes a continuous range of values: v(t) ANALOG A digital signal assumes discrete (isolated, separate) values Usually there
More informationChapter 11: Factorial Designs
Chapter : Factorial Designs. Two factor factorial designs ( levels factors ) This situation is similar to the randomized block design from the previous chapter. However, in addition to the effects within
More informationUnit 3 Session - 9 Data-Processing Circuits
Objectives Unit 3 Session - 9 Data-Processing Design of multiplexer circuits Discuss multiplexer applications Realization of higher order multiplexers using lower orders (multiplexer trees) Introduction
More information