Algebra Algebra – defined by the tuple:  A, o 1, …, o k ; R 1, …, R m ; c 1, …, c k  Where: A is a non-empty set o i is the function, o i : A p i  A.

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

Presented by: Ms. Maria Estrellita D. Hechanova, ECE
Sistemas Digitais I LESI - 2º ano Lesson 3 - Boolean Algebra U NIVERSIDADE DO M INHO E SCOLA DE E NGENHARIA Prof. João Miguel Fernandes
Types of Logic Circuits
Logical Systems Synthesis.
ECE C03 Lecture 21 Lecture 2 Two Level Minimization Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.
מבנה המחשב + מבוא למחשבים ספרתיים תרגול 1#
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 -Part 2.
EECC341 - Shaaban #1 Lec # 5 Winter Switching Algebra: Principle of Duality Any theorem or identity in switching algebra remains true if.
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
EE365 Adv. Digital Circuit Design Clarkson University Lecture #2 Boolean Laws and Methods.
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 3-1 Chapter #2: Two-Level Combinational Logic Section 2.1, Logic Functions.
Lattice and Boolean Algebra
Fall 2002CMSC Discrete Structures1 Yes, No, Maybe... Boolean Algebra.
Chapter 2: Boolean Algebra and Logic Functions
Boolean Algebra. Binary Logic and Gates Binary variables take on one of two values. Logical operators operate on binary values and binary variables. Basic.
Boolean Algebra أ. زينب آل كاظم 1. Boolean Functions In Boolean algebra we work with the set {0,1}, where: 0 ≡ F (False) & 1 ≡ T (True). The 3 Operations.
Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.
Binary Logic and Gates Binary variables take on one of two values.
Boolean Algebra and Digital Circuits
Chapter 3 – Set Theory  .
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
Boolean Algebra 1854, George Boole created a two valued algebraic system which is now called Boolean algebra. 1938, Claude Shannon adapted Boolean algebra.
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
LOGIC GATES & BOOLEAN ALGEBRA
--- outputs logical functions of inputs --- new outputs appear shortly after changed inputs (propagation delay) --- no feedback loops --- no clock Sequential.
Boolean Algebras Lecture 27 Section 5.3 Wed, Mar 7, 2007.
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.
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
Lecture 4 Boolean Algebra. Logical Statements °A proposition that may or may not be true: Today is Monday Today is Sunday It is raining °Compound Statements.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
Logic Circuits Lecture 3 By Amr Al-Awamry. Basic Definitions Binary Operators  AND z = x y = x yz=1 if x=1 AND y=1  OR z = x + y z=1 if x=1 OR y=1 
Boolean Algebra M. AL- Towaileb1. Boolean Functions In Boolean algebra we work with the set {0,1}, where: 0 ≡ F (False) & 1 ≡ T (True). The 3 Operations.
Binary Logic and Gates Boolean Algebra Canonical and Standard Forms Chapter 2: Boolean Algebra and Logic Gates.
CEC 220 Digital Circuit Design Boolean Algebra Friday, January 17 CEC 220 Digital Circuit Design Slide 1 of 22.
R. Johnsonbaugh Discrete Mathematics 5 th edition, 2001 Chapter 9 Boolean Algebras and Combinatorial Circuits.
Dale Roberts Department of Computer and Information Science, School of Science, IUPUI Dale Roberts, Lecturer Computer Science, IUPUI
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
ECE DIGITAL LOGIC LECTURE 6: BOOLEAN ALGEBRA Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2016, 02/01/2016.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
Boolean Algebras Lecture 24 Section 5.3 Wed, Mar 22, 2006.
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.
Boolean Algebra.
CHAPTER 2 Boolean algebra and Logic gates
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
Chapter 11 (Part 1): Boolean Algebra
Chapter 2: Boolean Algebra and Logic Functions
14:332:231 DIGITAL LOGIC DESIGN Boolean Algebra
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture)
CS 105 Digital Logic Design
Gate Circuits and Boolean Equations
… and now for the Final Topic:
Overview Part 1 – Gate Circuits and Boolean Equations
Lecture 3: Boolean Algebra
Boolean Algebra.
Boolean Algebra.
CMSC Discrete Structures
Chapter 2 Boolean Algebra and Logic Gate
CSE 370 – Winter Combinational Logic - 1
January 19 W’05 Yutao He 4532B Boelter Hall CSM51A/EEM16-Sec.1 W’05
Yes, No, Maybe... BooleanAlgebra 12/10/2018.
Boolean Algebra Introduction CSCI 240
Applied Discrete Mathematics Week 4: Functions
Sungho Kang Yonsei University
COMS 361 Computer Organization
CMSC Discrete Structures
Presentation transcript:

