Digital Logic & Boolean

Algebra
 Learning Objectives
1. Define and Identify Boolean Algebra Rules

2. Apply Boolean Algebra Rules to Simplify Boolean Expressions

3. Understand the basic logics of NOT, OR and AND operations

4. Use De Morgan’s Theorem to simplify Boolean Expressions

5. Understand Boolean Functions and Standard Form

 Digital Signal
• It is an electrical signal that has two discrete values or levels.

• These levels may be called as LOW level and High level.

• The signal will always be of one of the two levels.

• HIGH  LOGIC 1
• LOW  LOGIC 0
Two Valued Logical Symbol

An open switch, low voltage, or an “off” lamp

0

Closed switch, a high voltage, or an “on” lamp

1
Current
Simple Circuit Diagram
Logical Addition
 A

A + B = Y

0 + 0 = 0
 A

A + B = Y

1 + 0 = 1
 A

A + B = Y

0 + 1 = 1
 A

A + B = Y

1 + 1 = 1
Logical Addition

A+B = Y
0+0 = 0
1+0 = 1
0+1 = 1
1+1 = 1
Logical Multiplication
 A B

A . B = Y

0 . 0 = 0
 A B

A . B = Y

1 . 0 = 0
 A B

A . B = Y

0 . 1 = 0
 A B
Y

A . B = Y

1 . 1 = 1
Logical Multiplication

A.B = Y
0.0 = 0
1.0 = 0
0.1 = 0
1.1 = 1
 Digital (Logic) Circuit
• Signals in digital circuit operates using 2 discrete values and therefore
said to be Binary. A binary digit, called a bit, has two values: 0 and 1

• Discrete elements of information are represented with groups of bits

called Binary Codes.

• An n – bit binary code is group of n bits that assumes up to disticnt

combinations of 1’s and 0’s, with each combination representing one
element of the set that is being coded.
 Boolean Algebra
• This characteristic of logic circuit allows the use of Boolean Algebra as
a way of analyzing and designing digital circuits.

• Algebra associated with binary numbers is called Boolean Algebra.

• Variables used in Boolean Algebra are called Boolean Variables.

• It is a variable that can only have one of two values: 0 or 1
• Example: If X is a Boolean variable, then, X = 0 or X = 1
 Boolean Algebra
• Boolean Algebra consists of Boolean variables and a set of logical
operations
B. A = {0, 1 │ AND, OR, NOT}

• Three basic logical operations - AND, OR, NOT

• Binary logic resembles binary arithmetic, and the operations AND and
OR have similarities to multiplication and addition respectively
 Basic Logic Operations
• NOT Operation (Complementation)

X NOT (X)/
0 1
1 0
NOT gate or Inverter
 Basic Logic Operations
• AND Operation (Logical Multiplication)

X Y X AND Y/ (X.Y)

0 0 0
0 1 0 Two-input AND gate
1 0 0
1 1 1
 Basic Logic Operations
• OR Operation (Logical Addition)

X Y X OR Y/ (X+Y)

0 0 0
0 1 1 Two-input OR gate
1 0 1
1 1 1
 Logic Gates
• Example
Logic Gates
Logic Gates
Logic Gates – HW – Exercise
Identify each of these logic gates
by name, and complete their
respective truth tables:
Boolean Laws
• Commutative law
• Associative law
• Distributive law
• AND law
• OR law
• INVERSION law
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 ) = A B + AC
AND Law
OR Law
INVERSION Law

´
𝑨= 𝑨
Boolean Algebra Rules
Example
• Using Boolean algebra, Simplify the following expressions

1.
2.
3.
4.
 Exercises
1. Select the Boolean expression that is not equivalent to

2. Select the expression which is equivalent to

 Exercises
3. Select the expression which is equivalent to

4. Select the expression that is not equivalent to

 Exercises
• Using Boolean algebra, simplify the following expressions:

(i) A  X Y Z  X YZ  X Y Z  XYZ
(ii ) X  AB  A( B  C )  B( B  C )
(iii ) A  X  Y  X Y  ( X  Y ). X Y
 Exercises

(i) A  XY Z  XYZ  X YZ  XYZ (ii) X  AB  A(B  C)  B(B  C)

 XY (Z  Z)  XZ( Y  Y )  AB  AB  AC  B.B  BC
 XY  XZ  AB  AC  B  BC
 B( A  1  C)  AC
 B  AC
 Exercises

(iv) Z  ABC[AB C(BC  AC)]

( v ) Y  (A  A)(AB  AB C)
( v i) Y  (A  B)(A  C)
( vii) Z  AB ABC  ABCD ABCDE
 HW - Exercises
