1 lecture 12 more about combinational analysis and design procedures

Lecture 12More about Combinational Analysis and

Design Procedures

Logic Circuit Analysis

Analysis:

Determining the behavior of a system given its description.

The description of the system is often provided

in the form of a circuit diagram.

Logic Circuit Analysiso For two-level circuits, the analysis process is simple.

o The Boolean expression representing the circuit can often be written by inspection.

For multilevel circuits, the analysis process is much more complicated.

Cannot write a Boolean expression by inspection. Must follow a procedure to implement the analysis.

1. Identify inputs and outputs

2. Track circuit behavior from input to output

3. Determine Boolean expression for output(s)

4. Determine Truth Table

5. Examine circuit timing, power dissipation, etc.

P 6 P 8

Verification - Circuit Analysis

° Circuit analysis involves figuring out what some circuit does

• Every circuit computes some function, which can be described with

Boolean expressions or truth tables

• So, the goal is to find an expression or truth table for the circuit

° The first thing to do is to figure out what the inputs and outputs of the overall circuit are

Inputs: x, y,z

Output: f

Symbolic Analysis

° We start with the circuit diagram• We determine gate output expressions

• Intermediate expressions are combined in following gates to form complex expressions

- It might help to do some algebraic simplification along the way

• We repeat until we have the output function and expression

° Symbolic analysis gives both the truth table and logic expression

Literal Analysis° Literal analysis is process of manually assigning a set

of values to the inputs, tracing the results, and recording the output values

• For ‘n’ inputs there are 2n possible input combinations

• From input values, gate outputs are evaluated to form next set of gate inputs

• Evaluation continues until gate outputs are circuit outputs

° Literal analysis only gives us the truth table

° Once you know the number of inputs and outputs, list all the possible input combinations in your truth table

• A circuit with n inputs should have a truth table with 2n rows

x y z f0 0 00 0 10 1 00 1 11 0 01 0 11 1 01 1 1

Literal Analysis

° You can simulate the circuit by hand to find the output for each possible combination of inputs

x y z f

0 0 00 0 10 1 00 1 11 0 01 0 1 11 1 01 1 1

Literal Analysis

° Doing the same thing for all the other input combinations yields the complete truth table

° This is simple, but tedious

x y z f

0 0 0 00 0 1 10 1 0 10 1 1 01 0 0 01 0 1 11 1 0 01 1 1 1

Circuit Analysis

° Remember that if you already have a Boolean expression, you can use that to easily make a truth table

° For example, since we already found that the circuit computes the function

f(x,y,z) = xz + y’z + x’yz’, we can use that to fill in a table:

x y z xz y’z x’yz’ f

0 0 0 0 0 0 00 0 1 0 1 0 10 1 0 0 0 1 10 1 1 0 0 0 01 0 0 0 0 0 01 0 1 1 1 0 11 1 0 0 0 0 01 1 1 1 0 0 1

Circuit Analysis

x y z f

0 0 0 00 0 1 10 1 0 10 1 1 01 0 0 01 0 1 11 1 0 01 1 1 1

° The opposite is also true: it’s easy to come up with an expression if you already have a truth table

° Convert a truth table into a sum of minterms expressionfor example

° You can then simplify this sum of minterms if desired using a K-map,

f(x,y,z) = x’y’z + x’yz’ + xy’z + xyz

= m1 + m2 + m5 + m7

Truth Table → Equation

° Analyze the logic circuit shown below to determine the circuit’s truth-table. Using the truth table, derive the logic expression for the output F1.

Did you analyze the circuit BEFORE you turned the

power on?

a) Add test-points at the output of every gate.TP1

TP4TP5The Process

a) Add test-points at the output of every gate.

b) Add a column to the truth table for every test-point.

c) Working from the inputs to the output, complete the truth table for each test-point, ultimately ending at the circuit’s output.

d) From the completed truth table, identify the Minterms from the truth table anywhere the output is one.

e) Using the extracted Minterms, write the Sum-Of-Products logic expression.

Steps (a)

b) Add a column to the truth table for every test-point.

c) Working from the inputs to the output, complete the truth table for each test-point, ultimately ending at the circuit’s output.

Steps (b) & (c)

X Y Z F1 TP1 TP2 TP3 TP4 TP5

0 0 0 0 1 0 0 1 0

0 0 1 0 1 0 0 1 0

0 1 0 0 1 1 0 0 0

0 1 1 1 1 1 1 0 0

1 0 0 1 0 0 0 1 1

1 0 1 1 0 0 0 1 1

1 1 0 0 0 0 0 0 0

1 1 1 0 0 0 0 0 0

The Processa) Add test-points at the output of

every gate.b) Add a column to the truth table for

every test-point.c) Working from the inputs to the

output, complete the truth table for each test-point, ultimately ending at the circuit’s output.

Steps (d) & (e)

Z Y XZ Y X Z Y XF 1

X Y Z F1 TP1 TP2 TP3 TP4 TP5

0 0 0 0 1 0 0 1 0

0 0 1 0 1 0 0 1 0

0 1 0 0 1 1 0 0 0

0 1 1 1 1 1 1 0 0

1 0 0 1 0 0 0 1 1

1 0 1 1 0 0 0 1 1

1 1 0 0 0 0 0 0 0

1 1 1 0 0 0 0 0 0

Example #1: Circuit Analysis

Example

Analyze the logic circuit shown below to determine the circuit’s truth table. Using the truth table, derive the logic expression for the output F2.

Z Y XZ Y X Z Y XF2

Solutiona)

b) & c)

TP1TP2 TP3

e)A B C F2 TP1 TP2 TP3 TP4 TP5

0 0 0 0 1 0 0 1 0

0 0 1 0 1 0 0 0 0

0 1 0 1 1 1 0 1 1

0 1 1 1 1 1 1 0 0

1 0 0 0 0 0 0 1 0

1 0 1 0 0 0 0 0 0

1 1 0 1 0 0 0 1 1

1 1 1 0 0 0 0 0 0

The Process

a) Working from the inputs to the output, write the cumulating logic expression at the output of each gate concluding with the expression for the circuit’s output.

b) Using the circuit’s output logic expression, derive the circuit’s truth table.

Equation → Truth Table Technique

Analyze the logic circuit shown below to determine the logic expression for the output F1. Using the logic expression, derive the circuit’s truth table.

a) Working from the inputs to the output, write the cumulating logic expression at the output of each gate concluding with the expression for the circuit’s output.

Step (a)

Y X Z Y X

The Processa) Add test-points at the output of every gate.b) Add a column to the truth table for every test-

point.c) Working from the inputs to the output,

complete the truth table for each test-point, ultimately ending at the circuit’s output.

b) Using the circuit’s output logic expression, derive the circuit’s truth table.

Step (b)

X Y Z F1

0 0 0 0

0 0 1 0

0 1 0 0

0 1 1 1

1 0 0 1

1 0 1 1

1 1 0 0

1 1 1 0

Y X Z Y XF 1 The Process

a) Add test-points at the output of every gate.b) Add a column to the truth table for every test-

point.c) Working from the inputs to the output,

complete the truth table for each test-point, ultimately ending at the circuit’s output.

Example

Analyze the logic circuit shown below to determine the logic expression for the output F2. Using the logic expression, derive the circuit’s truth table.

A B C F2

0 0 0 0

0 0 1 0

0 1 0 1

0 1 1 1

1 0 0 0

1 0 1 0

1 1 0 1

1 1 1 0

B AC B A C B C B A

C B C B AF 2

Solution

C B A C B

Circuit Analysis Summary

° After finding the circuit inputs and outputs, you can come up with either an expression or a truth table to describe what the circuit does

° You can easily convert between expressions and truth tables

° The analysis and synthesis tools presented are sometimes based on the fundamental concepts of Boolean algebra

Find the circuit’sinputs and outputs

Find a Booleanexpression

for the circuit

Find a truth tablefor the circuit

Analysis versus Design

° Design of a circuit starts with specification and ends up with a logic diagram.

° Analysis for a combinational circuit consists of determining the function that the circuit implements with:

A set of Boolean functions orA truth table, together with a possible

explanation of the operation of the circuit.We can perform the analysis by manually

finding the Boolean equations or truth table.

oThe first step in the analysis is to make sure that the given circuit is combinational and not sequential (i.e. no feedback or storage elements).

Digital Design Overview

° Design digital circuit from specification

° Digital inputs and outputs known• Need to determine logic that can transform data

° Start in truth table form

° Create K-map for each output based on function of inputs

° Determine minimized sum-of-product representation

° Draw circuit diagram

Design Procedure (Mano)

Design a circuit from a specification.

1. Determine number of required inputs and outputs.

2. Derive truth table

3. Obtain simplified Boolean functions

4. Draw logic diagram and verify correctnessA00001111

B00110011

C01010101

R00000001

S01111111

S = A + B + CR = ABC

Combinational logic design

° Use multiple representations of logic functions

° Use graphical representation to assist in simplification of function.

° Use concept of “don’t care” conditions.

° Example - encoding BCD to seven segment display.

° Similar to approach used by designers in the field.

BCD to Seven Segment Display

° Used to display binary coded decimal (BCD) numbers using seven illuminated segments.

° BCD uses 0’s and 1’s to represent decimal digits 0 - 9. Need four bits to represent required 10 digits.

° Binary coded decimal (BCD) represents each decimal digit with four bits

4. Draw logic diagram and verify correctness

BCD to seven segment display

0 a,b,c,d,e,f1 b,c2 a,b,d,e,g3 a,b,c,d,g4 b,c,f,g5 a,c,d,f,g6 a,c,d,e,f,g7 a,b,c8 a,b,c,d,e,f,g9 a,b,c,d,f,g

° List the segments that should be illuminated for each digit. Design a circuit from a

specification.

.0111110019

.1111100018

.0011111107

.1101101002

.0011010001

.1111100000

.edcbazyxwDec

° Derive the truth table for the circuit.

° Each output column in one circuit.

Inputs Outputs

10110100

For segment “a” :

Note: Have only filled in ten squares, corresponding to the ten numerical digits we wish to represent.

° Find minimal sum-of-products representation for each output

Don’t care conditions (BCD display) ...

1 1 X X

X X X X

10110100

Put in “X” (don’t care), and interpret as either 1 or 0 as desired ….

° Fill in don’t cares for undefined outputs.• Note that these combinations of inputs should never happen.

° Leads to a reduced implementationDesign a circuit from a

specification.

yFa1 1 0

1 1 X X

X X X X

10110100

° Circle biggest group of 1’s and Don’t Cares.

° Leads to a reduced implementation

Don’t care conditions (BCD display)

wFa2 1 0

1 1 X X

X X X X

10110100

° Leads to a reduced implementationDesign a circuit from a

specification.

1 1 X X

X X X X

10110100

1 1 X X

X X X X

10110100

° All 1’s should be covered by at least one implicant

xzzxwyF 1 0

1 1 X X

X X X X

10110100

° Put all the terms together

° Generate the circuit

.0111110019

.1111100018

.0011111107

.1101101002

.0011010001

.1111100000

.edcbazyxwDec

° Derive the truth table for the circuit.

° Each output column in one circuit.

Inputs Outputs

10110100

For segment “b” :

° Find minimal sum-of-products representation for each output

10110100

X X X X

10110100

X X X X

10110100

X X X X

10110100

X X X X

10110100

X X X X

Analysis versus Design

° Design of a circuit starts with specification and ends up with a logic diagram.

° Analysis for a combinational circuit consists of determining the function that the circuit implements with:

A set of Boolean functions orA truth table, together with a possible

explanation of the operation of the circuit.We can perform the analysis by manually

finding the Boolean equations or truth table.

oThe first step in the analysis is to make sure that the given circuit is combinational and not sequential (i.e. no feedback or storage elements).

Multilevel Logic Circuits

A two-level logic circuit is usually efficient for Boolean expressions of a few variables.

However, as the number of inputs increases, a two-level logic circuit may result in fan-in problems.

Fan-in refers to the number of inputs to a logic gate

Whether fan-in is an issue is dependent upon the technology used to implement the logic circuit.

Standard TTL and CMOS chips Field Programmable Gate Array (FPGA) Complex Programmable Logic Device (CPLD)

Example:

Realize the following Boolean expression using only 2-input AND gates and 2-input OR gates.

F(A,B,C) = m(0, 5, 6)

Often requires fewer logic gates than the logically equivalent two-level logic circuit.

Reduced (silicon) area Decreased cost

Requires less complex wiring between logic gates Fewer literals results in fewer interconnecting

Has a greater propagation delay than the logically equivalent two-level logic circuit.

Each additional level adds to the propagation delay

Decreased speed

Objectives:

1. Design logic circuits that meet the fan-in requirements of the chosen technology.

2. Design a minimum-cost logic circuit.

Two techniques that can be used to realize multilevel logic circuits:

1. Factoring

2. Functional Decomposition

Factoring

Example:

Realize a logic circuit that has a maximum fan-in of two for the following Boolean expression.

F(A..G) = ACF' + ADEF' + BCG + BDEG

Factoring

Example:

Design the minimum-cost logic circuit that implements the following Boolean expressions.

F1(A,B,C,D) = m(1,2,3,7,11,15)

F2(A,B,C,D) = M(0,1,2,3,4,8,12)

Functional Decomposition

Example:

Design a minimum-cost logic circuit to implement the following Boolean expression.

F(A,B,C,D) = A'BC + AB'C + ABD + A'B'D

NAND and NOR Circuits

As with two-level circuits, multilevel circuits can be realized using NAND or NOR gates only.

Example:

Realizing a NAND Circuit

x 6 x 7

x 5 x 6

Example:

Realizing a NOR Circuit

x 6 x 7

Combinational Logic Design Process

Step Description

Step 1 Capture the function

Create a truth table or equations, whichever is most natural for the given problem, to describe the desired behavior of the combinational logic.

Step 2 Convert to equations

This step is only necessary if you captured the function using a truth table instead of equations. Create an equation for each output by ORing all the miniterms for that output. Simplify the equations if desired.

Step 3 Implement as a gate-based circuit

For each output, create a circuit corresponding to the output’s equation. (Sharing gates among multiple outputs is OK optionally.)

Summary° Analysis and Design Procedures (Combinational)

° Important concept – analyze digital circuits• Given a circuit

- Create a truth table

- Create a minimized circuit

° Approaches• Boolean expression approach

• Truth table approach

° Both results can then be minimized using K-maps. (Leads to minimized hardware)-----------------------------------

° Need to formulate circuits from problem descriptions1.Determine number of inputs and outputs

2.Determine truth table format

3.Determine K-map

4.Determine minimal SOP

o There may be multiple outputs per designo Solve each output separately

1 lecture 12 more about combinational analysis and design procedures

Documents

lecture 15: combinational circuits

www...

1 combinational logic lecture #8. combinational logic 2...

1 ee121 john wakerly lecture #4 combinational-circuit...

lecture 4 combinational logic implementation technologies

lecture 2 - combinational and sequential logic

lecture no. 14 combinational functional devices...

3. lecture: combinational logic...

cse 140, lecture 2 combinational logic

lecture 3 inverters and combinational...

lecture 9: combinational circuit design. cmos vlsi...

fall 2005 l15: combinational circuits lecture 15:...

lecture 2 â€“ combinational circuits and verilog

lecture 2: combinational...

vlsi testing lecture 5: combinational atpg

ee108a lecture 2: combinational logic...

ee466: vlsi design lecture 8: combinational circuits

cs 140 lecture 14 standard combinational modules

lecture 2: combinational logic · lecture 2: combinational...

cse 140 lecture 12 combinational standard...