THE RULES OF BOOLEAN ALGEBRA The algebra is two valued {0,1} and has three operations (+),(), and

(). A A1 = A A+0 = A A0 = 0 A+1 = 1 AA = A A+A = A AA=0 A+A=1 0 B0 0 1 1 0 A 0 1 B0 0 1 1 1 1 A+B

0 1 AB

Commutation AB = BA A+B = B+A

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

Distribution A(B+C) = (AB)+(AC) A+(BC) = (A+B)(A+C)

Reduction A(A+B) = A+(AB) = A A(A+B) = (AA)+(AB) = AB A+(AB) = (A+A)(A+B) = A+B

DeMorgans theorem (AB) = A+B (A+B) = AB proof (A+B)(AB) = (A A B) + (B A B) = 0 (A+B)+(AB) = (A+ B+A) (A+ B+ B) = 1 In general ( Ai ) = Ai and f(A1 ,A2 ,AM, ,+) = f(A1 ,A2 ,AM, +,)

Example F = ABC + AEF + BF F = (ABC)(AEF)(BF) = (A+B+C)(A+E+F)(B+F) Duality Every valid statement has a valid dual. The dual is found by complementing every variable and interchanging the operators and +.

12

TRUTH TABLES Determine the output for every combination of the input Input ABC 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 Output Y1 Y2 Y3 0 0 0 0 0 1 0 1 0 0 1 0 0 1 0 1 0 0 1 0 0 1 0 0

A B C

Y1 Y2 Y3 SOP

Y3 = ABC Y2 = ABC + ABC + ABC Y1 = ABC + ABC + ABC

Y1 = ABC+ ABC + ABC + ABC + ABC Y1 = (A+B+C)(A+B+C)(A+B+C)(A+B+C)(ABC) Y2 = ABC+ ABC + ABC + ABC + ABC Y2 = (A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C)

POS

POS

Y3 = ABC + ABC + ABC + ABC + ABC + ABC + ABC Y3 = (A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C)(A+B+C) POS The outputs in minterms (SOP) The outputs in maxterms (POS) Y3 = m(1) Y1 = m(0,2,3,4,5,6,7) Y1 = M(0,2,3,4,5,6,7) Y2 = m(2,3,4) Y2 = m(0,1,5,6,7) Y2 = M(0,1,5,6,7) Y1 = m(5,6,7) Y3 = m(0,1,2,3,4) Y3 = M(0,1,2,3,4) Any input variable or its complement is a literal of the function. Any product in a SOP is an implicant of the problem Any implicant which by removing one literal becomes a non-implicant is a prime implicant. Any implicant with a literal contained in no other implicant is an essential prime implicant. Example Y2 = ABC + ABC + ABC = AB + A BC The literals are The implicants are The prime implicants are The essential primes are (A, A, B, B, C, C) (ABC, ABC, ABC, AB) (ABC, ABC, ABC, AB) (AB, ABC)

The POS and the SOP are standard or canonic forms.

13

ALGEBRAIC REDUCTION A(A+B) = A+(AB) = AA+AB =A (A+A)(A+B) = A(A+B) = A

A(A+B) = AA +AB = AB A+(AB) = (A+A)(A+B) = (A+B) AB + AC + BC = ABC + AC + ABC+ BC = AC(B+1) + BC(A+1) = AC + BC

Example using AB + AB=A 0 2 5 7 8 10 13 15 F = ABCD+ ABCD+ ABCD + ABCD + ABCD + ABCD + ABCD + ABCD 0,2 0,8 2,10 5,7 5,13 8,10 7,15 13,15 F = ABD + BCD + BCD + ABD + BCD + ABD + BCD + ABD 0,2,8,10 0,8,2,10 5,7,13,15 5,13,7,15 BD + BD + BD + BD = BD + BD

F=

Example using DeMorgans theorm F(ABCD) = (1,2,3, 6,7,8,9,10,11,14,15) F(ABCD) = (0,4,5,12,13) 0 4 5 12 13 F = ABCD + ABCD + ABCD + ABCD + ABCD 0,4 4,5 4,8 5,13 12,13 F =ACD + ABC + BCD + BCD + ABC = ACD + BC(A+D+D+A)

F = ACD + BC F = (A+C+D)(B+C)

14