DIGITAL ELECTRONICS

Chapter 3: Logic gates

1. Basic gates – NOT, OR, AND, NAND, NOR, Exclusive-OR and Exclusive-
NOR.
2. Gate symbols, truth tables and Boolean operations.
3. Boolean algebra: derivation of Boolean expression from logic circuits and
vice versa.
4. Simplification of logic circuits using Boolean algebra
5. Conversion of AND-OR circuits to NAND-NAND and NOR-NOR.
6. SOP and POS representations of Boolean functions, minterm, maxterm
and De-Morgan equivalent circuits

(STB24403 Digital Electronics)

 Introduction
Logic is way of telling if a certain statement is true if certain conditions is true.

If water level is high and temperature is high, then it is dangerous.

If stomach is hungry and class is boring, then you are sleepy

Logic functions/statements are represented using Boolean algebra which consists

of one/several basic logic operations.

Logic operations are done by logic gates (AND, OR and NOT).

Dr. Mohamad Fadzli Bin Haniff (STB24403 Digital Electronics)

The NOT Gate

Perform Boolean operation inversion @ complementation

Single input (left terminal) with single output (right terminal)

Input Boolean operation Output

A A
0 0 1
1 1 0

(STB24403 Digital Electronics)

 The NOT Gate
Operation with waveform inputs

Applications: Finding the 1’s complement of binary number

(STB24403 Digital Electronics)

 The AND Gate

Perform Boolean operation multiplication

Two or more inputs (left terminals) with single output (right terminal)

Input Input Boolean operation Output

A B A.B
0 0 0.0 0
0 1 0.1 0
1 0 1.0 0
1 1 1.1 1

(STB24403 Digital Electronics)

The AND Gate
Operation with waveform inputs

(STB24403 Digital Electronics)

 The AND Gate
Applications: Timer enable frequency counter
When the 1 second timer is on, the AND gate will let pulses from A pass through.
Counter count the pulses.
If 6 pulse passed through, the signal A frequency 6x(1/1s) = 6Hz.

(STB24403 Digital Electronics)

 The OR Gate

Perform Boolean operation addition

Two or more inputs (left terminals) with single output (right terminal)

Input Input Boolean operation Output

A B A+B
0 0 0+0 0
0 1 0+1 1
1 0 1+0 1
1 1 1+1 1

(STB24403 Digital Electronics)

The OR Gate
Operation with waveform inputs

(STB24403 Digital Electronics)

 The OR Gate
Applications: Security system
When any of the windows
and doors are opened, the
OR gate will produce a HIGH
output to trigger the alarm
circuit

(STB24403 Digital Electronics)

 The NAND Gate

Perform Boolean operation NOT, AND and OR

Two or more inputs (left terminals) with single output (right terminal)

Input Input Boolean operation Output

A B A.B
0 0 0.0 1
0 1 0.1 1
1 0 1.0 1
1 1 1.1 0

(STB24403 Digital Electronics)

The NAND Gate
Operation with waveform inputs

(STB24403 Digital Electronics)

The NAND Gate
Another symbols for NAND

𝑨. 𝑩 ≡ 𝑨 + 𝑩

(STB24403 Digital Electronics)

 The NAND Gate
4 inputs NAND gate

NAND gate only produce LOW output when ALL inputs are HIGH

(STB24403 Digital Electronics)

 The NAND Gate
Applications: Water tank level indicator

When both tank is still within acceptable When both tank is still within acceptable
level, the light turns on. level, the light turns off
When at least one of the tank is below When at least one of the tank is below
the acceptable level, the light turns off the acceptable level, the light turns on

(STB24403 Digital Electronics)

 The NOR Gate

Perform Boolean operation NOT, AND and OR

Two or more inputs (left terminals) with single output (right terminal)

Input Input Boolean operation Output

A B A+B
0 0 0+0 1
0 1 0+1 0
1 0 1+0 0
1 1 1+1 0

(STB24403 Digital Electronics)

The NOR Gate
Operation with waveform inputs

(STB24403 Digital Electronics)

The NOR Gate
Another symbol for NOR

𝑨 + 𝑩 ≡ 𝑨. 𝑩

(STB24403 Digital Electronics)

The NOR Gate
4 inputs NAND gate

NAND gate only produce HIGH output when ALL inputs are LOW

(STB24403 Digital Electronics)

 The NOR Gate
Applications: Aircraft functional monitoring system

RED light will only turn on when at GREEN light will only turn on when
least one of the gears is retracted all of the gears are extended

(STB24403 Digital Electronics)

Exclusive OR & Exclusive NOR
XOR and XNOR are gates formed by a combination of other basic gates (OR, AND, NOT)
𝑋𝑁𝑂𝑅 = 𝐴𝐵 + 𝐴𝐵 = 𝐴𝐵⊕𝐴𝐵

(STB24403 Digital Electronics)

Exclusive OR & Exclusive NOR
𝑋𝑁𝑂𝑅 = 𝐴𝐵 + 𝐴𝐵 = 𝐴𝐵 + 𝐴𝐵

