CHAPTER 6 |

DIGITAL ELECTRONICS
BTD1133 | Electrical and Electronics Technology
Nurul Wahidah Arshad
TOPICS
• Introduction
6.1

• Logic gates and operations

6.2

• Circuit Implementation
6.3

6.4 • Circuit simplification

LEARNING
OUTCOMES
Describe Write Apply

Describe the Write the Apply logic gate

operation and Boolean simplifications.
construct the expression for
truth tables for the logic gates
each logic and their
circuit. combinations.
6.1 INTRODUCTION
Digital Application?
Communication

Image
Processing
Business
Transactions
Digital
Application
Interne s
Traffic
t Control

Medical
Weather Treatment
Monitoring
Analog & Digital
Representations

Analog Digital
Representati Representati
on:
Analog on:
Digital
quantities can quantities
vary over a change in
continuous discrete steps.
range of values. Examples:
Examples: decimal digits Analog quantities have Digital quantities have
speed, on digital clock. continuous values discrete sets of values
temperature,
pressure.
Analog vs Digital

ANALOG DIGITAL
Noise and distortion Can be very immune to
problems noise
Precision is limited to three or Can handle as many digits of
four digits precision
Storage capability are limited Mass storage techniques
Can be programmed but limited
Programmability
variety and complexity
Usually simple Can be complex
List all the basic gate names that
you are familiar with.
IC
DIAGRAM
INSIDE IC

Plastic
Chip case

Pins
 DIGITAL SIGNAL
Typical voltage assignments in digital system and digital signal timing diagram (to
represent two binary states):
TRUTH TABLE
The truth table describes how a logic circuit’s
output depends on the logic levels present at
the circuit’s input.

The inputs consist of all possible combinations

of logic levels. For N number of inputs, the
total number of combinations is equal to 2N.

For 2-input circuit, there are 4 combinations of

input logic levels.

12
6.2 LOGIC
GATES &
OPERATIO
NS
INSIDE THE
LOGIC GATE
14
1. Inverter (NOT Gate)

• Performs on single I/O variable.

• Performs the operation called inversion or
complementation
2. OR Gate

• Composed of two or more inputs & single output.

• Performs logical addition.
• The output is HIGH (1) when at least one input is HIGH (1).

16
OR Gate
• Application: Intrusion detection & alarm system

17
3. AND Gate

• Composed of two or more inputs & single output.

• Performs logical multiplication.
• The output is HIGH (1) if only all inputs are HIGH (1).

18
AND Gate

Application: seat belt alarm system

19
 4. NOR Gate

• Produces HIGH(1) output only when all the inputs are

LOW(0).
• The output is the invert of OR output.

20
5. NAND Gate

• Produces LOW(0) output only when all the inputs are

HIGH(1).
• The output is the invert of AND output.

21
6. Exclusive-OR Gate (XOR)

• Has only 2 inputs.

• Opposite inputs make the output HIGH(1).

22
7. Exclusive-NOR Gate
(XNOR)

• Has only 2 inputs.

• Opposite inputs make the output LOW(0).

23
Exclusive-NOR Gate (XNOR)

Application: Magnitude comparator for two 4-bit numbers for equality.

A1
B1

A2
B2
Output
A3
B3

A4
B4

24
 Gate Symbol Function Truth
table

AND

OR

NOT

NAND

LOGIC GATES NOR

25 XOR

XNOR
Image Upload submission from Firdaus shah
6.3 CIRCUIT
IMPLEMENTATIO
N

27
Boolean Expression in Combinational Logic Circuit
• Write the Boolean Expression for each output from each gate in
order to make it easier to obtain the final output.
• Start from left to right.
• Example:

28
Circuit
Implementation

• We can draw a logic circuit diagram

directly from a Boolean expression
• Methods:
1. Determine the inputs
2. Determine which operation is
performed first
3. Insert appropriate logic gates
4. Draw the connections
between logic gates

29
Implementing Circuit from Boolean
Expressions
Which operation is performed first?
1. Parenthesis
2. NOT
3. AND
4. OR

X = A.B+C X = A.(B+C)
Perform A.B first Perform B+C first

30
Example A
X = A+B.C
B
C
A

Example B

31
Activity

Draw a logic circuit diagram for the following Boolean expressions:

32
6.4 CIRCUIT
SIMPLIFICATIO
N

33
SIMPLIFYING LOGIC CIRCUIT

• OBJECTIVE: reduce the logic circuit expression to a simpler form so

that fewer gates and connections are required to build the circuit

• Two methods for simplifying:

• Boolean algebra (use Boolean algebra theorems)
• Karnaugh map (systematic, step-by-step approach)
34
METHOD 1: ALGEBRAIC
SIMPLIFICATION
Make use of relationships and theorems to simplify
Boolean Expressions
• perform algebraic manipulation resulting in a complexity
reduction
• this method relies on your algebraic skill
METHOD 2: KARNAUGH MAP
• K-map is a grid of squares (cells).
• K-map simplification technique always results in
minimum expression and less error-prone compared to
the algebraic simplification.
35
Terms in Boolean Algebra:

• Boolean constants: 1 and 0.

• Variable: symbol used to represent a logical quantity
(eg,: A, B, C).
• Boolean theorems: rules and laws that must be followed
to apply Boolean algebra.
• Boolean algebra: mathematics of digital system
• Complement: inverse of a variable, eg.: complement of
variabla A is A’

36
Boolean Addition
• Equivalent to the OR operation.
• In logic circuits, a sum term is produced by an OR operation with no AND
operations involved.
• Sum term = 1 : when at least one of the input is 1.
• Examples of sum terms: A  B, A  B , A  B  C
0+0 = 0 0+1 = 1 1+0 = 1 1+1 = 1

Figure 8: Basic rules of Boolean addition

37
Boolean Multiplication

• Equivalent to AND operation

• In logic circuits, a product term (product of literals) is produced by an AND
operation with no OR operations involved
• Product term = 1: only if all literals in the term is 1.
• Examples of product terms:

AB, AB , ABC , A BCD

0.0 = 0 0.1 = 0 1.0 = 0 1.1 = 1

Figure 9: Basic rules of Boolean multiplication

38
Rules of Boolean Algebra
 Activity
Simplify each expression algebraically

1.

2.

3.
De Morgan’s Theorem

• Useful in simplifying expressions that included inversions.

• The objective of using this theorem in circuit design is to
minimize the number of ICs required in a logic circuit.

1.

2.

41
De Morgan’s First Theorem

A B (AB)’ A’+B’
0 0 1 1
0 1 1 1
1 0 1 1
1 1 0 0

42
De Morgan’s Second
Theorem

A B (A+B)’ A’B’
0 0 1 1
0 1 0 0
1 0 0 0
1 1 0 0

43
Activity 3

DEE1224
THANK YOU
• NURUL WAHIDAH
ARSHAD
• wahidah@[Link]

45