LOGIC FUNCTIONS & LOGIC GATES:

LOGIC FUNCTIONS

Any decision that can be answered yes/no or true/false can be mathematically

represented as a combination of logic functions.

George Boole invented and published this form of mathematics (Boolean Algebra) in
1847.

The 3 basic logic functions, which can be used to solve any Boolean equation, are:

NOT

AND

OR

Other common logic functions, that are combinations of the basic 3, are:

NAND

NOR

XOR
NOT FUNCTION

Boolean Logic Equation

_
X=A X = A=

Truth Table

Input Output
A | X in out
-----|------ A X
0 | 1 0 1
1 | 0 1 0

Logic Symbols

Traditional or “distinctive-shape@ symbol:

IEEE or “rectangular-outline@ symbol:

NOTE: NOT gates are often called Inverters.

AND FUNCTION

Boolean Logic Equation

X = AxB X = A⋅B

X = A*B X = AB

Truth Table

AB X
00 0
01 0
10 0
11 1

Logic Symbols

Traditional or “distinctive-shape@ symbol:

IEEE or “rectangular-outline@ symbol:

OR FUNCTION

Boolean Logic Equation

X = A+B

Truth Table

AB X
00 0
01 1
10 1
11 1

Logic Symbols

Traditional or “distinctive-shape@ symbol:

IEEE or “rectangular-outline@ symbol:

NAND FUNCTION

Boolean Logic Equation

____
X = AxB X = (A x B)=
____
X = A*B X = (A * B)=
____
X = A⋅B X = (A ⋅ B)=
__
X = AB X = (AB)=

Truth Table

AB X
00 1
01 1
10 1
11 0

Logic Symbols

Traditional or “distinctive-shape@ symbol:

IEEE or “rectangular-outline@ symbol:

NOR FUNCTION

Boolean Logic Equation

____
X = A+B

Truth Table

AB X
00 1
01 0
10 0
11 0

Logic Symbols

Traditional or “distinctive-shape@ symbol:

IEEE or “rectangular-outline@ symbol:

XOR FUNCTION

Boolean Logic Equation

X = ArB X = AB= + A=B

Truth Table

AB X
00 0
01 1
10 1
11 0

Logic Symbols

Traditional or “distinctive-shape@ symbol:

IEEE or “rectangular-outline@ symbol:

DEMORGAN=S THEOREM

It is sometimes difficult to understand a Boolean equation that is in the form of a NAND

or NOR function.

By implementing DeMorgan=s Theorem, it is possible to convert the equation into an

AND or OR function, which is easier to deal with.

Conversion Steps: 1. Change the logic symbol ( + to *; * to +).

2. Break the “bar@ over the symbol that was changed.

Examples:
________
Equation to convert: X=A*B*C
________
step 1: A+B+C change logic symbol(s)
_ _ _
step 2: A+B+C break bar over symbol change(s)
_ _ _
X=A+B+C

________
Equation to convert: X=A+B+C
_______
` step 1: A*B*C change logic symbol(s)
_ _ _
step 2: A*B*C break bar over symbol change(s)
_ _ _
X=A*B*C
ALTERNATIVE GATE SHAPES

Sometimes the logic of a circuit is more easily understood if an alternative gate shape is
used.

DeMorgan=s Theorem can be used to determine equivalent logic gates.

Rules: 1. Change the gate shape (AND ==> OR; OR ==> AND).

2. Change the bubbles (add where missing; remove if present).

Examples:

More Examples:
FUNCTIONALLY COMPLETE GATES

Any Boolean logic equation can be implemented with a combination of:

AND gates & NOT gates

OR gates & NOT gates

Some gates are functionally complete. These gates can implement any
combinational logic equation. These gates are:

NAND gates (contain both AND function & NOT function)

NOR gates (contain both OR function & NOT function)

BOOLEAN ALGEBRA:

The first 4 Laws (Theorems) for Boolean Algebra are similar to those of regular algebra.

Commutative Law

A+B=B+A A*B=B*A

Associative Law

A + (B + C) = (A + B) + C A * (B * C) = (A * B) * C

Distributive Law

A(B + C) = AB + AC (A + B)(C + D) = AC + AD + BC + BD

A + (BC) = (A + B)(A + C) AB + CD = (A + C)(A + D)(B + C)(B + D)

Miscellaneous Laws

In each of these laws, x is a variable that can be either a 0 or a 1.

These laws can be easily proven by looking at the truth tables for OR gates and AND
gates.

x*x=x x+x=x 1*1=1 1+1=1 x + x= = 1

x*0=0 x+1=1 1*0=0 1+0=1 x * x= = 0
x*1=x x+0=x 0*0=0 0+0=0