Use DeMorgan’s Theorem, as well as any other applicable rules of
Boolean algebra, to simplify the following expression so there are no
more complementation bars extending over multiple variable:
Example

• Simplify the following Boolean Expressions using De Morgans Theorem

Example
Use DeMorgan’s Theorems to simplify the following expressions
Digital Logic Gates

• Commercially available digital logic gates are available in two basic

families or forms, TTL which stands for Transistor Logic such as the
7400 series, and CMOS which stands for Complementary Metal-
Oxide-Silicon which is the 4000 series of chips.
Digital Logic Gates

• This notation of TTL or CMOS refers to the logic technology used to

manufacture the integrated circuit, (IC) or a “chip” as it is more
commonly called.
• Generally speaking, TTL logic IC’s use NPN and PNP type Bipolar
Junction Transistors while CMOS logic IC’s use complementary
MOSFET or JFET type Field Effect Transistors for both their input and
output circuitry.
Types of Logical Gates

• AND Gate
• OR Gate
• NOT Gate
• NANAD Gate
• NOR Gate
• XOR Gate
• XNOR Gate
AND Gate

• y is only TRUE only if a is TRUE and b is TRUE

• In Boolean algebra AND is represented by a dot .
AND Gate
• The Logic AND Gate is a type of digital logic circuit whose output
goes HIGH to a logic level 1 only when all of its inputs are HIGH
AND Gate
• Commonly available digital logic AND gate IC’s include:
TTL Logic AND Gate
74LS08 Quad 2-input
74LS11 Triple 3-input
74LS21 Dual 4-input
CMOS Logic AND Gate
CD4081 Quad 2-input
CD4073 Triple 3-input
CD4082 Dual 4-input
OR Gate

• y is TRUE if a is TRUE or b is TRUE (or both)

• In Boolean algebra OR is represented by a plus sign
OR Gate
• The Logic OR Gate is a type of digital logic circuit whose output
goes HIGH to a logic level 1 only when one or more of its inputs
are HIGH
NOT Gate
• The Logic NOT Gate is the most basic of all the logical gates and is
often referred to as an Inverting Buffer or simply an Inverter.
• Inverting NOT gates are single input devices which have an output
level that is normally at logic level “1” and goes “LOW” to a logic
level “0” when its single input is at logic level “1”, in other words
it “inverts” (complements) its input signal.
NOT Gate
NAND Gate
• The Logic NAND Gate is a combination of a digital logic AND gate
and a NOT gate connected together in series
• Universal Gate.
NOR Gate
• The Logic NOR Gate is a combination of the digital logic OR gate and
an inverter or NOT gate connected together in series
• Universal Gate
XOR
• Exclusive-OR gate ONLY goes “HIGH” when both of its two input
terminals are at “DIFFERENT” logic levels with respect to each other. If
these two inputs, A and B are both at logic level “1” or both at logic
level “0” the output is a “0”
XNOR Gate
• The Exclusive-NOR Gate function is a digital logic gate that is the
reverse or complementary form of the Exclusive-OR function
Example simplification
Example simplification
Example simplification
 Boolean Functions
• Algebraic expression consisting of;
• Binary values,
• Constants 0 and 1,
• Logic operation symbols

• Example:
Boolean Functions
Boolean Functions
Boolean Functions
Boolean Functions
Minterms and Maxterms
 Minterms and Maxterms
• Example
 Minterms and Maxterms
• Example – as a sum of Minterms
 Minterms and Maxterms
• Example – as a product of Maxterms

...

..
Minterms and Maxterms
Example
• What are the minterms and maxterms of ?
 Standard Form
• Results in a two-level structure of gates
• Sum of Products
• Product of Sums

• Example:
 Standard Form
• Example:
 Standard Form
• Example: and
 Exercises
1. Convert the following logic gate circuit into a Boolean expression,
writing Boolean sub-expressions next to each gate output in the
diagram:
 Exercises
2. Convert the following logic gate circuit into a Boolean expression,
writing Boolean sub-expressions next to each gate output in the
diagram:
 Exercises
3. Convert the following logic gate circuit into a Boolean expression,
writing Boolean sub-expressions next to each gate output in the
diagram:
 Exercises
4. Following Boolean expression is written down on a paper and
handed over to you, to build a gate circuit:

Draw a logic gate circuit for this function

 Exercises
5. Implement the following Boolean expression in the form of a digital
logic circuit:

Form the circuit by making the necessary connections between the pins
of 74LS37 integrated circuits (IC’s)
Example
6. For the logic circuit below complete the truth table and find the
Boolean expressions
Example
 Question 1
• Implement NOT, AND, OR operations using:
• NAND gates only
• NOR gates only
Implementation of Gates Using NANAD
Gate