Topics Combinational network delay.

Slides:



Advertisements
Similar presentations
FPGA-Based System Design: Chapter 2 Copyright 2003 Prentice Hall PTR Gate Design n Static complementary logic gate structures. n Switch logic. n Other.
Advertisements

Digital Integrated Circuits© Prentice Hall 1995 Low Power Design Low Power Design in CMOS.
Advanced Interconnect Optimizations. Buffers Improve Slack RAT = 300 Delay = 350 Slack = -50 RAT = 700 Delay = 600 Slack = 100 RAT = 300 Delay = 250 Slack.
FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR Topics n Logic synthesis. n Placement and routing.
Logic Synthesis – 3 Optimization Ahmed Hemani Sources: Synopsys Documentation.
FPGA-Based System Design: Chapter 5 Copyright  2004 Prentice Hall PTR Clocking disciplines Flip-flops. Latches.
ELEN 468 Lecture 261 ELEN 468 Advanced Logic Design Lecture 26 Interconnect Timing Optimization.
Modern VLSI Design 3e: Chapter 10 Copyright  2002 Prentice Hall Adapted by Yunsi Fei ECE 300 Advanced VLSI Design Fall 2006 Lecture 24: CAD Systems &
Logical Effort A Method to Optimize Circuit Topology Swarthmore College E77 VLSI Design Adem Kader David Luong Mark Piper December 6, 2005.
RTL Hardware Design by P. Chu Chapter 161 Clock and Synchronization.
Modern VLSI Design 2e: Chapter 4 Copyright  1998 Prentice Hall PTR Topics n Switch networks. n Combinational testing.
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n Sequential machine implementation: –clocking. n Sequential machine design.
Modern VLSI Design 2e: Chapter4 Copyright  1998 Prentice Hall PTR.
Technology Mapping.
Dec. 6, 2005ELEC Glitch Power1 Low power design: Insert delays to eliminate glitches Yijing Chen Dec.6, 2005 Auburn university.
Modern VLSI Design 2e: Chapter 6 Copyright  1998 Prentice Hall PTR Topics n Shifters. n Adders and ALUs.
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n Memory elements. n Basics of sequential machines.
Modern VLSI Design 2e: Chapter 5 Copyright  1998 Prentice Hall PTR Topics n State assignment. n Power optimization of sequential machines. n Design validation.
Logic Simulation 2 Outline –Timing Models –Simulation Algorithms Goal –Understand timing models –Understand simulation algorithms Reading –Gate-Level Simulation.
Topics Combinational logic functions.
© 2000 Prentice Hall Inc. Figure 6.1 AND operation.
Modern VLSI Design 2e: Chapter 4 Copyright  1998 Prentice Hall PTR Topics n Crosstalk. n Power optimization.
FPGA Technology Mapping. 2 Technology mapping:  Implements the optimized nodes of the Boolean network to the target device library.  For FPGA, library.
Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.
FPGA-Based System Design: Chapter 5 Copyright  2004 Prentice Hall PTR Topics n Basics of sequential machines. n Sequential machine specification. n Sequential.
1 Delay Estimation Most digital designs have multiple data paths some of which are not critical. The critical path is defined as the path the offers the.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Interconnect design. n Crosstalk. n Power optimization.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n Circuit design for FPGAs: –Logic elements. –Interconnect.
FPGA-Based System Design: Chapter 4 Copyright  2004 Prentice Hall PTR HDL coding n Synthesis vs. simulation semantics n Syntax-directed translation n.
Review: CMOS Inverter: Dynamic
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Switch networks. n Combinational testing.
Modern VLSI Design 3e: Chapter 5,6 Copyright  2002 Prentice Hall PTR Adapted by Yunsi Fei Topics n Sequential machine (§5.2, §5.3) n FSM construction.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation.
False Path. Timing analysis problems We want to determine the true critical paths of a circuit in order to: –To determine the minimum cycle time that.
FPGA-Based System Design: Chapter 2 Copyright  2003 Prentice Hall PTR Topics n Combinational logic functions. n Static complementary logic gate structures.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR FPGA Fabric n Elements of an FPGA fabric –Logic element –Placement –Wiring –I/O.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.
1 EECS 219B Spring 2001 Timing Optimization Andreas Kuehlmann.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Combinational network delay. n Logic optimization.
Logical Effort and Transistor Sizing Digital designs are usually expected to operate at high frequencies, thus designers often have to choose the fastest.
FPGA-Based System Design Copyright  2004 Prentice Hall PTR Logic Design Process n Functional/ Non-functional requirements n Mapping into an FPGA n Hardware.
مرتضي صاحب الزماني 1 Synthesis. مرتضي صاحب الزماني 2 Synthesis What is Synthesis? RTL-style Combinatorial Logic Sequential Logic Finite State Machines.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Interconnect design. n Crosstalk. n Power optimization.
Modern VLSI Design 4e: Chapter 3 Copyright  2008 Wayne Wolf Topics n Pseudo-nMOS gates. n DCVS logic. n Domino gates. n Design-for-yield. n Gates as IP.
4. Combinational Logic Networks Layout Design Methods 4. 2
Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Topics n CAD systems. n Simulation. n Placement and routing. n Layout analysis.
FPGA-Based System Design: Chapter 4 Copyright  2003 Prentice Hall PTR Topics n Number representation. n Shifters. n Adders and ALUs.
Linear Delay Model In general the propagation delay of a gate can be written as: d = f + p –p is the delay due to intrinsic capacitance. –f is the effort.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 23: April 20, 2015 Static Timing Analysis and Multi-Level Speedup.
Nonlinear & Neural Networks LAB. CHAPTER 8 Combinational Circuit design and Simulation Using Gate 8.1Review of Combinational Circuit Design 8.2Design of.
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Layouts for logic networks. n Channel routing. n Simulation.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Circuit design for FPGAs n Static CMOS gate vs. LUT n LE output drivers n Interconnect.
Modern VLSI Design 4e: Chapter 3 Copyright  2008 Wayne Wolf Topics n Wire delay. n Buffer insertion. n Crosstalk. n Inductive interconnect. n Switch logic.
Modern VLSI Design 3e: Chapter 7 Copyright  1998, 2002 Prentice Hall PTR Topics n Power/ground routing. n Clock routing. n Floorplanning tips. n Off-chip.
Technology Mapping. 2 Technology mapping is the phase of logic synthesis when gates are selected from a technology library to implement the circuit. Technology.
FPGA-Based System Design: Chapter 1 Copyright  2004 Prentice Hall PTR Moore’s Law n Gordon Moore: co-founder of Intel. n Predicted that number of transistors.
FPGA-Based System Design: Chapter 2 Copyright  2004 Prentice Hall PTR Topics n Logic gate delay. n Logic gate power consumption. n Driving large loads.
Chapter 6 Copyright © 2004 The McGraw-Hill Companies, Inc. All rights reserved. High-Speed CMOS Logic Design.
Modern VLSI Design 4e: Chapter 4 Copyright  2008 Wayne Wolf Topics n Combinational network delay. n Logic optimization.
Modern VLSI Design 3e: Chapter 8 Copyright  1998, 2002 Prentice Hall PTR Topics n Basics of register-transfer design: –data paths and controllers; –ASM.
FPGA-Based System Design: Chapter 6 Copyright  2004 Prentice Hall PTR Topics n Low power design. n Pipelining.
Modern VLSI Design 3e: Chapter 3 Copyright  1998, 2002 Prentice Hall PTR Topics n Wire delay. n Buffer insertion. n Crosstalk. n Inductive interconnect.
Timing Behavior of Gates
Modern VLSI Design 3e: Chapter 4 Copyright  1998, 2002 Prentice Hall PTR Topics n Transistor sizing: –Spice analysis. –Logical effort.
Courtesy RK Brayton (UCB) and A Kuehlmann (Cadence) 1 Logic Synthesis Timing Optimization.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.
COE 360 Principles of VLSI Design Delay. 2 Definitions.
Copyright © 2004 The McGraw-Hill Companies, Inc. All rights reserved.
Topics Logic synthesis. Placement and routing..
Topics Switch networks. Combinational testing..
Presentation transcript:

