Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 1 – The.

Slides:



Advertisements
Similar presentations
CMOS Logic Circuits.
Advertisements

Selected Design Topics. Integrated Circuits Integrated circuit (informally, a chip) is a semiconductor crystal (most often silicon) containing the electronic.
Overview Part 2 – Combinational Logic Functions and functional blocks
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 7 – Registers.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 12 Basic (NAND) S – R Latch “Cross-Coupling” two NAND gates gives the S -R Latch:
Overview Part 1 - Storage Elements and Analysis
Overview Part 1 - Storage Elements and Analysis
1 CS 151: Digital Design Chapter 5: Sequential Circuits 5-3: Flip-Flops I.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 1 – Storage.
EET 1131 Unit 10 Flip-Flops and Registers
Chapter 6 –Selected Design Topics Part 2 – Propagation Delay and Timing Logic and Computer Design Fundamentals.
Introduction to Digital Systems By Dr. John Abraham UT-Panam.
Microelectronic Circuits, Sixth Edition Sedra/Smith Copyright © 2010 by Oxford University Press, Inc. C H A P T E R 13 CMOS Digital Logic Circuits.
Charles Kime © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 7 – Registers and Register Transfers Part 3 – Control of.
Combinational Circuits
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 –Selected Design Topics Part 3 – Asynchronous.
CPEN Digital System Design
Henry Hexmoor1 Chapter 3 Henry Hexmoor Types of Logic Circuits Combinational logic circuits: –Outputs depend only on its current inputs. –A combinational.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 3 – Combinational.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 1 – Storage.
Lecture #24 Gates to circuits
Chapter 6 – Selected Design Topics Part 1 – The Design Space Logic and Computer Design Fundamentals.
Flip-Flops and Related Devices
© 2000 Prentice Hall Inc. Figure 6.1 AND operation.
Chapter #6: Sequential Logic Design 6.2 Timing Methodologies
Digital logic families
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 8 – Memory Basics Logic and Computer Design.
Combinational Circuit
INTEGRATED CIRCUIT LOGIC FAMILY
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 11 – Design Concepts.
Ch 10 MOSFETs and MOS Digital Circuits
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 2 –
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 4 – Programmable.
1 DIGITAL ELECTRONICS. 2 OVERVIEW –electronic circuits capable of carrying out logical (boolean) and arithmetic operations on information stored as binary.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 1 – The.
CHAPTER 3 Sequential Logic/ Circuits.  Concept of Sequential Logic  Latch and Flip-flops (FFs)  Shift Registers and Application  Counters (Types,
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 5 – Sequential Circuits Part 2 – Sequential.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
IC Logic Families Wen-Hung Liao, Ph.D.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS 352: Digital Systems.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS 352: Digital Systems.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 7 – Registers and Register Transfers Part.
1 Digital Fundamentals Chapter 8 Flip-Flops and Related Devices Resource: CYU / CSIE / Yu-Hua Lee / Not made by Engr. Umar Talha,
EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009 Combinational Circuits.
Flip Flop Chapter 15 Subject: Digital System Year: 2009.
EE210 Digital Electronics Class Lecture 10 April 08, 2009
Solid-State Devices & Circuits
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 8 – Memory Basics Logic and Computer Design.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 13 Edge-Triggered FF Operation.
2016/7/21 Haifeng Liu 2014 Fall College of Computer Science and Technology, Zhejiang University Chapter 3 Combinational Logic Design.
Overview Part 1 - Storage Elements and Sequential Circuit Analysis
Overview Part 2 – Combinational Logic Functions and functional blocks
Overview Part 1 – The Design Space
4.
Overview Part 1 – Logic Circuits and Boolean Functions
EE2174: Digital Logic and Lab
2-6 Exclusive-OR Operator and Gates
Overview Part 1 – Gate Circuits and Boolean Equations
PROPAGATION DELAY.
Overview The Design Space Programmable Implementation Technologies
Overview Part 1 – Design Procedure Beginning Hierarchical Design
Overview Part 1 – The Design Space
Overview Part 1 – The Design Space
Edge-Triggered FF Operation
Overview Part 3 – Additional Gates and Circuits
Combinational Circuits
Combinational Circuits
Presentation transcript:

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 6 – Selected Design Topics Part 1 – The Design Space Logic and Computer Design Fundamentals

Chapter 6 - Part 1 2 Overview  Part 1 – The Design Space Integrated Circuits  Levels of Integration CMOS Circuit Technology  CMOS Transistor Models  Circuits of Switches  Fully Complementary CMOS Circuits  Technology Parameters  Part 2 – Propagation Delay and Timing  Part 3 – Asynchronous Interactions  Part 4 - Programmable Implementation Technologies

Chapter 6 - Part 1 3 Integrated Circuits  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) to thousands of gates VLSI (very large-scale integrated) - thousands to 100s of millions of gates