Algebra Algebra – defined by the tuple:  A, o 1, …, o k ; R 1, …, R m ; c 1, …, c k  Where: A is a non-empty set o i is the function, o i : A p i  A where p i is a positive integer R j is a relation on A c i is an element of A EXAMPLE  Z, +,  Z is a set of integers + is addition operation  is “less than or equal to” relation

Lattice Algebra Lattice Algebra – defined by the tuple:  A, ,  Where: A is a non-empty set , are binary operations And, the Following Axioms Hold: a  a = a a a = a (Idempotence) a  b = b  a a b = b a (Commutativity) a  (b  c) = (a  b )  c a (b c) = (a b) c (Associativity) a  (a b) = a a (a  b) = a (Absorption) a,b,c  A

Distributive Lattice Algebra A Lattice Algebra plus the Following Distributive Laws Hold: a  (b c) = (a  b ) (a  c) a (b  c) = (a b)  (a c) Complemented Distributive Lattice Algebra 1) maximal element = 1 2) minimal element = 0 3) For any a  A if  x a  A such that a x a = 0 4) For any a  A if  x a  A such that a  x a = 1 A Complemented Distributive Algebra is a Boolean Algebra

Distributive Lattice Examples a (b  c) = (a b)  (a c)? a 1 = a (a b)  (a c) = b  0 = b No, non-distributive lattice! 1 0 a c 1 0 b a No complement c is complement of a c is complement of b

Boolean Algebra  B, ,,, 0, 1  0, 1  B is a unary operation over B , are binary operations over B 0 is the “identity element” wrt  1 is the “identity element” wrt Ordered Set Lattice Dist. Lattice Boolean Algebra

Boolean Algebra Postulates  B, ,,, 0, 1  0, 1  B For arbitrary elements a,b,c  B the Following Postulates Hold: Absorption a  (a b) = a a (a  b) = a Associativity a  (b  c) = (a  b )  c a (b c ) = (a b) c Commutativity a  b = b  a a b = b a Idempotence a  a = a a a = a Distributivity a  (b c) = (a  b) (a  c) a (b  c) = (a b)  (a c) Involution a = a Complement a  a = 1 a a = 0 Identity a  0 = a a 1 = a a  1 = 1 a 0 = 0 DeMorgan’s a  b = a b a b = a  b

Huntington’s Postulates  B, ,,, 0, 1  0, 1  B All Previous Postulates may be Derived Using: Commutativity a  b = b  a a b = b a Distributivity a  (b c) = (a  b) (a  c) a (b  c) = (a b)  (a c) Complement a  a = 1 a a = 0 Identity a  0 = a a 1 = a If Huntington’s Postulates Hold for an Algebra then it is a Boolean Algebra

DeMorgan’s Theorem  B, ,,, 0, 1  0, 1  B Theorem: Let F(x 1, x 2,…,x n ) be a Boolean expression. Then, the complement of the Boolean expression F(x 1, x 2,…, x n ) is obtained from F as follows: 1) Add parentheses according to order of operation 2) Interchange all occurrences of  with 3) Interchange all occurrences of x i with x i 4) Interchange all occurrences of 0 with 1 EXAMPLE F = a  ( b c ) F = a ( b  c ) a  (b c ) = a ( b  c )

Principle of Duality  B, ,,, 0, 1  0, 1  B Interchanging all occurrences of  with and/or interchanging all occurrences of 0 with 1 in an identity, results in another identity that holds. A is a Boolean expression and A D is the Dual of A 0 D =11 D =0 A, B and C are Boolean Expressions if A = B  C then A D = B D C D if A = B C then A D = B D  C D if A = B then A D = B D

Logic (Switching) Functions B ={0, 1} The set of all mappings B n  B for B ={0,1} can be represented by Boolean expressions and are called “two- valued logic functions” or “switching functions”. The set B n contains 2 n elements The total number of mappings or functions is The notation we use is f: B n  B f can also be described through the use of an expression

