Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

Slides:

Advertisements

Similar presentations

Boolean Algebra and Logic Gates

Advertisements

BOOLEAN ALGEBRA. A Mathematical notation used to represent the function of the Digital circuit. A notation that allows variables & constants to have only.

Combinational Logic Circuits Chapter 2 Mano and Kime.

Morgan Kaufmann Publishers

Logical Systems Synthesis.

Chapter 2 Logic Circuits.

Prof. YingLi Tian Sept. 10, 2012 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) Lecture 4: Implementation.

ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.

ECE 331 – Digital System Design

Gate-Level Minimization. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.

Basic Digital Design Discussion D5.4 Section 13.6.

Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.

CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.

Boolean Algebra and Logic Gates

Basic Digital Design Discussion D5.4 Appendix F. Basic Digital Design Sum-of-Products Design Product-of-Sums Design.

COMBINATIONAL LOGIC CIRCUITS C.L. x1 x2 xn Z Z = F (x1, x2, ……., Xn) F is a Binary Logic (BOOLEAN ) Function Knowing F Allows Straight Forward Direct Implementation.

Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.

ECE 301 – Digital Electronics Boolean Algebra and Standard Forms of Boolean Expressions (Lecture #4) The slides included herein were taken from the materials.

CSCE 211: Digital Logic Design

Combinational Logic Circuits Chapter 2 Mano and Kime.

Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.

Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.

Chapter 2: Boolean Algebra and Logic Functions

طراحی مدارهای منطقی نیمسال دوم دانشگاه آزاد اسلامی واحد پرند.

CHAPTER 2 Boolean Algebra

1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.

©2004 Brooks/Cole FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter in.

+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 2.

CE1110 :Digital Logic Design lecture 02 Digital Logic Gates Dr. Atef Ali Ibrahim 1.

Boolean Algebra Introduction Logical arguments are valid (or not) by virtue of their form, not content Example All men are mortal(premise 1) Harry is a.

NAND and NOR Gates ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

Boolean Algebra AND gate A B | AB 0 0 | | | | 1 OR gate A B | A + B 0 0 | | | | 1 NOT gate _ A | A or A’ 0 | 1 1 |

6 - 1 Simplification Theorems Useful for simplification of expressions & therefore simplification of the logic network which results. XY + XY' = ( X +

1 BOOLEAN ALGEBRA Basic mathematics for the study of logic design is Boolean Algebra Basic laws of Boolean Algebra will be implemented as switching devices.

Discrete Mathematics CS 2610 September Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x 1,..x n )  B.

ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.

Boolean Algebra – II. Outline  Basic Theorems of Boolean Algebra  Boolean Functions  Complement of Functions  Standard Forms.

A. Abhari CPS2131 Chapter 2: Boolean Algebra and Logic Gates Topics in this Chapter: Boolean Algebra Boolean Functions Boolean Function Simplification.

1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.

BOOLEAN ALGEBRA Kamrul Ahsan Teacher of

Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.

CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2002 Topic2: DeMorgan Laws José Nelson Amaral.

Module 5.  In Module 3, you have learned the concept of Boolean Algebra which consists of binary variables and binary operator.  A binary variable x,

BOOLEAN ALGEBRA – Digital Circuit 1 Choopan Rattanapoka.

Boolean Algebra and Logic Gates

Chapter 2: Basic Definitions BB inary Operators ●A●AND z = x y = x yz=1 if x=1 AND y=1 ●O●OR z = x + yz=1 if x=1 OR y=1 ●N●NOT z = x = x’ z=1 if x=0.

CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.

ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.

Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.

CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.

CSE 461. Binary Logic Binary logic consists of binary variables and logical operations. Variables are designated by letters such as A, B, C, x, y, z etc.

Digital Logic Circuits, Digital Component and Data Representation Course: BCA-2 nd Sem Subject: Computer Organization And Architecture Unit-1 1.

Speaker: Fuw-Yi Yang 楊伏夷伏夷非征番, 道德經察政章(Chapter 58) 伏者潛藏也

ECE 301 – Digital Electronics

Table 2.1 Postulates and Theorems of Boolean Algebra

Chapter 2: Boolean Algebra and Logic Functions

CS 105 Digital Logic Design

CHAPTER 2 Boolean Algebra

CHAPTER 2 Boolean Algebra This chapter in the book includes:

Princess Sumaya University

SLIDES FOR CHAPTER 2 BOOLEAN ALGEBRA

FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA

Lecture 3: Boolean Algebra

Boolean Algebra Why study Boolean Algebra?

Boolean Algebra.

Boolean Algebra.

Boolean Algebra Logic Gates

Table 2.1 Postulates and Theorems of Boolean Algebra

Presentation transcript:

Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning

311_022 Logic Gates

311_033 Exclusive-OR (XOR)

Boolean Algebra 311_024 Identity laws: 1. X + 0 = X1D. X 1 = X 2. X + 1 = 12D. X 0 = 0 Idempotent laws: 3. X + X = X3D. X X = X Involution law: 4. (X')' = X Laws of complements: 5. X + X' = 15D. X X' = 0

Boolean Algebra 311_025 Commutative laws: 6. X + Y = Y + X 6D. XY = YX Associative laws: 7. (X + Y) + Z = X + (Y + Z) 7D. (XY)Z = X(YZ) = XYZ Distributive laws: 8. X(Y + Z) = XY + XZ 8D. X + YZ = (X + Y)(X + Z) DeMorgan's laws: 9. (X + Y )' = X'Y' 12D. (XY)' = X' + Y' Simplification theorem: 10. XY + XY' = X(Adjacency Theorem)

Minterms and Maxterms 311_046

Sum of Products (SOP) 311_027 AB' + CD'E + AC'E'

Product of Sums (POS) 311_028 (A + B')(C + D' + E)(A + C ' + E ' )

311_07 NAND and NOR Gates 9

DeMorgan's Laws  (X ∙ Y)' = X' + Y'  (X + Y)' = X' ∙ Y' 311_0710

311_07 SOP to NAND-NAND G = WXY + YZ 11