Boolean Algebra – Axioms

1
Boolean Algebra

• Boolean Algebra:
– algebra over 2 elements: {0,1}
– 3 operators: AND (), OR (), NOT ()
• AND Operation: a b a&b a|b
– a  b = 1 iff a=1 and b=1 0 0 0 0
• OR Operation: 0 1 0 1
– a  b = 1 if a=1 or b=1 1 0 0 1
1 1 1 1
• NOT Operation:
– a = 1 iff a=0
a ~a
0 1

2
Axioms of Boolean Algebra

• Axioms: a set of mathematical statements that we assert to be true.

• Identity:
– 1x=x
– 0x=x
• Annihilation:
– 0x=0
– 1x=1
• Negation:
– 0 = 1
– 1 = 0

3
Boolean Algebra - Theorems

4
 Useful Boolean Properties
(all can be derived from the axioms)

Communicative xy=yx xy=yx

Associative x  (y  z) = (x  y)  z x  (y  z) = (x  y)  z

Distributive x  (y  z) = (x  y)  (x  z) x  (y  z) = (x  y)  (x  z)

Idempotence xx=x xx=x

Complementation x  x = 0 x  x = 1

5
Useful Boolean Properties
(all can be derived from the axioms)

Absorption x  (x  y) = x x  (x  y) = x

Combining (x  y)  (x  y) = x (x  y)  (x  y) = x

DeMorgan’s (x  y) = x  y (x  y) = x  y

(x  y)  (x  z)  (y  z) ) (x  y)  (x  z)  (y  z) )
Consensus
= (x  y)  (x  z) = (x  y)  (x  z)

6
DeMorgan’s Law

• (x  y) = x  y (x  y) = x  y

• Proof by perfect induction

x y (x  y) x  y

0 0 1 1

0 1 1 1

1 0 1 1

1 1 0 0

7
DeMorgan Graphically

8
 Applying Boolean Properties

f(a,b,c) = (a  c)  (a  b  c)  (a  b  c)  (a  b  c)

f(a,b,c) = (a  c)  (a  b  c) 
(a  b  c)  (a  b  c) 
(a  b  c)  (a  b  c) Apply Absorption Property
f(a,b,c) = (a  c) 
(a  b  c)  (a  b  c) 
(a  b  c)  (a  b  c) Apply Combining Property
f(a,b,c) = (a  c)  (b  c)  (a  b)

9
Boolean Algebra – Dual function

10
Dual Functions

11
Example: Finding the dual of a function

Give the dual of the following un-simplified function:

f(x, y) = (1  x)  (0   y)

12
 Summary

• Learned the basics of Boolean algebra.

– Axioms (identity, annihilation, negation)
– Properties (commutative, associative ... DeMorgan's theorem)
– Theorems (consensus, absorption, uniting ...)
• Duality

13
Boolean Algebra – Normal forms

14
Normal Form

Simplified Sum-of-Products form

f(a, b, c) = (a  c)  (b  c)  (a  b)

Canonical (standard) Sum-of-Products form

f(a, b, c) =

Shannon expansion

15
 Example

Write the following equation in normal form:

f(a, b, c) = a  (b  c)

16
Boolean Algebra – Logic diagram

17
From Equations to Gates

18
Exclusive-or function

19
NAND and NOR gates

20
From Gates to Equations

21
Example: From equation to schematic

Draw the schematic for a three-input majority function that only uses
NAND gates:

22
Boolean Algebra – Verilog expression

23
Boolean Expressions in Verilog

24
 Summary

• Normal forms
• Logic diagram
• Verilog using assign statement

26