Multi-dimensional Logic Functions f:B n  B m B={0,1} f is a vector of functions f i : B n  B where I = 1 to m B n represents the set of all elements in the set formed by n applications of the Cartesian Product B  B  …  B B n can also be interpreted geometrically as an n -dimensional hypercube The geometrical representations are referred to as “cubical representations” Each element in B n is represents a geometric coordinate a discrete hyperspace

Cubical Representation Consider f:B 3  B B={0,1} The domain of f is a hypercube of dimension n = 3 The range of f is a hypercube of dimension n = 1 01 (0,0,0) (1,0,0) (1,0,1) (1,1,1) (0,1,1) (0,1,0) (0,0,1) (1,1,0) NOTE: These are (sideways) Hasse Diagrams for B 3 and B 1 !!! f

Some Definitions variable – A symbol representing an element of B x i  B literal – x i or x i if x i =0 then x i =1 if x i =1 then x i =0 product – a Boolean expression composed of literals and the  operator (e.g. x 1  x 3  x 4 ) NOTE: when two literals appear next to each other, the  operation is “assumed” to be present (e.g. x 1 x 3 x 4 ) cube – another term for a product minterm – an element of B n for f:B n  B such that f = 1 j -cube – a product composed of n-j literals f(x 1, x 2,…,x n ) – a function f: B n  B f(x 1, x 2,…, x n ) – a multi-dimensional function f : B n  B m

Functions and Expressions  B, +,,, 0, 1  B ={0, 1} A specific function may be defined by an expression EXAMPLE: Consider the Boolean algebra defined above. Each operation can be given a name and defined by a personality matrix or table. The table contains the operation result for each element in B  B for a binary operation and for each element in B for a unary operation  NAME is ORNAME is ANDNAME is NOT EXAMPLE: A function f: B 3  B can be specified by an expression over some Boolean algebra. f(x 1, x 2, x 3 ) = x 1 + x 1 x 2 x 3

Geometric Interpretation of a Function  B, +,,, 0, 1  B ={0, 1} f( x 1, x 2, x 3 ) = x 1 + x 1 x 2 x 3 01 (0,0,0) (1,0,0) (1,0,1) (1,1,1) (0,1,1) (0,1,0) (0,0,1) (1,1,0) f f 1 denotes the “on-set” of the function f “on-set” is a set of cubes in the domain of f for which f = 1 f 1 ={x 1, x 1 x 2 x 3 } x1x1 x3x3 x2x2

Geometric Description of a Function  B, +,,, 0, 1  B ={0, 1} f ( x 1, x 2, x 3 ) = x 1 + x 1 x 2 x 3 (0,0,0) (1,0,0) (1,0,1) (1,1,1) (0,1,1) (0,1,0) (0,0,1) (1,1,0) x1x1 x3x3 x2x2 f =  (0,1,2,3,6) where each value represents a 0 -cube Each cube in f 1 ={x 1, x 1 x 2 x 3 } “covers” 1 or more 0 -cubes x 1 covers {000, 001, 010, 011}x 1 is a 2 -cube x 1 x 2 x 3 covers {110}x 1 x 2 x 3 is a 0 -cube

Geometric Description (cont)  B, +,,, 0, 1  B ={0, 1} f (x 1, x 2, x 3 ) = x 1 + x 1 x 2 x 3 = x 1 + x 2 x 3 (0,0,0) (1,0,0) (1,0,1) (1,1,1) (0,1,1) (0,1,0) (0,0,1) (1,1,0) x1x1 x3x3 x2x2 minterm – any 0 -cube that is covered by any element in f 1 “don’t care” is a variable that is not present in a cube in f 1 don’t care is denoted by “-” f 1 ={x 1 --, x 1 x 2 x 3 }={ - x 2 x 3, x 1 - x 3, x 1 x 2 x 3 } x 2 and x 3 are don’t cares in cube x 1 (0,0,0) (1,0,0) (1,0,1) (1,1,1) (0,1,1) (0,1,0) (0,0,1) (1,1,0)

Cube Sets f 1 is a set of all cubes for which f = 1 (on-set) f 0 is a set of all cubes for which f = 0 (off-set) f DC is a set of all cubes for which f = don’t care(DC-set) f is “completely specified” if any two of f 0, f 1 or f DC are given f is “incompletely specified” proper subsets are given for f 0, f 1 or f DC f 1 is said to be a “cover” for f