Boolean Algebra

(The Mathematics of Circuit Design)

Before we venture into the laws that govern Boolean Algebra we must remind ourselves that the: plus sign (+) means OR the multiplication sign () means AND As we work our way through the laws of Boolean Algebra we will see that these signs are appropriate. Commutative Law
In math class x+y = y+x xy = yx In Boolean Algebra A+B = B+A
A B

[3+4 = 4+3] [8x9 = 9x8]

B A

AB = BA
A B B A

/var/www/apps/conversion/tmp/scratch_4/153021247.doc

Page 1 of 8

Associative Law
In math class (x+y) + z = x+(y+z) (xy) z = x(yz) [(3+4) + 5 = 3+(4+5)] [(8x9)x6 = 8x(9x6)]

In Boolean Algebra (A+B) + C= A+(B+C)

A B C B

C A

(AB) C = A(BC)

A B C

C A

/var/www/apps/conversion/tmp/scratch_4/153021247.doc

Page 2 of 8

Distributive Law
In math class x(y+z) = xy + xz x+(yz) (x+y) (x+z) [3x(4+5) = 3x4 + 3x5 [3+(45) (3+4) (3+5)]
(multiplication can be distributed over addition) (addition cannot be distributed over multiplication)

In Boolean Algebra A(B+C) = (AB) + (AC)

A B C A C A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 B+C 0 1 1 1 0 1 1 1 A (B+C) 0 0 0 0 0 1 1 1 B

(AND can be distributed over OR)

(AB) 0 0 0 0 0 0 1 1

(AC) 0 0 0 0 0 1 0 1

(AB) +( AC) 0 0 0 0 0 1 1 1

A+(BC) = (A+B) (A+C)

B C A C A B

(OR can be distributed over AND)

A 0 0 0 0 1 1 1 1

B 0 0 1 1 0 0 1 1

C 0 1 0 1 0 1 0 1

BC 0 0 0 1 0 0 0 1

A+ (BC) 0 0 0 1 1 1 1 1

(A+B) 0 0 1 1 1 1 1 1

(A+C) 0 1 0 1 1 1 1 1

(A+B )(A+C) 0 0 0 1 1 1 1 1

/var/www/apps/conversion/tmp/scratch_4/153021247.doc

Page 3 of 8

DeMorgan's Laws AND and OR logic are related by DeMorgan's Laws AB = A+B The complement of the product equals the sum of the complements. Draw the schematic for A+B

Draw the Schematic for AB

Draw the truth table for AB

Draw the truth table for A+B

A+B = AB

The complement of the sum equals the product of the complements.

Draw the Schematic for A+B

Draw the schematic for AB

Draw the truth table for A+B

Draw the truth table for AB

/var/www/apps/conversion/tmp/scratch_4/153021247.doc

Page 4 of 8

Logic Rules
Rules of AND A0 A1 AA AA Rules of OR A+0 A+1 A+A A+A Rules of XOR A 0 A 1 A A A A Rules of NAND A NAND 0 = A NAND 1 = A NAND A = A NAND A = Rules of NOR A NOR 0 A NOR 1 A NOR A A NOR A A A 0 1 = = = =

= = = = = = = =

0 A A 0 A 1 A 1 = = = =

1 A A 1 A 0 A 0 A A 1 0

Rules of XNOR A XNOR 0 = A XNOR 1 = A XNOR A = A XNOR A =

Order of operations NOT Bracket AND OR

/var/www/apps/conversion/tmp/scratch_4/153021247.doc

Page 5 of 8

Emulation
(AA) (BB) = A+B

Simplify the left side of the equation (AA) (BB) = (AA) +(BB) = (AA) + (BB) = A+B
(De Morganise) (delete the double negative) (the rules of AND)

A 0 0 1 1

B 0 1 0 1

(AA) 1 1 0 0

(BB) 1 0 1 0

(AA) (BB) 0 1 1 1

A+B 0 1 1 1

/var/www/apps/conversion/tmp/scratch_4/153021247.doc

Page 6 of 8

Emulation
((AB) A)((AB) B) = A B Simplify the left side of the equation ((AB) A)((AB) B) = ((AB)A)+((AB)B) = ((AB)A)+((AB)B) = ((A+B)A)+((A+B)B) = ((AA) + (AB)) + ((BA) + (BB)) = (0+(AB))+((AB+0) ( )+( )
A 0 0 1 1 B 0 1 0 1 A 1 1 0 0 B (AB) 1 1 0 1 1 1 0 0 (AB)A 1 1 0 1 (AB)B 1 0 1 1 ((AB)A)((AB)B) 0 1 1 0 (AB)+(AB) 0 1 1 0 A B 0 1 1 0

(De Morganise)

(delete the double negatives) (De Morganise) (distributive law) (rules of AND) (rules of OR)

/var/www/apps/conversion/tmp/scratch_4/153021247.doc

Page 7 of 8

Min Terms & Max Terms

Extracting min & max terms from truth tables reveals emulations Take the truth table for two input XOR logic A 0 0 1 1 B 0 1 0 1 A B 0 1 1 0

To find the min term look for positive outputs Therefore: (AB) + (AB) is the min term expression, and an emulation for XOR Min term expressions OR,AND logic To find the max term look for negative outputs Therefore: (A+B)(A+B) is the max term expression and an emulation for XOR Max term expressions AND, OR logic Draw the schematic and the truth table for the min term expression.

Draw the schematic and the truth table for the max term expression

/var/www/apps/conversion/tmp/scratch_4/153021247.doc

Page 8 of 8