Scribd
Upload
59 views

Module 3 - Ckt-Expr Analysis-Sop-Pos

This document discusses analyzing combinational logic circuits by obtaining truth tables and Boolean expressions. It covers: 1. Deriving a truth table from a logic circuit diagram by assigning variables and obtaining the output values. 2. Obtaining the Boolean expression from the truth table by replacing variables according to gate operations. 3. Expressing functions as sums of minterms or products of maxterms, and implementing the expressions using AND-OR or OR-AND networks respectively.

Uploaded by

Main axieinfinity
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
59 views

Module 3 - Ckt-Expr Analysis-Sop-Pos

This document discusses analyzing combinational logic circuits by obtaining truth tables and Boolean expressions. It covers: 1. Deriving a truth table from a logic circuit diagram by assigning variables and obtaining the output values. 2. Obtaining the Boolean expression from the truth table by replacing variables according to gate operations. 3. Expressing functions as sums of minterms or products of maxterms, and implementing the expressions using AND-OR or OR-AND networks respectively.

Uploaded by

Main axieinfinity
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 35

Digital Logic Circuits

for IT (CPE102)

Module 4
Combinational Circuit Analysis, Boolean Expression Analysis,
SOP Expression and POS Expression
Combinational Circuit Analysis:
Module Objectives:

- Analyze a given combinational circuit

- Obtain truth table from the logic circuit

- Derive the Boolean Expression from the


logic circuit
Combinational Circuit Analysis:
Introduction

Characterization of the combination circuit:

- input – circuit schematic diagram

- output – circuit operation (truth table or Boolean


expression)
Logic Circuit:
Diagram
Types of Logic Circuits:

Combinational Circuit

- Its outputs at any time are determined by the present combination


of inputs without regard to previous values of the input

- It is basically composed of logic gates.


Obtaining the truth table from the
Logic Circuit:
Steps:

- Assign variables to the input and output.

- Assign temporary variables to the output of each logic gate


whose inputs have all been labeled. Use subscripted T, starting
from T1.

- Repeat previous step until all logic gates have been assigned
output variables.
Obtaining the truth table from the
Logic Circuit:
Steps - continuation

- Derive the Boolean expression for each of the temporary variables


according to gate operation.

- Set up truth table with temporary variables, in increasing subscript


sequence, between the input and output columns.
Obtaining the truth table from the
Logic Circuit:
Steps – continuation

- Fill-up temporary variable columns in increasing subscript


sequence. This is made possible due to the sequence
followed in assigning the temporary variables.

- Get values for each output variable.


Obtaining the truth table from the
Logic Circuit:
Example 1:
Obtaining the truth table from the
Logic Circuit:

Continuation
Obtaining the truth table from the
Logic Circuit:
Example 2:
Obtaining the truth table from the
Logic Circuit:

Continuation
Obtaining the truth table from the
Logic Circuit:
Example 3:
Obtaining the truth table from the
Logic Circuit:
Continuation
Truth Table Short - Cuts:

Introduction

- It is easier to operate on one variable /


operand at a time.

- These can easily be extended to multiple


variables.
Truth Table Short - Cuts:
AND
– output is 0 if at least one input is 0

1. Copy all 0 from 1st operand to output.


2. Copy unassigned from 2nd operand.

OR – output is 1 if at least one input is 1

1. Copy all 1 from 1st operand to output.


2. Copy unassigned from 2nd operand.
Truth Table Short - Cuts:
NAND
– inverse of AND

1. Invert all 0 from 1st operand to output.


2. Invert unassigned from 2nd operand.

NOR
– inverse of OR

1. Invert all 1 from 1st operand to output.


2. Invert unassigned from 2nd operand.
Truth Table Short - Cuts:

XOR – 0 if equal

NOR – 1 if equal
Obtaining the Boolean Expression from
Logic Circuit:
Steps 1 to 4 are the same as when obtaining the
truth table.

5. From T1, replace temporary variables in each


expression with corresponding expressions involving only the input variables.

6. Get expression for each output variable.

7. Simplify expression.
Obtaining the Boolean Expression from
Logic Circuit:
Obtaining the Boolean Expression from
Logic Circuit:
Obtaining the Boolean Expression from
Logic Circuit:
Boolean Expression Analysis
Module Objectives:
1.analyze a given Boolean expression
2.2. obtain the truth table from the Boolean expression
3. design the logic circuit from the Boolean expression
Obtaining the Truth Table from the Boolean Expression
•Easier to work with notation using prime and dot.
•Create truth table with space for column under each operator.
•Identify operator according to precedence rule.
•List operator result under corresponding operator in table.
Examples
1. 2.
Practice Problems
1. Derive the Boolean expressions and truth tables of the
following combinational circuits:
Practice Problems
2. Construct the truth tables and logic circuits for the
following Boolean expressions:
Practice Problems
2. Construct the truth tables and logic circuits for the
following Boolean expressions:
Standard Product Terms (Minterms)
Module Objectives:
1. define the term minterm
2. express a function as a sum of minterms
3. implement SOP expression using AND-OR network
Definition of Terms
•A literal is the appearance of a variable or its complement.
•A product term is one or more literals connected by AND
operators.
•A standard product term, also minterm is a product term
that includes each variable of the problem, either
uncomplemented or complemented.
•A sum of products expression (often abbreviated as
SOP) is one or more product terms connected by OR
operators.
Standard Product Terms (Minterms)
•There are 2n possible minterms per n-variable function.

Example: Given two input variables, X and Y, the four


minterms are:

•Each minterm corresponds to a


row in the truth table.
•Each minterm is labeled in the
form mj, where j is the decimal
equivalent of the binary number
of the minterm designated.
Standard Product Terms (Minterms)
•Any function can be expressed as a sum of minterms.
•Sum of minterm notation – list of minterms comprising the
function
Example:
Derive the Boolean expression for the following truth table.
Solution
•We need 4 three-input AND
gates and 1 four-input OR gate
to implement the given truth
table.
•It is normally assumed that the
complement of each variable is
always available.

The Boolean expression is


obtained by getting the sum of the
minterms.
STANDARD SUM TERMS (MAXTERMS)
Module Objectives:
1.define the term maxterm
2.express a function as a product of maxterms
3. implement POS expression using OR-AND network
Definition of Terms
•A sum term is one or more literals connected by OR
operators.
•A standard sum term, also called a maxterm, is a sum
term that includes each variable of the problem, either
uncomplemented or complemented.
•A product of sums expression (POS) is one or more sum
terms connected by AND operators.
STANDARD SUM TERMS (MAXTERMS)
•There are 2n possible minterms per n-variable function.

Example: Given two input variables, X and Y, the four


maxterms are:

•Each maxterm corresponds to a


row in the truth table.
•Each maxterm is labeled in the
form Mj, where j is the decimal
equivalent of the binary number
of the maxterm designated.
STANDARD SUM TERMS (MAXTERMS)
•Any function can be expressed as a product of maxterms.
•Product of maxterm notation – list of maxterms comprising the
function
Example:
Derive the Boolean expression for the following truth table.
Solution
•We need 4 three-input OR
gates and 1 four-input AND
gate to implement the given
truth table.
•It is normally assumed that
the complement of each
variable is always available.

•The Boolean expression is


obtained by getting the product of
the maxterms.

You might also like