SYEN 3330 Digital Systems Chapter 2 Part 3 SYEN 3330 Digital Systems.

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

Logical Systems Synthesis.
Chapter 2 Logic Circuits.
Morgan Kaufmann Publishers
Boolean Algebra and Logic Gates 1 Computer Engineering (Logic Circuits) Lec. # 4 Dr. Tamer Samy Gaafar Dept. of Computer & Systems Engineering Faculty.
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 Part 3.
Chapter 2 – Combinational Logic Circuits Part 1 – Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals.
EE365 Boolean algebra Combinational-circuit analysis.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
1 COMP541 Combinational Logic Montek Singh Jan 16, 2007.
1 COMP541 Combinational Logic - II Montek Singh Aug 27, 2014.
28/06/041 CSE-221 Digital Logic Design (DLD) Lecture-5: Canonical and Standard forms and Integrated Circuites.
Combinational Digital Circuits. Measurement Our world is an analog world. Measurements that we make of the physical objects around us are never in discrete.
Chapter 2: Boolean Algebra and Logic Functions
Logic Design CS221 1 st Term Boolean Algebra Cairo University Faculty of Computers and Information.
Switching functions The postulates and sets of Boolean logic are presented in generic terms without the elements of K being specified In EE we need to.
1 Representation of Logic Circuits EE 208 – Logic Design Chapter 2 Sohaib Majzoub.
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
Combinational Logic 1.
Overview Part 1 – Gate Circuits and Boolean Equations
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 6 – Canonical Forms.
1 Boolean Algebra  Digital circuits Digital circuits  Boolean Algebra Boolean Algebra  Two-Valued Boolean Algebra Two-Valued Boolean Algebra  Boolean.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
ece Parity Used to check for errors Can be either ODD or EVEN Left most bit used as the indicator For EVEN, insert a 0 or a 1 so as to make the.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
A. Abhari CPS2131 Chapter 2: Boolean Algebra and Logic Gates Topics in this Chapter: Boolean Algebra Boolean Functions Boolean Function Simplification.
Module –I Switching Function
Fundamentals of digital electronics Prepared by - Anuradha Tandon Assistant Professor, Instrumentation & Control Engineering Branch, IT, NU.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
1 COMP541 Combinational Logic - II Montek Singh Jan 18, 2012.
Binary Logic and Gates Boolean Algebra Canonical and Standard Forms Chapter 2: Boolean Algebra and Logic Gates.
ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 Part 3 Tom Kaminski & Charles.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
Logic Design (CE1111 ) Lecture 2 (Chapter 2) Prepared by Dr. Lamiaa Elshenawy 1.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
Digital Logic & Design Dr. Waseem Ikram Lecture 09.
CHAPTER 2 Boolean algebra and Logic gates
Canonical Forms BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Boolean Algebra and Logic Gates COE 202 Digital Logic Design Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals.
Chapter 2: Boolean Algebra and Logic Functions
CS Chapter 3 (3A and ) Part 1 of 8
Overview Part 1 – Gate Circuits and Boolean Equations
ECE 2110: Introduction to Digital Systems
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture)
CS 105 Digital Logic Design
ECE 3110: Introduction to Digital Systems
Complement of a Function
ECE/CS 352 Digital Systems Fundamentals
Princess Sumaya University
CS Chapter 3 (3A and ) Part 1 of 8
TN 221: DIGITAL ELECTRONICS 1
Karnaugh Maps.
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
17-Nov-18 Logic Algebra 1 Combinational logic.
Boolean Algebra.
Chapter 2 Boolean Algebra and Logic Gate
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
CSE 370 – Winter Combinational Logic - 1
SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems.
Dr. Clincy Professor of CS
Functions Computers take inputs and produce outputs, just like functions in math! Mathematical functions can be expressed in two ways: We can represent.
COMP541 Combinational Logic - II
Chapter 2 Introduction to Logic Circuits
EE121 John Wakerly Lecture #3
Analysis of Logic Circuits Example 1
Analysis of Logic Circuits Example 1
Presentation transcript:

SYEN 3330 Digital Systems Chapter 2 Part 3 SYEN 3330 Digital Systems

Boolean Operator Precedence SYEN 3330 Digital Systems

Review: Duality Principle SYEN 3330 Digital Systems

Duality In Proofs SYEN 3330 Digital Systems

Useful Theorems SYEN 3330 Digital Systems

Proof of Simplification SYEN 3330 Digital Systems

Proof of Concensus SYEN 3330 Digital Systems

Proof of DeMorgan’s Law SYEN 3330 Digital Systems

Boolean Function Evaluation SYEN 3330 Digital Systems

Expression Simplification Simplify to contain the smallest number of literals (complemented and uncomplemented variables): SYEN 3330 Digital Systems

Complementing Functions This generate a lot of terms. You might want to simplify the expression first. SYEN 3330 Digital Systems

Canonical Forms It is useful to specify Boolean functions of n variables in a manner that is easy to compare. Two such Canonical Forms are in common usage: Sum of Minterms Product of Maxterms SYEN 3330 Digital Systems

Minterms SYEN 3330 Digital Systems

Maxterms SYEN 3330 Digital Systems

Maxterms and Minterms The index above is important for describing which variables in the terms are true and which are complemented. SYEN 3330 Digital Systems

Standard Order SYEN 3330 Digital Systems

Purpose of the Index The index for the minterm or maxterm, expressed as a binary number, is used to determine whether the variable is shown in the true form or complemented form. SYEN 3330 Digital Systems

Index Example in Three Variables SYEN 3330 Digital Systems

Four Variables, Index 0-7 SYEN 3330 Digital Systems

Four Variables, Index 8-15 SYEN 3330 Digital Systems

Minterm and Maxterm Relationship Review: DeMorgan's Theorem (x · y) = ( ` x + y) and (x + y) = ( x y ) Note: For 2 variables: M 2 = ( + y) and m = (x y ) Thus M is the complement of m and vice - versa. Since DeMorgan's Theorem can be extended to n variables, this holds that for terms of variables giving : Mi and mi are complements. SYEN 3330 Digital Systems

Function Tables for Both Minterms of two variables Maxterms of two variables SYEN 3330 Digital Systems

Observations SYEN 3330 Digital Systems

Minterm Function Example SYEN 3330 Digital Systems

Minterm Function Example F(A, B, C, D, E) = m2 + m9 + m17 + m23 SYEN 3330 Digital Systems

Maxterm Function Example SYEN 3330 Digital Systems

Maxterm Function Example SYEN 3330 Digital Systems

Cannonical Sum of Minterms SYEN 3330 Digital Systems

Another SOM Example SYEN 3330 Digital Systems

Shorthand SOM Form Note that we explicitly show the standard variables in order and drop the “m” designators. SYEN 3330 Digital Systems

Canonical Product of Maxterms SYEN 3330 Digital Systems

Product of Maxterm Example SYEN 3330 Digital Systems

Function Complements Then: Or alternately: SYEN 3330 Digital Systems

Conversion Between Forms SYEN 3330 Digital Systems

Review of Canonical Forms SYEN 3330 Digital Systems

Review: Indices SYEN 3330 Digital Systems

Forms of Terms, Complements SYEN 3330 Digital Systems

Review: Sum of Minterms Form SYEN 3330 Digital Systems

Review: Product of Maxterms SYEN 3330 Digital Systems

Review: Complements, Conversions SYEN 3330 Digital Systems