Chapter 10.1 and 10.2: Boolean Algebra Based on Slides from Discrete Mathematical Structures: Theory and Applications.

Slides:

Advertisements

Similar presentations

Chapter 2 Logic Circuits.

Advertisements

Morgan Kaufmann Publishers

Logic Gate Level Part 2. Constructing Boolean expression from truth table First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result.

EECC341 - Shaaban #1 Lec # 10 Winter Implementing n-variable Functions Using 2 n -to-1 Multiplexers Any n-variable logic function, in canonical.

1 Section 10.1 Boolean Functions. 2 Computers & Boolean Algebra Circuits in computers have inputs whose values are either 0 or 1 Mathematician George.

Boolean Algebra and Logic Gates

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.

Chapter 9: Boolean Algebra

Logic Functions and their Representation. Slide 2 Combinational Networks x1x1 x2x2 xnxn f.

Lecture 3. Boolean Algebra, Logic Gates

Fall 2002CMSC Discrete Structures1 Yes, No, Maybe... Boolean Algebra.

Chapter Two Boolean Algebra and Logic Gate

Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.

Chapter 2: Boolean Algebra and Logic Functions

22C:19 Discrete Math Boolean Algebra & Digital Logic Fall 2010 Sukumar Ghosh.

9/15/09 - L6 Standard FormsCopyright Joanne DeGroat, ECE, OSU1 Standard Forms.

Applied Discrete Mathematics Week 13: Boolean Algebra

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.

Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.

Chapter 2: Boolean Algebra and Logic Gates. F 1 = XY’ + X’Z XYZX’Y’XY’X’ZF1F

Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and

A.Abhari CPS2131 Chapter 3: Gate-Level Minimization Topics in this Chapter: The Map Method Two-Variable Map Three- Variable Map Four/Five variable Map.

Venn Diagram – the visual aid in verifying theorems and properties 1 E.

Discrete Mathematics CS 2610 February 12, Agenda Previously Finished functions Began Boolean algebras And now Continue with Boolean algebras.

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.

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.

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.

Discrete Mathematics CS 2610 February 10, Agenda Previously Functions And now Finish functions Start Boolean algebras (Sec. 11.1)

Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.

R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.

Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.

Dr. ClincyLecture Slide 1 CS Chapter 3 (3A and ) Part 2 of 8 Dr. Clincy Professor of CS.

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.

Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications.

Boolean Algebra.

Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.

CHAPTER 2 Boolean algebra and Logic gates

Boolean Constants and Variables Boolean 0 and 1 do not represent actual numbers but instead represent the state, or logic level. Closed switchOpen switch.

Table 2.1 Postulates and Theorems of Boolean Algebra

Chapter 11 (Part 1): Boolean Algebra

Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and

Chapter 2: Boolean Algebra and Logic Functions

… and now for the Final Topic:

CHAPTER 3 SETS AND BOOLEAN ALGEBRA

Boolean Algebra A Boolean algebra is a set B of values together with:

September 7 Notes Boolean Algebra.

Dr. Clincy Professor of CS

Discrete Mathematics CS 2610

CMSC Discrete Structures

Representing Boolean functions

Yes, No, Maybe... BooleanAlgebra 12/10/2018.

Lecture 20: Combinatorial Circuits I

Chapter 10.1 and 10.2: Boolean Algebra

Chapter 10.1 and 10.2: Boolean Algebra

Chapter 10.1 and 10.2: Boolean Algebra

Applied Discrete Mathematics Week 4: Functions

Representing Boolean Functions

The Map Method Truth table of fn is unique but fn can be in many different algebraic forms Simplification by using boolean algebra is often difficult because.

Table 2.1 Postulates and Theorems of Boolean Algebra

Representing Boolean Functions

Digital Logic Chapter-2

Analysis of Logic Circuits Example 1

Representing Boolean Functions

Chapter 10.1 and 10.2: Boolean Algebra

CMSC Discrete Structures

Boolean Algebra.

Presentation transcript:

Chapter 10.1 and 10.2: Boolean Algebra Based on Slides from Discrete Mathematical Structures: Theory and Applications

Discrete Mathematical Structures: Theory and Applications 2 Learning Objectives  Learn about Boolean expressions  Become aware of the basic properties of Boolean algebra

Discrete Mathematical Structures: Theory and Applications 3 Two-Element Boolean Algebra Let B = {0, 1}.

Discrete Mathematical Structures: Theory and Applications 4 Two-Element Boolean Algebra

Discrete Mathematical Structures: Theory and Applications 5

6

7

8 Two-Element Boolean Algebra

Discrete Mathematical Structures: Theory and Applications 9 Two-Element Boolean Algebra

Discrete Mathematical Structures: Theory and Applications 10

Discrete Mathematical Structures: Theory and Applications 11

Discrete Mathematical Structures: Theory and Applications 12

Discrete Mathematical Structures: Theory and Applications 13

Discrete Mathematical Structures: Theory and Applications 14 Boolean Algebra

Discrete Mathematical Structures: Theory and Applications 15 Boolean Algebra

Discrete Mathematical Structures: Theory and Applications 16

Discrete Mathematical Structures: Theory and Applications 17 Find a minterm that equals 1 if x 1 = x 3 = 0 and x 2 = x 4 = x 5 =1, and equals 0 otherwise. x’ 1 x 2 x’ 3 x 4 x 5

Discrete Mathematical Structures: Theory and Applications 18 Therefore, the set of operators {., +, ‘} is functionally complete.

Discrete Mathematical Structures: Theory and Applications 19 Sum of products expression  Example 3, p. 710 Find the sum of products expansion of F(x,y,z) = (x + y) z’ Two approaches: 1)Use Boolean identifies 2)Use table of F values for all possible 1/0 assignments of variables x,y,z

Discrete Mathematical Structures: Theory and Applications 20 F(x,y,z) = (x + y) z’

Discrete Mathematical Structures: Theory and Applications 21 F(x,y,z) = (x + y) z’ F(x,y,z) = (x + y) z’= xyz’ + xy’z’ + x’yz’

Discrete Mathematical Structures: Theory and Applications 22

Discrete Mathematical Structures: Theory and Applications 23

Discrete Mathematical Structures: Theory and Applications 24 Functional Completeness This means that the set of operators {., +, '} is functionally complete. Summery: A function f: B n  B, where B={0,1}, is a Boolean function. For every Boolean function, there exists a Boolean expression with the same truth values, which can be expressed as Boolean sum of minterms. Each minterm is a product of Boolean variables or their complements. Thus, every Boolean function can be represented with Boolean operators ·,+,'

Discrete Mathematical Structures: Theory and Applications 25 Functional Completeness The question is: Can we find a smaller functionally complete set? Yes, {., '}, since x + y = (x'. y')' Can we find a set with just one operator? Yes, {NAND}, {NOR} are functionally complete: NAND: 1|1 = 0 and 1|0 = 0|1 = 0|0 = 1 {NAND} is functionally complete, since {., '} is so and x' = x|x xy = (x|y)|(x|y) NOR: