TOPIC 3: DIGITAL LOGIC DESIGN

TCS1063: COMPUTER ORGANIZATION & ARCHITECTURE

BOOLEAN ALGEBRA
• 2 situations or values, that is 0 and 1
• Some of the situations
Logic 0 Logic 1
False True
Off On
Low High
No Yes
Open Switch Close Switch
Rules in Boolean algebra

• Variable  only two values

• 1  TRUE
• 0  FALSE
• Complement  Represented by an overbar (-)
• Complement of B  B Bar or or B’
• If B = 0 then = 1 and B = 1 then = 0.
• Logical OR  Represented by a plus (+) sign
• Logical AND  Represented by a dot (.) sign
BOOLEAN OPERATORS
• 3 basic operations in Boolean algebra

• OR operation
Logic addition • symbol “ + ”

Logic • AND operation

multiplication • symbol “ . ”

Logic • NOT operation

complement • symbol “ - ”
OR Operator AND Operator

NOT Operator
 Truth Table
• Truth Table  A table that shows how circuit reaction for
all combinational input
• Left-hand side  input values
• Right-hand side  result for the circuit
• Number of possible input combination  2N
N - number of variables (integer)

2 variables 4 input combinations

3 variables 8 input combinations
4 variables 16 input combinations
 Based on gate or
operation

A
LOGIC GATE X
B

INPUT OUTPUT
ple
Exa
m
A B X (or F)
0 0 0
0 1 1
1 0 1
1 1 1
LOGIC GATES
• GATES  An electronic circuit
• Function: To perform AND, OR, NOT, NAND and
NOR operations
 OR GATE
• OR GATE operates logic addition operation
• Example: F(A,B) = A + B, so the output is F = A + B
A B X (or F) = A + B
0 0 0
0 1 1
1 0 1
1 1 1

X=A+B

B
 AND GATE
• AND GATE operates logic multiplication operation
• Example: F(A,B) = A·B or AB, so the output is
F=AB
A B X (or F) = A·B
0 0 0
0 1 0
1 0 0
1 1 1

A
X = A·B

B
 NOT FUNCTION
• NOT function represents the opposite situation
• It has one input and one output
• The output is inversion of the input entered
A X (or F) = Ā
0 1
1 0

A X=Ā
 NOR FUNCTION
• Combination of OR and NOT gate
A B A+B A+B
0 0 0 1
0 1 1 0
1 0 1 0
1 1 1 0

X=A+B

B
 NAND FUNCTION
• A combination of AND gate and NOT gate

A B X (or F) = A·B A·B

0 0 0 1
0 1 0 1
1 0 0 1
1 1 1 0

A
X = A·B

B
 EXCLUSIVE-OR (XOR) FUNCTION
• Symbol for exclusive-or is 
• Output is TRUE if there are different value of
combination input A B X=AB
0 0 0
0 1 1
1 0 1
1 1 0

X=AB

B
 EXCLUSIVE-NOR (XNOR) FUNCTION
• Symbol for exclusive-nor (XNOR) is  or 
• Output is TRUE if there are same value of
combination input
Since XNOR is complement for XOR
A B X=AB
so, 0 0 1
____ 0 1 0
• XNOR = XOR
____ __ 1 0 0
• A  B = AB @ AB+AB 1 1 1

X=AB

B
 COMBINATIONAL CIRCUIT

Interconnected set of gates

Combinational circuit

To develop a circuit (IC or

Usage
main board)

The possible combinations

Truth table of input signals with its
output

Can be defined in three The interconnected layout

Graphical symbols
ways: of gates

Each output signal is

Boolean expression expressed as a Boolean
function
• Complex Circuit
Example 1 : Find the Boolean expression and truth table for the
circuit below
 A·B
_
A·B + B·C
_ _
B B·C

Boolean Expression
_
X = A·B + B·C
  
Truth table 

   
A B C A·B B’ B’·C X = A·B + B’·C
0 0 0 0 1 0 0
0 0 1 0 1 1 1
0 1 0 0 0 0 0
0 1 1 0 0 0 0
1 0 0
0 1 0 0
1 0 1
1 1 0 0 1 1 1
1 1 1 1 0 0 1
1 0 0 1
Example 2 : Draw the circuit and develop a truth table X=A·B +
A·C A·B + A·C
 

A A·B
B X=A·B + A·C