Topics Combinational network delay. Combinational network energy/power.

Delay characteristics Measured from change in inputs to change in ouputs. Data-dependent: Some inputs give longer delays than others. May exercise different paths through the network.

Timing diagram tc >= tx + ty A 1 S C X B time

Sources of delay Gate delay: Wire: intrinsic; drive; load. lumped load; transmission line.

Basic gate delay model Gate delay tg. Wire delay tw. LE LE PIP

Optimizing a single link Custom design---improve gate delay: Transistor sizing. Gate topology. FPGA or custom design---improve wire delay: Shorten wire length. Choose wire category. Increase driver size.

Fanout Fanout adds capacitance. sink source sink sink

Driving fanout Adding gates adds capacitance:

Ways to drive large fanout Increase sizes of driver transistors. Must take into account rules for driving large loads. Add intermediate buffers. This may require/allow restructuring of the logic.

Buffers

Wire capacitance Use layers with lower capacitance. Redesign layout to reduce length of wires with excessive delay.

Path delay Combinational network delay is measured over paths through network. Can trace a causality chain from inputs to worst-case output.

Path delay example network graph model

Critical path Critical path = path which creates longest delay. Can trace transistions which cause delays that are elements of the critical delay path.

Delay model Nodes represent gates. Assign delays to edges—signal may have different delay to different sinks. Lump gate and wire delay into a single value.

