LOGIC GATES

AND
FUNDAMENTALS OF BOOLEAN Algebra
 UNIT 2
Logic Gates and Boolean Algebra
 Key Terms

• Inverter : A logic circuit that inverts or complements its inputs.

• Truth table : A table showing the inputs and corresponding output(s) of a logic
circuit.

• Timing diagram : A diagram of waveforms showing the proper time relationship

of all of the waveforms.

• Boolean algebra: The mathematics of logic circuits.

• AND gate :A logic gate that produces a HIGH output only when all of its inputs are
HIGH.
• OR gate: A logic gate that produces a HIGH output when one or more inputs are
HIGH.
• NAND gate : A logic gate that produces a LOW output only when all of its inputs
are HIGH.

• NOR gate: A logic gate that produces a LOW output when one or more inputs are
HIGH.
 Key Terms

Exclusive-OR A logic gate that produces a HIGH output only

gate when its two inputs are at opposite levels.
Exclusive-NOR A logic gate that produces a LOW output only
gate when its two inputs are at opposite levels.
 Binary Digits, Logic Levels, and Digital Waveforms

• The two binary digits are designated 0 and 1

• They can also be called LOW and HIGH, where

LOW = 0 and HIGH = 1
• In order to practice with Logic Gates we can use:

•LogicCircuit
•CEDAR Logic Simulator
•Logisim
 Logic Gates
• Inverter
• AND Gate
• OR Gate
• NAND Gate
• NOR Gate
• Exclusive-OR Gate
• Exclusive-NOR Gate
 A X
The Inverter
The inverter performs the Boolean NOT operation. When the
input is LOW, the output is HIGH; when the input is HIGH,
the output is LOW.

Input Output
A X
LOW (0) HIGH (1)
HIGH (1) LOW(0)

The NOT operation (complement) is shown with an overbar.

Thus, the Boolean expression for an inverter is X = A.
 The Inverter
A X

Example waveforms:
A
X
A group of inverters can be used to form the 1’s complement
of a binary number: Binary number
1 0 0 0 1 1 0 1

0 1 1 1 0 0 1 0
1’s complement
 Truth Tables
• Total number of possible combinations of binary
inputs
N = 2n
• For two input variables:
N = 22 = 4 combinations
• For three input variables:
N = 23 = 8 combinations
• For four input variables:
N = 24 = 16 combinations
 X
The AND Gate

The AND gate produces a HIGH output when all inputs are
HIGH; otherwise, the output is LOW. For a 2-input gate,
the truth table is Inputs Output
A B X
0 0 0
0 1 0
1 0 0
1 1 1

The AND operation is usually shown with a dot between the

variables but it may be implied (no dot). Thus, the AND
operation is written as X = A .B or X =AB.
 X
The AND Gate

Example waveforms:
A
B

X
The AND operation is used in computer programming as a
selective mask. If you want to retain certain bits of a binary
number but reset the other bits to 0, you could set a mask with
1’s in the position of the retained bits.
If the binary number 10100011 is ANDed with the
mask 00001111, what is the result? 00000011
The AND Gate for more than 2 inputs

3-Input AND Gate

4-Input AND Gate

 X
The OR Gate
The OR gate produces a HIGH output if any input is HIGH;
if all inputs are LOW, the output is LOW. For a 2-input gate,
the truth table is Inputs Output
A B X
0 0 0
0 1 1
1 0 1
1 1 1

The OR operation is shown with a plus sign (+) between the

variables. Thus, the OR operation is written as X = A + B.
 X
The OR Gate

Example waveforms:
A
B

X
The OR operation can be used in computer programming to set certain
bits of a binary number to 1.
ASCII letters have a 1 in the bit 5 position for lower case letters
and a 0 in this position for capitals. (Bit positions are numbered
from right to left starting with 0.) What will be the result if you
OR an ASCII letter with the 8-bit mask 00100000?
The resulting letter will be lower case.
The OR Gate for more than 2 inputs

3-Input OR Gate

4-Input OR Gate
 X
The NAND Gate

The NAND gate produces a LOW output when all inputs

are HIGH; otherwise, the output is HIGH. For a 2-input
gate, the truth table is Inputs Output
A B X
0 0 1
0 1 1
1 0 1
1 1 0

The NAND operation is shown with a dot between the

variables and an overbar covering them. Thus, the NAND
operation is written as X = A .B (Alternatively, X =AB.)
 X
The NAND Gate

Example waveforms:
A
B

X
The NAND gate is particularly useful because it is a
“universal” gate – all other basic gates can be constructed
from NAND gates.
How would you connect a 2-input NAND gate
to form a basic inverter?
 X

The NOR Gate

The NOR gate produces a LOW output if any input is
HIGH; if all inputs are HIGH, the output is LOW. For a
2-input gate, the truth table is
Inputs Output
A B X
0 0 1
0 1 0
1 0 0
1 1 0
The NOR operation is shown with a plus sign (+) between
the variables and an overbar covering them. Thus, the NOR
operation is written as X = A + B.
 X
The NOR Gate

Example waveforms:
A
B

X
The NOR operation will produce a LOW if any input is HIGH.
+5.0 V

When is the LED is ON for the circuit shown? 330 

A
The LED will be on when any of B X
the four inputs are HIGH. C
D
 The XOR Gate
The XOR gate produces a HIGH output only when both
inputs are at opposite logic levels. The truth table is
Inputs Output
A B Z
0 0 0
0 1 1
1 0 1
1 1 0

The XOR operation is written as Z =AB +AB.

Alternatively, it can be written with a circled plus sign
between the variables as Z =A + B.
 X
The XOR Gate

Example waveforms:
A
B

Z
Notice that the XOR gate will produce a HIGH only when exactly one
input is HIGH.
If the A and B waveforms are both inverted for the above
waveforms, how is the output affected?

There is no change in the output.

 The XNOR Gate
The XNOR gate produces a HIGH output only when both
inputs are at the same logic level. The truth table is
Inputs Output
A B Z
0 0 1
0 1 0
1 0 0
1 1 1
The XNOR operation shown as Z =AB +AB. Alternatively,
the XNOR operation can be shown with a circled dot
between the variables. Thus, it can be shown as Z = A . B.
 The XNOR Gate

Example waveforms:
A
B

Z
Notice that the XNOR gate will produce a HIGH when both inputs are the
same. This makes it useful for comparison functions.
If the A waveform is inverted but B remains the same, how is
the output affected?

The output will be inverted.

 Boolean Operations and
Expressions
• Addition • Multiplication
0+0=0 0*0=0
0+1=1 0*1=0
1+0=1 1*0=0
1+1=1 1*1 =1
 Laws Boolean Algebra

• Commutative Laws
• Associative Laws
• Distributive Law
 Laws of Boolean Algebra
• Commutative Law of Addition:
A+B=B+A
 Laws of Boolean Algebra

• Commutative Law of Multiplication:

A*B=B*A
 Laws of Boolean Algebra

• Associative Law of Addition:

A + (B + C) = (A + B) + C
 Laws of Boolean Algebra

• Associative Law of Multiplication:

A * (B * C) = (A * B) * C
 Laws of Boolean Algebra

• Distributive Law:
A(B + C) = AB + AC
Rules of Boolean Algebra
 Rules of Boolean Algebra
• Rule 6

OR Truth Table
 Rules of Boolean Algebra

• Rule 7

AND Truth Table

 Rules of Boolean Algebra

• Rule 8

AND Truth Table

 Rules of Boolean Algebra

• Rule 9
 Rules of Boolean Algebra

• Rule 10: A + AB = A

AND Truth Table OR Truth Table

 Rules of Boolean Algebra

• Rule 11: A + AB = A + B

AND Truth Table OR Truth Table

 Rules of Boolean Algebra

• Rule 12: (A + B)(A + C) = A + BC

AND Truth Table OR Truth Table

 DeMorgan’s Theorems
• Theorem 1 Remember:
“Break the bar,
XY = X + Y change the sign”
• Theorem 2
X + Y = XY
DeMorgan’s theorems are equally valid for use with three, four or
more input variable expressions.
Example1:

Example2:
 DeMorgan’s First Theorems
DeMorgan’s First theorem proves that when two (or more) input variables are AND’ed and negated, they
are equivalent to the OR of the complements of the individual variables. Thus the equivalent of
the NAND function will be a negative-OR function, proving that (A.B)’ = A’+B’. We can show this
operation using the following table.

Verifying DeMorgan’s First Theorem using Truth Table

We can also show that (A.B)’ = A’+B’ using logic gates as shown.
 DeMorgan’s Second Theorems
DeMorgan’s Second theorem proves that when two (or more) input variables are OR’ed and negated,
they are equivalent to the AND of the complements of the individual variables. Thus the equivalent of
the NOR function is a negative-AND function proving that (A + B)’ = A’ . B’ , and again we can show
operation this using the following truth table.

Verifying DeMorgan’s Second Theorem using Truth Table

We can also show that (A + B)’ = A’ . B’ using logic gates as shown.

Summary of the Rules of Boolean Algebra
 Relations Between Logic Forms
Boolean Expression to Truth-table: Evaluate expression for all
input combinations and record output values.
Boolean Expression to Logic Circuit : Use AND gates for the
AND operators, OR gates for the OR operators, and inverters for
the NOT operator. Wire up the gates the match the structure of the
expression.
Logic Circuit to Boolean Expression: Reverse the above process
Example: Find the Boolean Expression for the logic circuit below

Solution
Example: For the below Boolean Expression find
out the Truth table and Logic Circuit

Solution:
Example Find the Boolean Expression and Truth
Table for below Logic Circuit.

Solution: