Transcript Chapter 3 - Computer Science | SIU

Chapter 3
Henry Hexmoor
Types of Logic Circuits
• Combinational logic circuits:
– Outputs depend only on its current inputs.
– A combinational circuit may contain an arbitrary number of logic gates and
inverters but no feedback loops.
• A feedback loop is a connection from the output of one gate to propagate
back into the input of that same gate
– The function of a combinational circuit represented by a logic diagram is
formally described using logic expressions and truth tables.
•
Sequential logic circuits:
– Outputs depend not only on the current inputs but also on the past sequences
of inputs.
– Sequential logic circuits contain combinational logic in addition to memory
elements formed with feedback loops.
– The behavior of sequential circuits is formally described with state transition
tables and diagrams.
Henry Hexmoor
1
• Combinational Circuit Analysis:
– Start with a logic diagram of the circuit.
– Proceed to a formal description of the function of the circuit using truth
tables or logic expressions.
• Combinational Circuit Synthesis:
– May start with an informal (possibly verbal) description of the function
performed.
– A formal description of the circuit function in terms of a truth table or logic
expression.
– The logic expression is manipulated using Boolean (or switching) algebra
and optimized to minimize the number of gates needed, or to use specific
type of gates.
– A logic diagram is generated based on the resulting logic expression.
Henry Hexmoor
2
Sequential Circuits
• The general structure of a sequential Circuit:
– Combinational logic + Memory Elements
Combinational
outputs
Memory outputs
Combinational
logic
Memory
elements
External inputs
Memory element: a device that can remember value indefinitely,
or change value on command from its inputs.
• Examples: latches and flip-flops
Henry Hexmoor
3
Combinational Circuits
• A combinational logic circuit has:
– A set of m Boolean inputs,
– A set of n Boolean outputs, and
– n switching functions, each mapping the 2m input combinations to
an output such that the current output depends only on the
current input values
• A block diagram:
Combinatorial
Logic
Circuit
m Boolean Inputs
Henry Hexmoor
n Boolean Outputs
4
Integrated Circuits (IC)
• Integrated circuit (informally, a “chip”) is a semiconductor
crystal (most often silicon) containing the electronic
components for the digital gates and storage elements
which are interconnected on the chip.
• Terminology - Levels of chip integration
–
–
–
–
SSI (small-scale integrated) - fewer than 10 gates
MSI (medium-scale integrated) - 10 to 100 gates
LSI (large-scale integrated) - 100 to thousands of gates
VLSI (very large-scale integrated) - thousands to 100s of millions
of gates
Henry Hexmoor
5
Hierarchical Design
• To control the complexity of the function mapping inputs to
outputs:
– Decompose the function into smaller pieces called blocks
– Decompose each block’s function into smaller blocks, repeating as
necessary until all blocks are small enough
– Any block not decomposed is called a primitive block
– The collection of all blocks including the decomposed ones is a
hierarchy
• Example: 9-input parity tree (see next slide)
–
–
–
–
–
Top Level: 9 inputs, one output
2nd Level: Four 3-bit odd parity trees in two levels
3rd Level: Two 2-bit exclusive-OR functions
Primitives: Four 2-input NAND gates
Design requires 4 X 2 X 4 = 32 2-input NAND gates
Henry Hexmoor
6
Hierarchy for Parity Tree Example
X0
X1
X2
X3
X4
X5
X6
X7
X8
9-Input
odd
function
ZO
(a) Symbol for circuit
X0
A0
X1
A1
X2
A2
X3
A0
3-Input
odd B O
function
X5
3-Input
A 1 odd B O
function
A2
X6
A0
X7
A1
X8
A2
X4
A0
A1
A2
3-Input
odd B
O
function
3-Input
odd B O
function
(b) Circuit as interconnected 3-input odd
function blocks
A0
A1
BO
A2
(c) 3-input odd function circuit as
interconnected exclusive-OR
blocks
Henry Hexmoor
(d) Exclusive-OR block as interconnected
7
NANDs
ZO
Reusable Functions and CAD
• Whenever possible, we try to decompose a complex
design into common, reusable function blocks
• These blocks are
– verified and well-documented
– placed in libraries for future use
• Representative Computer-Aided Design Tools:
–
–
–
–
Schematic Capture
Logic Simulators
Timing Verifiers
Hardware Description Languages
• Verilog and VHDL
– Logic Synthesizers
– Integrated Circuit Layout
Henry Hexmoor
8
Top-Down versus Bottom-Up Design
• A top-down design proceeds from an abstract, highlevel specification to a more and more detailed
design by decomposition and successive refinement
• A bottom-up design starts with detailed primitive
blocks and combines them into larger and more
complex functional blocks
• Designs usually proceed from both directions
simultaneously
– Top-down design answers: What are we building?
– Bottom-up design answers: How do we build it?
• Top-down controls complexity while bottom-up
focuses on the details
Henry Hexmoor
9
Technology Parameters
• Specific gate implementation technologies are
characterized by the following parameters:
– Fan-in – the number of inputs available on a gate
– Fan-out – the number of standard loads driven by a gate output
– Logic Levels – the signal value ranges for 1 and 0 on the inputs
and 1 and 0 on the outputs (see Figure 1-1)
– Noise Margin – the maximum external noise voltage
superimposed on a normal input value that will not cause an
undesirable change in the circuit output
– Cost for a gate - a measure of the contribution by the gate to the
cost of the integrated circuit
– Propagation Delay – The time required for a change in the value
of a signal to propagate from an input to an output
– Power Dissipation – the amount of power drawn from the power
supply and consumed by the gate
Henry Hexmoor
10
Propagation Delay
• Propagation delay is the time for a change on an input of
a gate to propagate to the output.
• Delay is usually measured at the 50% point with respect
to the H and L output voltage levels.
• High-to-low (tPHL) and low-to-high (tPLH) output signal
changes may have different propagation delays.
• High-to-low (HL) and low-to-high (LH) transitions are
defined with respect to the output, not the input.
• An HL input transition causes:
– an LH output transition if the gate inverts and
– an HL output transition if the gate does not invert.
Henry Hexmoor
11
Propagation Delay (continued)
• Propagation delays measured at the midpoint between
the L and H values
• What is the expression for the tPHL delay for:
– a string of n identical buffers?
– a string of n identical inverters?
Henry Hexmoor
12
Delay Models
• Transport delay - a change in the output in response to a
change on the inputs occurs after a fixed specified delay
• rejection time is a specified value no larger than the
propagation delay and it is often equal to it. (page 99)
• Inertial delay - similar to transport delay, except that if
the input changes such that the output is to change twice
in a time interval less than the rejection time, the output
changes do not occur. Models typical electronic circuit
behavior, namely, rejects narrow “pulses” on the outputs
Henry Hexmoor
13
Cost
• In an integrated circuit:
– The cost of a gate is proportional to the chip area
occupied by the gate
– The gate area is roughly proportional to the number
and size of the transistors and the amount of wiring
connecting them
– Ignoring the wiring area, the gate area is roughly
proportional to the gate input count
– So gate input count is a rough measure of gate cost
• If the actual chip layout area occupied by the
gate is known, it is a far more accurate measure
Henry Hexmoor
14
Hardware Description Languages
3-1
•HDL – Hardware Description Languages allow rigidly
defined language to represent logic circuits.
–AHDL – Altera Hardware Description Language.
–VHDL – Very High Speed Integrated circuit Hardware Description
Language.
–Developed by DoD
–Standardized by IEEE
–Widely used to translate designs into OR
bit patterns
that
Gate
A
program actual devices.
Henry Hexmoor
15
HDL Format and Syntax
• Boolean Description
Using VHDL
• Example defines an
AND gate.
– The keyword ENTITY
names the circuit block,
in this case: and_gate
– The keyword PORT
defines the inputs and
outputs.
– The keyword
ARCHITECTURE
describes the operation
inside the block.
– The BEGIN and END
contain a description of
the operation
Henry Hexmoor
16
Design Procedure
3-3
1.
2.
3.
4.
5.
Specification: the circuit functions
Formulation: truth table or I/O mapping
Optimization: draw logic diagrams
Technology Mapping: map logic components to available components
Verification: correctness check
See Examples 3-2, 3-3, 3-4
Henry Hexmoor
17
Design Procedure
1. Specification
–
Write a specification for the circuit if one is not already
available
2. Formulation
–
Derive a truth table or initial Boolean equations that
define the required relationships between the inputs
and outputs, if not in the specification
3. Optimization
–
–
Apply 2-level and multiple-level optimization
Draw a logic diagram or provide a netlist for the
resulting circuit using ANDs, ORs, and inverters
Henry Hexmoor
18
Design Procedure
4. Technology Mapping
– Map the logic diagram or netlist to the
implementation technology selected
5. Verification
– Verify the correctness of the final
design
Henry Hexmoor
19
Intentionally left blank
Henry Hexmoor
20
Design Example 3-2
1. Specification
– BCD to Excess-3 code converter
– Transforms BCD code for the decimal digits
to Excess-3 code for the decimal digits
– BCD code words for digits 0 through 9: 4-bit
patterns 0000 to 1001, respectively
– Excess-3 code words for digits 0 through 9: 4bit patterns consisting of 3 (binary 0011)
added to each BCD code word
– Implementation:
• multiple-level circuit
• NAND gates (including inverters)
Henry Hexmoor
21
Design Example (continued)
2. Formulation
–
–
–
–
Conversion of 4-bit codes can be most easily
formulated by a truth table
Variables
Input BCD
Output Excess-3
- BCD:
ABCD
WXYZ
A,B,C,D
0000
0011
0001
0100
Variables
0010
0101
- Excess-3
0011
0110
W,X,Y,Z
0100
0111
0101
1000
Don’t Cares
0110
1001
- BCD 1010
0111
1010
to 1111
1000
1011
Henry Hexmoor
1001
22
1011
Design Example (continued)
3. Optimization
z
1
1
3
4
5
7
X
X
12
13
8
9
X
X
1
1
B
1
4
5
A
X
X
12
13
8
9
1
1
2
0
4
5
7
6
4
1
Henry Hexmoor
1
10
3
1
X
13
1
X
C
3
8
B
14
11
w
1
A
X
X
0
12
6
15
1
10
C
X
7
D
x
X
2
X
D
1
3
1
X
14
11
0
1
6
15
1
C
2
1
X
A
y
1
0
1
a. 2-level using
K-maps
W = A + BC + BD
X = BC + B D + B C D
Y = CD + C D
Z= D
C
X
15
X
9
X
14
10
23
X
1
7
X
13
1
8
1
5
12
A
X
11
D
B
1
2
6
X
15
X
9
11
D
14
X
10
B
Design Example (continued)
3. Optimization (continued)
b. Multiple-level using transformations
T1 = C + D
W = A + BT1
X = BT1 + B CD
Y = CD + C D
Z = D
– An additional extraction not shown in the text since it
uses a Boolean transformation: ( CD= C + D = T1 ):
W = A + BT1
X = B T1 + BT1
Y = CD + T1
Z= D
Henry Hexmoor
24
Design Example (continued)
4. Technology Mapping: page 107 – 3rd
ed.
•
Mapping with a library containing inverters and 2-input
NAND, 2-input NOR, and 2-2 AOI gates
A
A
W
B
W
X B
X
C
Y
C
D
D
Y
Z
Henry Hexmoor
25
Z
Design Example: BCD to BCD-to-Seven-Segment Decoder
1.
Specification
•
A BCD-to-seven-segment-decoder is a combinational circuit that
accepts a decimal digit in BCD and generates the appropriate output
for the selection of segments that display the decimal digit.
Each digit is formed from 7 segments, each consisting of 1 LED that
can be illuminated by digital signals.
•
Henry Hexmoor
26
2. Formulation (Truth table)
To display the input BCD digit:
 Which segment(s) should illuminate (be turned on)?
 Which segment(s) should not illuminate (be turned off)?
f
b
g
e
c
d
Henry Hexmoor
27
3. Optimization:
Boolean Function for each
output
 a=?
b=? c=? d=?
 e=?
f=? g=?
4. Draw the logic diagram
Henry Hexmoor
28
Technology Mapping
1. Custom design
2. Cell design: reuse
3. Gate array: VLSI fabrication
Henry Hexmoor
29
Chip Design Styles
• Full custom - the entire design of the chip down to the
smallest detail of the layout is performed
– Expensive
– Justifiable only for dense, fast chips with high sales volume
• Standard cell - blocks have been design ahead of time or
as part of previous designs
– Intermediate cost
– Less density and speed compared to full custom
• Gate array - regular patterns of gate transistors that can
be used in many designs built into chip - only the
interconnections between gates are specific to a design
– Lowest cost
– Less density compared to full custom30and standard cell
Henry Hexmoor
Cell Libraries
• Cell - a pre-designed primitive block
• Cell library - a collection of cells available for
design using a particular implementation
technology
• Cell characterization - a detailed specification
of a cell for use by a designer - often based
on actual cell design and fabrication and
measured values
• Cells are used for gate array, standard cell,
and in some cases, full custom chip design
Henry Hexmoor
31
Example Cell Library
Typical
Input-toOutput
Delay
Normalized
Area
Typical
Input
Load
Inverter
1.00
1.00
0.04
0.012
1
3 SL
2NAND
1.25
1.00
0.05
1 0.014 3 SL
2NOR
1.25
1.00
0.06
1 0.018 3 SL
2-2 AOI
2.25
0.95
0.07
1 0.019 3 SL
Cell
Name
Cell
Schematic
Henry Hexmoor
Basic
Function
Templates
32
Basic Verification Methods
• Manual Logic Analysis
– Find the truth table or Boolean equations for the final circuit
– Compare the final circuit truth table with the specified truth table,
or
– Show that the Boolean equations for the final circuit are equal to
the specified Boolean equations
• Simulation
– Simulate the final circuit (or its netlist, possibly written as an
HDL) and the specified truth table, equations, or HDL description
using test input values that fully validate correctness.
– The obvious test for a combinational circuit is application of all
possible “care” input combinations from the specification
Henry Hexmoor
33
Programmable Configurations
• Read Only Memory (ROM) - a fixed array of AND gates
and a programmable array of OR gates
• Programmable Array Logic (PAL) - a programmable
array of AND gates feeding a fixed array of OR gates.
• Programmable Logic Array (PLA) - a programmable
array of AND gates feeding a programmable array of
OR gates.
• Complex Programmable Logic Device (CPLD) /FieldProgrammable Gate Array (FPGA) - complex enough to
be called “architectures” - See VLSI Programmable Logic
Devices reading supplement
Henry Hexmoor
34
PAL is a registered trademark of Lattice Semiconductor Corp.
ROM, PAL and PLA Configurations
Fixed
AND array
(decoder)
Inputs
Programmable
Connections
Programmable
OR array
Outputs
(a) Programmable read-only memory (PROM)
Inputs
Programmable
Connections
Programmable
AND array
Fixed
OR array
Outputs
Programmable
OR array
Outputs
(b) Programmable array logic (PAL) device
Inputs
Programmable
Connections
Programmable
AND array
Programmable
Connections
(c) Programmable logic array (PLA) device
Henry Hexmoor
35
Read Only Memory
•
Read Only Memories (ROM) or Programmable Read Only Memories
(PROM) have:
– N input lines,
– M output lines, and
– 2N decoded minterms.
•
•
•
Fixed AND array with 2N outputs implementing all N-literal minterms.
Programmable OR Array with M outputs lines to form up to M sum of
minterm expressions.
A program for a ROM or PROM is simply a multiple-output truth table
– If a 1 entry, a connection is made to the corresponding minterm for the
corresponding output
– If a 0, no connection is made
•
Can be viewed as a memory with the inputs as addresses of data (output
values), hence ROM or PROM names!
Henry Hexmoor
36
Read Only Memory Example
• Example: A 8 X 4 ROM (N = 3 input lines, M= 4 output lines)
• The fixed "AND" array is a
X
X
D7
“decoder” with 3 inputs and 8
D6
outputs implementing minterms.
X
D5
X
• The programmable "OR“
D4
array uses a single line to
A2 D3
A
X
D2
represent all inputs to an
X
B
A1 D1
X
OR gate. An “X” in the
A0 D0
C
array corresponds to attaching the
minterm to the OR
• Read Example: For input (A2,A1,A0)
= 011, output is (F3,F2,F1,F0 ) = 0011.
F2
F1
F3
• What are functions F3, F2 , F1 and F0 in terms of (A2, A1, A0)?
Henry Hexmoor
37
X
X
X
F0
Programmable Array Logic (PAL)
• The PAL is the opposite of the ROM, having a programmable
set of ANDs combined with fixed ORs.
• Disadvantage
– ROM guaranteed to implement any M functions of N
inputs. PAL may have too few inputs to the OR gates.
• Advantages
– For given internal complexity, a PAL can have larger N and M
– Some PALs have outputs that can be complemented, adding POS
functions
– No multilevel circuit implementations in ROM (without external
connections from output to input). PAL has
outputs from OR terms as internal inputs to all AND
terms, making implementation of multi-level circuits easier.
Henry Hexmoor
38
Programmable Logic Array (PLA)
• Compared to a ROM and a PAL, a PLA is the most
flexible having a programmable set of ANDs
combined with a programmable set of ORs.
• Advantages
– A PLA can have large N and M permitting implementation of
equations that are impractical for a ROM (because of the
number of inputs, N, required
– A PLA has all of its product terms connectable to all outputs,
overcoming the problem of the limited inputs to the PAL Ors
– Some PLAs have outputs that can be complemented, adding
POS functions
• Disadvantage
– Often, the product term count limits the application of a PLA.
Two-level multiple-output optimization reduces the number
of product terms in an implementation, helping to fit it into a
PLA.
Henry Hexmoor
39
HW 3
• 1. A majority function has an output value of 1 if
there are more 1’s than 0’s on its inputs. The
output is 0 otherwise. Design a three-input
majority function. 3-10
• 2. design a circuit with a 4-bit BCD input A, B, C,
D that produces an output W, X, Y, Z that is
equal to the input + 6 in binary. For example
9(1001) + 6 (0110) = 15 (1111). 3-17
Henry Hexmoor
40