ECE 501

Fall 2011

Boolean Algebra 1
ClickRalphMaster subtitle style Dr. to edit Barrera

Ralph.Barrera@notes.udayton.edu

Binary Arithmetic
There are only 10 kinds of people in the world, those the understand binary, and those that dont.

2ECE501 F11, Boolean

Digital Logic Design

Predominately deals with binary variables and logical operators Variables (symbolized by letters of the alphabet) assume values 0 or 1 Three basic logical operations: AND, OR, NOT
Operation AND OR NOT Symbol x y or xy x+y x or x

3ECE501 F11, Boolean

Logic Function AND

AND

x y 0 0 0 1 1 0 1 1

xy 0 0 0 1
Two-input AND

4ECE501 F11, Boolean

Logic Function OR

OR

x 0 0 1 1

y 0 1 0 1

x+y 0 1 1 1
Two-input OR

5ECE501 F11, Boolean

Logic Function NOT Invert

NOT

x 0 1

x 1 0
Inver ter

6ECE501 F11, Boolean

Boolean Algebra and Logic Gates

Boolean Algebra provides a formal method to manipulate binary variables Classical logic design based on developing Boolean equations for desired logic functions We will briefly review the axioms of Boolean Algebra and the basic theorems

7ECE501 F11, Boolean

Axiomatic Definition of Boolean Algebra

Algebraic structure defined by a set of elements, B, together with two binary operators, + and , satisfying the following (Huntington) postulates (a) Closure with respect to the operator + (b) Closure with respect to the operator
(b) An identity element with respect to , designated by 1: x 1 = 1 x = x

1.

2. (a) An identity element with respect to +, designated by 0: x + 0 = 0 + x = x

3. (a) Commutative with respect to +: x + y = y + x (b) Commutative with respect to : x y = y x 4. (a) is distributive over + : x (y + z) = (x y) + (x z) (b) + is distributive over : x + (y z) = (x + y) (x + z) 5. For every element x B, there exists an element of x B (called the complement of x) such that
(a) (b)

x + x = 1 x x = 0

6. There exists at least two elements x,y B such that x y

8ECE501 F11, Boolean

Comparison of Boolean Algebra to Ordinary Algebra

1.

Huntington postulates do not include associative law. (It is valid for Boolean algebra and can be derived from the other postulates) The distributive law stated in 4(b) is not valid for ordinary algebra

1.

3. Boolean algebra does not have additive or multiplicative inverses, hence there are no subtraction or division operations 4. Ordinary algebra does not have a complement operation (Postulate 5) 5. Ordinary algebra deals with real numbers (an infinite set) while twovalued Boolean algebra used for logic design uses only two elements:
0 and 1

Duality: The postulates have been listed in pairs where one element of the pair may be obtained from the other by interchanging the binary elements and operators. This is called duality.
9ECE501 F11, Boolean

Basic Theorems
Theorem Theorem 1 Theorem 2 Theorem 3, involution Theorem 4, associative Theorem 5, DeMorgan Theorem 6, absorption x+x=x x+1=1 (x) = x x + (y + z) = (x + y) + z (x + y) = xy x + xy = x x(yz) = (xy)z (xy) = x + y x(x + y) = x Part (a) Part (b) (Dual of a) xx=x x0=0

10ECE501 F11,

Proof of Theorem 1(b)

Statement xx=x x x = xx + 0 = xx + xx = x(x + x) =x1 =x Justification (postulate ref) To be Proved 2(a) 5(b) 4(a) 5(a) 2(b)

11ECE501 F11,

Truth Table Proof

Prove F1 (xyz+xyz+xy) = F2 (xy+xz)

x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 xyz 0 1 0 0 0 0 0 0 xyz 0 0 0 1 0 0 0 0 xy 0 0 0 0 1 1 0 0 F1 0 1 0 1 1 1 0 0 xy 0 0 0 0 1 1 0 0 xz 0 1 0 1 0 0 0 0 F2 0 1 0 1 1 1 0 0

12ECE501 F11,

Assignment 1, Theorems Due Monday, 8/29/2011

Submit using Isidore Prove Theorems 1 through 4 algebraically.

Theorem 1 Theorem 2 Theorem 3 Theorem 4

x+x=x x+1=1 (x) = x

xx=x x0=0 x(yz) = (xy)z

x + (y + z) = (x + y) + z

Show that theorems 5 and 6 are true by using a truth table.

Theorem 5 Theorem 6

(x + y) = xy x + xy = x

(xy) = x + y x(x + y) = x

Read Chapters 1, 2, and 3 of the text

13ECE501 F11,