Chip manufacturing process  /385/ /385/  Video illustrating chip manufacturing:  q4YzBtY&feature=player_embedded q4YzBtY&feature=player_embedded  q4YzBtY&feature=player_embedded q4YzBtY&feature=player_embedded Chapter 6 - Part 1 4

Chapter 6 - Part 1 5 MOS Transistor DD n-ChannelTransistor: OFF - no D-to-S Current 0Volts VV 0V

Chapter 6 - Part 1 6 MOS Transistor

Chapter 6 - Part 1 7 Switch Models for MOS Transistors  n-Channel – Normally Open (NO) Switch Contact  p-Channel – Normally Closed (NC) Switch Contact

Chapter 6 - Part 1 8 Circuits of Switch Models  Series  Parallel

NAND and NOR gates Chapter 6 - Part 1 9

Chapter 6 - Part 1 10 Fully-Complementary CMOS Circuit  Circuit structure for fully-complementary CMOS gate

Chapter 6 - Part 1 11 CMOS Circuit Design Example  Find a CMOS gate with the following function:  Beginning with F0, and using F  The switch model circuit in terms of NO switches:

Chapter 6 - Part 1 12 CMOS Circuit Design Example  The switch model circuit for F1 in terms of NC contacts is the dual of the switch model circuit for F0:  The function for this circuit is: which is the correct F.

Chapter 6 - Part 1 13 CMOS Circuit Design Example  Replacing the switch models with CMOS transistors; note input Z must be used.

Chapter 6 - Part 1 14 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

Chapter 6 - Part 1 15 Fan-out  Fan-out can be defined in terms of a standard load Example: 1 standard load equals the load contributed by the input of 1 inverter. Transition time -the time required for the gate output to change from H to L, t HL, or from L to H, t LH The maximum fan-out that can be driven by a gate is the number of standard loads the gate can drive without exceeding its specified maximum transition time

Chapter 6 - Part 1 16 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

Chapter 6 – Part 2 17 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 (t PHL ) and low-to-high (t PLH ) 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.

Chapter 6 – Part 2 18 Propagation Delay (continued)  Propagation delays measured at the midpoint between the L and H values  What is the expression for the t PHL delay for: a string of n identical buffers? a string of n identical inverters?

Chapter 6 – Part 2 19 Delay Models  Transport delay - a change in the output in response to a change on the inputs occurs after a fixed specified delay  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

Chapter 6 – Part 2 20 Delay Model Example A A B: Transport Delay (TD) Inertial Delay (ID) B Time (ns) No Delay (ND) abcde Propagation Delay = 2.0 ns Rejection Time = 1.0 ns

Chapter 6 – Part 2 21 Circuit Delay  Suppose gates with delay n ns are represented for n = 0.2 ns, n = 0.4 ns, n = 0.5 ns, respectively:

Chapter 6 – Part 2 22  Consider a simple 2-input multiplexer:  With function: Y = B for S = 1 Y = A for S = 0  “Glitch” is due to delay of inverter A S B Y 0.2 Circuit Delay A S B Y S Here S=0 and S=0

Chapter 6 – Part 2 23 Fan-out and Delay  The fan-out loading a gate’s output affects the gate’s propagation delay  Example: One realistic equation for t pd for a NAND gate with 4 inputs is: t pd = SL ns SL is the number of standard loads the gate is driving, i. e., its fan-out in standard loads For SL = 4.5, t pd = ns  If this effect is considered, the delay of a gate in a circuit takes on different values depending on the circuit load on its output.

Chapter 6 – Part 2 24  t s - setup time  t h - hold time  t w - clock pulse width  t px - propa- gation delay t PHL - High-to- Low t PLH - Low-to- High t pd - max (t PHL, t PLH ) t s t h t p-,min t p-,max t wH $ t wH,min t wL $ t wL,min C D Q (b) Edge-triggered (negative edge) t h t s t p-,min t p-,max t wH $ t wH,min t wL $ t wL,min C S / R Q (a) Pulse-triggered (positive pulse) Flip-Flop Timing Parameters

Chapter 6 – Part 2 25 Flip-Flop Timing Parameters  t s - setup time Master-slave - Equal to the width of the triggering pulse Edge-triggered - Equal to a time interval that is generally much less than the width of the the triggering pulse  t h - hold time - Often equal to zero  t px - propagation delay Same parameters as for gates except Measured from clock edge that triggers the output change to the output change

Chapter 6 – Part 2 26  Consider a system comprised of ranks of flip-flops connected by logic:  If the clock period is too short, some data changes will not propagate through the circuit to flip-flop inputs before the setup time interval begins Circuit and System Level Timing

Chapter 6 – Part 2 27  New Timing Components t p - clock period - The interval between occurrences of a specific clock edge in a periodic clock t pd,COMB - total delay of combinational logic along the path from flip-flop output to flip-flop input t slack - extra time in the clock period in addition to the sum of the delays and setup time on a path  Can be either positive or negative  Must be greater than or equal to zero on all paths for correct operation Circuit and System Level Timing

Chapter 6 – Part 2 28  Timing components along a path from flip-flop to flip-flop Circuit and System Level Timing (a) Edge-triggered (positive edge) t p t pd,FF t pd,COMB t slack t s C (b) Pulse-triggered (negative pulse) t p t pd,FF t pd,COMB t slack t s C

Chapter 6 – Part 2 29  Timing Equations t p = t slack + (t pd,FF + t pd,COMB + t s ) For t slack greater than or equal to zero, t p ≥ max (t pd,FF + t pd,COMB + t s ) for all paths from flip-flop output to flip-flop input  Can be calculated more precisely by using t PHL and t PLH values instead of t pd values, but requires consideration of inversions on paths Circuit and System Level Timing

Chapter 6 – Part 2 30 Calculation of Allowable t pd,COMB  Compare the allowable combinational delay for a specific circuit: a) Using edge-triggered flip-flops b) Using master-slave flip-flops  Parameters t pd,FF (max) = 1.0 ns t s (max) = 0.3 ns for edge-triggered flip-flops t s = t wH = 1.0 ns for master-slave flip-flops Clock frequency = 250 MHz

Chapter 6 – Part 2 31 Calculation of Allowable t pd,COMB  Calculations: t p = 1/clock frequency = 4.0 ns Edge-triggered: 4.0 ≥ t pd,COMB + 0.3, t pd,COMB ≤ 2.7 ns Master-slave: 4.0 ≥ t pd,COMB + 1.0, t pd,COMB ≤ 2.0 ns  Comparison: Suppose that for a gate, average t pd = 0.3 ns Edge-triggered: Approximately 9 gates allowed on a path Master-slave: Approximately 6 to 7 gates allowed on a path

Chapter 6 - Part 1 32 Terms of Use  All (or portions) of this material © 2008 by Pearson Education, Inc.  Permission is given to incorporate this material or adaptations thereof into classroom presentations and handouts to instructors in courses adopting the latest edition of Logic and Computer Design Fundamentals as the course textbook.  These materials or adaptations thereof are not to be sold or otherwise offered for consideration.  This Terms of Use slide or page is to be included within the original materials or any adaptations thereof.