(STB24403 Digital Electronics)

 Boolean Theorems
Logic operation can be representation by using Boolean
operations/expressions.

In Boolean, a variable (A, B, C, D..) is a symbol used to represent an

action, a condition or data.

A literal is a variable or the complement of the variable (𝐴 & 𝐴)

(STB24403 Digital Electronics)

Representation Of Boolean Expressions
Boolean Addition Boolean Multiplication
Sum Term Product term
𝐴+𝐵 𝐴𝐵
𝐴+𝐵+𝐶 𝐴𝐵𝐶

Equals to 1 when one or more of the Equals to 1 when all of the literals in
literals in the term is 1 the term is 1
Equals to 0 when all of the literals in Equals to 0 when one or more of the
the term is 0 literals in the term is 0

(STB24403 Digital Electronics)

Representation Of Boolean Expressions
Expressing a circuit in Boolean expression

𝑿 = 𝑨 + 𝑩 .𝑪 𝑿 = 𝑨. 𝑩 + 𝑪

𝑿 = 𝑨. 𝑩
(STB24403 Digital Electronics)
Representation Of Boolean Expressions
Construct truth table using Boolean expression.

𝑨(𝑩 + 𝑪𝑫)

When is 𝑨 𝑩 + 𝑪𝑫 = 𝟏? When is 𝑩 + 𝑪𝑫 = 𝟏 ?
𝐴=1 𝐵 = 1, 𝐶 = 𝐴𝑁𝑌, 𝐷 = 𝐴𝑁𝑌
& &
𝐵 + 𝐶𝐷 = 1 𝐵 = 0, 𝐶 = 1, 𝐷 = 1

(STB24403 Digital Electronics)

Representation Of Boolean Expressions
A B C D A(B+CD)
0 0 0 0 0
0 0 0 1 0 𝑨 𝑩 + 𝑪𝑫 = 𝟏
0
0
0
0
1
1
0
1
0
0
Only when
0 1 0 0 0 A=1
0
0
1
1
0
1
1
0
0
0
while
0 1 1 1 0 𝐵 = 1, 𝐶 = 𝐴𝑁𝑌, 𝐷 = 𝐴𝑁𝑌
1
1
0
0
0
0
0
1
0
0
And
1 0 1 0 0 𝐵 = 0, 𝐶 = 1, 𝐷 = 1
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

(STB24403 Digital Electronics)

 Boolean Theorems
Boolean Addition Boolean Multiplication
Sum Term Product term
𝐴+𝐵 𝐴𝐵
𝐴+𝐵+𝐶 𝐴𝐵𝐶
Equals to 1 when one or more of the Equals to 1 when all of the literals in
literals in the term is 1 the term is 1
Equals to 0 when all of the literals in Equals to 0 when one or more of the
the term is 0 literals in the term is 0

(STB24403 Digital Electronics)

Boolean Theorems
Boolean Laws Statement

Commutative 𝐴+𝐵 =𝐵+𝐴

𝐴𝐵 = 𝐵𝐴

Associative 𝐴 + (𝐵 + C) = (𝐴 + 𝐵) + 𝐶
𝐴(𝐵𝐶) = (𝐴𝐵)𝐶

Distribute 𝐴 𝐵 + C = 𝐴𝐵 + 𝐴𝐶

(STB24403 Digital Electronics)

 Boolean Theorems
No. Boolean Rules No. Boolean Rules
1 𝐴+0=𝐴 7 𝐴. 𝐴 = 𝐴
2 𝐴+1=1 8 𝐴. 𝐴 = 0
3 𝐴. 0 = 0 9 𝐴=𝐴
4 𝐴. 1 = 𝐴 10 𝐴 + 𝐴𝐵 = 𝐴
5 𝐴+𝐴=𝐴 11 𝐴 + 𝐴𝐵 = 𝐴 + 𝐵
6 𝐴+𝐴=1 12 𝐴 + 𝐵 𝐴 + 𝐶 = 𝐴 + 𝐵𝐶

(STB24403 Digital Electronics)

 Simplifying Logic Circuit
A logic expression can be reduced to its simplest form or changed to a
more convenient form to implement the expression most efficiently

By simplifying the logic expression, the logic circuit size also can be
reduced to the simpler form while still perform the same way as the
original

(STB24403 Digital Electronics)

Simplification Using Boolean Algebra
Simplify 𝑨𝑩 + 𝑨 𝑩 + 𝑪 + 𝑩 𝑩 + 𝑪

Use distributive law : 𝐴𝐵 + 𝐴𝐵 + 𝐴𝐶 + 𝐵𝐵 + 𝐵𝐶

