Administrative Notes. Chapter 2 <9>
|
|
|
- Phillip Ellis
- 5 years ago
- Views:
Transcription
1 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 <9>
2 Some Definitions Complement: variable with a bar over it A, B, C Literal: variable or its complement A, A, B, B, C, C Implicant: product of literals ABC, AC, BC Minterm: product that includes all input variables ABC, ABC, ABC Maxterm: sum that includes all input variables (A+B+C), (A+B+C), (A+B+C) Chapter 2 <10>
3 Canonical Sum-of-Products (SOP) Form All equations can be written in SOP form Each row has a minterm A minterm is a product (AND) of literals Each minterm is TRUE for that row (and only that row) A B Y minterm A B A B A B A B minterm name m 0 m 1 m 2 m 3 Chapter 2 <11>
4 Canonical Sum-of-Products (SOP) Form All equations can be written in SOP form Each row has a minterm A minterm is a product (AND) of literals Each minterm is TRUE for that row (and only that row) Form function by ORing minterms where the output is TRUE A B Y Y = F(A, B) = minterm A B A B A B A B minterm name m 0 m 1 m 2 m 3 Chapter 2 <12>
5 Canonical Sum-of-Products (SOP) Form All equations can be written in SOP form Each row has a minterm A minterm is a product (AND) of literals Each minterm is TRUE for that row (and only that row) Form function by ORing minterms where the output is TRUE Thus, a sum (OR) of products (AND terms) A B Y minterm A B A B A B A B minterm name m 0 m 1 m 2 m 3 Y = F(A, B) = AB + AB = Σ(m 1, m 3 ) Chapter 2 <13>
6 SOP Example Steps: Find minterms that result in Y=1 Sum TRUE minterms A B Y Y = F(A, B) = Chapter 2 <14>
7 Aside: Precedence AND has precedence over OR In other words: AND is performed before OR Example: Y = A B + A B Equivalent to: Y = A B + (AB) Chapter 2 <15>
8 Canonical Product-of-Sums (POS) Form All Boolean equations can be written in POS form Each row has a maxterm A maxterm is a sum (OR) of literals Each maxterm is FALSE for that row (and only that row) A B Y maxterm A + B A + B A + B A + B maxterm name M 0 M 1 M 2 M 3 Chapter 2 <16>
9 Canonical Product-of-Sums (POS) Form All Boolean equations can be written in POS form Each row has a maxterm A maxterm is a sum (OR) of literals Each maxterm is FALSE for that row (and only that row) Form function by ANDing the maxterms for which the output is FALSE Thus, a product (AND) of sums (OR terms) A B Y maxterm A + B A + B A + B A + B maxterm name M 0 M 1 M 2 M 3 Y = M 0 M 2 = A + B (A + B) Chapter 2 <17>
10 SOP and POS Comparison Sum of Products (SOP) Implement the ones of the output Sum all one terms OR results in one Product of Sums (POS) Implement the zeros of the output Multiply zero terms AND results in zero Chapter 2 <18>
11 Boolean Equations Example You are going to the cafeteria for lunch You will eat lunch (E=1) If it s open (O=1) and If they re not serving corndogs (C=0) Write a truth table for determining if you will eat lunch (E). O C E Chapter 2 <19>
12 Boolean Equations Example You are going to the cafeteria for lunch You will eat lunch (E=1) If it s open (O=1) and If they re not serving corndogs (C=0) Write a truth table for determining if you will eat lunch (E). O C E Chapter 2 <20>
13 SOP & POS Form SOP sum-of-products O C E POS product-of-sums O C E minterm O C O C O C O C maxterm O + C O + C O + C O + C Chapter 2 <21>
14 SOP & POS Form SOP sum-of-products O C E minterm O C O C O C O C POS product-of-sums O C E maxterm O + C O + C O + C O + C Chapter 2 <22>
15 SOP & POS Form SOP sum-of-products O C E minterm O C O C O C O C E = OC = Σ(m 2 ) POS product-of-sums O C E maxterm O + C O + C O + C O + C Chapter 2 <23>
16 SOP & POS Form SOP sum-of-products O C E minterm O C O C O C O C E = OC = Σ(m 2 ) POS product-of-sums O C E maxterm O + C O + C O + C O + C E = (O + C)(O + C)(O + C) = Π(M0, M1, M3) Chapter 2 <24>
17 Boolean Algebra Axioms and theorems to simplify Boolean equations Like regular algebra, but simpler: variables have only two values (1 or 0) Duality in axioms and theorems: ANDs and ORs, 0 s and 1 s interchanged Chapter 2 <25>
18 Boolean Axioms Chapter 2 <26>
19 Duality Duality in Boolean axioms and theorems: ANDs and ORs, 0 s and 1 s interchanged Chapter 2 <27>
20 Boolean Axioms Chapter 2 <28>
21 Boolean Axioms Dual: Exchange: and + 0 and 1 Chapter 2 <29>
22 Boolean Axioms Dual: Exchange: and + 0 and 1 Chapter 2 <30>
23 Basic Boolean Theorems B = B Chapter 2 <31>
24 Basic Boolean Theorems: Duals Dual: Exchange: and + 0 and 1 Chapter 2 <32>
25 T1: Identity Theorem B 1 = B B + 0 = B Chapter 2 <33>
26 T1: Identity Theorem B 1 = B B + 0 = B B = 1 B B 0 = B Chapter 2 <34>
27 Switching Algebra Simplification of digital logic connecting wires with a on/off switch X = 0 (switch open) X = 1 (switch closed) Chapter 2 <35>
28 Series Switching Network: AND Switching circuit in series performs AND 1 is connected to 2 iff A AND B are 1 Chapter 2 <36>
29 Parallel Switching Network: OR Switching circuit in parallel performs OR 1 is connected to 2 if A OR B is 1 Chapter 2 <37>
30 T1: Identity Theorem B 1 = B B + 0 = B B = 1 B B 0 = B Chapter 2 <38>
31 T2: Null Element Theorem B 0 = 0 B + 1 = 1 Chapter 2 <39>
32 T2: Null Element Theorem B 0 = 0 B + 1 = 1 B = 0 0 B 1 = 1 Chapter 2 <40>
33 T3: Idempotency Theorem B B = B B + B = B Chapter 2 <41>
34 T3: Idempotency Theorem B B = B B + B = B B = B B B B = B Chapter 2 <42>
35 T4: Involution Theorem B = B Chapter 2 <43>
36 T4: Involution Theorem B = B 0 1 B = B Chapter 2 <44>
37 T5: Complements Theorem B B = 0 B + B = 1 Chapter 2 <45>
38 T5: Complements Theorem B B = 0 B + B = 1 B = B 0 B B = 1 Chapter 2 <46>
39 Recap: Basic Boolean Theorems Chapter 2 <47>
40 Boolean Theorems of Several Vars Number Theorem Name T6 B C = C B Commutativity T7 (B C) D = B (C D) Associativity T8 B (C + D) = (B C) + (B D) Distributivity T9 B (B+C) = B Covering T10 (B C) + (B C) = B Combining T11 B C + (B D) + (C D) = B C + B D Consensus Chapter 2 <48>
41 Boolean Theorems of Several Vars Number Theorem Name T6 B C = C B Commutativity T7 (B C) D = B (C D) Associativity T8 B (C + D) = (B C) + (B D) Distributivity T9 B (B+C) = B Covering T10 (B C) + (B C) = B Combining T11 B C + (B D) + (C D) = B C + B D Consensus How do we prove these are true? Chapter 2 <49>
42 How to Prove Boolean Relation Method 1: Perfect induction Method 2: Use other theorems and axioms to simplify the equation Make one side of the equation look like the other Chapter 2 <50>
43 Proof by Perfect Induction Also called: proof by exhaustion Check every possible input value If two expressions produce the same value for every possible input combination, the expressions are equal Chapter 2 <51>
44 Example: Proof by Perfect Induction Number Theorem Name T6 B C = C B Commutativity B C BC CB Chapter 2 <52>
45 Example: Proof by Perfect Induction Number Theorem Name T6 B C = C B Commutativity B C BC CB Chapter 2 <53>
46 Boolean Theorems of Several Vars Number Theorem Name T6 B C = C B Commutativity T7 (B C) D = B (C D) Associativity T8 B (C + D) = (B C) + (B D) Distributivity T9 B (B+C) = B Covering T10 (B C) + (B C) = B Combining T11 B C + (B D) + (C D) = B C + B D Consensus Chapter 2 <54>
47 T7: Associativity Number Theorem Name T7 (B C) D = B (C D) Associativity Chapter 2 <55>
48 T8: Distributivity Number Theorem Name T8 B (C + D) = (B C) + (B D) Distributivity Chapter 2 <56>
49 T9: Covering Number Theorem Name T9 B (B+C) = B Covering Chapter 2 <57>
50 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 <58>
51 T9: Covering Number Theorem Name T9 B (B+C) = B Covering Method 1: Perfect Induction B C (B+C) B(B+C) Chapter 2 <59>
52 T9: Covering Number Theorem Name T9 B (B+C) = B Covering Method 1: Perfect Induction B C (B+C) B(B+C) Chapter 2 <60>
53 T9: Covering Number Theorem Name T9 B (B+C) = B Covering Method 2: Prove true using other axioms and theorems. Chapter 2 <61>
54 T9: Covering Number Theorem Name T9 B (B+C) = B Covering Method 2: Prove true using other axioms and theorems. B (B+C) = B B + B C T8: Distributivity = B + B C T3: Idempotency = B (1 + C) T8: Distributivity = B (1) T2: Null element = B T1: Identity Chapter 2 <62>
55 T10: Combining Number Theorem Name T10 (B C) + (B C) = B Combining Prove true using other axioms and theorems: Chapter 2 <63>
56 T10: Combining Number Theorem Name T10 (B C) + (B C) = B Combining Prove true using other axioms and theorems: B C + B C = B (C+C) T8: Distributivity = B (1) T5 : Complements = B T1: Identity Chapter 2 <64>
57 T11: Consensus Number Theorem T11 (B C) + (B D) + (C D) = (B C) + B D Name Consensus Prove true using (1) perfect induction or (2) other axioms and theorems. Chapter 2 <65>
58 Recap: Boolean Thms of Several Vars Number Theorem Name T6 B C = C B Commutativity T7 (B C) D = B (C D) Associativity T8 B (C + D) = (B C) + (B D) Distributivity T9 B (B+C) = B Covering T10 (B C) + (B C) = B Combining T11 B C + (B D) + (C D) = B C + B D Consensus Chapter 2 <66>
59 Boolean Thms of Several Vars: Duals # Theorem Dual Name T6 B C = C B B+C = C+B Commutativity T7 (B C) D = B (C D) (B + C) + D = B + (C + D) Associativity T8 B (C + D) = (B C) + (B D) B + (C D) = (B+C) (B+D) Distributivity T9 B (B+C) = B B + (B C) = B Covering T10 (B C) + (B C) = B (B+C) (B+C) = B Combining T11 (B C) + (B D) + (C D) = (B C) + (B D) (B+C) (B+D) (C+D) = (B+C) (B+D) Dual: Replace: with + 0 with 1 Consensus Chapter 2 <67>
60 Boolean Thms of Several Vars: Duals # Theorem Dual Name T6 B C = C B B+C = C+B Commutativity T7 (B C) D = B (C D) (B + C) + D = B + (C + D) Associativity T8 B (C + D) = (B C) + (B D) B + (C D) = (B+C) (B+D) Distributivity T9 B (B+C) = B B + (B C) = B Covering T10 (B C) + (B C) = B (B+C) (B+C) = B Combining T11 (B C) + (B D) + (C D) = (B C) + (B D) (B+C) (B+D) (C+D) = (B+C) (B+D) Consensus Dual: Replace: with + 0 with 1 Warning: T8 differs from traditional algebra: OR (+) distributes over AND ( ) Chapter 2 <68>
61 Boolean Thms of Several Vars: Duals # Theorem Dual Name T6 B C = C B B+C = C+B Commutativity T7 (B C) D = B (C D) (B + C) + D = B + (C + D) Associativity T8 B (C + D) = (B C) + (B D) B + (C D) = (B+C) (B+D) Distributivity T9 B (B+C) = B B + (B C) = B Covering T10 (B C) + (B C) = B (B+C) (B+C) = B Combining T11 (B C) + (B D) + (C D) = (B C) + (B D) (B+C) (B+D) (C+D) = (B+C) (B+D) Consensus Axioms and theorems are useful for simplifying equations. Chapter 2 <69>
CPE100: 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
CPE100: 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
T9: 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)
CHAPTER 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.
Combinational 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
CHAPTER 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.
This 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
Slides for Lecture 10
Slides for Lecture 10 ENEL 353: Digital Circuits Fall 2013 Term Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary 30 September, 2013 ENEL 353
ENGR 303 Introduction to Logic Design Lecture 3. Dr. Chuck Brown Engineering and Computer Information Science Folsom Lake College
Introduction to Logic Design Lecture 3 Dr. Chuck rown Engineering and Computer Information Science Folsom Lake College Outline for Todays Lecture Logic Circuits SOP / POS oolean Theorems DeMorgan s Theorem
Digital Logic Design. Malik Najmus Siraj
Digital Logic Design Malik Najmus Siraj siraj@case.edu.pkedu LECTURE 4 Today s Agenda Recap 2 s complement Binary Logic Boolean algebra Recap Computer Arithmetic Signed numbers Radix and diminished radix
Slide 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
Unit 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
ECE 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
Chapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.
Boolean Expression Forms: Sum-of-products (SOP) Write an AND term for each input combination that produces a 1 output. Write the input variable if its value is 1; write its complement otherwise. OR the
ECE 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
Chapter 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. (Hyperlinks are active
EECS150 - 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
ELCT201: 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
Chapter 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
Digital Circuit And Logic Design I. Lecture 3
Digital Circuit And Logic Design I Lecture 3 Outline Combinational Logic Design Principles (). Introduction 2. Switching algebra 3. Combinational-circuit analysis 4. Combinational-circuit synthesis Panupong
Advanced 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
CHAPTER 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,
Digital Logic & Computer Design CS Professor Dan Moldovan Spring Copyright 2007 Elsevier 2-<101>
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer Architecture David Money Harris and
Midterm1 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
CS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions
Combinational Logic Design Principles
Combinational Logic Design Principles Switching algebra Doru Todinca Department of Computers Politehnica University of Timisoara Outline Introduction Switching algebra Axioms of switching algebra Theorems
Number 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
Combinational 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
Digital Design 2. Logic Gates and Boolean Algebra
Digital Design 2. Logic Gates and oolean lgebra József Sütő ssistant Lecturer References: [1] D.M. Harris, S.L. Harris, Digital Design and Computer rchitecture, 2nd ed., Elsevier, 213. [2] T.L. Floyd,
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
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
Lecture 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
211: 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
ECEN 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
Simplification 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,
Ch 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:
ENG2410 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
CS 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
Chapter-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.
Functions. 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)
Standard 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
Lecture 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
Logic 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
Chapter 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
Logic 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
Chapter 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
Computer Organization I
Computer Organization I Lecture 6: Boolean Algebra /2/29 Wei Lu CS283 Overview Two Principles in Boolean Algebra () Duality Principle (2) Complement Principle Standard Form of Logic Expression () Sum of
II. 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
Lecture 2 Review on Digital Logic (Part 1)
Lecture 2 Review on Digital Logic (Part 1) Xuan Silvia Zhang Washington University in St. Louis http://classes.engineering.wustl.edu/ese461/ Grading Engagement 5% Review Quiz 10% Homework 10% Labs 40%
Digital Logic & Computer Design CS Professor Dan Moldovan Spring 2010
Digital Logic & Computer Design CS 434 Professor Dan Moldovan Spring 2 Copyright 27 Elsevier 2- Chapter 2 :: Combinational Logic Design Digital Design and Computer rchitecture David Money Harris and
Chapter 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
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) January 30, 2003 John Wawrzynek Outline Review of three representations for combinational logic:
Chapter 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
EECS Variable Logic Functions
EECS150 Section 1 Introduction to Combinational Logic Fall 2001 2-Variable Logic Functions There are 16 possible functions of 2 input variables: in general, there are 2**(2**n) functions of n inputs X
Combinational logic. Possible logic functions of two variables. Minimal set of functions. Cost of different logic functions.
Combinational logic Possible logic functions of two variables Logic functions, truth tables, and switches NOT, ND, OR, NND, NOR, OR,... Minimal set xioms and theorems of oolean algebra Proofs by re-writing
Lab 1 starts this week: go to your session
Lecture 3: Boolean Algebra Logistics Class email sign up Homework 1 due on Wednesday Lab 1 starts this week: go to your session Last lecture --- Numbers Binary numbers Base conversion Number systems for
UNIT 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
UNIT 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
Lecture 4: More Boolean Algebra
Lecture 4: More Boolean Algebra Syed M. Mahmud, Ph.D ECE Department Wayne State University Original Source: Prof. Russell Tessier of University of Massachusetts Aby George of Wayne State University ENGIN2
Chapter 2: Boolean Algebra and Logic Gates
Chapter 2: Boolean Algebra and Logic Gates Mathematical methods that simplify binary logics or circuits rely primarily on Boolean algebra. Boolean algebra: a set of elements, a set of operators, and a
Combinational 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
Learning 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
Chapter 2 Combinational
Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations HOANG Trang Reference: 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean
2009 Spring CS211 Digital Systems & Lab CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS
CHAPTER 2: INTRODUCTION TO LOGIC CIRCUITS What will we learn? 2 Logic functions and circuits Boolean Algebra Logic gates and Synthesis CAD tools and VHDL Read Section 2.9 and 2.0 Terminology 3 Digital
Digital Logic Design ABC. Representing Logic Operations. Dr. Kenneth Wong. Determining output level from a diagram. Laws of Boolean Algebra
Digital Logic Design ENGG1015 1 st Semester, 2011 Representing Logic Operations Each function can be represented equivalently in 3 ways: Truth table Boolean logic expression Schematics Truth Table Dr.
BOOLEAN ALGEBRA CLASS XII. Presented By : Dinesh Patel PGT CS KV IIT Powai
BOOLEAN ALGEBRA CLASS II Presented By : Dinesh Patel PGT CS KV IIT Powai Introduction Boolean Algebra is a set of rules and regulation which is suitable for Digital Circuits, whose answer is either True
Chapter 2 : Boolean Algebra and Logic Gates
Chapter 2 : Boolean Algebra and Logic Gates By Electrical Engineering Department College of Engineering King Saud University 1431-1432 2.1. Basic Definitions 2.2. Basic Theorems and Properties of Boolean
Chapter 2. Introduction. Chapter 2 :: Topics. Circuits. Nodes. Circuit elements. Introduction
hapter 2 Introduction igital esign and omputer rchitecture, 2 nd Edition avid Money Harris and Sarah L. Harris logic circuit is composed of: Inputs Outputs Functional specification Timing specification
Karnaugh 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.
Unit 2 Boolean Algebra
Unit 2 Boolean Algebra 2.1 Introduction We will use variables like x or y to represent inputs and outputs (I/O) of a switching circuit. Since most switching circuits are 2 state devices (having only 2
EEE130 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
Lecture A: Logic Design and Gates
Lecture A: Logic Design and Gates Syllabus My office hours 9.15-10.35am T,Th or gchoi@ece.tamu.edu 333G WERC Text: Brown and Vranesic Fundamentals of Digital Logic,» Buy it.. Or borrow it» Other book:
Chap 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
Goals 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/
Minimization 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
Boolean 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
CHAPTER 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
Combinatorial 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
MC9211 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
Week-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
Signals and Systems Digital Logic System
Signals and Systems Digital Logic System Prof. Wonhee Kim Chapter 2 Design Process for Combinational Systems Step 1: Represent each of the inputs and outputs in binary Step 1.5: If necessary, break the
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
L2: Combinational Logic Design (Construction and Boolean Algebra)
L2: Combinational Logic Design (Construction and Boolean Algebra) Acknowledgements: Lecture material adapted from Chapter 2 of R. Katz, G. Borriello, Contemporary Logic Design (second edition), Pearson
Digital 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
Possible 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
ELEC Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2)
ELEC 2200-002 Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2) Vishwani D. Agrawal James J. Danaher Professor Department of Electrical and Computer Engineering Auburn University, Auburn, AL
Review. 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
WEEK 2.1 BOOLEAN ALGEBRA
WEEK 2.1 BOOLEAN ALGEBRA 1 Boolean Algebra Boolean algebra was introduced in 1854 by George Boole and in 1938 was shown by C. E. Shannon to be useful for manipulating Boolean logic functions. The postulates
2 Application of Boolean Algebra Theorems (15 Points - graded for completion only)
CSE140 HW1 Solution (100 Points) 1 Introduction The purpose of this assignment is three-fold. First, it aims to help you practice the application of Boolean Algebra theorems to transform and reduce Boolean
Switches: basic element of physical implementations
Combinational logic Switches Basic logic and truth tables Logic functions Boolean algebra Proofs by re-writing and by perfect induction Winter 200 CSE370 - II - Boolean Algebra Switches: basic element
CSE140: Components and Design Techniques for Digital Systems. Introduction. Instructor: Mohsen Imani
CSE4: Components and Design Techniques for Digital Systems Introduction Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic Rosing & Dr.Pietro Mercati Welcome to CSE 4! Instructor: Mohsen Imani Email:
Chapter 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
Karnaugh 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
Combinational Logic. Fan-in/ Fan-out Timing. Copyright (c) 2012 Sean Key
Combinational Logic Fan-in/ Fan-out Timing Copyright (c) 2012 Sean Key Fan-in & Fan-out Fan-in The number of inputs to a logic gate Higher fan-in can lead to longer gate delays because of the higher input
Introduction to Digital Logic Missouri S&T University CPE 2210 Boolean Representations
Introduction to Digital Logic Missouri S&T University CPE 2210 Egemen K. Çetinkaya Egemen K. Çetinkaya Department of Electrical & Computer Engineering Missouri University of Science and Technology cetinkayae@mst.edu
Computer 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
Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.
The Laws of Boolean Boolean algebra As well as the logic symbols 0 and 1 being used to represent a digital input or output, we can also use them as constants for a permanently Open or Closed circuit or
If 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
E&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