C A·C
 



  
A B C A·B A·C Q = A·B + A·C
0 0 0 0 0 0
0 0 1 0 0 0
0 1 0 0 0 0
0 1 1 0 0 0
1 0 0 0 0 0
1 0 1 0 1 1
1 1 0 1 0 1
1 1 1 1 1 1
 KARNAUGH MAP ( K–MAP )
• Karnaugh map (K-map)
• A pictorial method used to minimize Boolean expressions
 • Steps involve:

Plot the Boolean expression in the K-map

Plot 1 on the map

Grouping the 1’s

Draw loops around adjacent 1’s , group of 2 at least, the loops may overlaps

Eliminate the variable that can be cancelled to form the simplified expression
Plot into K-Map
TRUTH TABLE K-MAP
A B X 2 variables
4 boxes
0 0 0
0 1 1 A’ A
1 0 1 B’
1 1 1 0 1
B 1 1
K-MAP
3 variables
8 boxes
 A B C X
0 0 0 0 A’B’C’
0 0 1 0 A’B’C
0 1 0 1 A’BC’
0 1 1 1 A’BC
1 0 0 0 AB’C’
1 0 1 0 AB’C
1 1 0 1 ABC’
1 1 1 1 ABC

A’B’ A’B AB AB’

C’ 0 1 1 0
C 0 1 1 0
• Plot AB + AB’
A’ A
B’ 0 1
B 0 1
• Plot
     
ABC + AB’C + A’BC + A’BC’ + A’B’C’ + A’B’C

A’B’ A’B AB AB’

C’ 1 1 0 0
C
1 1 1 1
Rules in grouping

• Groups NOT include any cell containing a zero

• Groups may be horizontal or vertical, but NOT diagonal

• Groups must contain 1, 2, 4, 8, or in general 2n cells
• Groups may overlap
• Groups may wrap around the table. The leftmost cell in a
row may be grouped with the rightmost cell and the top
cell in a column may be grouped with the bottom cell
Example 2 variables
• Example 1: AB + AB’

A’ A
B’ 0 1
B 0 1

AB
A
AB’

So, AB + AB’ = A
• Example 2 : AB + A’B + A’B’
A’ A
B’ 1 0
B 1 1

A’B’
GROUP 1 A’
A’B
A’B
GROUP 2 B
AB
So, AB + A’B + A’B’ = A’ + B
• Example 3: Simplify the logic diagram below.
Solution:
X = A’B + AB’ + AB
A’ A
B’ 0 1
B 1 1

AB’
GROUP 1 A
AB
A’B
GROUP 2 B
AB
So, A’B + AB’ + AB = A + B
Example 3 variables
• Example 1: ABC + AB’C + A’BC + A’BC’ + A’B’C’ + A’B’C

A’B’ A’B AB AB’

C’ 1 1 0 0
C 1 1 1 1

GROUP 1
A’B’C’ GROUP 2
A’B’C
A’BC’ A’BC
A’B’C A’ ABC C
A’BC AB’C
So, ABC + AB’C + A’BC + A’BC’ + A’B’C’ + A’B’C = A’ + C
• Example 2: A’B’C’ + A’B’C + AB’C + A’BC’ + AB’C’ + ABC’
A’B’ A’B AB AB’
C’ 1 1 1 1
C 1 0 0 1

A’B’C’ GROUP 2
A’B’C’
GROUP 1
A’BC’ A’B’C
C’ B’
ABC’ AB’C’
AB’C’ AB’C

So, A’B’C’ + A’B’C + AB’C + A’BC’ + AB’C’ + ABC’ = B’ + C’

 ABC
ABC’
• Example 3 : A + A’BC + AB’C’ AB’C
AB’C’
A’B’ A’B AB AB’
Omitted
C’ 0 0 1 1 because has
existed in
C 0 1 1 1 expression

ABC’ A’BC
GROUP 1 GROUP 2 BC
AB’C’ ABC
A
ABC
AB’C

So, A + A’BC + AB’C’ = A + BC

SEQUENTIAL CIRCUIT
• Sequential circuit  Circuit that has capability to
memorize and store past event
• It has an output at one time, which is depends to
current input and previous input
• Types of sequential diagram

Synchronous Asynchronous
• Changes happen at a • No general control in
decided time by a this system
general signal control • Changes in output
• If there is a clock happen when input
pulse, changes will changes
happen