Critical path through delay graph

Reducing critical path length To reduce circuit delay, must speed up the critical path—reducing delay off the path doesn’t help. There may be more than one path of the same delay. Must speed up all equivalent paths to speed up circuit. Must speed up cutset through critical path.

False paths Logic gates are not simple nodes—some input changes don’t cause output changes. A false path is a path which cannot be exercised due to Boolean gate conditions. False paths cause pessimistic delay estimates.

False path example

Another false path example d = 10 d = 10 d = 20 d = 20 False path

Placement and delay Placement helps determine routing. Routing determines wire length. Wire length determines capacitive load.

Placement and wire capacitance g1 g3 dvr g2 g4 unbalanced load g1 g3 dvr g2 g4 more balanced

Optimizing network delay Identify the longest path. Improve delay along the longest path: Driver delay. Wire delay. Logic restructuring.

Example: adder placement and delay N-bit adder: + + + +

Bad placement and routing

Better placement and routing

Logic rewrites shallow logic deep logic

Logic transformations Can rewrite by using subexpressions. Simplifications affect the cost of rewrites. Flattening logic increases gate fanin. Logic rewrites may affect gate placement.

Power optimization Transitions cause power consumption. Logic network design helps control power consumption: minimizing capacitance; eliminating unnecessary glitches.

Glitching example Gate network:

Glitching example behavior NOR gate produces 0 output at beginning and end: beginning: bottom input is 1; end: NAND output is 1; Difference in delay between application of primary inputs and generation of new NAND output causes glitch.

Adder chain glitching bad good

Explanation Unbalanced chain has signals arriving at different times at each adder. A glitch downstream propagates all the way upstream. Balanced tree introduces multiple glitches simultaneously, reducing total glitch activity.

Power estimation tools Power estimator approximates power consumption from: gate network; primary input transition probabilities; capacitive loading. May be switch/logic simulation based or use statistical models.

Factorization for low power Proper factorization reduces glitching. bad good

Factorization techniques In example, a has high transition probability, b and c low probabilities. Reduce number of logic levels through which high-probability signals must travel in order to reduce propagation of glitches.

Layout for low power Place and route to minimize capacitance of nodes with high glitching activity. Feed back wiring capacitance values to power analysis for better estimates.