Use rule 5 (𝐴𝐵 + 𝐴𝐵 = 𝐴𝐵) : 𝐴𝐵 + 𝐴𝐶 + 𝐵𝐵 + 𝐵𝐶
Use rule 7 (𝐵. 𝐵 = 𝐵) : 𝐴𝐵 + 𝐴𝐶 + 𝐵 + 𝐵𝐶
Use distributive law : 𝐵 𝐴 + 𝐶 + 1 + 𝐴𝐶
Use rule 2 (𝐴 + 𝐶 + 1 = 1) : 𝑩 + 𝑨𝑪

(STB24403 Digital Electronics)

Simplification Using Boolean Algebra
Simplify [𝑨𝑩 𝑪 + 𝑩𝑫 + 𝑨𝑩]𝑪

Use distributive law : (𝐴𝐵𝐶 + 𝐴𝐵𝐵𝐷 + 𝐴𝐵)𝐶

Use rule 8 (𝐵. 𝐵 = 0) : (𝐴𝐵𝐶 + 𝐴𝐷. 0 + 𝐴𝐵)𝐶
Use rule 3 (𝐴𝐷. 0 = 0) : (𝐴𝐵𝐶 + 𝐴𝐵)𝐶
Use distributive law : 𝐴𝐵𝐶𝐶 + 𝐴𝐵𝐶
Use rule 7 (𝐶. 𝐶 = 𝐶) : 𝐴𝐵𝐶 + 𝐴𝐵𝐶
Use distributive law : 𝐵𝐶(𝐴 + 𝐴)
Use rule 6 (𝐴 + 𝐴=1) : 𝑩𝑪

(STB24403 Digital Electronics)

Conversion of AND-OR circuits to NAND-
NAND and NOR-NOR.
Universal properties of NAND

(STB24403 Digital Electronics)

Conversion of AND-OR circuits to NAND-
NAND and NOR-NOR.
Universal properties of NOR

(STB24403 Digital Electronics)

Conversion of AND-OR circuits to NAND-
NAND and NOR-NOR.

NAND

NOR

(STB24403 Digital Electronics)

 SOP & POS
Sum of product (SOP) : The sum term consisting multiple product terms

Standard form of SOP must contain all the variable in each product terms @
minterm. If a product term is not complete with term 𝐶, it must be multiplied with
(𝐶 + 𝐶 )

𝐴𝐵 = 𝐴𝐵 𝐶 + 𝐶 = 𝐴𝐵𝐶 + 𝐴𝐵𝐶

(STB24403 Digital Electronics)

 SOP & POS
Product of sum (POS) : The product term consisting multiple sum terms

Standard form of POS must contain all the variable in each sum terms @ maxterm .
If a sum term is not complete with term 𝐶, it must be added with (𝐶𝐶 ), and apply
Boolean rule no 12.

𝐴 + 𝐵 = 𝐴 + 𝐵 + 𝐶𝐶 = (𝐴 + 𝐵 + 𝐶)(𝐴 + 𝐵 + 𝐶 )

(STB24403 Digital Electronics)

 DeMorgan Theorems
DeMorgan’s Theorem Equation
The complement of a product of
variables is equal to the sum of the 𝑋𝑌𝑍 = 𝑋 + 𝑌 + 𝑍
complements of the variables
The complement of a sum of
variables is equals to the product of 𝑋 + 𝑌 + 𝑍 = 𝑋𝑌𝑍
the compliments of the variable

𝐴 + 𝐵𝐶 + 𝐷(𝐸 + 𝐹 ) = (𝐴 + 𝐵𝐶 )(𝐷(𝐸 + 𝐹 ))

= (𝐴 + 𝐵𝐶 )(𝐷 + 𝐸 + 𝐹 )

= (𝐴 + 𝐵𝐶 )(𝐷 + 𝐸 + 𝐹 )

(STB24403 Digital Electronics)

DeMorgan Theorems

(STB24403 Digital Electronics)

 Simplification Using DeMorgan
Simplify 𝑨𝑩 + 𝑨𝑪 + 𝑨𝑩𝑪

Use DeMorgan 𝐴𝐵 + 𝐴𝐶 = (𝐴𝐵)(𝐴𝐶) : (𝐴𝐵)(𝐴𝐶) + 𝐴𝐵𝐶

Use DeMorgan 𝐴𝐵 = (𝐴 + 𝐵 ) , 𝐴𝐶 = (𝐴 + 𝐶 ) : (𝐴 + 𝐵)(𝐴 + 𝐶 ) + 𝐴𝐵 𝐶
Use distributive law : 𝐴 𝐴 + 𝐴𝐶 + 𝐴𝐵 + 𝐵 𝐶 + 𝐴 𝐵 𝐶
Use rule 7 𝐴. 𝐴 = 𝐴 : 𝐴 + 𝐴𝐶 + 𝐴𝐵 + 𝐵 𝐶 + 𝐴𝐵 𝐶
Use distributive law : 𝐴 1 + 𝐶 + 𝐵 + 𝐵𝐶 + 𝐵𝐶
Use rule 2 𝐶 + 𝐵 + 𝐵𝐶 + 1 = 1 : 𝑨 + 𝑩𝑪

(STB24403 Digital Electronics)