Scribd
Upload
41 views

Boolean Theorems and Boolean Algebra

This document discusses Boolean theorems and Boolean algebra which can be used to simplify logic circuits and expressions. It presents three tables that list single-variable theorems, multivariable theorems, and DeMorgan's theorems. Four examples are provided that apply the theorems to simplify expressions into sum of products form. The theorems allow converting between AND and OR expressions, enabling any logic expression to be implemented using universal gates like NAND or NOR.

Uploaded by

Anonymous s8OrImv8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
41 views

Boolean Theorems and Boolean Algebra

This document discusses Boolean theorems and Boolean algebra which can be used to simplify logic circuits and expressions. It presents three tables that list single-variable theorems, multivariable theorems, and DeMorgan's theorems. Four examples are provided that apply the theorems to simplify expressions into sum of products form. The theorems allow converting between AND and OR expressions, enabling any logic expression to be implemented using universal gates like NAND or NOR.

Uploaded by

Anonymous s8OrImv8
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Boolean Theorems and Boolean Algebra

We have seen how Boolean expressions can be used to express a logic operation mathematically.
We can also use these expressions combined with Boolean theorems to simplify a logic circuit.
The Boolean theorems are grouped into two categories below. Table 1 lists the single-variable
theorems. Table 2 lists the theorems relating expressions with multiple variables. Table 3 lists
two special multivariable theorems which express how to change an AND expression to an OR
expression and vice versa. DeMorgan’s theorems in Table 3 are also covered in your textbook.

Note that AB and A � B are equivalent representations for the AND function. The dot notation is
used below to avoid confusion when combining numbers and variables, ie, to differentiate the
expression x �
0 from the variable x0.

0=0
1. x � x 5. x + 0 = x x
0
x
0
0

1= x
2. x � x 6. x + 1 = 1 x
x 1
1 1

x=x
3. x � x 7. x + x = x x
x x

x =0
4. x � x 8. x + x = 1 x
0 1

Table 1: Single-variable Theorems

9. x + y = y + x 13a. x( y + z ) = xy + xz

y = y�
10. x � x 13b. ( w + x)( y + z ) = wy + xy + wz + xz

11. x + ( y + z ) = ( x + y ) + z = x + y + z 14. x + xy = x

12. x( yz ) = ( xy ) z = xyz 15a. x + xy = x + y

15b. x + xy = x + y
Table 2: Multivariable Theorems

16. ( x + y ) = x �
y y) = x + y
17. ( x �
Table 3: DeMorgan’s Theorems

EE302 – Spring 2004 Page 1/2


Boolean Theorems and Boolean Algebra
These theorems can be used to simplify expressions as shown in the examples below. In all of
the following examples, we refer to the theorems above by number for simplicity.

Example 1
Simplify the expression z = ABD + ABD to a sum of products (SOP) form.
z = ABD + ABD
z = AB ( D + D) by theorem 13
z = AB (1) by theorem 8
z = AB by theorem 2 � z = AB

Example 2
Simplify the expression z = ( A + B )( A + B ) to a sum of products form.
z = ( A + B )( A + B )
z = AA + AB + BA + BB by theorem 13
z = 0 + AB + BA + B by theorems 3 and 4
z = B ( A + A + 1) by theorem 13
z = B (1) by theorem 6
z=B by theorem 2 �z=B

Example 3
Simplify the expression z = ( A + C ) �
( B + D) to a sum of products form.
z = ( A + C) �
( B + D)
z = ( A + C ) + ( B + D) by theorem 17
z = ( AC ) + ( B D) by theorem 16
z = ( AC ) + ( BD) � z = AC + BD

Example 4
Determine the output expression of the circuit in Figure 1 and simplify to a sum of products.
A
B z = A�
B�C by analysis
C
z z = A+ B +C by theorem 17
z = A+ B +C
Figure 1: Logic Circuit
� z = A+ B +C

Note that in Example 4 we have changed an AND expression (since a NAND gate is an AND
gate with an inverter after it) to an OR expression. This conversion leads directly to our ability
to implement any logic expression using any universal gate, eg, NAND or NOR. Universal gates
are discussed further in your textbook.

EE302 – Spring 2004 Page 2/2


Boolean Theorems and Boolean Algebra

You might also like