Logic-timing Simulation and the Degradation Delay Model
This page intentionally left blank
LogIc-timing Simulation ...
33 downloads
1025 Views
10MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
Logic-timing Simulation and the Degradation Delay Model
This page intentionally left blank
LogIc-timing Simulation and the Degradation Delay Model
Manuel J. Bellido Jorge Juan Manuel Valencia
University of Seville, Spain & Institute for Microelectronics of Seville, Spain
Imperial College Press
Published by
Imperial College Press 57 Shelton Street Covent Garden London WC2H 9HE Distributed by
World Scientific Publishing Co. Re. Ltd.
5 Toh Tuck Link, Singapore 596224 USA ofice: 27 Warren Street, Suite 401-402, Hackensack, NJ 07601
UK ofice: 57 Shelton Street, Covent Garden, London WC2H 9HE
British Library Cataloguing-in-PublicationData A catalogue record for this book is available from the British Library.
LOGIC-TIMING SIMULATION AND THE DEGRADATION DELAY MODEL Copyright 0 2006 by Imperial College Press All rights reserved. This book, or parts thereoJ may not be reproduced in any form or by any means, electronic or mechanical, including photocopying, recording or any information storage and retrieval system now known or to be invented, without written permissionfrom the Publisher.
For photocopying of material in this volume, please pay a copying fee through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA. In this case permission to photocopy is not required from the publisher.
ISBN 1-86094-589-9
Printed in Singapore by World Scientific Printers (S) Pte Ltd
To our families
This page intentionally left blank
Prologue
“And God made the two great lights; the greater light to rule the day, and the lesser light to rule the night: he made the stars also. And God set them in the firmament of heaven to give light upon the earth, and to rule over the day and over the night, and to divide the light from the darkness: and God saw that it was good” (Genesis 16-1 8). This is history’s first synchronous system run by a non-overlapping twophase clock (the greater light to rule the day, and the lesser light to rule the night). In this system we are confronted for the first time with the problem of clock skew since the phases may overlap although the system has been built as immune to such clock skew. This example should serve to illustrate how aspects of timing are cmcia1 in nature and inherent to the very fact of existence. For this reason the analysis and study of these aspects is of decisive importance for understanding system behaviour. From the point of view of the design of electronic systems we should keep in mind that the functioning of a system is no more than a succession of events in the signals that run through the paths connecting the devices. Establishing an adequate succession of events, with respect to signal sequencing and the generation of adequate levels of voltage and current will determine the correct or incorrect functioning of the system. According to Moore’s Law, the number of transistors per square millimetre on an integrated circuit is doubled every two years. This means that as the scale of integration grows, so does the functionality and complexity of electronic systems. On the other hand, performance requirements are increasingly restrictive in terms of operating speed and power
vii
viii
Prologue
consumption. In submicron technologies delays in the lines of interconnections become comparable to those of logic gates. Problems of clock skew, jittering and synchronization create serious restrictions in system design. All these aspects make the design process increasingly need the support of tools which facilitate the tasks of analysis, simulation and synthesis. Such tools should incorporate realistic behavioural models of the devices. The work presented here encompasses the main aspects related to the logic timing simulation of circuits and digital systems. This work arises as the product of the experience of the authors and their deep knowledge on the subject. In almost twenty years of research this team has produced new models of system behaviour making it possible to increase the precision of logic timing simulation without significantly having to increase costs in computing time or resources. This book presents a review of logic timing simulators, focusing on the modelling of the behaviour of the logic devices. The authors guide us through a review of the different logic gate delay models showing us the restrictions and positive qualities of each model. This is a natural way of presenting the new contributions that the authors themselves have made through the incorporation of new effects into the model. The influence of these new delay models may be seen in the realization of more precise logic simulators and applications for the analysis of power consumption in digital circuits. This book constitutes a basic work of reference for any professional digital designer. It is also a reference manual for researchers developing new analysis and simulation tools for digital systems. I believe that with this work it will be easier to understand how designers see timing effects and how this vision makes it possible to construct adequate models to study the timing behaviour of systems.
Angel Barriga Microelectronics Institute of Seville
Preface
From the beginning of its development until the present day, microelectronic technology has made continuous and unstoppable advances in the miniaturization of the basic components of integrated circuits. This miniaturization has had two fundamental consequences. First of all, the capacity to implement extremely complex systems within a single chip. Secondly, an increasingly higher operation speed in the circuits, more and more comparable to the propagation speed of the electrical signals passing through the conductors of the chip. In order to achieve such highly complex system designs, the designer needs to use CAD tools for synthesis as well as for verification. The latter are meant to check that each design description meets the behavioural specifications. An aspect which is often overlooked is that the tools or, rather, the precision of the results obtained with those tools, is very sensitive to technological variations. In particular, verification tools lose precision because the behavioural models of the devices they implement lose validity with technological evolution. In order to avoid this loss of precision in the results it is necessary to carry out a constant update of the tools by analysing and improving behavioural models. The timing behaviour of digital circuits is undoubtedly one of those with the greatest sensitivity to technological variations. This, along with the fact that the aim is to achieve a maximum circuit operation speed, implies a constant scientific need for analysis and improvement of the timing behavioural models which allow the tools to obtain results which are sufficiently reliable for the designer.
ix
X
Preface
This book focuses on this line of work. More specifically, it deals with the modelling of the timing behaviour of logic devices (especially of logic gates) and the simulation tools at the logic level which allow for the timing analysis of large digital circuits. Precision in the timing analysis at gate level is of the utmost importance for several reasons. On the one hand, it is important from the point of view of the designer, who normally follows a Top-Down methodology, because it is at the gate level where timing behaviour is first encountered physically since at a previous level only clock cycles are modelled. In addition, it is important because the gate level is the last one common to practically all forms of implementation: Full-custom, Standard Cell Semi-Custom, and even FPGAs. On the other hand, from the point of view of timing simulation applications, there are several reasons: 1) it is essential not only for verifying the correctness of the design at the timing level but also for characterizing the performances, an aspect which may in turn be applied to the redesign of those parts of the circuit which do not offer the desired performance; 2) analysis and treatment of collisions and glitches, with applications in the study of asynchronous interactions or desynchronized signals and in the prevention of undesired behaviour such as metastability; 3) measuring switching activity, with direct application to the analysis of consumption and noise generation in mixed analog-digital circuits. We have structured the book into eight chapters. The first two chapters are general while subsequent ones deal with the specific results of our research team in this line of work, both in delay modelling as well as in the implementation of simulation tools and their application to the verification of the designs. The first chapter is devoted to the fundamental aspects of timing simulation. Specifically, various techniques are analysed which were developed so that a designer may carry out the timing simulation of a design. Thus, simulation is analysed at the electrical level, undoubtedly the one with the most precise results, which, in addition, serves as a reference for measuring the quality of the other types of timing simulation. However, the excessive use of computer resources (CPU time, memory, etc.) makes it completely nonviable, especially when aiming to simulate the behaviour of systems of considerable complexity. In this chapter other alternatives for the timing simulation are also analysed, such as simulation at the
Preface
xi
transistor level or at the logic gate level. Advantages and disadvantages are described along with a brief description of the event-driven simulation technique employed in these kinds of timing simulations. In Chapter 2 we focus on the logic timing simulation at the gate level and, more specifically, on the delay models which are implemented in the simulators. A review of the delay models is carried out, starting with the zero delay model, that is, without considering any specific timing behavioural effect, followed by a presentation of successive models of increasingly higher complexity. Thus, models are presented which include static effects as well as dynamic effects which affect the propagation delay. The so-called inertial and degradation effects are introduced in Chapter 3. The behaviour of the gates with respect to these effects is studied and the so-called Degradation Delay Model (DDM) is presented. By applying the DDM, a study is carried out on the importance of the degradation effect, concluding that specially in very high speed designs, it is fundamental to take it into account in order to achieve a correct verification of the designs. On the other hand, a detailed analysis is given of the inertial effect and the so-called inertial delay, a model widely used to include this effect within the logic simulation. In this chapter it is shown how the Inertial Delay can produce significant errors in the simulation results and an alternative algorithm is proposed to include said effect within the logic simulation, resolving the problem. Chapters 4 and 5 are devoted fully to developing the DDM. Specifically, Chapter 4 presents a very exhaustive characterization of the typical DDM parameters with respect to the technological parameters of a CMOS inverter. The step from modelling a gate with a single entry such as the inverter to modelling gates with several entries is not a trivial one. Indeed, the model may be realized by obtaining an equivalent inverter, but also by applying the same DDM concept to the different gate entries. In Chapter 5 an extension of the model to the complex CMOS gates is made. The next two chapters are devoted to presenting the characteristics of a simulation tool called HALOTIS (High Accuracy Logic TIming Simulator), which implements the DDM model along with the results obtained. Chapter 6 is devoted to presenting the general structure of the tool along
xii
Preface
with the basic characteristics of the simulation engine and the delay model interface. Chapter 7 is in turn devoted to presenting the results of HALOTIS simulation using two different behavioural models, the DDM and the CDM (Conventional Delay Model, which differs from the DDM in that it does not include the degradation effect). These results are moreover compared with those obtained by means of electrical simulation. Three types of results are presented which we consider significant: simulation of pulse propagatiodpulse trains through a chain of gates; calculation of the operating frequency of a three-inverter ring oscillator; and the simulation of the metastable behaviour in several latches designed at the logic gate level. The results clearly show that there is quite a significant increase in the precision of the results when the degradation effect is included in the logic simulation. Lastly, in Chapter 8 of this book a detailed analysis of the switching activity within the digital circuits is carried out with different types of timing simulators. The switching activity is a direct measurement of the average number of changes in the nodes of a circuit. It is a fundamental parameter for measuring the consumption and the switching noise in digital circuits. Actually, most tools for estimating the consumption of energy in digital circuits employ switching activity as a fundamental parameter. In this chapter, on the one hand, a detailed quantitative study on the ISCAS85 benchmark circuits is carried out, demonstrating that the activity due to glitches can become as significant as the functional activity inherent to the circuit (the one due to the operation of the circuit). The numerical values here presented show the great importance of treating glitches when measuring switching activity. On the other hand, the measurements of this parameter obtained with logic simulators are presented, showing that commercial simulators can make serious errors, whereas HALOTIS (using DDM) increases precision significantly.
Contents
Prologue . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
vii
Preface . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
ix
1
2
Fundamentals of Timing Simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
1
...........................................
1
......................................
5
1.1
Introduction
1.2
Circuit Simulation
1.3
Transistor-Level Simulation ............................. 10 1.3.1 Switch-level simulation ........................... 10 1.3.2 Advanced transistor-level simulators . . . . . . . . . . . . . . . . 12 .
1.4
Timing Gate Level Simulation ........................... 13 1.4.1 Delay models at gate level ......................... 16 1.4.1.1 Zero and unit delay models . . . . . . . . . . . . . . . . . . .16 1.4.1.2 Static delay models ......................... 16 1.4.1.3 Dynamics effects ........................... 17 1.4.2 The event-driven simulation technique . . . . . . . . . . . . . . . .17
1.5
Summary and Tendencies
...............................
19
Delay Models: Evolution and Trends..............................
23
2.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.1.1 Deterministic delay models ........................ 2.1.2 Non-deterministic delay models .....................
23 23 25
2.2
Deterministic Delay Model Types ........................ 2.2.1 Zero and unitary delay models ...................... 2.2.2 Assignable delay models .......................... 2.2.2.1 Static delay models .........................
26 26 27 27
...
XI11
xiv
Contents
2.2.2.2 Example of static delay model parameter characterization . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2.2.2.3 Dynamic delay models . . . . . . . . . . . . . . . . . . . . . . 2.3
3
4
30 33
State of the Art in Delay Models .......................... 35 2.3.1 Classification of the proposed delay models . . . . . . . . . . .35 2.3.2 Delay model performance ......................... 40 2.3.3 Evolution and trends in delay models . . . . . . . . . . . . . . . . .42
Degradation and Inertial Effects . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
47
3.1
Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.1.1 Degradation and inertial effects .....................
47 47
3.2
Degradation Delay Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 51 3.2.1 Behaviour regions . . . . . . . . . . . . . . . . . . . . . . . . . 53 3.2.2 Degradation modelling . . . . . . . . . . . . . . . . . . . 3.2.3 Physical interpretation of the degradation parameters . . . .56 3.2.4 Limits between behaviour regions . . . . . . . . . . . . . . . . . . .59 3.2.4.1 Limit between the normal propagation region and the degradation region . . . . . . . . . . . . . . . . . . 59 . 3.2.4.2 Limit between the filtering region and the 59 degradation region . . . . . . . . . . . . .
3.3
62 The Importance of the Degradation Effect . . . . . 3.3.1 Maximum device operation frequency . . . . . . . . . . . . . . . .64 3.3.2 Comparison with classical calculations and results . . . . . .66
3.4
Inertial Effect . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67 3.4.1 Inertial delay model failure . . . . . . . . . . . . . . . . . . . . . . . . 67 3.4.2 Inertial effect algorithm . . . . . . . . . . . . . . . . . . . . . . . 71 . . . . . . .72 3.4.3 Results . . . . . . . . . . . . . . . . . . . . . . ....
CMOS Inverter Degradation Delay Model ....... . . . . . . . . . . . . . . . . . .
75
..........................................
75
4.1
Introduction
4.2
Technological Parameters
4.3
Normal Propagation Delay .............................. 81 4.3.1 CMOS inverter transient response: regions of operation . .82 4.3.1.1 Region I: overshoot . . . . . . . . . . . . . . . . . . . . . . . . . 84 4.3.1.2 Region 11: short-circuit ...................... 86 4.3.1.3 Region 111: discharge . . . . . . . . . . . . . . . . . . . . . . . . 87 . 4.3.2 Actual response of the CMOS inverter . . . . . . . . . . . . . . . 87
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
Contents
xv
4.3.2.1 Step input response of the CMOS inverter . . . . . . .88 4.3.2.2 Limits between slow and fast input transitions . . . .90 4.3.2.3 Critical transition time calculation . . . . . . . . . . . . .91 4.3.2.4 Delay calculation for fast input transitions . . . . . . .93 4.3.2.5 Delay calculation for slow input transitions . . . . . .95 4.3.3 Output transition time calculation . . . . . . . . . . . . . . . . . . 96 .
5
4.4
Input-to-Output Coupling Capacitance Modelling . . . . . . . . . . . .98 4.4.1 IOCC calculation for micron MOSFET’s . . . . . . . . . . . . . .99 4.4.2 IOCC calculation for submicron MOSFET’s . . . . . . . . . .102 4.4.2.1 Reduced IOCC estimation from SPICE model card .................................... 105 4.4.3 Comparison of IOCC models ...................... 105 4.4.4 IOCC modelling impact in the Inverter’s timing 108 characteristics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
4.5
Modelling the Degradation Parameters .. . . . . . . . . . . . . . . . . . . 109 4.5.1 Modelling the first degradation parameter . . . . . . . . . . . .111 4.5.2 Modelling the second degradation parameter . . . . . . . . . .113 4.5.3 Ranges of interest for the external and internal parameters of the CMOS inverter . . . . . . . . . . . . . . . . . . .116
4.6
Obtaining the Value of Technological Parameters . . . . . . . . . . .118 4.6.1 Verification of the model for the first degradation parameter ..................................... 118 4.6.2 Verification of the model for the second degradation parameter . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 122
4.7
Discussion
..........................................
125
Gate-Level DDM
......................................
127
.........................................
127
5.1
Introduction
5.2
DDM for Multi-Input Gates . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130 5.2.1 Gate-level delay equations ........................ 131 5.2.1.1 Normal propagation delay . . . . . . . . . . . . . . . . . . . 131 5.2.1.2 Degradation parameters .................... 132 5.2.2 Gate-level degradation parameter multiplicity in multi-input gates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 134 5.2.3 Exhaustive gate-level degradation model . . . . . . . . . . . . . 136
5.3
Degradation Parameter Characterization Process . . . . . . . . . . . . 138 5.3.1 General degradation model validation . . . . . . . . . . . . . . .138 5.3.2 Gate-level degradation parameters extraction . . . . . . . . . 140
xvi
Contents
141 5.3.2.1 Variation with the output load . . . . . . . . . . 5.3.2.2 Variation with the input transition time . . . . . . . . 142 5.3.3 Characterization process complexity . . . . . . . . . . . . . . . 142 . 5.4
Analysis of Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5.4.1 Characterization results . . . . . . . . . . . . . . . . . . 5.4.2 Simplified model ................
148 149 150
5.5
Simplified Model Equations
............................
153
5.6
Simplified Model Characterization Process . . . . . . . . . . . . . . . .155 5.6.1 Basic model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161 5.6.1.1 Basic model equations . . . . . . . . . . . . . . . . . . . . . 163 5.6.1.2 Basic model characterization process . . . . . . . . . .163 5.6.2 Error estimation for the propagation delay . . . . . . . . . . . .165 5.6.2.1 Expressions for error propagation . . . . . . . . . . . . .166 5.6.2.2 Example of error propagation towards the propagation delay . . . . . . . 169
5.7
Discussion of Results
5.8
6
....
...............
174
Appendix: Calculation of Error Sensitivity in the Propagation Delay With Respect to the Degradation Parameter Error . . . . . .176 5.8.1 Sensitivity of the pro pro agation delay with respect to . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 177 parameter 5.8.2 Sensitivity of the propagation delay with respect to To . . 178 5.8.3 Sensitivity of parameter z with respect to A . . 178 5.8.4 Sensitivity of parameter z with respect to B . . . . . . . . . . .178 5.8.5 Sensitivity of To with respect to C . . . . . . . . . . . . . . . . . .178
Logic Level Simulator Design and Implementation . . . . . . . . . . . . . . . . .181 6.1
Introduction
.........................................
181
6.2
Object Oriented Methodologies: UML . . . . . . . . . . . . . . . . . . . . 6.2.1 UML introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6.2.2 UML representation .............................
183
...........................
186
183 184
6.3
Global Analysis of HALOTIS
6.4
Analysis of Requirements
..............................
190
6.5
HALOTIS Design and Modelling ........................ 6.5.1 HALOTIS use case diagrams ...................... 6.5.2 Object models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
192 192 194
xvii
Contents
6.6
7
8
HALOTIS Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199 6.6.1 Implementation language and platform . . . . . . . . . . . . . .199 6.6.2 Intermediate formats . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 199 6.6.3 Simulation core . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 200 6.6.4 HALOTIS tools . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201
DDM Simulation Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
203
.........................................
203
7.1
Introduction
7.2
Pulse Propagation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.2.1 Isolated pulse . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.2.2 Train of equidistant pulses ........................
205 206 208
7.3
Ring Oscillator Frequency . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.3.1 Simple oscillator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.3.2 Oscillator with out-buffer . . . . . . . . . . . . . . . . . . . . . . . . .
214 215 217
7.4
Metastable Behaviour . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7.4.1 Simulation results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
219 222
Accurate Measurement of the Switching Activity . . . . . . . . . . . . . . . . . . 227 .
.........................................
227
.....................
229
8.1
Introduction
8.2
Selection of the Testing Environment
8.3
Measurement of the Switching Activity Based on DFWII
. . . . .234
8.4
Measurement of the Switching Activity Based on HSPICE
. . . .237
8.5
Comparison between DFWII versus HSPICE Measurements
8.6
Accurate Measurement of the Switching Activity: A HALOTIS Application . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
244
.........................................
249
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
251
Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
265
8.7
Conclusions
. .239
This page intentionally left blank
Chapter 1
Fundamentals of Timing Simulation Carlos J e s h Jiminez Fernandez Manuel ValenciaBarrero
1.1 Introduction The design process of VLSI integrated circuits has different options and many stages. In general, there are great differences between the design process of analog and digital integrated circuits. Figure 1.1 outlines these design processes. In every design process, the tasks to test the correctness of the design are as important as the design itself. The sooner failures are detected, the sooner failures are corrected, and the sooner and less expensive it will be to make those possible corrections. In general, the starting point for an analog design is a circuit at the transistor level. Although in some cases it is useful to start off with functional descriptions composed of blocks of higher level (mainly amplifiers of different types), it is always necessary to extract the characteristics of these blocks and their design with transistors. Once the description of the circuit has been obtained at the transistor level, it is necessary to verify it. The layout design is usually manual, following a methodology called full-custom. The verification of the correctness of a layout is divided into three main areas. First of all, the verification of construction rules for layout imposed by the foundry, DRC (Design Rule Check). Secondly, it must be verified that the devices implemented by the layout exist within the netlist of transistors, LVS (Layout versus Schematic). And thirdly, it must be verified that the functional behaviour continues within the margins anticipated by the designer. For this last verification, a netlist with the par-
1
2
Logic-TimingSimulation and the Degradation Delay Model
Architectural level
HDL description
verification
I 1
I
Gate netlist
andtiming . verification
I I
I verification
Layout
I
Layout
Transistor netlist
I
Geometrical verification LVS verification
verification
Fig. 1.1 a) Analog design flow b) Digital design flow.
and timing verification
Chapter 1. Fundamentals of Timing Simulation
3
asitic capacitances is extracted from the layout for its simulation with a circuit simulator. The process of digital VLSI design is, in general, quite different from the analog design process. Although the same analog full-custom methodology can also be followed in the design process of digital circuits, the development of CAD tools allows the design process to be automated and therefore to follow a semi-custom methodology. The starting point of this methodology consists of raising an architecture (architectural level) from which an HDL description is usually obtained at the register transfer level. In these levels of design, the verifications are directed, mainly, at verifying the correct functional behaviour of the design, schemes of timing, etc. In these phases of the design, the descriptions are technologyindependent, so other types of verifications which need technological data cannot be made. Automatic synthesis tools transform the HDL description into a netlist at the logic gate level. In some cases, the description at the transistor level of the logic gates is available, so it is possible to generate a netlist of transistors from the netlist of logic gates. In these levels of design and the successive levels underneath, the descriptions contain technology information. Thus, in addition to the functional verification, a timing verification can be made. An analysis of the design taking into consideration the dynamic behaviour of the different components which constitute the circuit also has to be carried out. This analysis is of use to evaluate the final performance of the chip, as maximum operation frequency and outputs delay times. But in addition errors in the behaviour of the circuit caused by the propagation delays can be detected. The layout is generated from the logic gate netlist by the use of automatic tools. The verifications focus on geometrical aspects, checking the violation of the layout rules. Our interest is centred on the analysis of the problem of timing verification. This task is acquiring more and more importance due to two factors. On the one hand, the development of deep sub-micron technologies is producing a reduction in the delays of logic gates, so that the interconnecting delays have an increasing importance. On the other hand, circuits with a higher operating frequency and with faster interfaces with other components are needed. Thus, timing verifications with more precision and over bigger circuits are needed.
4
Logic- Eming Simulation and the Degradation Delay Model
In timing verification tools, timing behaviour is obtained by the use of delay models of the components of the circuit. Among these tools for the analysis of timing behaviour, the main one is the simulator. The simulator is a computer program whose inputs are the netlist of a circuit and a set of stimuli data introduced in the circuit inputs. The simulator imitates the behaviour of the circuit and obtains the value of internal signals and outputs related to the input stimulus. At gate and transistor levels, the use of timing simulators means that the simulation is always a timing simulation (as well as a functional simulation). With these simulators it is possible to analyse different aspects of a system: The sensitivity of the system to variations in component delays. If the design is free of critical races, oscillations, forbidden input conditions or clockout states. The comparison of different designs. The possibility of starting the simulation at any initial state. The analysis of the behaviour of synchronous circuits with asynchronous inputs. Another group of temporal verification tools are the temporal analysis tools. The main objective of these tools is to establish the critical paths of a circuit (mainly combinational). The critical paths are the paths which connect the inputs with the outputs of a circuit with a maximum or a minimum value in the propagation delay [Mizco (1986)l. Sometimes the critical paths obtained by these tools are never activated [McGeer and Brayton (1 99 l)]. It is important to eliminate these paths to carry out the timing analysis, mainly when a high frequency system is under design. This problem is usually called the false critical path problem. The objective of temporal analysis is to guarantee that the propagation delays of a circuit are not going to affect the correct behaviour of the circuit, as well as to estimate the maximum operating frequency of synchronous sequential circuits and to calculate the delay time of the outputs. Of both types of tools, the timing simulation is much more general, so from now, the focus will be on it. Taking into account the level at which they operate, the simulators can be divided into three main groups: the circuit simulators, the switch level simulators and the gate level simulators. The simulators that are fitted in each one of these types have common characteristics which will be described in the next sections.
Chapter I . Fundamentals of liming Simulation
5
In order to analyse how ideal each of the simulators is, some characteristics are defined which allow to be classified according to this quality. These characteristics are: The maximum circuit size which can be simulated with the existing computer resources The time needed to obtain the results (efficiency) The accuracy of the results (reliability) A simulator of maximum quality is one which can simulate very large circuits, in just a short time and with very accurate results. As will be seen subsequently, while a simulator is more near to some of these characteristics more moves away of the other. For that reason, it is very important in the whole simulation process that the customer knows the limitations of each type of simulator and may then choose the best simulator which fits the needs of the circuit under design.
1.2 Circuit Simulation Circuit simulation treats circuits as dynamic systems whose variables (voltages and currents) are continuous signals. The reference simulator is SPICE, a freeware simulator developed at the University of Berkeley [Newton et al. (1993)], but there are also commercial versions of SPICE (for example, HSPICE [Hspice (1999)], PSPICE [PSPICE] and others). These commercial SPICE simulators are distributed independently but also included in design environments. In general, circuit simulators are programs for simulating circuits which may contain resistors, capacitors, inductors, independent voltage and current sources, some types of dependent sources, lossless and lossy transmission lines and the four most common semiconductor devices: diodes, BJTs, MESFETs and MOSFETs. Circuit simulators have built-in models for the semiconductor devices, and the user needs to specify only the pertinent model parameter values. In the special case of the SPICE simulator, the model for the BJT is based on the integral-charge model of Gummel and Poon. However, if the Gummel-Poon parameters are not specified, the model is reduced to the simpler Ebers-Moll model. In either case, charge-storage effects,
6
Logic-Timing Simulation and the Degradation Delay Model
ohmic resistances, and a current-dependent output conductance may be included. The diode model can be used for junction diodes or for Schottky barrier diodes. The JFET model is based on the FET model of Shichman and Hodges. Six MOSFET models are implemented: MOS 1 is characterized by square-law I-V characteristics, MOS2 is an analytical model, while MOS3 is a semi-empirical model [Vladimirescu and Liu (1 98O)J; MOS6 [Sakurai and Newton (1990)l is a simple analytic model, accurate in the short-channel region, MOS4 [Sheu et al. (1985); Pierret (1984)l and MOS5 are BSIM (Berkeley Short-channel IGFET Model) and BSIM2 [Min-Chen (1990)]. SPICE can carry out different types of analysis, among which the following should be pointed out: DC Analysis The DC analysis portion of SPICE determines the DC operating point with inductors shortened and capacitors opened. A DC analysis is automatically performed prior to a transient analysis to determine the transient initial conditions, and prior to an AC small-signal analysis to determine the linearized, small-signal models for nonlinear devices. The DC analysis can also be used to generate DC transfer curves: a specified independent voltage or current source is stepped over a userspecified range and the DC output variables are stored for each sequential source value. AC Small-Signal Analysis The AC small-signal portion of SPICE computes the AC output variables as a function of frequency. The program first commutes the DC operating point or the circuit and determines a linearized, small-signal model for all the nonlinear devices in the circuit. The resultant linear circuit is then analysed over a user-specified range of frequencies. Transient Analysis The transient analysis portion of SPICE computes the transient output variables as a function of time over a user-specified time interval. The initial conditions are automatically determined by a DC analysis. All sources which are not time dependent (for example, power supplies) are set to their DC value. Pole-Zero Analysis The pole-zero analysis portion of SPICE computes the poles and/or
Chapter I . Fundamentals of llming Simulation
7
zeros in the small signal AC transfer function. The program first computes the DC operating point and then determines the linearized, small-signal models for all the nonlinear devices in the circuit. This circuit is then used to find the poles and zeros of the transfer function. The method used in the analysis is a sub-optimal numerical search. For large circuits it may take a considerable time or fail to find all poles and zeros. Small-Signal Distortion Analysis The distortion analysis portion of SPICE computes steady-state harmonic and intermodulation products for small input signal magnitudes. If signals of a single frequency are specified as the input to the circuit, the complex values of the second and third harmonics are determined at every point in the circuit. If there are signals of two frequencies input to the circuit, the analysis determines the complex values of the circuit variables at the sum and difference of the input frequencies, and at the difference of the smaller frequency from the second harmonic of the larger frequency. Sensitivity Analysis SPICE will calculate either the DC operating-point sensitivity or the AC small-signal sensitivity of an output variable with respect to all circuit variables, including model parameters. Spice calculates the difference in an output variable (either a node voltage or a branch current) by perturbing each parameter of each device independently. Since the method is a numerical approximation, the results may demonstrate second order effects in highly sensitive parameters, or they may fail to show very low but non-zero sensitivity. Furthermore, since each variable is perturbed by a small fraction of its value, zero-valued parameters are not analysed (this has the benefit of reducing what is usually a very large amount of data). Noise Analysis The noise analysis portion of SPICE does an analysis of device-generated noise in the given circuit. When provided with an input source and an output port, the analysis calculates the noise contributions of each device (and each noise generator within the device) to the output port voltage. It also calculates the contribution of input noise to the circuit, equivalent to the output noise coming from a specified input
8
Logic-Eming Simulation and the Degradation Delay Model
source. This is done for every frequency point in a specified range. The calculated value of the noise corresponds to the spectral density of the circuit variable viewed as a stationary Gaussian stochastic process. After calculating the spectral densities, noise analysis integrates these values over the specified frequency range to arrive at the total noise voltage/current (over this frequency range). This calculated value corresponds to the variance of the circuit variable viewed as a stationary Gaussian process. All input data is assumed to have been measured at a nominal temperature (typically 27°C). This value can be overridden for any device which models temperature effects by specifying a parameter on the model itself. The first step underlying simulation is, the formulation of a coupled set of nonlinear first-order, differential algebraic equations representing the behaviour of the interconnected set of devices comprising the circuit. The second step is the replacement of the time derivatives on the differential equations by means of finite difference approximations (known as integration formulas) which discretise time, in general, in a non-uniform way. This step transforms the nonlinear differential equations, at each discretized time point, into a time independent set of nonlinear equations. The third step is to solve the nonlinear equations, at each discretized time, by means of the Newton-Raphson technique which approximates them with a linear set of equations based on an initial estimate of the solution. A repeated solution of the linear set, with relinearization of the equation set after each iteration, is used to refine the estimated solution until it is deemed that adequate precision has been achieved pichols (1994)l. The converged solution of the Newton-Raphson process is then tested as an adequate solution of the differential equation set for this time point. The mechanisms used for the calculation of an output variable imply the resolution of differentials equations. Action is necessary when the Newton-Raphson iterations fail to converge to a solution, or convergence is attained but the circuit solution is too imprecise or is numerically unstable. The action taken normally involves cutting the time increment and repeating the solution process at the same time point. Having arrived at a satisfactory solution at the time point, a trial time increment to advance to a new point is selected, and a prediction of the
Chapter 1.Fundamentals of Eming Simulation
9
solution at the new point is made. This prediction is used as the initial estimate of the solution for the Newton-Raphson process at the new time point. Thus simulation proceeds as a march-in-time through a sequence of discretized time points selected to achieve both convergence of the Newton-Raphson process and adequate precision of simulation. A key factor in this kind of simulator is that there is not delay model by itself. The functional model includes the delay model, too. So the computation of the output variables cannot be divided, as described later for other kinds of simulators, into the computation of the functional behaviour and the computation of the delays. This type of simulation is characterized by its high precision. However, it requires a long time and a great amount of computation resources to generate results. Computation time grows quickly with the size of the circuits. For this reason, this type of simulation is generally used to verify circuits of a small size or independent modules which belong to larger, high precision circuits. These simulators are also used to compare the results produced by simulators which are more efficient in computation times, but less precise. Other tools use SPICE as a reference simulator in order to produce designs optimized for some parameters while maintaining some other performances. Sometimes the smallest area of the transistors is the desired target. The purpose of circuit simulators is the electrical characterization of circuits. Although they can carry out transient analysis, it is not their main function, so they are not optimized for that task. For this reason, although they achieve the maximum precision among all kinds of simulators and their outputs are used as a reference for other simulators, the performance of speed and the maximum size of circuits which can be simulated with this kind of simulator is not good enough for simulating complex deep sub-micron circuits. But there is another important reason which does not allow the use of this kind of simulator in the design of digital circuits. These simulators need a netlist description of the circuit at the device level (transistors, capacitors and inductors). In the design of digital circuits, based on a semi-custom design flow, the design is based on standard cells and macro cells, but it is not usual to have the device level description of the stand-
10
Logic-lhing Simulation and the Degradation Delay Model
ardmacro cells of the foundry libraries. In these cases the use of this type of simulator is impossible.
1.3 Transistor-Level Simulation
1.3.1 Switch-level simulation
In contrast with circuit simulation, in switch level simulation the signal values are discrete and the transistors are modelled as bidirectional resistive switches. In this type of simulation, the tension values in the nodes are discrete, mainly 0, 1 and X (undefined value). Besides, sometimes the value of high impedance is included (represented by the letter Z). The switch-level simulation technique operates directly on the structure of the circuit designed with transistors and, for that reason, it makes it possible to consider many properties of the circuit which are difficult, if not impossible, to consider at gate level. For example, the bidirectional effect of a signal, the effect of load distribution or the control of the geometric parameters of transistors. The basic way for modelling the transistor is to replace it by a switch controlled by the voltage in the gate. If this switch models an N-MOS transistor, it is closed when there is a voltage equivalent to a logic “1” in the gate and it is open when the voltage is equivalent to a logic “0” (a PMOS transistor is controlled by complementary values). A discrete value of strength can be introduced in the transistor model which is used to characterize the conductance. With this parameter it is possible to analyse circuits with several transistors, and with different geometries and sources connected to the same node. Thus, a subcircuit compound with transistors connected in series has an equivalent strength to the weakest transistor of the chain, but the strength of a subcircuit with transistor in parallel is the strongest transistor. The input nodes, such as power, clocks, input data, have the highest strength, so they can always influence the state of the remaining nodes of the circuit but not inversely. On the other hand, the internal nodes of the circuit are considered storage nodes with the capacity to accumulate load. These nodes have dis-
Chapter 1. Fundamentals of Eming Simulation
11
Crete sizes assigned to them which depend on the relative value of their equivalent capacities. This size is used when the internal nodes are disconnected from the input nodes. In this situation an effect called distribution of load occurs, so that the nodes of greater size dominate the load of the nodes of minor size connected to them. The simulation of the whole circuit uses an event-driven scheme. This technique is the one which provides the high speed of generation of results and makes it possible to analyse very complex circuits. The main difference is that now there are no blocks with predefined functionality, but blocks composed by serial-connected transistors. This simulator structure allows for the simulation of digital circuits with structures without logic gates, as well as circuits constructed with dynamic or differential logic. Concerning temporal aspects, there are two basic ways for the calculus. The first one makes use of a circuit simulator to estimate the delay and the waveform of the signals. A partition of the circuit is made, establishing which nodes change their value. With this information, those subcircuits whose output nodes had changed their value are selected. The circuit simulator is applied to these subcircuits so that the analog simulation can be carried out now. The CPU time and the memory required are reduced considerably because the simulation is not performed over the whole circuit but over the subcircuit with a node which has changed. With this technique the propagation delays of signals are obtained with very good precision. Nevertheless, although a great reduction of CPU time and other computer resources are obtained with respect to circuit simulation, when the circuit under simulation is large, the CPU time needed is too high. This type of simulator is not useful for circuits with more than 10.000 components. The second way to make the simulation consists of using the eventdriven simulation technique in a way similar to that used in the logic timing simulation at gate level. This way a higher simulation speed is reached than with the previous alternative. On the other hand, the precision of the results depends on the delay model used. In order to apply the eventdriven simulation technique it is necessary to have models of the dynamic behaviour or a generic network of transistors. This kind of simulation, with the increase of speed of operation at the cost of precision, has numer-
12
Logic-Timing Simulation and the Degradation Delay Model
ous disadvantages. In the first place, there is still a great complexity in the design and it is not possible to simulate circuits of great size. On the other hand, the entry point is a netlist with descriptions at the device level (mainly transistors), which prevents its use if there are no suitable models. This type of simulation, halfway between circuit simulation and gate level simulation is falling into disuse, and is being replaced by other transistor-level simulators.
1.3.2 Advanced transistor-level simulators
The need to verify deep sub-micron circuits of very great size has led to the appearance of a new type of simulator, which perform a timing verification at transistor level with a precision similar to that obtained with electrical simulators but with much greater speeds. These commercial simulators (such as Synopsys’s NanoSim or Mentor Graphics’ Mach TA) combine the following characteristics: They use an intelligent partition making it possible, with the synchronization of the design, to carry out parallel operations. They combine the “time-based” and “event-driven’’ simulation techniques, without losing precision in the results. They use SPICE, Verilog and other input netlists. They manage devices such as BJT, JFET, MOSFET, etc. But the core of this type of simulators are not the models they use, but how they use them. Due to the commercial secrets which prevail over these simulators, there is little information available, we know the way of operation consists of tabulating the behaviour of the devices so that the execution of the program is much faster and more efficient. Although these simulators increase the benefits of the circuit simulator with a small degradation in the behaviour, nevertheless they have two strong drawbacks: They still have restrictions on the size of the circuit being simulated. They need netlists based on transistors. The last restriction can be crucial in semi-custom designs based on library cells without a transistor level description. In such a case the only simulation that prevails is the timing-logic simulation.
13
Chapter 1. Fundamentals of7iming Simulation
OUT
IN+ vin
- GND
Static Behaviour Dynamic Behaviour
(4
Static Behaviour Dynamic Behaviour
(b)
Fig. 1.2 a) CMOS inverter, b) Logic model of a CMOS inverter.
1.4 Timing Gate Level Simulation The gate level timing simulators make an abstraction of the waveform of the signals, which in fact are continuous signals (Fig. 1.2 (a)) but are transformed into waveform with discrete values (0, 1, X, Z, ...) (Fig. 1.2 (b)). At the functional level, such abstraction makes it possible to use Boole’s Algebra for the mathematical processing of the circuits, which makes it possible to specify formally and, consequently, to design the digital systems. In addition, this abstraction establishes a temporal relation between the inputs and the outputs of a gate, represented by the intuitive notion of propagation delay. For example, the output of the inverter of Fig. 1.2 (b) changes at moment tl + $, as a reply to the input change which occurred in tl. That is why it may be said that the inverter has a propagation delay of value $,. These two levels obtained from the functional temporal abstraction are separated to make a different treatment for each one. A given instance of a real gate may be split in two types of blocks, a first type that consid-
14
Logic-Timing Simulation and the Degradation Delay Model
Real
Log1c Gate
X,
4
x3
-
D namic hock
D namic
1 ~
6lock
(4
Fig. 1.3 Partition of a real logic block into two blocks: functional and dynamic. a) real logic gate, b) delay model before the gate, c) delay model after the gate.
ers the functional behaviour of the gate and a second one that considers the dynamic effects, that is to say, the propagation delay. The second type of blocks are named the delay elements. As may be observed in Fig. 1.3, there are two possible configurations for these blocks which in principle are non-excluding. In the configuration for Fig. 1.3 (b), the dynamic blocks or delay elements are placed between the input signal and the functional block. Thus, there are as many blocks as inputs. However, in the configuration of Fig. 1.3 (c) only one dynamic block is placed between the functional block and the output signal. On account of the use of many more elements, the first model gives much greater flexibility than the second one. Nevertheless, most timing simulators and timing analysers use the second option because it requires much less data storage. The delay element is fully characterized when it has a delay model associated with it. A model of this nature is characterized by a set of rules and parameters which are used to determine the value of the propagation delay for an input transition. In order to establish a delay model, the following aspects must be considered because they are going to characterize the model:
Chapter I . Fundamentals of liming Simulation
15
On the one hand, the effects considered in the model. Basically these effects can be grouped into two types: static and dynamic. The static ones are those invariant in time, whereas the dynamic ones are changing in time. The more typical static effects considered are: the pure delay, the dependency with the output load and the dependency on the geometry of the transistors. The dynamic effects of greater importance are the dependency on the slope of input transitions and the dependency on the closeness between transitions, that is to say, effects such as collisions and glitches. The method of obtaining the relations which describe the timing behaviour. There are two ways to obtain these relations, an analytical method and a heuristic method. In the analytical method, the initial point is the simplified model of the transistors, from which the behaviour of the output is deduced as a function of the parameters of the simplified models (geometry, loads, etc.) and the input waveform. The heuristic method is based on the extraction of an important amount of information from the electrical simulation to look for the expressions and/or methods which best describe these data. There are some adjustment methods and among them the Piece-Wise Linear (PWL) method is very common. This way, a digital circuit in the logical-timing level is made up of blocks which make logic functions along with blocks which incorporate the dynamic behaviour by means of the evaluation of the propagation delay. The behaviour of the circuit is determined by the transitions or events in the signals (i.e. the logical changes from 0 to 1 or from 1 to 0) and the propagation of these events through the blocks which compose the circuit. In order to analyse the behaviour of this type of system, the eventdriven simulation technique is used. The delay model and the eventdriven technique are the two basic characteristics of the simulator tools at the logical level. The model determines the precision of the results and the event-driven technique is the one which provides the greatest efficiency in the generation of results. We are going to present briefly some of the simplest static delay models and the event-driven simulation technique.
16
Logic-Eming Simulation and the Degradation Delay Model
1.4.1 Delay models at gate level
The simulators, at gate level, can include different types of delay models, with a different level of complexity. The simplest ones will be useful, mainly, for the functional verification, and the most complex ones will also be useful for timing verification.
1.4.1.1 Zero and unit delay models
The zero and unitary delay are the models of lesser complexity. They are useful mainly for the functional verification, since they do not contain a minimum degree of precision in the simulation to be able to consider timing aspects. The model consists of only one parameter of one unit. With this model, all the gates which compose a circuit design have the same timing behaviour. Although the results provided by the use of this model are not precise and it is not possible to consider that a timing verification has been made, it is possible to detect some timing phenomena such as, for example, the hazard.
1.4.1.2 Static delay models
The first model which begins to contribute a sufficient degree of precision in the results in the logical timing simulation is the denominated model of assignable delay. It is characterized by having each logical gate its own delay element associated to it, that is to say, the values of the parameters of the model are different for each gate. The simplest version consists of a single parameter, D,called pure delay, for each delay element. The difference between this version and the Unitary Delay Model is that the value of D can change from one gate to another. The second version considers two different values for the pure delay of an element, one for the transition from 0 to 1 (Dlh) and the other for the transition from 1 to 0 (Dhl).Another version arises when the delay value is a function of the load at the output of the gate.
Chapter I . FundamentaIs of Eming Simulation
17
1.4.1.3 Dynamics eflects
The wide use of static models has made it possible to observe some of the inaccuracies obtained in the timing logic simulation. The main reason for this resides in the fact that the propagation delay of a gate changes according to the waveform of the input signal. This has led to the development of new delay models in which these effects are considered. These delay models are called generically Dynamic Delay Models. At the moment, the existing dynamic models consider mainly two effects of the waveform: the slope of the input signal and the closeness between consecutive changes. This last effect is called the effect of collisions [Melcher et al. (1 992)].
1.4.2 The event-driven simulation technique Figure 1.4 shows the different elements necessary to carry out a simulation process. The simulation program arranges, on the one hand, the netlist of the circuit and the stimuli and control parameters provided by the user. On the other hand, it has to count on the behaviour models of the components used in the circuit, often obtained from a precharacterized library. After developing the simulation process, a set of results is generated. The verification of a design consists in verifying that the results obtained when simulating that design match the desired behaviour of the circuit. The event-driven technique consists in evaluating exclusively the time in which events take place and how they propagate through the different components of the circuit. In most cases, an event is associated to the change in the value of the signal, so that an event in the input of a gate may, when coming out, cause a new event in the output of this gate. This implies a fundamental difference with respect to circuit simulation, in which an analysis of the value of the signals is made in continuous time, that is to say, the signals are analysed at every necessary instant in order to be able to represent the signal by a continuous curve. For this reason
18
Logic-Timing Simulation and the Degradation Delay Model
Simulation
program
Results
netlist)
Behavioural
models Fig. 1.4 Elements in a digital simulation process.
logical simulation is several orders of magnitude faster than circuit simulation, needing, in addition, much fewer resources of memory and CPU time. In the following, event-driven simulation will be analysed. In this type of simulation it is said that an element is active when an event occurs in some of its input signals. Whenever an active element exists in a given moment, the simulator should carry out the evaluation of this element. This evaluation consists of determining if the output of the active element is going to change in value and, if so, with what propagation delay. This is why it is necessary to use a delay model of the element. The simulation process begins by analysing the events which occur in the input signals of the circuit, which have been defined previously by the designer in the input stimuli file. As these events are evaluated, they generate new events in the remaining wires of the circuit and, thus, they activate new elements which are not connected directly to the input signals. Thus, a double propagation of events takes place: in time and in the elements which compose the circuit. The temporary flow mechanism of the simulation handles the events so that they are evaluated following an increasing timing order. In order to do so, the events are stored in what is called a queue of events, according to the moment in which they occur. This queue of events is being modified continuously, eliminating those
Chapter I . Fundamentals of Kming Simulation
19
events which have been evaluated and incorporating the new events which have been generated and have become active elements. Figure 1.5 shows the main flow of this type of simulation. Once a period of time is evaluated the simulator advances to the following time in which pending events exist, which becomes the present time of simulation. Later, the simulator obtains from the queue of events those events which occur in that moment and updates the value of the active signals. The active elements are determined from the list of active signals. Later, the active elements are evaluated and new events can arise. These events are introduced in the queue following the order in which occur. The process is repeated for each event at the present moment. The simulation continues as long as there is activity in the circuit.
1.5 Summary and Tendencies Table 1.1 summarizes the characteristics of the different types of timing simulation, based on the maximum size of the circuit, the speed of obtaining results and precision. A basic conclusion may be observed: the faster the simulation, the less precise are the results, and inversely. Table 1.1 Characteristics of different types of simulation.
Simulation type
Maximum circuit size
Speed
Circuit 10-1000gates very low simulation
Precision
Notes
very high
Only for small circuits
Switch-level simulation
lo5 gates
medium
medium
Only in circuits with transistor-leveldescription
Gate level
> lo6 gates
high
low
The only one used in semi-
simulation
custom designs
In all that has been presented so far, there are clear tendencies. The need for high precision timing simulations which are able to support very great circuits does not allow for the use of electrical simulators due to two factors. In the first place, the complexity of the calculations makes this
20
Logic- Eming Simulation and the Degradation Delay Model
I
Init
the next simulation time ~
Next event in actual time
i
Actualization of active
signals
1
Computation of new events
1
YES
Fig. 1.5 Flow diagram in an event driven simulation algorithm.
type of simulations slow and applicable only to small circuits. Secondly, it is necessary to have device-level descriptions of the circuits. Although switch level simulations simplify calculations and thus yield greater speeds making it possible to simulate greater circuits, use device level netlists it is a drawback. Gate level simulators are better to fulfil the present and future necessities of design verification. Nevertheless the low precision of their results can be a great problem, mainly in the current deep sub-micron technologies.
Chapter 1. Fundamentals of liming Simulation
21
This makes it necessary to increase the timing precision of these simulators and to include models with more precision. Although the complexity of calculations will increase, the models used in circuit simulators will always be much simpler because they are referenced to the logical level and not to the electrical level.
This page intentionally left blank
Chapter 2
Delay Models: Evolution and Trends Manuel J e s h BelIido Diaz David Guerrero Martos
2.1 Introduction In logic timing simulation, a delay model is used to predict the dynamic behaviour of every element of the circuit (transistor net in transistor level simulation, logic gates in gate level simulation). The simulation precision depends on the precision of the delay model used. Delay models can be classified into two categories: deterministic and nondeterministic. These categories have several subtypes (Table 2.1) which will be presented in this chapter.
2.1.1 Deterministic delay models In this model, every circuit component has a single delay value which may depend on several factors. There are two types of delay models: Unitary delay models: In these models every circuit component has the same delay. Assignable delay models: In these models the delay of each component may differ. Assignable models can consider different effects to calculate the delay of each element. For example, when considering the output capaci-
23
24
Logic- Timing Simulation and the Degradation Delay Model
Table 2.1 Classification and characteristics of delay model types.
Zero delay Outputs change instantaneously when inputs change. Only functional simulation is carried out. Unitary delay The delay value is the same and fixed for every circuit component. The timing information obtained is qualitative.
Deterministic Calculate a specific value for the propagation delay.
Non-deterministic They find bounds for the delay. They enable simulation of random phenoma but the results obtained are often pessimistic.
Assignable delay Delay has a separate value 'or each circuit component.
Static The delay depends on the circuit nd parameters that do not change with time. The results are quite iccurate under bounded operating conditions. Dynamic The delay depends on the waveform as well as on static parameters. Different delay values are possible for separate simulation instants. Results can be very accurate in a wide range of operating conditions.
Minimum-maximum Assign the same probability to every delay value within a range. Statistical The probability of a delay value is ruled by a probability function, usually Gaussian.
tame of a gate, C,, the delay value is determined by the following expression [Abramovici et al. (1990)l: t, =
tpcfo
+ %CL
3
(2.1)
Chapter 2. Delay Models: Evolution and Trends
25
where tpc,,, is the intrinsic delay of the gate (the delay when C, = 0), and m,, models the influence of the output capacitance of the gate. We can consider two types of assignable deterministic delay models: static and dynamic [McGeer and Brayton (1991)l. In a static model, the delay of a gate depends only on the circuit and on gate characteristics which do not change in simulation time. In a dynamic model, the delay also depends on the input waveform of the element and may vary in simulation time. Static models are less precise than dynamic models since they do not take into account the history of the input waveform, but they can be quite accurate if the operation conditions are well-defined and the elements have been properly characterized. There are several factors in the input signals which can change the propagation delay, for example, the input slope or the temporal proximity of transitions in a gate input (input collisions). Modelling this effect would make it possible to deal in logic simulation with effects such as glitch propagation in circuits as well as to detect and to control oscillatory states [Abramovici et al. (1990)l.
2.1.2 Non-deterministic delay models Non-deterministic delay models do not specify a single delay propagation value for each element of the circuit. Instead they calculate lower and upper bounds for the real delay value. There are two types: Minimum-maximum delay (min-max), which consider that the probability of the delay of a gate is uniformly distributed in an interval. Thus, during the simulation the minimum and maximum possible delay values are calculated, since they are the most significant cases. Statistical delay [Vasuneda (1993)], which assigns a non-uniform probability to the values of the delay within a range bounded by a maximun and a minimun value. Usually, a Gaussian distribution is used. The distribution is centred in a value called typical delay, so that the probability decreases from the typical delay to the maximum or minimum.
26
Logic-Timing Simulation and the Degradation Delay Model
The main advantage of non-deterministic delay models is that they can deal with model random issues such as variations of the propagation delay of each element in the production process and the environmental conditions, but they have several disadvantages. On the one hand, they lead to results which are too pessimistic about the circuit behaviour and, on the other hand, they require much more computation time during simulation. Moreover, they do not allow for the simulation of several issues such as propagation of short pulses in a circuit or oscillation state detection. Finally, this type of model can lead to simulation results which are not possible in several circuits [Mizco (1986)], so it is necessary to pay special attention to detecting this type of wrong results. With deterministic delay models it is always possible to make two estimations of the circuit operation using first maximum delay values and then minimum delay values, which make it possible to allowing problems due to extreme delay values. Because of this, we will focus exclusively on deterministic delay models. In the next section, a more detailed analysis of this type of model will be presented.
2.2 Deterministic Delay Model Types
In this section we will see different delay models following in rising order of complexity and accuracy. We will first look at those helpful in functional verification and we will follow with those which allow timing verification.
2.2.1 Zero and unitary delay models
The simplest models are the zero delay model and the unitary delay model, which are employed in the functional verification of the circuit without taking into account timing issues. The zero delay model does not take into account the propagation delay. Only the functional behaviour of the gate is considered. (Fig. 2.1) The unitary delay model uses a single delay element in the gate modelling. As may be seen in Fig. 2.2, the model has a single parameter that is
27
Chapter 2. Delay Models: Evolution and Trends
Fig. 2.1 Zero delay model.
I IN-
N
2
I
OUT OUT
3
Iu
Fig. 2.2 Unitary delay model.
the propagation delay from an input gate to the output. It must be emphasized that in this model all the gates of a circuit have the same timing behaviour. Although the results obtained with this model are not yet accurate enough for temporal verification, they allow for detection of some timing phenomena such as glitches (Fig. 2.3).
2.2.2 Assignable delay models The models that allow for sufficient precision in logic simulation are the assignable delay models. In these models each logic gate has its own delay element, that is, each gate has its own delay parameters. Assignable models can be static, if they do not take into account the input waveform, or dynamic.
2.2.2.1 Static delay models
Here four static assignable delay models will be presented in rising order of complexity as an example.
28
Logic-Ening Simulation and the Degradation Delay Model
\Hazard Fig. 2.3 Logic timing simulation with unitary delay model.
The simplest one has only parameter, t, , called pure delay, for each delay element. In this model any change at the input of a delay element will change the output with a delay equal to t,, as may be seem in Fig. 2.4 (a). Unlike the unitary model, in this model each gate can have a different t , value. A second version of the model allows for two separate values for the pure delay of the same element: one for transitions from 0 to 1 (t,,) and the other one for transitions from 0 to 1 (tPf). Fig. 2.4 (b) shows this model working. For any gate, t,, y t,, are usually different. In the third version of the model, the propagation delay depends on the output capacitance. There is a lineal dependence between them which follows this expression: t , = t,, + mcCL
(2.2) where CL is the output capacitance t,,and m, are gate parameters. If necessary, it is possible to use separate values of t,, and m, for falling and rising transitions. Fig. 2.4 (c) shows a delay element working with this delay model. This model takes into account issues related to the placement of the gate within the circuit (such as fanout). 3
Chapter 2. Delay Models: Evolution and Trends
IN
tP
29
OUT
IN
OUT
I
OUT
Fig. 2.4 Static assignable delay models: a) Pure delay. b) Pure delay with separate rising and falling values. c ) Pure delay taking into account the output capacitance. d) Inertial pure delay with t p i = t , .
A fourth version of assignable model can introduce the so-called inertial effect [Unger (1969)l. This is an effect observed in real gates which prevents short pulses from propagating through the gates. In this version each delay element has two parameters: t , or the pure component and tPi or the inertial component. The model works this way (Fig. 2.4 (d)): a pulse of width T , at the input of a delay element appears at the output with a total delay t, if T , > tPi ,but it is eliminated (that is,
30
Logic- 7iming Simulation and the Degradation Delay Model
the input does not change) if T , I t p i .Pure delay, t, is modelled as in Version 3. In summary, we have presented four versions of a static assignable delay model which take into account the following issues about the real behaviour of the gates: Version 1: pure delay propagation effect: t , parameter. Version 2: separate propagation delay for falling and rising transitions: t,, and tPf parameters. Version 3 : influence of the output capacitance over the propagation delay: tpOr,t P o f ,mcr and mcf parameters for the gate and C , parameter for the circuit. Version 4: Version 3 including the inertial effect: additional parameters: tpir and t P i f . In order to use these models it is necessary to get their parameter values ( t p O r ,t p o f etc.) , for each gate. This task is called parameter characterization. Usually, these models have a characterization process of its values which is relatively straightforward and fast without having to develop analytical models to obtain them.
2.2.2.2 Example of static delay model parameter characterization
As an example we will consider a gate, in this case an inverter (Fig. 2.5), in order to characterize it for the versions of the static assignable delay models which we have seen. For this characterization, analog simulation will be employed, namely with the HSPICE [Hspice (1999)l simulator. First of all, we must set the measurement criterion for the timing parameters. Generally, this criterion must be specified by the model itself. We will use the usual measurement criterion, that is, the pass through 50% of the polarization range (Fig. 2.6). The characterization of the simplest versions of assignable delay models (Versions 1 and 2) is carried out with a single simulation, whose result is shown in Fig. 2.7 (a). As may be seen, parameters t,, and tPf of
Chapter 2. Delay Models: Evolution and Trends
31
P wdP1 =8/0.8 Fig. 2.5 CharacterizedCMOS inverter. 0.7pm CMOS technology.
v~~ v~~ 2
O(GND)
I
--
1
0 Fig. 2.6 Criterion to approximate a real signal to a pure digital signal.
Version 2 are obtained directly from simulation, while t, parameter of Version 1 is obtained as a mean of both values: t , = ( t P r+ t,)/2. The third version, which includes load dependency, requires several simulations with different load values at the inverter output. Table 2.2 shows these results. There is a lineal relation between delay and load and the values of the parameters obtained are m, = 0.524ps/fF and t,, = 6 0 . 5 ~ sThese . values are approximately the same for both types of transitions, so it is not necessary to make a distinction between them, For the fourth version of the assignable model we must set the inertial delay value. Taking into account the measurement criterion, this value is obtained from the transitory simulation of an input pulse which produces
32
Logic-TfmingSimulation and the Degradation Delay Model
. .:
~
; . . ... . . . . . . . .
;
INYERSOR.EF!
.-
Fig. 2.7 Transitory analysis of a CMOS inverter. a) Measure of t p r , tPf y t p . b) Measure of the inertial delay.
an output pulse reaching 50% of the polarization but does not go beyond it (Fig, 2.7 (b)). The value of the inertial delay is practically equal to the propagation delay for all the load conditions, so it will be assumed that tP I'X = tp x ' To sum up, the inverter parameter values for each model version may be seen in Table 2.3.
Chapter 2. Delay Models: Evolution and Trends
33
Table 2.2 Propagation delay value of an inverter for several output capacitances.
95.06
66.24
130.1
132.5
164.6
198.7
199.2
.
265.0
Table 2.3 Delay parameter values for assignable delay models in a CMOS inverter.
Version 1
Version 2
Version 3
Version 4
t , = 1 6 5 ~t,,~ = 1 6 4 ~ ~t,, = 6 0 . 5 ~ ~ t,, = 6 0 . 5 ~ ~ m, = 0.524psIfF tPf = 166ps m, = 0.524ps/fF tPi = t ,
2.2.2.3 Dynamic delay models
The widespread use of static delay models makes it obvious that the logic simulation results obtained with these models are not accurate enough. The main reason is the strong dependence of the gate propagation delay on the input signal waveform. Because of that, new assignable delay models, generally called dynamic delay models, have been developed to take into account these effects. The existing dynamic models take into account two issues of the input waveform: the input slope and the proximity between consecutive changes. The last one is called the collision eflect [Melcher et al. (1992)l. Fig. 2.8 shows examples of both. The input slope is relevant because real signals are continuous and do not change instantaneously between logic levels. To model the wave form each transition is commonly approximated by a straight line. This linealization can be carried out following different criteria, for example, the
34
Logic-Timing Simulation and the Degradation Delay Model
IN' >OUT IN2
OUT
IN
IN2 O U T T \ \
Ak-~
I-'
?-,
OUT
tp*tpnomal
P (a>
(b)
(c)
Fig. 2.8 Dynamic effects: a) input slope, b) input collisions which produce opposite changes at the output, c) input collisions which produce the same effect at the output.
passing through 10% and the 90% of the polarization range, or taking the straight tangent to the real curve when it passes through 50% of the polarization range. Both methods lead to satisfactory results. Each transition is thus characterized by its slope or by the time employed to commute between polarization rails, which is called transition time. As shown in Fig. 2.8 (a), if the transition time changes, the propagation delay changes significantly. There are two types of collisions. The first one (Fig. 2.8 (b)) occurs when input changes that are near in time produce output changes in opposite directions. This type of input change generates small pulses or glitches at the gate output which can propagate through the circuit (glitch collisions). In the second type input changes that are near in time produce changes in the gate output in the same direction (Fig. 2.8 (c)). This can accelerate the output transition in same cases or delay it in others [Melcher et al. (1992)l. Nowadays it is necessary to include dynamic effects to provide enough accuracy. The dependency of the delay on these effects is related to the production technology of I.C., so it is necessary to develop different models for each technology. Moreover, technological breakthroughs
Chapter 2. Delay Models: Evolution and Trends
35
make it mandatory to verify model accuracy continuously. This is why there are many works published in this field. We will now make a systematic review of a series of articles introducing innovations on delay models which we consider representative enough.
2.3 State of the Art in Delay Models
The research community has made, and is currently making, remarkable efforts to develop delay models and timing simulation techniques to achieve a better characterization and analysis of integrated digital circuits. These efforts have produced a huge number of articles published on this issue, especially in the last two decades. The delay model field is a hot issue since technological breakthroughs and increasing circuit perfomance oblige a continuous verification and improvement of the existing models. Here we present a wide variety of works published within the last few years in the delay model field. We will focus on those dealing with deterministic delay models for CMOS technologies. The works presented are not an exhaustive but a representative showing of the evolution of this field of research. First of all the main criteria to classify delay models which we will use with the selected works will be introduced. Then the performance reached by several implementations of delay models will be analysed, considering accuracy and simulation time. Finally, the evolution in the delay model field and possible future trends will be discussed.
2.3.1 Classification of the proposed delay models
It is not easy to obtain suitable criteria to classify the delay models developed, since there are multiple viewpoints that have led to their development. We propose a classification based on four criteria which are summarized in Table 2.4: technology, abstraction level, effects taken into account and the method of analysis. Each one is described below.
36
Logic- liming Simulation and the Degradation Delay Model
Table 2.4 Delay models classification criterion. Technology:
Abstraction level:
NMOS CMOS BiCMOS etc.
Transistor level Gate level
Effects taken into account: Static effects only Static and dynamic effects
Analisys method: Analytic method Heuristic method
Technology: This refers to the integrated circuit design technology the model was developed for. It may be NMOS, CMOS, BiCMOS or others. Many models focus on a specific technology, usually CMOS because it is currently the most widespread technology for I.C. production. Abstraction level: The viewpoint in the development of a delay model depends on whether it is applied in discrete circuits at the logic gate level or at the transistor level. For example, when it is applied at the transistor level, it is necessary to obtain the explicit dependence with the geometric parameters in the delay equations, while models for logic simulation at gate level can be described at a higher description level, considering each component as a black box whose input-output behaviour has been modelled. Effects considered: As seen in Sec. 2.2, deterministic delay models can be static or dynamic, depending on the effects they consider. Analysis method: The goal of the modelling process is to obtain an expression to describe the dynamic behaviour of the circuit components. There are two main non-exclusive methods to obtain this: a m lytic and heuristic. Analytic models use simplified transistor models and solve the differential equations which describe the behaviour of a circuit component for a given load and stimuli. Heuristic models, on the other hand, have a previous phase of data collection about the behaviour of the component, obtained from a prototype or by precise
Chapter 2. Delay Models: Evolution and Trends
37
Table 2.5 Summary of characteristics for several delay models.
ABSTRAC. DYNAMIC METHOD REMARKS LEVEL EFFECTS
REF.
TECH’
Ousterhout (1985)
MOS
transistor
Lai et al. (1987)
MOS
transistor
Deschant et al. (1988)
CMOS
transistor
Deng (1988)
CMOS
transistor
Deng and Shiau (1990)
CMOS
transistor
Wu and Shiau (1990)
CMOS
gates
Yang and Hoburn (1990), Vemuro and CMOS Smith (199 1)
slope
slope
0.f. (lineal 2
intervals)
Analytic
General
Analytic
General
Analytic
General
Heuristic
General lineal fit by interval
Anal/Heur Uses generic RC theory Analytic
transistor
slope
AnaVHeur
Jeppson (1994)
CMOS
gate (inverter)
slope
Analytic
Embabi and Damodaran ( 1994)
CMOS, BiCMOS
gate (inverter)
slope
Analytic
Capacitance coupling
electric simulation. In a second phase they are analysed to obtain expressions able to describe the dynamic behaviour of the component using few parameters. In fact, pure analytic or heuristic models are not used. The equations to be solved in an analytic approach are usually too complex so it is necessary to make simplifications by introducing fit parameters. On the other hand, the search for modelling expressions in heuristic models is much more efficient if there is a previous analysis. Tables 2.5, 2.6 and 2.7 show selected works and their characteristics concerning the former criteria.
Logic-Timing Simulation and the Degradation Delay Model
38
Table 2.6 Summary of characteristics for several delay models (continuation). REF.
TECH- ABSTRAC. DYNAMIC METHOD REMARKS NOLOGY LEVEL EFFECTS
Zukowski and Chen (1988)
MOS
Jun et al. (1 989)
MOS
operation frequency gates
0.f., colli-
sions
Heuristic
Tabular Methods
Heuristic
Polynomial fit
slope, 0.f., exponential
Eisele et al. (1990)
slope
Switch
Heuristic
Polynomial optimization models
Analytic
Models for BRASIL simulator
Hoppe et al. (1 990)
CMOS
gates
Warmers et al. (1990)
MOS
transistor
Navavi-Lishi and Rumin ( 1994)
CMOS
gate (inverter)
Uebel and Bampi (1994)
CMOS
gates
Hallam et al, (1995)
CMOS
gates
Daga et al. (1996b)
CMOS
inverter
slope
Analytic
Submicron Technology
Liu and Chang (I 998)
CMOS
transistor
slope
Analytic
Gate resistance
Hirata et al. (1998)
CMOS
transistor
slope
Analytic
Bisdounis et al. (1998a) Bisdounis et al. (1 998b)
CMOS
inverter
'lope
Analytic
Submicron Technology
Daga and Auvergne (1999)
CMOS
gates
'lope
Analytic
Submicron Technology
Chatzigeorgiou et al. (1999a)
CMOS
gates
'lope
Analy/Heur
Collision reduction
0.f., expo-
nential
colli-
0.I.
sions
slope
Current and Analitic delay calculus
Anal/Heur
REFFModelling
Heuristic
39
Chapter 2. Delay Models: Evolution and Trends
Table 2.7 Summary of characteristics for several delay models (continuation).
REF.
ABSTRAC. DYNAMIC
TECHNOLOGY HH LEVEL
Casu et al.
EFFECTS
METHOD
REMARKS
CMOS
transistor
slope
Analytic
Hamoui and Rumin (2000)
CMOS
inverter
slope
Analytic
delay, current and power
Sakurai and Newton (1991)
MOS
gates
slope
Analytic
Short channel effect
Kayssi et al. (1992)
CMOS
inverter
slope
Analytic
DCFLISDCFL
gates
slope
Analytic
CMOS
gates
Bafleur et al. (1992)
CMOS
transistor and gates
Chow and Feng ( 1992)
CMOS
gate (inverter)
Shousna and Aboulwafa (1 993)
CMOS
gate (inverter)
CMOS, DCFL
Shih et al. ( 1993)
(2000)
Hernandez et Hernandez et al. (1993) Melcher et al. (1992)
0.f.,
collisions
Polinomic fit Jun et al. (1989)
Collision Heuristic classification Analytic
Can be used in mixed simulation
Analytic
Channel modulation
slopa
Analytic
Application of 1-V model
gates
slope
Heuristic
Input slope influence
MOS
transistor
0.f.
Analytic
Reduction to generic primitive
Bellido (1994)
CMOS
gates
glitch-like co11ision s
Lai and Cheng (1994)
BiCMOS
Kayssi et al. (1993)
gates
0.
f.
Heuristic Pulse degradation
Analytic
Basic cell
40
Logic- Eming Simulation and the Degradation Delay Model
2.3.2 Delay model performance
The quality of a delay model within its range of application is determined by the performance reached by the simulation tool implementing that model. Performance depends on two main issues: accuracy and simulation speed. These are usually opposite criteria, since a more accurate model will probably be more complex and, consequently, slower and vice versa. As mentioned, electric simulation is used to evaluate and to compare delay model implementations, since it reaches accuracy levels above logic simulation. The electric simulator most used for this task is SPICE mewton et al. (1993)l or any of its commercial versions [Hspice (1999)l. Thus, the accuracy of a model implemented in a logic simulator is usually expressed as an error percentage with respect to the electric simulation results running over the same system. The same applies to simulation speed. Table 2.8 shows the data obtained by different authors. The estimation accuracy is approximately 10% with respect to electric simulation, which can be considered an acceptable margin for the results obtained by logic simulation. On the other hand, as already mentioned in this chapter, the speed-up in simulation velocity with respect to electric simulators is about 2 or 3 orders of magnitude, depending on the size of the circuit being simulated Figure 2.9 shows a summary averaging the results in Table 2.8 and distinguishes four different types of models by abstraction level and method of analysis. Gate level delay models are usually faster and, among them, heuristical models are the fastest. This result is foreseeable if we consider that gate level simulators lack the partitioning phase of the transistor level simulation and use equations obtained by heuristical methods that are simpler. Gate level delay models are also slightly more accurate, maybe because the dynamic partitioning used in the transistor level logic simulation is a source of error which does not appear in gatelevel logic simulation. Therefore both can reach similar accuracy despite the fact that the first one uses a more detailed simulation level. However, we must keep in mind that transistor level simulation may be applied to circuits which cannot be simulated at gate level.
41
Chapter 2. Delay Models: Evolution and Trends
Table 2.8 Performance comparison for several proposed model. speedup compared with compared SPICE in magniwith SPICE tud order deviation
REF.
IMPLEMENTED IN:
Ousterhout (1985)
CRYSTAL: timing analyser
Lai et al. (1 987)
JADE: timing simulator, transistor level
Deschant et al. (1990) PATH-RUNNER timing simulator, transistor level Deschant et al. (1993)
- 10% -10% <
10%
4 (S) 2 (S2)
2 - 3(S2G.6)
Deng (1988)
Experimental simulator
< 10%
2-3(S2)
Jun et al. (1989)
Experimental simulator
- 5%
- 3 (S)
Eisele et al. (1 990) Warmers et al. (1 990)
- 10% (S) BRASIL: timing simulator, transis- 10% tor level MOGLO: automatic transistor scaling
Deng and Shiau (1 990)
DSIM: timing simulator, transistor level
< 10%
Wu and Shiau (1990)
TISA: automatic transistor scaling
< 30%
Yang and Hoburn (1 990)
MOTIVE: timing verifier
- 5%
Hernandez et al. (1993)
GASTIM: timing analyser
< 15%
CINNAMON: mixed level simulator
<5
XIS: gate level timing simulator
<5
Kayssi et al. (1993) Bellido (1994)
2 - 3 (S3)
- 2 (S) - 3 (9
< 25%
Melcher et al. (1992) Bafleur et al. (1992)
2 - 3 (S2)
- 2 (S)
-6 2 -3 (HS)
- 10% (S) - 2% (S)
Lai and Cheng (1994) Jeppson (1 994) Embabi and Damodaran (1994)
timing simulator
< 10%
- 2 (HS)
Casu et al. (2000)
timing simulator
-5%
2 - 3 (HS)
timing simulator
-8%
1 (ELDO)
Hamoui and Rumin (2000)
42
Logic-Timing Simulation and the Degradation Delay Model
Speed
TYPE
Precision
TYPE
3
H+G
6.75%
A+G
2.5
A+G
7.75%
H+G
2.33
H+T
8.33%
H+T
2.25
A+T
8.57%
A+T
(a)
(b)
Fig. 2.9 Summary of delay model performance: (a) speed, (b) precission. H = Heuristic, A = Analytic, G = Gate level, T = Transistor level.
2.3.3 Evolution and trends in delay models
There are two major issues in the evolution of the delay models developed: the abstraction level used (transistors or gates) and the growing set of effects that they model. There are works within the gate level as well as within the transistor level, although many models, especially those based on analytic studies, can be applied to both levels [Kayssi et al. (1992); Deschant et al. (1988); Sakurai and Newton (1991); Jeppson (1994); Daga and Auvergne (1999); Chatzigeorgiou et al. (1999a)l. Usually, the model is developed for a basic cell (typically an inverter) and is then generalized for more complex structures employing some type of technique to reduce them to the basic cell [Sakurai and Newton (1991); Chatzigeorgiou and Nikolaidis (1998); Chatzigeorgiou et al. (1999b)l. The reduction technique is very important when determining what level the final implementation of the model will be applied to. In both abstraction levels, the accuracy obtained by delay models and, consequently, by logic simulation, is remarkable. At the beginning, logic simulation was employed basically to verify the functional operation of the circuit and, perhaps, employing simple delay models, to obtain quali-
Chapter 2. Delay Models: Evolution and Trends
43
tative timing information. The main causes which set the delay value were introduced later, such as the output capacitance and the component conductivity. Also, transistor level logic simulation uses delay models based on RC net models previously developed [Elmore (1948); Rubistein et al. (1983)l. An important breakthrough in model precision was the introduction of the transition slope as a parameter to calculate the delay, which paved the way for dynamic delay models [Deng (1 988); Auvergne et al. (1990); Kayssi et al. (1993)]. Another dynamic effect being considered is the input transition collision, whose classification can be found in [Melcher et al. (1992)l. Collision handling is often found with techniques which reduce complex gates to a simple equivalent structure [NavaviLishi and Rumin (1994); Chatzigeorgiou and Nikolaidis (1998)l. Collision propagation which produces small pulses (glitches) is also being investigated [Moll and Rubio (1992); Rabe et al. (1996)] not only for delay calculus [Bellido (1994)], but also to calculate the power consumption due to these pulses [Eisele and Berthold (1995); Metra et al. (1995); Favalli and Metra (1995)l and to study phenomena such as metastability [Reyneri et al. (1 990); Valencia (1986)]. The addition of dynamic effects and the use of more detailed analysis which incorporate effects like capacitance coupling between input and output and short-circuit currents [Jeppson (1994)] have produced delay models which can reach accuracy levels next to electric simulation, at least under certain work conditions. At the same time, the introduction of submicron technologies during the last decade has produced a reanalysis of the delay phenomenon. The most remarkable characteristic of these devices related to delay calculus is that they work in saturation during almost the whole computation process, which is caused by the velocity saturation of the charge carrier, and not by the pinch-ofleffect, unlike the long-channel devices. Thus, new electric equations have been proposed for MOS devices [Sakurai and Newton (1990); Shousna and Aboulwafa (1993)] which have produced new formulations for the propagation delay [Sakurai and Newton (1991); Bafleur et al. (1992); Shih et al. (1993); Kayssi et al. (1992); Bisdounis et al. (1998a); Daga and Auvergne (1 999)], while applications based on RC models have lost applicability since the lineal operation zone is no longer the most important one in the commutation process.
44
Logic-Timing Simulation and the Degradation Delay Model
In our opinion, the trends in the field of delay model research will be characterized by the following issues: The model development method will be based on analytic studies of CMOS structures, but will include adjustment parameters (mainly related to the technology) so it will be possible to develop compact and high-accuracy models. The models will focus on the characterization of a basic cell (inverter) and on enhanced complex gate-reduction techniques. Usually, it will be possible to extract from these models two versions: an analytic version, including explicit dependencies on geometrical design parameters, and another version at precharacterized cell level. The first one will focus on full-custom design transistor level simulation, optimization tools (area, delay, power, etc.) based on logic simulation and automatic characterization and optimization of library cells. The second one will focus on semi-custom design using precharacterized library cells whose internal structure may not be available for the designer and whose model parameters are supplied. This only allows for cell level logic simulation, but most designs are described at this level, like those generated by automatic logic synthesis tools. Deep submicron technology is in development so, it will be necessary to revise constantly the methods of analysis employed in the delay modelling. Also, due the growing scale of integration, interconnection delays are gaining relevance and this may make it necessary to adapt the new models to RC type loads. Another problem related to the growing scale of integration is the power dissipated by the circuits. Some models have been developed to evaluate simultaneously power and delay [Bisdounis et al. (1998b); Eisele and Berthold (1995); Hamoui and Rumin (2000); Hoppe et al. (1990); Navavi-Lishi and Rumin (1994)l. In the future this cooperation will be even stronger. Nowadays, the high circuit operation velocity required makes dynamic effects more relevant, especially those related to signal collisions. These effects must be managed properly or they will become a bottleneck for precision in logic simulation. In particular, the degra-
Chapter 2. Delay Models: Evolution and Trends
45
dation effect presented in this book which describes glitch generation and propagation will have to be considered because of its remarkable influence in timing and power consumption results [Metra et al. (1995)].
This page intentionally left blank
Chapter 3
Degradation and Inertial Effects Manuel Jeslis BelIido Diaz David Guerrero Martos
3.1 Introduction
In the previous chapter we have seen the main issues of digital circuit time modelling. In order to enhance the precision of a delay model it is necessary to take into account most of the effects related to the behaviour of real digital components. In this chapter we will introduce and model the so-called degradation effect which, as will be shown, is related to the inertial effect.
3.1.1 Degradation and inertial effects
When the propagation delay of the circuit is much shorter than the period corresponding to its operation frequency, signals and gates may be considered ideal, that is, with zero delay and transition time (Fig. 3.1 (a)). Also, in this case it is acceptable to suppose that each transition is not affected by the previous one. Having said that, as operation frequency increases, non-ideal effects (i.e. effects observed in non-ideal gates) become more relevant. For example, in Fig. 3.1 (b) we can see two nonideal effects: there is a non-zero propagation delay and signal transitions are not instantaneous. Thus, because of the rising operation speed of the circuits, it becomes increasingly important to include non-ideal effects in the delay models
41
48
Logic-Timing Simulation and the Degradation Delay Model
7 5 0
9
4 . 5 0
4
0
7 5 0
3
5 0
P
2 6 0
3
P
O
2 . 7 5 0 2 . 5 0 2 . 2 5 0
2
L
0
7 5 0 6 0
L
L -25.3 I . o 7 5 0 S O D
ow OM
250.0" 0 .
Fig. 3.1 Digital signal shape. a) DelayEignal Period = 0.01 b) DelayKignal Period = 0.1.
used for timing analysis. In this chapter we will introduce and model the so-called degradation eflect [Juan et al. (1997a)l. At the beginning, because of the low operation frequency, these effects were not taken into account to model the timing behaviour of digital components. These
Chapter 3. Degradation and Inertial Effects
49
effects do occur in logic gates, however, so they must be included in current delay models. This can be done keeping the merely logical character of the delay model. This is very important since it allows the precision of the timing analysis to be enhanced without increasing the complexity of the delay model. Thus, it will maintain an acceptable timing simulation speed even with complex circuits and, at the same time, it will increase the accuracy of the analysis results. Basically, the degradation effect decreases the width of a pulse at the output of a logic gate when the pulse that generates it at a gate input becomes shorter, This is because the behaviour of each transition depends on the previous one, i.e. it depends on the history of the gate. In particular, it is known that pulses that are wide enough can propagate without problems through many gate levels. The propagation delay rises with the pulse width until it reaches a maximum, the normal propagation delay. In the propagation of pulses that are wide it is not possible to see the relationship between both transitions of the pulse. On the other hand, very short pulses do not propagate through many gate levels. These pulses are ignored or filtered by the gate. This phenomenon has been included in delay models such as inertial eflect [Unger (1969)l. Within these scenarios, normal and inertial, a degradation phenomenon appears whose modelling is the main objective of this chapter. When crossing a gate, the input pulse is narrowed (degraded) because the propagation delay of the second transition is shorter (is more degraded) than if the first transition had occurred long before, i.e. if the input pulse had been wide enough. This chapter starts introducing a model, which we will call DDM (Degradation Delay Model) and is based on the real behaviour of gates. The DDM model, despite being simple and compact, describes accurately the degradation effect and can be easily applied, introduced as a correction factor, to any traditional model. The new model can reduce the number of required parameters without losing accuracy. Also, the required parameters are intuitive and enable a deep understanding of the degradation effect. Later in this chapter, we will make a quantitative estimation of the relevance of the degradation effect in the behaviour of high speed digital circuits. As will be shown, the degradation effect is easily appreciable when using high operation frequencies so it must be taken into account in accurate timing analysis. Finally, taking into account that
50
Logic-Timing Simulation and the Degradation Delay Model
OUT
I
I
Fig. 3.2 Parameter T.
the degradation effect is closely related to the inertial effect, we will study the inertial effect by going over the model employed in the logic timing analysis, remarking on the inaccuracies generated by that model and proposing a new algorithm for the inertial effect in full compliance with DDM.
3.2 Degradation Delay Model
To develop the DDM we will focus our study on a CMOS inverter. In later chapters we will extend the model so as to enable its use with complex gates. As we have seen, the degradation effect occurs when a new transition reaches the gate input (in this case an inverter) and its output is still changing its state. So a parameter is needed to inform about the dynamic state of the gate when a new input event occurs. An appropriate parameter is the time elapsed from the last output transition (parameter T ) as shown in Fig. 3.2. If T is large enough, that means that the gate has had enough time since the last output change to reach a stable value. Thus, a new input change will be propagated with a normal delay by the gate. On the other hand, if T is small enough, what happens is that the new input transition arrives when the output has not yet reached a stable value so that an inertial or degradation effect can occur.
Chapter 3. Degradation and Inertial Effects
51
3.2.1 Behaviour regions
Let us see in detail the three different behaviours that can occur depending on T (Fig. 3.3). In (a) T is large enough to let the output reach a static value ( VDDin the example). In this situation, a new input transition will propagate with a delay which will not depend on the instant when it last changed (ie.it will be independent of 7). In this case we say that the transition will propagate with normal delay. In (b) the new transition occurs when the output is still switching from V D d 2 to VDD.The propagation delay of this new transition, $2, is shorter than the normal propagation delay (G2 < t p l ) , so we would say that the transition propagates with degradation. Finally, in (c) T is even smaller. The output has not reached the commutation threshold V D d 2 , so we could say that the output transition has not occurred. In this case the input pulse is filtered (inertial effect). This last situation seems to be in conflict with the meaning of parameter T since the last output transition, which serves as a reference for measuring this parameter, has not occurred. This is solved by defining T in a more precise and useful way. In a CMOS inverter, we will call T the time elapsed from the “predicted” instant of an output transition (either it occurs or not) to the instant when the next output transition occurs. Taking this definition of T into account, Fig. 3.4 shows the normalized propagation delay versus 7: There we can see three behaviour regions: one for larger values of Tin which the propagation delay is practically not affected (normal propagation), another region for medium values of Tin which the delay is appreciably lower than in the normal region (degradation region), and a last zone corresponding to very small values of T in which the output transition is cancelled with the previous transition (pulse filtering region).
52
Logic- fiming Simulation and the Degradation Delay Model
VDD
0 0
0
0
t
I
I
Fig. 3.3 Different behaviour depending on the value of T: a) Normal Propagation, b) Degradation effect, c) Inertial effect.
Chapter 3. Degradation and Inertial Effects
Pulse filtering
Degradation effect
53
Normal propagation
'
-0.2 T
Fig. 3.4 Propagation delay regions.
(5)versus
showing different behaviour
3.2.2 Degradation modelling Parameter T may be interpreted as a variable which tell us in what state a gate is after the arrival of an input transition. This state variable is necessary for computing the delay for a new input transition correctly, as shown in Fig. 3.4. This behaviour has been observed in all the gates in the set analysed by electric simulation with HSPICE [Hspice (1999)l. Taking the shape of the curve in account we propose the following expression to model the behaviour observed in the gates:
t , = t,,(l-e
--T - T 7
4,
(3.1)
where t,, is the normal propagation delay (that is, when there is no degradation effect) 1; and T o are parameters that must be adjusted. In Fig. 3.5 (a) we can see the real behaviour of a CMOS inverter obtained with HSPICE (each circle represents a data item obtained by simulation) and also how Eq. (3.3) fits these points. There we can see that
54
Logic-TimingSimulation and the Degradation Delay Model
T o represents the value for which the curve reaches zero while z is the characteristic time of the exponential. These parameters characterize the degradation effect so that they will be called degradation parameters. We will call the model proposed in Eq. (3.1) the DDM (Degradation DeZay Model). As mentioned, z and T o are parameters which must be set to fit as well as possible the data obtained by electric simulation. This may be done by linear regression rewriting the previous expression in this way: T = T , + (-In(
1-
.3],
(3.2)
Parameter z matches the slope and To the value whereby the representation of T versus x is 0 and x is as follows: (3.3) tPo has been previously measured to obtain x. It is easy since we just have to take tp for a value of T large enough. In order to obtain the repre-
sentation of T versus x, usually it is necessary to discard several marginal points in the characteristic tp versus T, especially those with t, = t,, , since they present convergence problems for x. In Fig. 3.5 we can see an example of results obtained in electric simulation as well as the lineal representation in the range of interest. In Fig. 3.5 (b) we can see that, indeed, the points obtained experimentally form a straight line, validating the exponential degradation model. A theoretical analysis of inverters employing electric models for transistors could reproduce the dependency of t, versus T . Anyway, employing realistic electric models, that is, models that are accurate enough, leads us to differential equations with non-closed solutions. On the other hand, employing simplified electric models to obtain closed solutions implies a significant loss of precision. This has lead us to verify Eq. (3.1) and to confirm that, indeed, it accurately fits the gate behaviour obtained by simulation. Figure 3.5 is an example of this: we can see the gate behaviour match exactly with the results of the DDM model equation, represented by a continuous line.
Chapter 3. Degradation and Inertial Effects
1
0.8 0.6 0
4
Ti& u 0.4 0.2 0.0 I
T,
-0.2
1000
500
T (PS)
500 T/=
169.4f0.9
To/=102f1 400
-
300
-
200
-
h
v
Corr. coef.. = 0,99990
h
'O0.0
'
0.5
1.o
1.5
Fig. 3.5 Curves used to obtain the degradation parameter values using data from electrical simulation: a) tp versus T.b) linear regression over simulation data.
55
56
Logic-lTming Simulation and the Degradation Delay Model
Thus, Eq. (3.1) is the starting point for modelling the propagation delay including the degradation effect. We will use it to interpret and realize the meaning of the degradation parameters, so that we will able to evaluate the importance of this effect. In the next chapter we will make a characterization of these parameters with respect to the microelectronic design parameters.
3.2.3 Physical interpretation of the degradation parameters
Degradation parameters z and T are not just fitting parameters but, in addition to their mathematical meaning, they also have a clear physical meaning. Realizing this meaning will be helpful to discover the importance of the degradation effect as well as to study the dependency on the design parameters. In order to interpret these parameters physically let us consider a static CMOS inverter which is experiencing a rising output transition. We will assume also that there is an effective threshold voltage for each type of input transition ( V , for a rising transition) which is the required voltage for the transistor carrying out the output transition (the NMOS one in this case) to conduct enoughly to make the output switch. It is obvious that threshold voltage VTL is related to the threshold voltage of the NMOS transistor (V,), but it also depends on the relative geometry of the transistors, as will be shown. Having made this hypothesis, suppose that a transition occurs at the transistor output ( V,,, goes over V D D / 2 ) at instant t o , as shown in Fig. 3.6. After that transition, there will be degradation or not depending on the instant in which the gate is activated again (?). Thus, if ? is large enough, the output signal will have switched completely when the gate is activated and the propagation will be normal. If ? is small enough, the output signal will behave as shown in Fig. 3.6, which shows a delay lower than the normal one (degradation effect). We will set an effective*limit between the degradation region and the normal propagation region, Tlimit , which will be the value of ? for which the normal propagation delay is equal to 0.95tP,, hence:
Chapter 3. Degradation and Inertial Effects
57
Fig. 3.6 Electric behaviour causing the degradation effect.
?' < ?'limit ? > ?limit
=$
t, < 0.95 t,o
t , > O.95tPo. (3.4) It is more interesting for us to refer this limit to parameter that is the one employed in the DDM model to describe the gate state. This yields: 3
T = ?+To, (3.5) where ?'o is the time employed by the linealized input transition to switch from the effective threshold level of the active transistor (V,) to logic threshold ( V,). It is a merely geometrical parameter whose value, for the type of transition shown, is: ?o = ( -1- - ) TVTL in,
2 VDD where zinis the input transition time. Thus, condition Eq. (3.4) is transformed in this way:
(3.6)
58
Logic-Timing Simulation and the Degradation Delay Model
T-
PO<
Plimit
-
*
T - T O> Tlimit
t , < 0.95tpo
* t, > 0.95tp0.
(3*7)
On the other hand, from model equation Eq. (3.1) we obtain that: T - To < 32 * t , < O.95tPo
T - T o > 32 * t , > 0.95tp0.
(3.8) The equality between Eq. (3.7) and Eq. (3.8) let us match the parameters on both expressions. Specifically this yields: To
Po *
3 ‘I: Tlimit . (3.9) This gives a physical meaning to the degradation parameters and allow us to define them accurately. Thus, z is a measure of the time required by the gate output to reach a stable state after a logic transition. To be precise, activating the gate a time 32 after the last output transition would produce a propagation delay of value 0.95tP0,which can be considered normal. On the other hand, T o is the time employed by the linealized input transition to switch from the effective threshold of the active transistor to logic threshold ( V , d 2 ) . Value T o can be obtained by analysing Fig. 3.6 geometrically. Distinguishing both types of transitions, for a high-low transition we have: (3.10) and for a low-high transition: (3.11) In order to generalize, To can be written in this way: (3.12) where V , is V , or VTH depending on the type of transition.
Chapter 3. Degradation and Inertial Effects
59
3.2.4 Limits between behaviour regions As seen in Fig. 3.3 and Fig. 3.4, there are three behaviour regions: normal propagation, degradation and filtering. Here we will obtain the values of T which set the limits between these behaviour regions, taking into account the degradation parameters.
3.2.4. I Limit between the normal propagation region and the degradation region
The change from the normal propagation region to the degradation region is gradual so that setting a limit is a question of consensus. In order to simplify, we will use the same rule employed in the definition of parameter T : any input transition that propagates with a delay greater or equal to 95% of the normal propagation delay is considered to be within the normal propagation region. From Eq. (3.8) we get: T < T o + 32 t , < 0.95tp0 (3.13) T > T o+ 32 t , > 0.95tpo,
*
Thus, the value of T (we will call it TNP,for Normal Propagation) which separate the two behaviour regions is defined as: (3.14) T N p = T o+ 3 2 .
3.2.4.2 Limit between thejltering region and the degradation region
Figure 3.7 shows a typical propagation of two consecutive transitions through a CMOS inverter, in which T , is the time elapsed between input transitions, tprO is the rising propagation delay of the first transition (which we will consider not degraded), tpf is the delay of the second transition (that can be degraded), Two is the width of the output pulse and T is the time elapsed from the last input transition to the last output transition. As seen in Fig. 3.3 (c), an input pulse is filtered when its corresponding output pulse is not wide enough to go beyond the logic threshold. The limit situation between filtering and degradation occurs when the output
60
Logic- Thing Simulation and the Degradation Delay Model
I T
IN
(7
>I
I
tPf
OUT
I
,
tpro
>
Fig. 3.7 Output pulse width given by T and tPf
pulse is tangential to the logic threshold, which means an output pulse of width zero ( T w o = 0 in Fig. 3.7). Taking into account that the width of the output pulse can be expressed as a function of T and tPf (Fig. 3.7), the limit condition is: T+t,f = 0, (3.15) or, in other cases, replacing Eq. (3.1) and generalizing for a rising or falling delay t , , --T - T
T+tpo(1-e
@)
= 0.
(3.16)
The solution of this equation, which we will call TpF (Pulse Filtering), is the definition of the limit between the degradation region and the filtering region. On the other hand, this is an equation whose graphical solution is shown in Fig. 3.8. We are interested in getting a closed expression for the limit value, so we will simplify Eq. (3.16) approximating the exponential term by its first order expansion: e - x - 1 --x. (3.17) This is a good approximation: as may be seen in Fig. 3.8, T p , is close to T o , so we should expect that the exponential argument is weak. Substituting Eq. (3.16) by the expansion yields: (3.18)
61
Chapter 3. Degradation and Inertial Effects
T
0
Fig. 3.8 Graphic solution of Eq. (3.16).
Table 3.1 Several approximations to the limit between the filtering region and the degradation region.
Approximations TPF ~
(Ps)
Exact
Order 2
Order 1
58.2
58.0
54.9
~
it follows that: TPF =
1 1 + z / t p 0To .
The corresponding delay, which we will represent with t P p Fis: , tPPF = --TPF *
(3.19)
(3.20)
As an example we have compared the values of T,, obtained by an exact graphical resolution, by a first order expansion and also by a more precise approximation of a second order (exponential expansion until second order). The parameters of a typical CMOS inverter in 0.8pm technology have been employed. We can see the comparison results in Table 3.1:
62
Logic-Eming Simulation and the Degradation Delay Model
with just the first order approximation we obtain enough precision, about 5% of the exact calculated value. We must remark that, although calculating T p F is of theoretical interest, the model is not expected to reach the highest precision around T p F but rather around T N p , the limit of the normal propagation region, since in general, we will want to know when and how the signal delay is degraded in order to avoid entering into filtering or strong degradation regions.
3.3 The Importance of the Degradation Effect There is no doubt that the degradation effect is a phenomenon which really occurs in signal propagation and, as we have seen here, there are delay models which allow us to describe this event accurately. Before going any further and studying this phenomenon, we must evaluate the importance of degradation in digital circuit behaviour. To do so we are going to set the time limit between two consecutive transitions of the same signal, T w N P which , separates the behaviour region where the degradation effect is insignificant ( i e . T , > T , N p ) from the region where it must be taken into account (i.e. T , < T w N p ) , where T , is the time elapsed between both input transitions. The limit between both regions was defined in the previous section as a function of the time elapsed from the last output transition ( T N p in Eq. (3.14)). On the other hand, in Fig. 3.7 we can see that the input pulse width, T , , for a positive pulse is: (3.21) T , = t p r o -+ T , as long as there was no degradation in the first transition. Hence we have that: (3.22) T w N P = tprO + T N P = tprO -k T O f + 32 f ' The case of a negative pulse is utterly analogous and a similar argument may be applied. In Table 3.2 we can see the value of T,Np and its relation with t p f o for a CMOS inverter in two typical geometric configurations ( k l and k-2, where k = W N /W , ) and for several input transitions. The data in
63
Chapter 3. Degradation and Inertial Effects
Table 3.2 Limit of the normal propagation region with respect to pulse width ( T w ~ p ) (Normalized with the normal propagation delay). WN=4pm,VDD=SV, CL=~C,.
Example 1: k=l
0.1 0.1 0.1
229
121
189
-5.86 790 6.5
2
384
162
139
79.4
880
5.4
5
618
187
140
217
1255
6.7
6.5
Example 2: k=2 Tinl2tps t p a (PS)
tpm (PSI
Tf (PS)
Tof (Ps)
%f
~wN~ltpm
0.1
170
183
137
-0.16
581
3.2
2
275
250
117
76
702
2.8
3
325
278
108
135
784
2.8
that table has been obtained for a load capacitance C, four times the inverter input capacitance ( C , = 4 c f N ) . The input slope (qn) is normalized to the propagation time of a step transition (t,,). The others are timing parameters which set the normal propagation delay and the degradation parameters needed to calculate T,,. Looking at the last column of the table we can see that the value of TwNpis about 3 times the value of tpJD when k=2, and can reach 6 times such a value for k ; l . The value T W ~versus p $J,is very significant since it indicates that the degradation effect cannot be neglected, especially in circuits running at a very high speed. Indeed, when the elapsed time since the last output transition is 2-3 times the propagation delay, the gate has not reached a stable value yet, and new input transitions will produce a degraded delay.
64
Logic-Erning Simulation and the Degradation Delay Model
7
lp/u
- I, - $lo
J
Fig. 3.9 Pulse narrowing due to the degradation effect affecting the second transition.
To see what happens when an input pulse reaches the gate input, let us assume, as a simple example, that the propagation delay for both transition types is t,, and that TwNp/t,, is equal to 3, which is a conservative estimation as seen in Table 3.2. In this case, Fig. 3.9 shows that the delay of the second transition of an input pulse will be degraded as long as the pulse width is lower than three times the normal propagation delay. The output pulse will be appreciably narrower than the original input pulse (Two,,< T w i n )despite , the fact that the width of the latter is much greater than the normal propagation delay. If the output pulse propagates through a similar gate, it will be more degraded than the original input pulse. Since the degradation is accumulative, the pulse can turn marginal (very narrow) even if the pulse looks as normal as the one shown (with Twin 3 t P 0>. This result shows that the degradation effect is very relevant near the maximum operation frequency which a circuit can reach as shall be shown in the next section.
3.3.1 Maximum device operation frequency This section evaluates the maximum operation frequency of a digital device (CMOS inverter) at which the output signal starts to degrade with respect to its pure digital behaviour. The criteria used is based on keeping
Chapter 3. Degradation and Inertial Effects
65
.
tI
I
I
IN OUT Fig. 3.10 Maximum non-degrading frequency.
the delay degradation below the degradation limit defined above. Thus, the digital characteristics of the signal are assured. It is not a pessimistic criteria since once degradation starts at a given stage, it may increase exponentially in following stages, as may be observed in Fig. 3.4. Let us consider a single inverter under consecutive input transitions forming a periodic pulse train. Let tl be the time spent by the input signal in the high state and t2 the time spent in the low state (Fig. 3.10). The maximum frequency above the degradation limit is achieved when: T1 = To), + 32, T , = T o [ +321. (3.23) Under these conditions it holds that tp[ = 0.95tp,,
= 0.95tpho,
(3.24)
t 2 = 0.95tPho+ D L , ,
(3.25)
tph
hence, fl
= 0.95tp[o+DL,
which yields the maximum frequency, deg =
1/ 2 0.95tP,, + DL,
(3.26)
where, tpmo
t p i -Itph , DL, = = 2
DL, + DL, 2 -
(3.27)
For practical purposes, fdeg can be approximated by deg
1/2 = tpmO+ DL,
*
(3.28)
66
Logic- k i n g Simulation and the Degradation Delay Model
Fig. 3.1 1 Maximum non-filtering frequency in the classical approximation.
3.3.2 Comparison with classical calculations and results
If we assume the classical approximation stating that a pulse is “fully” propagated if its width is greater than the propagation delay, the maximum operation frequency corresponds to the case shown in Fig. 3.1 1. The maximum frequency in this case is easily derived: fclass
=
1/2
-. tpmo
(3.29)
This classical approximation represents an overestimation with respect to Eq. (3.28), due to the absence of the term DLm . Furthermore, the limit considered in the classical calculation (T=O) actually corresponds to a case in which either the pulse is filtered or the delay is deeply degraded, as may be observed in Fig. 3.4. Additionally, this overestimation may become large since D L is typically a few times the normal propagation delay (tpo) [Juan et al. (1997a)l. To show how large this overestimation might be, let us consider a typical 0.7pm CMOS inverter operating under different input slope conditions (fast, moderate and slow). For the sake of clarity, we shall consider symmetric devices with equal parameters for high-to-low and low-to-high transitions. The parameters of the gate, the maximum frequencies calculated using both classical and degradation criteria, and their ratio are
67
Chapter 3. Degradation and Inertial Effects
Table 3.3 Inverter parameters and maximum frequencies for different input slopes. fclass
=inn THLS
f deg
(PS)
z(ps)
To(ps)
(MHz)
(MHz)
fclass
0.1 (fast)
121
189
-5.86
733
4132
5.6
2 (typical)
162
139
79.4
759
3086
4.1
5 (slow)
187
140
217
607
2674
4.4
~HLO
fdeg
shown in Table 3.3. In this table, ~i~ is the input transition time and THLs is the step response delay, which is used as a convenient normalizing parameter [Auvergne et al. (1987)]. The expected overestimation appears to be very important, since it is more than four times larger than the limit imposed by the degradation effect, which lies around 700MHz.
3.4 Inertial Effect
As we have seen, the degradation effect is closely related to the inertial effect. Since the objective of modelling the degradation effect is to increase significantly the precision of the result, it is necessary to consider at least with the same precision the inertial effect. In this chapter we will analyse the classical model employed for the inertial effect, called Inertial Delay, and we will show that it produces significant errors in logic timing simulation. To solve this we will propose a new algorithm for the inertial effect in logic timing simulation which will manage this effect much more accurately and is utterly congruent with DDM.
3.4.1 Inertial delay model failure
The inertial effect is currently modelled through the definition of an inertial delay. As stated in [Unger (1989)l: “An inertial delay with magnitude D ibehaves in the same way as a pure delay, except that it not only delays
68
Logic-Eming Simulation and the Degradation Delay Model
the input signal by D i,but also filters out positive or negative pulses of a duration of less than D i This model is illustrated in Fig. 6.1 1 of [Unger (1 989)]. Most logic-timing simulators use an inertial delay to take the inertial effect into account. To calculate the value of the inertial delay of a given gate, the criteria widely adopted is the use of a universal (same for each gate) threshold voltage at half the supply rail ( v,/2) 2 to measure signal switching. Thus, an input pulse to a gate is filtered if the generated output pulse does not reach the VDD/2 threshold, and then, an input pulse of a width smaller than D igenerates an output pulse of an amplitude smaller than vDD/2. This simple model is not accurate in many situations, as will be soon shown. In Fig. 3.12 (a) we find a test circuit in which an inverting driver (go) is loaded by two other inverter gates, gl and 82. The two loading inverters have different DC transfer curves with different threshold voltage: V T ~ =1 . 3 2 ~V= ,~ 3 . 4 1 ~(Fig. 3.12 (b)). These thresholds are defined as the input voltage which makes V,,, = v D D / 2 ,a good way to estimate the output logic state of the gate for a given input voltage, due to the large value of the slope at that point of the DC curves. Each loading inverter, in turn, is loaded by a chain of inverters, which are able to regenerate positive pulses. The propagation of an input pulse at go, narrower than the inertial delay, is simulated using the electrical simulator HSPICE [Hspice (1999)] and a conventional inertial delay model. Results are plotted in Fig. 3.13. Obviously, as the pulse width is smaller than the inertial delay, the output pulse at outO does not reach the vD,/2 threshold and, from the point of view of a model using the inertial delay, the pulse is filtered at go and no other activity is observed in the logic simulation (Fig. 3.13 (b)). However, the accurate electrical simulation in Fig. 3.13 (a) shows that the output pulse at outO is able to propagate through g2 and is easily regenerated through the chain of inverters ( o u ~ ~ while c ) , it is filtered at gl . That is, the inertial effect only occurs for gl, but not for 82. This example shows how modelling the inertial effect through an inertial delay may predict an output result which differs from the actual behaviour. The reason for this inaccuracy in the inertial delay model lies in that the inertial effect cannot be accurately reproduced using a single and universal threshold (vDD/2) to determine logic switching. This way, pulses
Chapter 3. Degradation and Inertial Effects
chain
69
outlc
5 4
2 1
0
Fig. 3.12 Example of an inertial delay model failure: a) sample circuit, b) DC curves of gl and 82.
that do not reach the threshold, like the one at out0 in Fig. 3.13 (a), are neglected, while they are still able to propagate through a loading gate. Propagation of such a pulse will depend on particular input thresholds of the loading gates. The pulse at out0 does not cross the input threshold of gl, as defined in the DC curves (Fig. 3.12 (b)), and is then not able to force out1 to switch; but the pulse crosses the input threshold of 82, so it will induce some change at the g2 output at least a small pulse like the one at out2, which might be regenerated afterwards.
70
Logic- Eming Simulation and the Degradation Delay Model
5 4 -
3 -
f out2
2 1. outl
I
outlc
I
I
I
I
I
outl I
I I
I I
! I I
I
I
I
I
I out2c I
I I
I
I
I I I
0
1
2
3
in out0
out2
I
outlc
(b)
Fig. 3.13 Results for the sample circuit: a) HSPICE simulation, b) expected output of a logic simulator based on inertial delays.
It is then clear that an accurate criterion to account for the inertial effect needs to be based on signals crossing individual input thresholds.
Chapter 3. Degradation and Inertial Effects
71
3.4.2 Inertial eflect algorithm We propose a new model that combines the DDM to calculate delays and a new method to handle the inertial effect in order to take account of particular input thresholds. The new algorithm is based on the following points: Signal transitions are approximated by linear ramps. The value of the ramp is calculated by the delay model. These ramps are represented by ( t h p s , z) pairs, where t h p s is the crossing instant through the half power supply ( V,,/2 ) and z is the transition time. Each transition at a given circuit node is split up into events, which corresponds to the signal cross through each input threshold of the gate’s inputs connected to the node. The events are represented by ( tgt,z) pairs where t,, is the cross instant through the input threshold and z is the transition time. Given a transition, the inertial effect is evaluated independently for each gate connected to the node as a function of the gate’s input threshold and the events scheduled for that gate. The simulation algorithm that implements the inertial effect algorithm must be driven by (t,,, z) events instead of just signal transitions, since these events represent the actual gate’s activation instants. Delay models which measure delays between vDD/2 threshold crosses can easily be used with this method since t h p s to tg, conversions are carried out easily. As an example, Fig. 3.14 shows how the case in Fig. 3.12 is handled using this approach. In Fig. 3.14, transition-1 in signal out0 generates events gl-el and g2-el in gI and 82, respectively. In the same way, transition-2 generates events gl-e2 and g2-e2. As the input threshold does not reach V,, ,events gl-el and gl-e2 do not need to be evaluated, and will be dequeued before evaluation. The IDDM can be summarized in the following simplified algorithm, which handles the propagation of an event given by a ( tgt,z) pair:
12
Logic-lhing Simulation and the Degradation Delay Model
Fig. 3.14 Event generation using the proposed approach.
(1) Calculate VDD/2 cross ( thps(in)) from (t g f ,T) . (2) Apply the DDM and calculate t,,,(out) and out) . (3) For each gate input connected to the output of the gate under evaluation: Calculate event instant ( t ) from t,,,(out) , out) and the input threshold ( V T ) . If the event happens after the last scheduled event ( t > tlasf), schedule the new event; if not, dequeue event at f l u s t . Update t l a s f :tlasl = t . (4) Grab a new event and continue.
3.4.3 Results
To check the performance of the inertial algorithm in DDM, we have applied the model to the case in Fig. 3.13. The waveforms that are generated are in Fig. 3.15. When compared to HSPICE results (Fig. 3.13 (a)), the same behaviour is obtained. The input pulse at in is not filtered, since it crosses the go threshold. A small pulse at out0 is generated, which is large enough to activate 82, resulting in a propagation at out2 and a regeneration at out2c. On the other hand, the pulse at out0 does not reach the g l threshold, so it is filtered by gl and no activity is observed in out1 and
13
Chapter 3. Degradation and Inertial Effects
r
5.0
I
I
2000
3000
-
i
in 0.0
1000
5.0 !
out0 out1
: 0.0 0 5.0 r
I
1000
I
,
2000
I
I
,
I
3000
_I
I
:
0.0 5.0 r
1000
,
2000
,
1
I
3000
_I
I
:
out2 0.0 5.0
outlc 0.0 5.0
out2c 0.0
0
r
1000 I
,
2900
i
0
r
;
1003
2000
3000 I
_I
I
3000
_I
I
I
I
1000
t (ps)
3000
2ooo
Fig. 3.15 Waveforms generated using the proposed approach for the case in Fig. 3.13.
outlc. This example cannot be reproduced using a conventional inertial delay approach as we saw before (Fig. 3.13 (b)). The next example shows a narrow pulse propagating through a multilevel combinational circuit which is represented by an inverter chain (Fig. 3.16). This example is useful to see degradation and inertial effects working together. The solid soft lines corresponds to the HSPICE simulation, showing how the narrow pulse enters the chain and is degraded in each stage. Finally, it is eliminated due to the inertial effect after stage 5. The piece-wise-linear solid lines correspond to the simulation using the IDDM, which almost match the HSPICE results up to the third stage (out3) and even give a good approximation in stages 4 and 5 when the pulse is degraded enough to lose its digital nature. As in HSPICE results, the pulse disappears in out6 and up. Finally, the dashed lines represents the results using a conventional non-degraded model with transition slopes. In this case the pulse simply propagates unaltered through the
74
Logic- Rming Simulation and the Degradation Delay Model
Fig. 3.16 Narrow pulse propagating through an inverter chain.
whole chain, failing to show the quantitative and even the qualitative behaviour.
Chapter 4
CMOS Inverter Degradation Delay Model Jorge Juan Chic0 Alejandro Mill& Calderdn
4.1 Introduction We have seen in previous chapter that the propagation delay of a CMOS inverter including the degradation effect can be accurately modelled by using three parameters ( tPo, z and T o ) for each type of input transition. These parameters, in turn,depend on the internal and external conditions of the gate [Juan et al. (1997b)l. The main objective of this chapter is to study the dependence of the three mentioned parameters on those variables that characterize the internal structure of the gate -the transistor geometv- and the external conditions --output load, input waveform and supply voltage. In this chapter, basic equations for these dependencies will be introduced, allowing for the application of the model in two different scenarios: logic simulation at the transistor level, needed for full-custom designs, and logic Simulation at the gate level, which is appropriate for semi-custom, library-based designs. In the first case, the equations derived in this chapter may be applied; in the second case, they are the starting point for a characterization process of library cells, developed in the next chapter. In the next section, the concepts and parameters needed to characterize a CMOS process for logic simulation will be presented and ranges of interest for the model will be stated. The third section presents the delay model for the CMOS inverter presented by Daga et al. [Daga et al. (1996b)l which will be used as an adequate model for the normal propa-
75
76
Logic-TimingSimulation and the Degradation Delay Model
gation delay. Also, regarding the normal propagation delay, a new method for characterizing the input-to-output coupling capacitance of the CMOS inverter for logic simulation is presented, greatly improving the calculation of the overshoot time, which is an important part of the total propagation delay. In the fourth and fifth sections, the equations for the degradation parameters -7 and T o- and a characterization method are obtained, respectively.
4.2 Technological Parameters
This section describes the most relevant facts in current submicron technologies affecting the design of delay models for logic simulation. A set of technological parameters are introduced, which are adequate for the timing description of digital CMOS circuits. This section is based on [Auvergne et al. (1 990)]. When entering the submicron range, second order effects in the CMOS structure due to a higher electric field in the channel become nonnegligible. Among these effects, one of the most important ones is the carrier’s velocity saturation which takes place for electric fields above lo4 V/cm. Another important effect is the reduction of the carrier’s mobility, caused by the increased substrate doping ( N s u b), the reduction in oxide thickness ( t o , ) and a higher vertical field, represented by V,, - V , . A simple model describing this phenomenon is presented in [Tsividis (1988)l:
(4.1) where e(t0,) =
a&
A d ,with a,
= 0.025pmN. (4.2) 2 Es t o , In the previous equations, po is the field mobility, which decreases with the doping concentration N s u b .On the other hand, e(to,) varies from 0.17 to 0.28 when oxide thickness to, changes from 250 to 150 A, which causes a mobility reduction due to the vertical field when scaling to
Chapter 4. CMOS Inverter Degradation Delay Model
I1
highly integrated technologies. The global result of these effects is a limited current ability of the CMOS transistors. Modelling these effects is a complex task when high accuracy is needed, especially for analogue applications. Fortunately, the saturation current derived from these effects becomes dominant, which simplifies the analysis of the charging and discharging of the capacitance in the digital domain. Figure 4.1 shows the I D vs V,, curves for minimum length MOS transistors in a 0.7mm technology and a range of VGs values. In all cases, the current saturated for V,, is greater than 2 V. This saturation effect is due to the above mentioned effects and not to the traditional pinch-offeffect. Under these conditions, I D presents a linear dependence on V,, for a wider voltage range as shown in Fig. 4.2, resulting in simpler equations for the current in the saturation region: =
KNWN(VGSN-
If' =
K P wP( V G S P
IN
VTN>
I
- vTPl)
,
(4.3) where K N and K , measure the current capabilities of the minimum transistor and will be referred to as drivingfactors. Parameters K , , K , , V , and V , are directly extracted from calibration curves such as the ones in Fig. 4.2. Driving factors K , and K , can be used to define new technological parameters which are useful from the timing point of view. This is the case of the parameter zsT, which is a measure of the maximum speed available in the process [Auvergne et al. (1987)l. More precisely, zST is defined as the propagation delay of a minimum inverter loaded by an identical one when a rising step input transition is applied at the input and parasitic and coupling capacitances are neglected. From a circuit point of view, as shown in Fig. 4.3, zST is the discharging time of the output node of the mentioned inverter from the supply voltage V D D to half the supply voltage VDD/2, when the NMOS transistor is driving the maximum current available. For short channel devices, the active transistor in a CMOS inverter under a step input transition will always operate in saturation due to the saturation effects described above. Therefore,
78
Logic-lhing Simulation and the Degradation Delay Model
Fig. 4.1 ZD vs. VDS ( VSD)characteristics of minimum length CMOS transistors for a 0.7mm technology and VGs (VsG) = 0 . 3 V. a) NMOS. b) PMOS.
(
Chapter 4. CMOS Inverter Degradation Delay Model
79
400
. slope = 109.5357 err 0.5587783
-
300 -
constant = -1 40.8387 err 1.972944 corr. coef. = 0.9995969 VTN = 1.285779 V
$5200 I 3
100 -
Fig. 4.2 ID vs. V G (~V ~ Gcharacteristics ) of minimum length CMOS transistors for a 0.7mm technology and VDs (VsD)= 5V. a)NMOS. b) PMOS.
where A V is the voltage drop at the output node, Imaxis the saturation current and CL is the total output load. In our case, these quantities are, respectively:
80
Logic-Eming Simulation and the Degradation Delay Model
0 Fig. 4.3 z~~ parameter.
VDD AV = 2 '
(
(4.5) (4.6)
(4.7)
Operating on Eq. (4.4) yields: (4.8)
KN can be expressed as K , = Coxv,,where Coxis the oxide capacity per unit area and v, is the maximum speed of the carriers [Tsividis (1988)l. Substituting this in Eq. (4.8) we get
(4.9) In Eq. (4.9) we can see the direct relation between the process maximum ~ the , maximum speed of the carriers, v, . speed, T ~ and
81
Chapter 4. CMOS Inverter Degradation Delay Model
Table 4.1 Process speed and dissymmetry evolution for various CMOS technologies.
T*x (A> zST
(Ps>
R,
1.1
0.8
0.7
250
200
150
33
28
24
2.4
2.2
2
For a complete characterization of the technological process including rising output transitions, the effective dissymmetry of the CMOS process, R, , is defined as the ration between the rise -PMOS activeand fall -NMOS active- of the minimum inverter used to define zsT under the same conditions. In practice, factor TSTR, plays the same role for rising output transitions as z~~for falling output transitions. In submicron devices, we can use Eq. (4.8) to obtain: (4.10) Studying the evolution of zST and R, with the minimum feature size of the technology makes it possible to know the evolution of the speed and dissymmetry of the switching process of logic devices. Table 4.1 taken from [Daga et al. (1996a)l shows that a reduction of 38% in the minimum length when going from a 1.1 mm to a 0.7 mm technology only gives a 27% speed increment, which is due to the mentioned new saturation effects which appear in the submicron range. In addition, we can see that the intrinsic dissymmetry is reduced in the submicron range when we use shorter channel lengths. This is due to the fact that the critical field for holes is higher than for electrons, causing saturation effects to appear sooner in electrons, partially compensating the mobility difference between carriers.
4.3 Normal Propagation Delay
As shown in the previous chapter, the timing behaviour of a CMOS inverter operating under glitch conditions may be described using three
82
Logic-Timing Simulation and the Degradation Delay Model
parameters: the normal propagation delay, t p O which , corresponds to a non-glitch operation, and the degradation parameters z and T o . In the last few years, the scientific community has devoted important efforts to obtain accurate models for the normal propagation delay [Navavi-Lishi and Rumin (1994); Jeppson (1994); Deschant et al. (1991); Daga et al. (1996a); Bisdounis et al. (1 998a); Maurine et al. (2002)l. To achieve this, more and more internal effects and external conditions have been taken into account in the proposed models: output load, input waveform and supply voltage. The need for a higher scale of integration makes current design styles use minimum length transistors as much as possible, thus making these devices especially interesting. On the other hand, minimum length transistors in current submicron technologies are affected by the saturation effects mentioned in the previous section, so that accurate models need to take them into account. In this section we will focus on the normal propagation delay of submicron devices, as the starting point to complete a model for the CMOS inverter which also takes into account operation under glitch conditions. Several proposed models may serve our objective. In particular, the model presented by Daga et al. [Daga et al. (1996a)l provides high accuracy as it takes into account the most important effects: input-to-output coupling capacitance, short circuit current, and input waveform. Here we reproduce some results obtained by Daga et al. along with some improvements affecting the modelling of the input-to-output coupling capacitance [Juan et al. (1998a); Juan et al. (1998b)], which will be described in detail.
4.3.1 CMOS inverter transient response: regions of operation
To obtain a model for the normal propagation delay of the CMOS inverter we will start with the electric model of the CMOS inverter in Fig. 4.4.In this model, C, represents the total output connected to the output node including parasitic capacitances- and C, is the total input-to-output coupling capacitance. As will be shown later on, C, may be considered constant during the propagation of an input transition, but having different values for rising and falling transitions.
83
Chapter 4. CMOS Inverter Degradation Delay Model
IN
'-b-
OUT
Fig. 4.4 CMOS inverter electric model.
6.0 I
1 2.5 overshoot
short-circuit 2.0
1.5
4.0
h
>
h
4
v
---
k
1
E
W
LII
0.5
2.0
0
0.0
0
500
t cpsjooo
1500
-0.5
Fig. 4.5 Typical transient response of a CMOS inverter for a rising input transition.
The typical transient response of a CMOS inverter for a rising input transition of duration T,, is depicted in Fig. 4.5. Three different regions of operation can be distinguished, depending on the operation modes
84
Logic-liming Simulation and the Degradation Delay Model
Fig. 4.6 Charge injection process causing overshoot.
reached by the transistors forming the inverter: overshoot, short-circuit and discharging regions. A detailed description of these three regions of operation follows.
4.3.1.1 Region I: overshoot.
Due to the input-to-output coupling provided by C,, the first consequence of an input transition on the inverters’ output is a voltage overshoot in case of a rising input or a voltage undershoot in case of a falling input. A description of the case of a rising input follows, since the opposite, the falling input, is analogous. The long term consequence of the overshoot is to increase the propagation delay, due to the fact that the extra charge accumulated at the output node during the overshoot will have to be dissipated later during the discharging phase. The quantity of the overshoot may be estimated by the maximum voltage value it produces. We consider a time dt in which the input voltage increases dVi and a quantity dQ of charge is injected through C , . Part of this charge will be accumulated by C , , increasing the output voltage, and another part will be absorbed by the transistor structure, as shown in Fig. 4.6. Thus: (4.1 1) C,d( Vi - V,) = Idt + CLd V , , where I is the current driven by both NMOS and PMOS transistors, which is a function of V , and V i.
Chapter 4. CMOS Inverter Degradation Delay Model
85
By integrating the above equation we can derive the total output voltage variation (AVO)caused by a finite input voltage variation (AV,): (CL + CM)AVo = C , A V i - [
t
Idt.
(4.12)
In the case of a rising input transition, AV, becomes V,, and At becomes q n .It is possible to calculate a maximum for AVO, only accurate for very fast input transitions, by neglecting the integral term in Eq. (4.12), yielding: (4.13) For a typical case of a symmetric inverter ( k = 1 ) loaded by an identical one, we obtain: 1 -c L ' W 2 OX m m VDD (4.14) VDD = Avolmax - 1 5 . -c L . w + 2 c o , L ~ , w 2 OX From where it may be said that, in general, the overshoot voltage generated is a small but non-negligible fraction of the supply voltage. Due to the fact that the overshoot voltage is typically much smaller than VDD,the PMOS transistor will be a weak conductor and will provide a negligible contribution to I . On the other hand, the NMOS transistor will be cut off only during the first part of the overshoot to start conducting in saturation after that. Thus, the current driven by the NMOS will not be negligible but for a small zin. In such a case, the overshoot voltage will approach Eq. (4.13). In fact, this behaviour can be used as an indirect method to measure the coupling capacitance by using a very fast input transition, measuring A V , and solving Eq. (4.13) for C, :
c,
=
Avo 'DLJ - Avo
c,
(4.15)
86
Logic-Timing Simulation and the Degradation Delay Model
Fig. 4.7 Current components in the short-circuit region for a falling output transition: short-circuit current ) ,Z( and dynamic current (ZJ.
4.3.1.2 Region 11: short-circuit
In the short-circuit region, both transistors are conducting simultaneously, thus providing a direct path for charges from the positive supply rail to the ground. The short-circuit region will be wider for slower transitions and starts just after the overshoot region. During the short-circuit operation, one of the transistors drives the output transition while the other one opposes the output transition. The current driven by the opposing transistor is called the short-circuit current (Is,-) and is provided by the PMOS during falling output transitions and by the NMOS in rising output transitions, as shown in Fig. 4.7. Focusing on the case of an falling output transition, the short-circuit region ends when the PMOS transistor stops driving current. Fig. 4.5 shows how once I , reaches its maximum, it reaches zero very quickly, making this maximum a good reference to mark the end of the short-circuit region. The behaviour of the CMOS structure in this region, as well as its duration depends on many factors: input transition slope, output load and inverter geometry, thus making it difficult to carry out an accurate analysis of the output waveform in this region. For this reason, an
Chapter 4. CMOS Inverter Degradation Delay Model
87
important effort has been devoted to this analysis in literature as in [Sakurai and Newton (1991), and Jeppson (1994)l.
4.3.1.3 Region 111: discharge
Once the transistor driving the short-circuit current is cut off, the output transition is ended by the complete discharge of the output capacitance, with the transistor acting as the driver. From the viewpoint of delay calculation, the interest is in the evolution of the output voltage until it crosses the logic threshold, very commonly set at Y D D / 2 . The output waveform in this region also depends on the output load and on the input transition slope, unless the input transition is fast enough to finish before entering the discharge region. In most practical cases and for submicron devices, the driving transistor operates in saturation mode in this region, making the output be lineal at least until it crosses the logic threshold. It is thus possible to calculate the slope of the linearized output voltage curve, which is needed by any delay model to be implemented in a simulation tool.
4.3.2 Actual response of the CMOS inverter
The output voltage evolution of a CMOS inverter is governed by the following differential equation: (4.16)
In order to calculate the propagation delay, it must be solved considering a piece-wise linear waveform such as:
v; =
I o
{
t Vm-
Tin
tIO O
(4.17)
88
Logic-Timing Simulation and the Degradation Delay Model
However, solving this equation in the general case for the whole transition process is difficult because the CMOS transistors forming the inverter go through different regions of operation which depend on the slope of the input transition. This complexity prevents us from obtaining a closedform analytical solution even when using a simplified electrical model for the CMOS transistors. It is possible, however, to distinguish between two different situations, one corresponding to fast input transitions and the other to slow input transitions. In the first case, it is possible to obtain a closed-form solution. The slow case is much more difficult, especially due to the operation in the short-circuit region. A description will be given of the method and model presented by Daga et al. [Daga et al. (1 996b)], which solves the problem for the fast case and proposes an empirical correcting factor modulated by technological coefficients which takes into account the slow case. These technological coefficients are extracted by fitting data from accurate electrical simulation. In the following subsections we will start by analysing the special case of an input step transition, which is the fastest input transition and the basis for defining more accurate expressions of the delay. Then the limit between fast and slow input transitions will be established, to finish with the general model.
4.3.2.1 Step input response of the CMOS inverter
As a starting point for studying the delay of an arbitrary input transition, it is useful to calculate the delay of a step input transition since the delay in more general cases can be conveniently expressed in terms of the step input delay. In the following, a rising input transition will be considered for our analysis, with the opposite case, the falling one, being analogous. The rising step input delay of a CMOS inverter -tpfs - is defined as the time spent by the NMOS transistor in discharging the output node from the supply voltage V D D to the logic threshold voltage Y D D / 2 , when the mentioned transistor is under maximum driving conditions Y,, = Y D D - . The subscript f in tpfs refers to thefalling output transition triggered by the rising input transition.
Chapter 4. CMOS Inverter Degradation Delay Model
89
VGSVDD
VDD
I
VDDQ
0 Fig. 4.8 Rising step input delay of the CMOS inverter.
This delay time is represented graphically in Fig. 4.8. During the step response, the NMOS is working in saturation, thus driving a constant current given by (4.18) I N = K NW N (VDD- V T N -) The above definition of tpfs results in: (4.19) giving the following value for tpfs: (4.20) vTN is the reduced NMOS threshold voltage given by = VTN/VDDIf a symmetric inverter ( k = 1 ) is used for loading an equal one, the
where VTN
definition of tpfs matches that given for z~~in Sec. 4.2:
90
Logic-Thing Simulation and the Degradation Delay Model
(4.21) Other usehl ways to express tpfs are: tpJi
=
C L =ST2 c N ’
(4.22)
where C N = CoxLmin W N is the gate capacitance of the NMOS, or (4.23)
This last equation is of special interest since it explicitly shows the dependence of tpfs on the technology through T ~ on~ the , device’s dissymmetry ( k ) and the fan-out factor c,/ C I N . In a similar way, the falling input step delay can be defined as: tprs
=
C L TSTR2 C P
Y
(4.24)
making use of parameters z~~ and R defined in Sec. 4.2. Expressions analogous to Eq. (4.23) can also be obtained: (4.25)
4.3.2.2 Limits between slow and fast input transitions The actual response of CMOS gates does not establish a clear limit between slow and fast input transitions, since the delay depends continuously on the input transition time. However, and in order to obtain closedform expressions for the delay, it is necessary to establish some limits enabling the necessary simplification. In this section different criteria are introduced to establish these limits and analyse their benefits and drawbacks. Once the preferred criterion is selected, an accurate limit is calculated to distinguish between slow and fast input transitions. Any criterion should provide a critical value for the input transition time, noted T ~ so~that~ input , transitions with smaller transition times would be classified as fast and those with a larger transition time would be
Chapter 4. CMOS Inverter Degradation Delay Model
91
considered slow. The following are examples of speed criteria for input transitions: In terms of the duration of the output transition (zOul): zinc = In terms of operating in the short-circuit region or not: Tin < zinc Isc 03 2, > zinc I,, # 0 . In terms of the duration of the overshoot: T~~~ = t o , . The first criterion is probably the most realistic because it defines the speed of the input in terms of the speed of the output. It is not very useful, however, from the analytical point of view because it does not determine in which region the CMOS transistors will operate at the critical point. The second criterion is appropriate from the analytical point of view since convenient simplification can be made whether short-circuit currents are present or not. The problem of this criterion is the difficulty in calculating an accurate limit when short-circuit currents are negligible during the whole transition. The third criterion overcomes the limitations of the previous ones. It warranties that for zi, < to,, the short-circuit currents will be negligible, greatly simplifying the analysis. For zin> to,, short-circuit currents may be important and should be considered and, in general, the MOS transistors will go through different regions of operation before the output transition crosses the logic threshold. Additionally, it is easy to calculate analytically when zinc= to,, so this will be the criterion chosen and analysed below.
4.3.2.3 Critical transition time calculation
Figure 4.9 shows examples of fast and slow input transitions, besides the limit transition which defines the critical transition time. To obtain an expression for zincit is necessary to calculate the value of to, which, in turn, depends on zi, . It is possible to obtain two expressions for to, using Eq. (4.16) and (4.17), one for slow and the other for fast input transitions. If I, = 0 , then:
92
Logic-liming Simulation and the Degradation Delay Model
6.0 I
I
Fig. 4.9 Fast and slow input transitions and critical transition time: a) fast input transition, b) slow input transition, c) limit transition.
(4.26) The limit condition is qnc= t o v ( ~ i nand c ) may be applied to any of the two previous expressions. Using the one for the fast case which is simpler yields (4.27)
Chapter 4. CMOS Inverter Degradation Delay Model
93
Fig. 4.10 Propagation delay for fast input transition.
where the subscriptfrefers to a falling output transition -triggered by a rising input transition. In a symmetric manner, the corresponding expression can be obtained for a rising output transition: (4.28)
4.3.2.4 Delay calculationfor fast input transitions
In this case, once the overshoot is finished, the NMOS is driving its maximum available current. The evolution of the output waveform from the point where V , = V D D is exactly the same that was described during the calculation of tpfs. Hence, as shown in Fig. 4.10, the propagation delay can be written as t,f =
-+ tpfs 2 L. in
to,
9
(4.29)
94
Logic-Timing Simulation and the Degradation Delay Model
where all the terms are already known except for the overshoot time to,. To calculate to, Eq. (4.16) can be solved using Eq. (4.17) for V , . Due to the relative small value of the overshoot voltage, I p is neglected to simplify the calculations. A distinction should be made between two regions of operation to , obtain V , . In the first one t I q f land
(4.30)
Solving Eq. (4.16) yields:
(4.31) In the second region, zi,< t I to, and the NMOS transistor is working in saturation, driving its maximum current: (4.32) I N m a x = K N@”( VDD- VTN). By applying the condition V,(t,,) = VDD the overshoot is obtained for the fast case already mentioned in Eq. (4.26): (4.33) Substituting in Eq. (4.29), the propagation delay for fast rising input transitions yields: (4.34) In a similar way, the propagation delay for falling input transitions may be calculated as: (4.35)
Chapter 4. CMOS Inverter Degradation Delay Model
95
250
200
non-linear region 150 h
K
v
rQ
100
50
4.3.2.5 Delay calculation for slow input transitions The method proposed in [Daga et al. (1996b)l to take into account the slow input transitions consists in applying a correcting factor to the expressions for fast input transitions. This correcting factor is empirically introduced and models the non-lineal dependence of the delay on the input transition time for slow input transitions (Fig. 4.1 1). The correcting factor also takes into account the dependence on supply voltage and the transistor’s geometry. These corrected expressions, for both types of transitions, are:
(4.36)
96
Logic-li'ming Simulation and the Degradation Delay Model
Table 4.2 Semi-empirical fitting parameters to model slow input transition delay in 0.7 pm CMOS technology
Delay value
a
P
Y
tpf
0.067
1.8
1.15
0.037
5.31
1.19
tPl.
where a, b and g are calculated by fitting the above expressions to accurate data obtained by electrical simulation, and are characteristic of the technological process. As an example, the values of these parameters for a 0.7 mm CMOS technology are shown in Table 4.2.
4.3.3 Output transition time calculation
As shown in previous sections, the input transition time ( T ~ plays ~ ) an important role when calculating the propagation delay. Future sections will show how transition time is also important for modelling the degradation effect. For these reasons, it is always necessary to evaluate the output transition time ( T , ~ ~in) addition to the propagation delay, since this output transition time will be the input transition time for the next stage in the circuit. The first step to obtain a measure for T , ~is ~to define a criterion to make the output transition linear. The 10/90% is one of the most extended criterion, which uses the points where the output waveform crosses the 10% and 90% of the supply rail. Other similar approaches use a 20/80% reference [Jun et al. (1989)l or a 30/70% reference [Dartu and Pileggi (1996)l. It seems that the narrower the range, the more accurate the linear ramp is [Dartu and Pileggi (1996)]. Following this idea, a good method to obtain a linearized output is to consider a ramp with the same slope the output waveform presents at 50% of the supply rail, that is, when V,,, = V D D / 2 . This is the criterion used in the following calculations. It is then easy to express the value of zOutas a hnction of the current driven by the active transistor when V,,, = V D D / 2 , that is:
97
Chapter 4. CMOS Inverter Degradation Delay Model
6.0
2.5
5.0 I
I
4.0
23.0 2.0 1.o
0.0
Fig. 4.12 Fast and slow input transitions for z,~ calculation. Fast I 2 t p f . Slow input transition: input transition: I d = I,,, , z~,, I , 2 t P f .
(4.37)
where I d is the current of the transistor acting as a driver. As before, the focus will be on a falling output transition, and at the end the corresponding solution for the opposite case will be given. Depending how fast or slow the input transition is, different values for the current of the driver at VD,/2 are obtained. When input transitions are fast enough, the driver will be in saturation driving its maximum current. Taking into account Eq. (4.6), input transitions are considered fast regarding the calculation of +routwhen (4.38) Z d ( V o u t = J'D,/~) = Z m a x = K N W N ( V D D -V T N *) In that case, Vi, has reached V D D before VOuf , descending to VDD/2 (Fig. 4.12) and the input transition time verifies that zi,I 2t,. In such a situation, using Eq. (4.20) and (4.37) yields:
98
Logic-liming Simulation and the Degradation Delay Model
(4.39) For slow input transitions, Id(Vour= vD,/2) < I,,, and zi,> 2tpf as shown in Fig. 4.12. Id may be calculated by using Eq. (4.3) and Eq. (4.17), giving: Tour
= 2tpfs.
(4.40) yielding: Tour
= 2tpfsl
1 - VTN
--vTN+-
tP f
(4.41)
2 Tin The complete model for zOutis summarized in the following expression:
(4.42)
where Xis N or P for falling or rising output transitions, respectively, and t,, becomes tPfs or tprs in the same way. It is important to note in the previous expression that it is necessary to obtain propagation delay t, before calculating z O u rso , that once the propagation delay is obtained with a given delay model, we have a direct way to obtain the output transition time.
4.4 Input-to-Output Coupling Capacitance Modelling
This section focuses on the modelling of the input-to-output coupling capacitance (IOCC) and its impact on the timing performance of the CMOS inverter, This capacitance is responsible for the voltage overshoot developed at the beginning of the output response to an input transition. It has been stated in Sec. 4.3.1 that an important part of the delay is due to this overshoot, and can be characterized by an overshoot time (to” in
Chapter 4. CMOS Inverter Degradation Delay Model
99
Fig. 4.5). Accurately modelling this time requires a good model for the IOCC, which is typically calculated by a single constant capacitor (C, ) in digital delay modelling. Actually, the IOCC is highly non-linear since it is formed by the summation of the gate-to-drain capacitances of both transistors in the inverter structure: CgdN -k cgdP * (4.43) Hence, it is very important to reduce the non-linear behaviour correctly to an equivalent capacitor C, as it may have an important impact on the resulting delay. Indeed, it seems that at least two values of C, have to be calculated, one for each type of transition. This section shows that the IOCC remains almost constant during the overshoot region, which validates the modelling through an equivalent capacitor. It is also shown that the traditional approach of neglecting the contribution of the driving transistor to C, is no longer valid in the submicron range and causes an important underestimation in the overshoot time calculation. An accurate model for C, is proposed, which takes into account the variation in the inverter geometry configuration. It shows very good accuracy with respect to the actual capacitance obtained by electrical simulation with the HSPICE electrical simulator [Hspice (1999)], without adding significant additional complexity to conventional calculations. The overshoot time obtained with this model practically matches the one obtained with HSPICE internal capacitance models.
4.4.1 IOCC calculationfor micron MOSFET's
This study will consider the Meyer model for MOS capacitances, which is widely used in electrical simulators. In the Meyer model, six independent capacitances calculate the charge effects in the MOS transistor, one for each pair of the MOSFET terminals (Fig. 4.13). Taking a look at the CMOS inverter in Fig. 4.14, it is clear that the gate-to-drain capacitances (C,,) of both PMOS and NMOS transistors sum up to give the total input-to-output coupling capacitance C, . These capacitances ( C,,, and C g d P need ) to be evaluated to take into account the coupling effects between input and output.
100
Logic-Eming Simulation and the Degradation Delay Model
Fig. 4.13 The Meyer Model.
Fig. 4.14 The CMOS Inverter.
In the following discussion we will focus on an input rising transition, the falling one being analogous, due to the symmetry of the inverter gate. In this case and during the evaluation of the overshoot time ( t , , ) , the NMOS can be considered in saturation or cut off during most of the evaluation time, while the PMOS will operate mostly in the linear region. Based on this fact, the conventional approach considers to be the contribution of the saturated driving transistor negligible, while it uses a Miller
Chapter 4. CMOS Inverter Degradation Delay Model
101
linear operation saturation operation
vDS
(v)
Fig. 4.15 Gate-to-drain capacitancefor a micron MOSFET.
approach to evaluate the contribution of the MOSFET operating in the linear region, namely: CgdNISAT
CgdPILiN
2 c,p
(4.44)
3
where C g p is the total gate capacitance of the PMOS transistor. Hence, for each type of transition the following is obtained:
C,
=
WpLpCox
CM,. =
51WNLNC,,
,
(4.45)
Figure 4.15 shows the value of C g d for the different regions of operation of a micron ( L = 8mm) NMOS transistor, being almost the same for a PMOS. It can be seen that the conventional approach is accurate enough for this kind of device, assuming deep linear or saturated operation are applied. The small gate-to-drain capacitance which remains in the saturation region is due to overlap capacitances, which is negligible for long channel devices. For convenience, the reduced input-to-output coupling capacitances shall be defined as: (4.46)
102
Logic-liming Simulation and the Degradation Delay Model
Thus, the conventional approach, valid for long channel devices, may be expressed as: C,,- = 0.5 C,, = 0.5. (4.47)
4.4.2 IOCC calculationfor submicron MOSFET’s
As the length of the MOS transistor is decreased, the total gate capacitance decreases, while the overlap capacitance contribution to Cgd remains constant. This causes that in the saturation region, the overlap capacitance might not be negligible for short channel MOSFET’s [Chen (1 990)]. In Fig. 4.16, the gate-to-drain capacitance for submicron N and P MOSFET’s are plotted as a function of gate and drain voltage. The following will focus on minimal length transistors, as shown in Fig. 4.16. A major difference with respect to micron devices arises: the gate-to-drain capacitance in the saturation region becomes more important, which agrees with the overlap capacitance conservation explained above. As a direct consequence and for a given transition, the saturated MOSFET may contribute significantly to the overall IOCC, especially in non-symmetric inverters ( W, # W,). From plots like the one shown in Fig. 4.16, effective values for c g d in the linear and saturation regions can be obtained. As before, the case of a rising input edge will be explained, the opposite case being analogous. Since V,, is small for the transistor operating in the linear region during the evolution of the overshoot, it will operate around point A in Fig. 4.16. With respect to the driving transistor, the drain-to-source voltage lies around V,, ,thus operating near point B. For each transistor, an effective constant capacitance is defined, corresponding to points A and B. For a sample 0.7 mm CMOS technology (Cox=2.3 fF/mm2, Lmin = 0.8 mm), it yields: cgd,I,, = o.521cgN CgdN[SAT = o-126cgh’, (4.48) CgdPILIN
=
0.522cgP
CgdPISAT
=
o.126cgP*
The IOCC is then calculated, for each type of transition, as:
(4.49)
Chapter 4. CMOS Inverter Degradation Delay Model
103
NMOS TRANSISTOR
0" %
u"
0.5
PMOS TRANSISTOR
Fig. 4.16 Gate-to-drain capacitance for a submicron MOSFET.
'Mf
=
'gdP
I
'Mi'
=
'gdN
ILIN + 'gdP ISAT
LIN + 'gdN
I
SAT *
From here, the reduced IOCC's are easily obtained using (4.46):
(4.50)
104
Logic-Timing Simulation and the Degradation Delay Model
c,,
= a + p-, c g
p
(4.5 1)
cgN
where,
(4.52) In this case, coefficients a and p are the same for both P and N transistors. If necessary, and depending on the process, these coefficients can be given particular values for each type of device. The gate capacitance quotient can be expressed in terms of the internal dissymmetry of the inverter ( k = W p / W N): (4.53) to obtain C,
c,,
= a+p/k,
(4.54)
= a+p.
(4.55)
In these expressions, a corresponds to the conventional approach while p takes account of the capacitances in the saturation region, which were neglected in the conventional calculation. Indeed, a and p can also be calculated for the micron device of Fig. 4.15, giving: a = 0.503 p = 0.018, (4.56) which makes the second term of Eq. (4.54) and (4.55) negligible for most practical values of k, obtaining the traditional result shown in Eq. (4.47). Considering the form of Eq. (4.54) and (4.55), the greatest deviations from the traditional result are obtained for a large dissymmetry ( k << 1 or k >> 1 ), for which the second term may become dominant.
Chapter 4. CMOS Inverter Degradation Delay Model
105
4.4.2.I Reduced IOCC estimationfrom SPICE model card
It is possible to make an estimation of coefficients a and p based on the technological parameters provided by the foundry in the SPICE model card. For a, it represents the Miller capacitance used in the conventional approach and can be estimated as a = 0.5. For p, it depends on the capacitance in the saturation region, which is basically an overlap capacitance. This can be estimated using the L D parameter: C g d l S A T = Cgdov wLDc~~. (4.57)
p is obtained, then, from its definition: (4.58) From a sample model card, it yields 1 (4.59) fl = 0= 0.125, 0.8 for both types of transistors, which is very close to the one obtained from the C,, curves in Eq. (4.52). Nevertheless, the calculation through the c g d curves is recommended as it provides higher precision and can be applied to any SPICE level.
4.4.3 Comparison of IOCC models Both the conventional and the proposed approaches rely on the fact that the IOCC can be modelled by an equivalent capacitor C, ,which remains unchanged during the overshoot. Figure 4.17 shows the waveforms of an inverter’s input and output for both types of transitions, besides the instantaneous coupling capacitance obtained with HSPICE (through the LX32 MOS model template). In this example, different coupling capacitances are observed for different input transitions (Fig. 4.17 (a)). It can be seen in Figs. 4.17 (b) and 4.17 (c) that the IOCC remains almost constant during
Logic-7Iming Simulation and the Degradation Delay Model
106
I 0.5
61
5
0.4
4
mn
0.3
B
E 3 a2
0.2
Q
1 0.1
0
5
5
0.4
4
E3 b 2
0.3@0
B
9
0.2
1
0
0.4
4
0.1
0.3 0
e -3
b 2
0.2
1 0
0
2
0.1
Fig. 4.17 Signal waveforms and instantaneous coupling capacitance: a) general view, b) rising input edge, c) falling input edge.
the development of the overshoot. After each transition, a transitory depletion in the IOCC value is observed, which corresponds to a time period in which both transistors are operating in the saturation region. Similar qualitative results have been observed for each inverter configuration studied and for a wide range of input transition times. In order to obtain a capacitance measure from HSPICE simulation, the value of the IOCC in the flat part of the curve before each transition point A in Fig. 4.17(b) and point B in Fig. 4.17(c)- is taken as the simulated IOCC for the transition. To validate the model proposed in Eq. (4.54) and Eq. (4.55) we have simulated CMOS inverters in a wide range of geometry ratios ( k ) . The simulation have been performed using minimum length transistors, an NMOS transistor width of 4mm, an output load capacitance of twice the
107
Chapter 4. CMOS Inverter Degradation Delay Model
Table 4.3 Simulation results for
HL output transition (C,$
c,.
LH output transition (C,,)
k SPICE Prop. % Prop. % Class.
k SPICE Prop. % Prop. % Class.
113 0.982 0.900
-8
-49
113 0.594 0.564
-5
-16
112 0.826 0.774
-6
-39
112 0.613 0.585
-5
-18
1
0.668 0.648
-3
-25
1
0.667 0.648
-3
-25
2
0.589 0.585
-1
-18
2
0.776 0.774
-0.2
-36
3
0.562 0.564
0.4
-12
3
0.885 0.900
2
-44
4
0.550 0.554
1
-9
4
0.993 1.026
3
-50
inverter input capacitance and moderate realistic input transition times. It has been observed that variations in output load, transition time and transistor width give similar results. The results are summarized in Table 4.3, where the C, values obtained with HSPICE and the proposed approach are compared. The error percentages for both the conventional and the proposed model with respect to HSPICE are also calculated. From this table, and for the case of a falling output transition, the following results may be derived: The traditional approach considerably underestimates the value of C, , especially for small values of k , where the saturation capacitance becomes important. The traditional approach is only adequate for large values of k , since the contribution of the driver becomes less important. But, in that case, the important error is shifted to the opposite case (rising output transition). For typical values of k (1-2), the underestimation of the traditional approach is about 20% with respect to HSPICE results, while the proposed approach is within 3%.
108
Logic-Timing Simulation and the Degradation Delay Model
The proposed approach adequately models the IOCC even for the most marginal cases, especially for k c 1 , where the traditional approach greatly deviates from the actual behaviour. The proposed model is, indeed, within 8% with respect to HSPICE for the whole studied range. The same discussion can be applied to the case of a rising output transition, provided we use k-I instead of k .
4.4.4 IOCC modelling impact in the Inverter’s timing characteristics As stated before, the IOCC affects the inverter delay through the overshoot time. From Eqs. (4.29) and (4.36): tpf = ( t o v - ? + t p f s ) K ,
(4.60)
where tpfs is the step response delay and K a coefficient decaying from one, which takes into account very slow input transitions. In this section the performance of the proposed CM model is evaluated by measuring the overshoot time obtained when the IOCC of the inverter is substituted by our model. Three situations are actually simulated (Fig. 4.18): a) the “real” inverter with the SPICE non-linear capacitance model, b) the same inverter with the IOCC modelled by the traditional C , model, and c) the same inverter with the proposed CM model. Table 4.4 shows the overshoot time measurements for the three configurations and the same inverter cases used in the previous section. Similar comments can be applied here to t o “ : the lack of accuracy of the traditional C, model translates into important to, errors, even for the better cases. However, the results using the proposed model are within 2% for most cases and never above 5% even for the worst case. Though only one example is presented here, the design space has been explored showing that similar results are obtained for C, E [ C, 8C,,] , W , E [2, 161 and for a wide range of input slopes.
Chapter 4. CMOS Inverter Degradation Delay Model
109
k
Fig. 4.18 to, comparison with three classical model, c) proposed model.
cMmodels: a) SPICE model, b)
4.5 Modelling the Degradation Parameters As analysed in the previous chapter, the propagation delay when considering the degradation effect can be expressed as: t, = t p 0 ( 1
-e
--T - T
1,
(4.61)
where T o and z characterize the degradation effect and t,, is the normal propagation delay (i. e. without degradation effect).
110
Logic-liming Simulation and the Degradation Delay Model
Table 4.4 Simulation results for to,,
HL output transition: to, (ps)
LH output transition: to, (ps)
% prop. % k SPICE class. prop. class.
% k hPICE class. prop.
% class. prop.
113 35.25 27.07 33.58 -23
-4.7
113 206.3 194.1 202
-5.9
-2.1
112 41.13 33.59 39.76 -18
-3.3
112 155.7 145.1 152.7 -6.8
-1.9
1 57.98 51.3 56.85 -12
-1.9
1
105.5 95.88 104 -9.1
-1.4
2 89.29 82.79 88.35 -7.3
-1.1
2
78.93 68.75 78.42 -13
-0.65
3
118.1 111.7 117.5 -5.4 -0.51
3 69.23 58.23 69.19 -16 -0.058
4
145.4 138.9 144.9 -4.5 -0.34
4
64.01 52.3 64.27 -18
0.41
In Sec. 4.3 t,, was modelled as a function of the internal parameters of the CMOS inverter as well as of the external conditions (wave form, load, and supply voltage). In this Section the degradation parameters (z and T o )will be modelled as functions of the internal characteristics and external conditions of the inverter gate. The process of obtaining these expressions will be supported by the physical interpretation of the degradation parameters developed in Sec, 3.2.3. According to this interpretation, the degradation parameters represent certain times in the evolution of the signals during a transition of the CMOS inverter. The recognition of z and T o as interesting intervals in the evolution of the signals will make it possible to propose logical dependencies regarding the internal parameters and external conditions. Once the dependencies have been established, their accuracy will be verified. In the next paragraphs the process of modelling the degradation parameters for a falling output transition will be described in detail. AS before, the expressions for the opposite transition will be obtained by analogy.
Chapter 4. CMOS Inverter Degradation Delay Model
111
Fig. 4.19 The interpretation of parameter 2 . 32 is the time that must lapse from the last output transition in order to make a new input transition propagate with a delay similar to 0.95tpO.
4.5.1 Modelling theJirst degradation parameter As indicated in Sec. 3.2.3, 3 2 represents the time that has to lapse from the last logical change of the output in order to make a new input transition produce a propagation delay equal or greater than 0.95tP0 (Fig. 4.19). The value 32 corresponds to the time of charge (or discharge) of the output load, controlled by the active transistor, therefore, 2 will be proportional to the characteristic time constant of this process of charge or discharge. This will make it possible to obtain a dependence of 2 on the parameters which determine this time constant. Analysing the situation of Fig. 4.19, the active transistor during the charge is the PMOS. It is feasible to suppose that the NMOS transistor is in off-state or near off-state, since this time is measured once the output transition has taken place. In turn, the PMOS will be driving in the lineal zone with V,, = V D D which , means that, in a first approach, it can be
112
Logic-Eming Simulation and the Degradation Delay Model
modelled by means of an equivalent resistance. Indeed, considering a simple model for the PMOS in lineal zone yields: (4.62) I D = K P wP( vSG - 1 vTPI ‘ S D . In our case, V,, = V D D and, considering V D D - 1 V,l= V D D : (4.63)
It is very well known that the constant of time governing the charge or discharge of a capacitance C through a resistance R is RC . Therefore, according to the interpretation foreseen for z , it follows that: (4.64) or what is the same: (4.65)
This expression shows the dependence of z on the external ( C L and internal ( W p )parameters. To be practical, the previous relation is converted into an equality through the inclusion of two parameters, a f and b, , which are characteristic of the CMOS technology used and are obtained by means of fitting these parameters to the obtained experimental results. In this way, the following expression for z is proposed: V D D ) and
(4.66)
Similarly, for the case of raising output: z,VDD = a, + b,- CL ,
(4.67) WN so that for the characterization of the parameter z four technological parameters are necessary. One of the most interesting aspects of this expression is that a dependence of z on the characteristics of the passive transistor is not expected because after the output transition it should already have left the short circuit region. This result will be proven by electrical simulation. Nor does an important dependence appear with the duration of the input
Chapter 4. CMOS Inverter Degradation Delay Model
113
transition (2, ). However, this dependence exists in parameter T o as will be seen.
4.5.2 Modelling the second degradation parameter
In the previous chapter the parameter T o was expressed as (4.68) where VTx represents both values, V , or V , , corresponding to a falling or rising output transition, respectively. In a first analysis of this expression, there is a clear dependence of T o on the external parameters ( V,, and z i n )together with a dependence, not so explicit, on the internal structure of the gate, represented by V,. For this reason the focus will be on analysing V , and its dependence on the rest of parameters. In a first approach, V , represents the variation of voltage with respect to the polarization which needs to be applied to the input of the structure so that the output begins to commute. In this sense, V , and V , define a couple of effective thresholds which determine the beginning of the inverter’s commutation (Fig. 4.20 (a)). In order to understand the meaning of these parameters better, we will consider the case of a rising input transition. As usual, the study of the opposite case is analogous. We will use subscript x when the expressions are applicable to both types of transitions. In Fig. 4.20 (b) we can see the output of an inverter corresponding to a rising input transition. By definition, V T Lcorresponds to the value of V i that makes the output voltage begin to diminish. To obtain this value, it is necessary that the NMOS be in on-state, for which it must be ensured that V T L 2V T N .In fact, in the absence of the PMOS, V , = V,, because as soon as the NMOS enters in on-state, the output transition begins. But in presence of the PMOS, the N transistor must evacuate the short-circuit current introduced by the PMOS, besides discharging the output node. To counteract this effect, the necessary input voltage to make the structure to commute in this case will be bigger than V,, that is, V , . In this sense, V , represents the voltage threshold which a NMOS
114
Logic-Eming Simulation and the Degradation Delay Model
Fig. 4.20 Effective commutation thresholds: a) threshold location, b) inverter’s output activation.
transistor would have in order to produce, working alone, the same effect as one in an NMOS-PMOS inverter structure. This effective voltage can be expected to increase as the relative strength of the PMOS increases with regards to the NMOS, which is represented by factor k = W p / W N. With these considerations, V T L has the following behaviour: V T L2 VTN (4.69)
115
Chapter 4. CMOS Inverter Degradation Delay Model
and VTL should be a growing function of k which tends to tends to zero:
dk
d V T L> 0 ,
VTL = f ( k )
limV,
=
VTN
when k (4.70) (4.71)
VTN.
k-0
In order to simplify the calculations it is convenient to define certain reduced threshold voltage:
(4.72) In terms of these reduced thresholds it follows that: limv, = v T N , VTL 2 VTN k-0
(4.73)
lim v T H = v T P . (4.74) +0 The introduction of vTX is a simple way to take into account a complex effect: the short-circuit currents. This fact implies that, in general, vTL will not only depend on k ,but also on V,, and on T~,,.Nevertheless, the major contribution to vTL comes on the part of vTN . Likewise, when delay models are built, a primordial objective just as important as precision is simplicity. The complexity of the model should not be increased unnecessarily unless the gain in precision justifies it. With this objective in mind vTL may be modelled by means of a constant and relative value to VTH
2 VTP
k-'
VTN : VTL
= (1 + c j - 1 ~ ~ ~
VTH
= (1+ cr)vTp
9
(4.75)
where cf and c, are characteristic parameters of the technology, positive and next to zero. Later on, it will be seen that this is a good approximation in most of cases, since it is an approximation of vTX which only affects the value of T o which is itself an important part in the final result only in cases of strong degradation. The value of v T X ,and therefore that of c, , must be obtained for each case by fitting Eq. (4.16) to the results of the electric simulation.
116
Logic-Thing Simulation and the Degradation Delay Model
4.5.3 Ranges of interestfor the external and internalparameters of the CMOS inverter In previous sections, relations of the dependence of degradation parameters z and T o on the internal and external parameters of the inverter were obtained. For the sake of clarity, these expressions are repeated here: CL = a,+b,--, WY
z,VDD
(4.76)
(4.77)
In these expressions three new parameters appear: a,, b,, and c, which are characteristic of the technology. The indices x and y make it possible to distinguish among the different. types of transitions and they must be substituted by f , r , N or P as it corresponds. The rest of the parameters are internal ones ( W N and W,) or external ones ( C , , z, , and V D D ) . In order to verify the previous relations it is necessary to determine the ranges of interest for the values of these five parameters, so that a certain degree of precision in the models for z and To inside these ranges can be assured. Table 4.5 Ranges for the design variables and typical value.
Variable
Min.
Max.
Typical
W,(CLm)
1
16
4
k = W,/WN
0.5
4
2
FO = C L / C I N
1
8
2-4 4
~,,/(2t,,)
0.5
5
1.5
3
5
5
v,
(V)
Table 4.5 shows the minimum and maximum values considered interesting for the different design variables, as well as a reference typical value, for a 0.7 pm CMOS technology. The typical values are usefd for fixing the value of a variable and to study the variations of the rest of
Chapter 4. CMOS Inverter Degradation Delay Model
117
them. In the following paragraphs, the reasons for the selection of the different ranges are explained: In the case of W , , 1 mm is the minimum value allowed by the technology used. 16 pm seems a reasonable maximum value, although the model should behave well with arbitrarily high values, since the driving capability increases lineally with the geometry. A typical value of 4 mm will be used to avoid possible deviations due to narrow channel effects. For the technology used, k = 2 represents the dissymmetry for a balanced device (same rising and falling delay) and therefore it is considered to be the typical value. A wide range of dissymmetry (0.5 - 4 ) is taken into account for interesting cases including nonbalanced designs. FO is the Fan-Out factor which measures the output capacity compared to the total capacity of the inverter input, so that it is a good relative measure of the loading capacitance. Here situations are considered in which a gate can be loaded by up to eight similar gates, as well as by gates smaller than the one given. A typical value could be one corresponding to a gate loaded by another identical one ( F O = 1 ), but this would not be realistic since it is necessary to keep in mind the parasitic capacitances. For this reason, a typical value in the range 2 4 is considered. The transition time of the output of a gate loaded by another identical one is typically slightly superior to 2t,, ; for this reason, that typical value is proposed. Also, input transitions are quick or slow depending on their duration with respect to the output transition; the proposed range thus seems wide enough to consider both fast and slow cases. As for V D D , the typical value depends on the technology, which is 5 V in our sample technology. The model will be validated for the range 3-5 V to take into account low voltage applications.
118
Logic- Rming Simulation and the Degradation Delay Model
4.6 Obtaining the Value of Technological Parameters
In the models for ‘I: and T o three parameters which are characteristic of the technology appear: a , b , and c , which in fact are copies when considering falling (a,, b, , and C , ) and rising transitions ( a , , b, ,and c,. ). To determine the value of these technological parameters, the usual characterization process of temporary parameters in delay models will be followed. This process is based on considering the data obtained by electric simulation as experimental data. With this simulation type, the behaviour of the device which is to be characterized is analysed and the parameters are evaluated. The basic characterization process consists of determining a group of values for parameters, t,, , z and T o , applying lineal regression, as was shown in Sec. 3.2.2, given a group of values of the internal ( W , and W,) and external parameters ( CL, zi,, and VD,). Starting from this group of values it will be possible to carry out two tasks: To obtain the value of the technological parameters. To verify if the proposed models for z and T o are correct.
4.6.1 Verification of the model for the first degradation parameter
In order to verify the proposed model for parameter z it is necessary to check the following points (a falling output transition is assumed): (1) Obtain values of z varying parameters C, and W p (or k ) . This will determine the nominal values of technological parameters A , and
4-
(2) Check that product z, V,, does not depend, in fact, on V,, , W N , and z~,.Curves for z in front of each one of these variables are obtained to show that their value remains approximately constant in the cases of interest.
119
Chapter 4. CMOS Inverter Degradation Delay Model
To calculate a, and b, it is very useful to keep in mind that product z V D D does not depend on V D D , nor on W N, nor on zin. Thus, typical values for these parameters are chosen: WN = 4pm V D D = 5V ~ i , = 1.5tpfs. (4.78) On the other hand, they depend on CL and W p ( k ) . We vary these parameters inside the following ranges of interest:
k = 0.5 ...3 Table 4.6 Product z V,,
CL = CIN
(4.79)
2...8.
vs. several configurations and loading capacitances. 7VDD
k
CL
=f
0.5
2
118.582
592.91
0.5
4
214.963
1074.82
0.5
6
312.043
1560.22
0.5
8
406.678
2033.39
1
2
79.9921
399.96
1
4
141.158
705.79
1
6
204.196
1020.98
1
8
265.352
1326.76
2
2
61.9786
309.893
2
4
116.048
580.24
2
6
158.306
791.53
2
8
205.038
1025.19
3
2
56.8486
284.243
3
4
99.8585
499.293
3
6
140.911
704.555
3
8
179.911
899.555
For these ranges of interest the corresponding values for z, and z,-VDD have been obtained. Results are shown in Table 4.6.Parameters
120
Logic-Timing Simulation and the Degradation Delay Model
2000
500
,-
Fig. 4.21 Linear regression for the extraction of parameters a and bf ( V D D = 5 V , W N = 4 y m , CC /,, = 2...8, k = 0.5 ...3 , T i n = 3t,fS 1.
a,- and b, can be obtained by applying lineal regression on the data of this table when it is represented z,- V D Din front of C L / W p. In Fig. 4.2 1
this representation is shown and, indeed, the linear relation proposed in the expression of z , Eq. (4.76), is verified. The values of a,- and b,obtained for this technology are: psxVxpm b,- = (44.1 k0.6) a,- = (68 k 12)psxV
fF
corr.coef. = 0.9988
(4.80)
The values of the parameters A , and B, come in the same way but for the case of a rising output transition. Considering the same typical values and ranges, the following is obtained: ps x V x pm a, = (91 k 2 2 ) p s x V b, = (15.9k0.6)
fF
corr. coef. = 0.984969
(4.81)
It is important to verify the independence of zf on zi, and W , , and the independence of 7,- V D D on V D D . In Fig. 4.22 zf is represented in
Chapter 4. CMOS Inverter Degradation Delay Model
121
I\
300 1
h
B 200
loo
I
-
1
Fig. 4.22 z vs. zin for different configurations and load conditions ( V D D= 5 V , W N = 4 pm, C , / C , = 4 . . . 8 , k = 1...3).
front of zi, for different configurations and load conditions. It may be observed that z stays practically constant except for z;, < 2 t p f , , where it suffers a slight increase. These values of zi, correspond to quick input transitions. The criterion applied in the last section about characterizing parameter z for zi, = 3 tpJsis adapted since it corresponds to the value of z for most of the range, especially the part that is more interesting. Even in this way, for the quickest transitions, the variation of z does not exceed 20% of the defined typical value. On the other hand, in Fig. 4.23 shows how T ~ remains V ~practi~ cally constant inside the range of interest of the supply voltage for the diverse inverters which have been analysed. The voltage of the chosen characterization is 5 V because it is commonly used in the studied technology. Finally, for a complete validation of the model for z ,the non-dependence of product zf V D D on the width of the active transistor needs to be checked, as expressed in Eq. (4.66). Inverters with different configurations and loads have been simulated as functions of the width of the active transistor (in this case the NMOS). In the simulations a polarization volt-
122
:
Logic-Timing Simulation and the Degradation Delay Model
>x 1000
- 1
k CLGN 4 8
- 1 - 2 A-A2
- 3 m
4 8 4
3
8
Fig. 4.23 zf V D D vs. V D D for different configurations and load conditions ( W , = 4 pm, C,/C, = 4...8, k = 1...3 , 'in = 3 t p f s ) .
age of 5 V and input transitions with typical duration ( 3 tpfs) were used. Figure 4.24 shows the results obtained. Indeed, product T~ V,, remains practically constant during the whole studied range ( 1 - 16 pm). Slight deviations only take place for the smallest values in W,, where second order effect and parasitic capacitances become appreciable. Even this way, this deviations are not important in most cases. Nevertheless, for the characterization of parameters A and B it is important to avoid this area, which makes it necessary to use a typical value equal or greater than 4 pm for W , for the characterization. These are the results. In the case of z,., corresponding to Eq. (4.67), the results are similar.
4.6.2 VeriJicationof the model for the second degradation parameter The model for T o ,specifically for a falling output transition, is defined by the following expression:
Chapter 4. CMOS Inverter Degradation Delay Model
123
1500
1000
500
0
Fig. 4.24 z V,, vs. W, for different configurations and load conditions(VDD = 5 V , C L / C I N = 4...8, k = 1 . . . 2 , zin = 3tpfs ).
(4.82) In Fig. 4.25 the dependence of T O f for different loads connected to the output node and different configurations is shown. One can see, as in most of the range, that the dependence of To, is exactly linear, as the model predicts. Likewise, the slope obtained is independent of the value of the load capacity, as was to be expected from the nature of parameter T o . However, differences appear in the slope for different values of k . This dependence had been mentioned when developing the model for T o (Sec. 4.5.2) and it causes different values of c for different values of k , as shown in Table 4.7. As could be foreseen, cf is practically zero for a relatively weak PMOS transistor with regard to the NMOS (k = 1 ), while the value of c increases as the PMOS grows in relative strength. At this point it would be necessary to develop a model for cf as a function of k . But since k moves in a relatively small range of values and c only represents a minority component of the value of vTL, Eq. (4.75),
124
Logic-Timing Simulation and the Degradation Delay Model
-506
20
40
I
60
80
zin’zST
Fig. 4.25 To vs. z~,,for different configurationsand load conditions ( V D D = 5 V , W, = 4 y r n , =~ 24ps). ~ ~
Table 4.7 Dependence of c on k for V,,
= 5 V , W, = 4 pm , and vTN = 1.25 V .
k
Slope
TL
aL
1
0.239
0.261
0.05
2
0.160
0.339
0.35
3
0.130
0.370
0.48
it is preferable not to complicate the model and to choose a commitment value for cf . This value can be chosen, for example, as the average of the maximum and minimum values in a given range. This way, taking the data from Table 4.7 results in: -- 0.05 + 0.35 = 0.2, (4.83) Cf (corn.
2
where (4.84)
Chapter 4. CMOS Inverter Degradation Delay Model
125
This approach assumes a maximum relative error of 15% for vTL in the studied range. In the same way a commitment value is obtained for cr and vTH, yielding: = 0.3, (4.85) cr Icorn. VTHl
corn.
= 1.1vTp.
(4.86)
In this case the maximum deviation is of only 13%.
4.7 Discussion
In this chapter each one of the parameters of the DDM, presented in the previous chapter, has been analysed depending on the technological and design characteristics of the CMOS inverter (internal and external characteristics). In this task, first, the parameters which characterize the submicron technologies regarding the propagation speed of the digital signals have been analysed. This analysis provides some parameters and expressions used later for the characterization of the DDM parameters. After this first analysis, parameters t,, , z, and T o of the DDM have been characterized. This task consists, basically, of finding the dependence of the DDM parameters on internal parameters of the gate ( W , ) and external conditions (polarization voltage, load capacity and input signal waveform). Beginning with the delay of normal propagation, t P o ,the characterization proposed in [Daga et al. (1996b)l has been developed. The most outstanding contribution to this model of t,, consists of a proposal for modelling the input-to-output coupling capacitance of the CMOS inverter ( C, ) which, as has been demonstrated, improves the calculation of the time of overshooting substantially in submicron technologies and, consequently, the calculation of the normal propagation delay. For z and T o the start was at the physical meaning associated to these parameters in the previous chapter. From this physical meaning, dependence expressions of 'I: and T o on a group of technological parameters a , b , and c , Eq. (4.76) and Eq. (4.77) were obtained. The most
126
Logic-Timing Simulation and the Degradation Delay Model
important thing in these expressions is that they make it possible to calculate the degradation parameters (z and T o )of any inverter CMOS inside the technology, once we know the values of the technological, design and environment parameters. In order to calculate the value of these new parameters and to verify the expressions of z and T o , a method for characterization of inverters has been developed. This method has been applied for a range of values of interest of the internal and external parameters of the CMOS inverter proving the validity of the proposed expressions. In this way, it may be concluded that the CMOS inverter has been fully characterized for the delay model which includes the degradation effect (DDM).
Chapter 5
Gate-Level DDM Jorge Juan Chic0 Alejandro Millrin Calderhn
5.1 Introduction
In previous chapters a very accurate model of the degradation effect has been developed for the CMOS inverter at a technological level. Once parameters a , b and c in Eq. (4.17) and Eq. (4.18) have been obtained, the necessary expressions are available to obtain the value of higher level degradation parameters. This delay is expressed as a function of the inverter structure ( W , and W,) and the external conditions to the gate: supply voltage, output load and input transition time. The objective of this chapter is to extend the usability of DDM to more complex CMOS gates than was possible with the CMOS inverter. More precisely, static NAND and NOR gates with ?n arbitrary number of inputs will be considered. This extension will lead to a more general degradation delay model suitable to be implemented in logic timing simulators, allowing for the analysis of a wide range of digital CMOS circuits taking account of degradation effect [Juan et al. (2000a); Juan et al. (2000b)l. Most delay models for CMOS gates rely on the fact that for every input event causing the switching of the output, it is possible to find an equivalent situation in a simpler gate which is well characterized and easier to analyse. In most cases, the reference gate is the inverter. Therefore, the problem is reduced to obtaining the parameters of the equivalent
I27
128
Logic-Timing Simulation and the Degradation Delay Model
inverter for the given input event and the calculation of the delay using inverter equations. We will use a similar approach starting with the hypothesis that the basic equation for the DDM is still valid for simple CMOS gates, so that the delay may be calculated as: t , = t,,(l-e
--T - T 7
4.
(5.1)
This hypothesis will be validated later in this chapter through accurate electrical simulation results. Once the general model is accepted, the problem of modelling the DDM for complex gates may be divided into two main tasks: Determining the input conditions causing degradation effect in multiinput gates. Determining parameters t,, , T and T o of the equivalent inverter to allow for the application of Eq. (5.1). To solve the first task we will make an exhaustive analysis of all the input conditions which may cause a degradation effect in a multi-input gate. This analysis is elaborated in the next section. Regarding the second task, two main strategies may be applied to obtain the equivalent parameters, which are: To apply reduction techniques at a geometric/technological level. To use an external gate-level modelling approach. The first approach is appropriate when it is important to maintain the explicit dependence on the internal structure of the gate (geometry, etc.) in the delay equations. In most cases, hybrid analytical and empirical techniques are used to obtain general equations to reduce the layout design of a complex gate to an equivalent inverter. Then, inverter equations can be applied such as [Deschant et al. (1988); Jeppson (1994); Navavi-Lishi and Rumin (1994); Daga et al. (1 996a); Chatzigeorgiou and Nikolaidis (1998)l. The main advantage of this approach is that the characterization process is done only once for the technology, and not for
Chapter 5. Gate-LevelDDM
129
every cell. This can be applied, for example, to fast library cell characterization provided that detailed cell layout information is available. On the other hand, the reduction process is complex and many simplifications need to be introduced in the calculations, which affects the accuracy of the results. Also, detailed layout information is not always available to the designer, leaving the characterization task to the foundry. Furthermore, the generality of the approach is not as wide as may be expected. For example, the channel widths of the equivalent inverter for delay calculation need not be the same for the calculation of other parameters such as input load, transition times or degradation parameters, since the operating conditions of the cell (the transistor’s operating points) will differ during the calculation of each parameter. The second approach, the external modelling at gate-level, does not try to keep an explicit dependence on the internal structure of the cell, but tries to reproduce the gate’s behaviour as accurately as possible by using a set of parameters which are characteristic of the cell. In general, these kinds of models are implemented by specifying a set of parameter values for each case in which the gate operates as like an equivalent inverter, for example, a set of values may be associated to each gate’s input. Hence, a high number of parameters are usually necessary to characterize a single gate. In theory, parameters obtained for a particular gate do not need to be the same for other gates, so the characterization process is carried out for each individual gate. This approach is thus mainly useful to simulate circuits based on a previously characterized library of cells, which is actually the most common implementation technique in current CMOS circuits. An advantage of this approach is that very accurate results can be obtained when the gates are well characterized. The model equations are simple and easy to implement in logic simulators. Library designers can provide these kinds of models with their cells without a detailed layout information. For these reasons these models are implemented in most commercial logic simulators. Both of the above techniques may be applied to the three main components of the DDM: t,, , 2 and T o . Regarding t,, , the topic is well treated in the bibliography as mentioned above. In particular, the extension to gates for the normal propagation delay used in previous chapters can be found in [Daga and Auvergne (1999)l. For the degradation part of
130
Logic- Timing Simulation and the Degradation Delay Model
the model, the approach of the external modelling at the gate-level has been chosen. This way an efficient and easy to implement model for the degradation effect may be obtained, making it possible to evaluate the impact of the phenomenon in complex circuits. However, the other approach is still possible since existing reduction techniques or new ones may be applied and the technological inverter equation in Sec. 4.5may be used. Although more general, this path implies complex calculations, a harder and less efficient implementation and reduced final accuracy, so it is not further developed here. The rest of the chapter is organized as follows: the next section describes the structure of the DDM at the gate level and the analysis of the input conditions which may cause degradation. Also included, for the sake of completeness, is an adaptation to the gate-level of the model for the normal propagation delay in [Daga et al. (1996a)l which was used in Sec. 4.3. This defines an exhaustive modelling of the degradation effect at the gate level, since all possible situations are taken into account. In Sec. 5.3 we analyse in detail the characterization process for degradation parameters and their complexity, including the operation of an automatic characterization program developed for the characterization tasks. Next, we include the characterization results for a set of CMOS gates are included. The analysis of these results yields two simplified models, ending with an analysis of error propagation for the different models. Finally, a comment on the main conclusions of the chapter is given.
5.2 DDM for Multi-Input Gates As mentioned before, an attempt will be made to extent the DDM to multi-input gates following an external gate-level approach. To do that, it will be necessary to obtain delay equations including the degradation effect and the dependence on external conditions to the gate: supply voltage, input transition time and output load. These equations will also include a set of parameters whose values are gate specific which determine the behaviour of the gates with respect to the degradation effect as it can be seen from the outside of the gate.
Chapter 5. Gate-Level DDM
131
For the sake of simplicity, the focus will be on the two main types of gates in CMOS technology: NAND and NOR, as well as the inverter, which is a particular case of both. Although the interest is in modelling the degradation effect, we will also provide gate-level expressions will also be provided for the normal propagation delay based in the model presented in [Daga et al. (1996a)l which has been used in previous chapters. In a first step a general degradation model will be proposed for gates based on the DDM for the inverter presented in previous chapter. Gatelevel parameters will be defined in these general equations. Then, all the input conditions that may lead to degradation effect will be identified and a set of values for each such condition will be defined.
5.2.1 Gate-level delay equations
As a starting point, the same basic degradation equation for the inverter in Eq. (5.1) is proposed as the general behaviour of multi-input gates. Remember the meaning of the main components of this equation: the normal propagation delay (tPo) which is the delay value when no degradation takes place, the main degradation parameters (z and T o ) which model the degradation effect and the variable T which measures the time elapsed since the last transition at the gate’s output and determines the amount of degradation in the current transition, so that the degradation effect becomes negligible when T - T o> 42.
5.2.1.1 Normal propagation delay
Regarding the normal propagation delay, a gate-level model is simply presented based on the sample model shown in Sec.4.3 [Daga et al. ( 1 996a)l. Gate-level parameters are obtained by collapsing into a single parameter those expressions which depend on a lower level design parameter, which results in:
132
L o g i c - k i n g Simulation and the Degradation Delay Model
(5.2)
=out,
{
= 2tPXS,
-
vT~
(5.3)
where tpxOis the normal propagation delay and zoUt,is the output transition time, needed for delay calculations in the successive stages of the circuit. The pair (x , y ) will be ( f , N ) or ( r , P ) for the case of a falling or rising output, respectively. The gate-level parameters are V , , CoUT,C , , K , , K 2 and K , . These parameters will be given particular values for each input condition causing normal propagation, which are falling and rising transitions in each input of the gate.
5.2.1.2 Degradationparameters For degradation parameters z and T o , the same equations obtained for the CMOS inverter in Sec. 4.5 are proposed as valid and are reproduced below for reference. These equations will be adapted soon to the gatelevel: z,VDD = a, + b,- CL , WY
(5.4)
(5.5) where V D D is the supply voltage, C, is the output load, zi,, the input transition time and W , and V , the channel width and threshold voltage respectively of the shot-circuiting transistor for a given transition. The
Chapter 5. Gate-Level DDM
133
subscripts ( x , y, z ) become (f,N , P ) for falling output transitions and (Y,P, N ) for rising ones. Parameters a , b and c are technological parameters that were obtained by fitting electrical simulation results, and collect all the technological information needed to model any inverter gate in the given technology. In the case of multi-input NAND and NOR gates, each input event will behave like an input event to the input of an equivalent inverter, provided that the rest of the inputs have the appropriate values. This value will be referred to as the logic sensitizing value, since it is the value which makes the input under analysis sensitive. This value is 0 for NOR gates and 1 for NAND gates and will be noted as S when not distinguishing among NAND and NOR gates, its complement being 3 . Based on the inverter model in Eq. (5.4) and Eq. (5.5), and taking into account that the interest is on a gate-level model, not explicitly depending on internal design parameters of the cell, the following model for the degradation parameters of a logic gate is proposed: 7,VDD
= A,
-k
BXC,
9
(5.6)
(5.7) where compared with Eqs. (5.4) and (5.5), A , is equivalent to parameter a , , B, substitutes quotient b,/ W , , and C , substitutes expression ( 1 + c,) V , , which represents the effective switching threshold of the equivalent inverter. Subscripts x and y follow the above mentioned convention to distinguish between rising and falling output transitions. Parameters A , B and C are defined as gate-level degradation parameters, since they contain degradation information as seen at the gate-level. There are many input scenarios which will cause degradation (multiple inputs, rising or falling transitions, etc.); for each one, a set of gate-level degradation parameters values will be defined. This point will be treated in the next section.
134
Logic-lhing Simulation and the Degradation Delay Model
5.2.2 Gate-level degradationparameter multiplicity in multi-input gates
In the previous section it was seen that the particular behaviour of each gate’s input can be considered by defining a particular value of the model parameters for each input. In the case of degradation parameters, the solution is not so simple because the delay degradation of an input transition in a gate’s input depends on the existence of a previous input transition, relatively close in time, in the same or in a different input node. Thus, a set of degradation parameters values may be defined for each possible combination of input transitions which can produce delay degradation. In general, these nearly simultaneous input transitions in different inputs of the gate are called collisions, and those that may produce degradation have been previously referred to as glitch collisions, since they usually make the gate produce very narrow pulses (glitches) at its output [Melchor et al. (1 992)]. Although input collisions may involve more than two inputs changing closely in time, only the case of collisions involving two inputs will be analysed. The reason is that collisions involving more that two inputs are very unlikely and their analysis is not worth the additional complexity introduced. Also, multiple successive transitions are in fact treated as two-input collisions of one transition with the preceding one. There are two types of input collisions which may produce degradation in NOR and NAND gates. These types are the following: Type 1. Initially, all inputs are of the same value, with value S as the sensitizing value. The output then is in the opposite state 3 . Under these conditions, an output transition will be triggered if there is a transition in any input. For degradation to appear, the output must change again, which is only possible if the same input that changed from the sensitizing value goes back to it. Thus, Type 1 collisions correspond to low input pulses (14-1) in NAND gates and high input pulses (0-14) in NOR gates. Under these conditions and for an ninput gate, there are n possible Type 1 input collisions, which corresponds to the occurrence of two successive input transitions in the input of the gate. Such an input collision taking place at input i will be referred to as collision-i.
Chapter 5. Gate-Level DDM
135
Table 5.1 Characteristics of input collisions producing degradation for NOR and NAND gates.j and i respectively refer to the first and second changing inputs.
Collision type collision-i collision-ij
Input evolution NOR NAND i: 0-1-0 rest: 0
i: 1-0-1 rest: 1
j : 1-0
j : 0-1 i: 1-0 rest: 1
i: 0-1
rest: 0
Final output transition NOR
NAND
rising
falling
(4
v)
falling
rising
v)
(r)
Type 2. In the other type of degradation collisions, all the inputs of the gate except one are in the sensitizing value. The output is in the sensitizing value as well. The output can only switch if the input which is not in the sensitizing value switches to it. From that moment, the output may switch again and degradation can take place if any of the inputs change again. Thus, Type 2 collisions may involve two or one input depending on whether the second transition take place in a different or in the same input as the first. In the second case, the collision takes the form of an input pulse of the opposite sense of that in Type 1 collisions. Therefore, an n-input gate will show n x n = n2 Type 2 collisions which may produce degradation, corresponding to thej-th input changing to the sensitizing state, followed by the i-th input changing from the sensitizing state, where i may be equal toj. Such a degradation collision will be referred to as collision-ij. It should be noted that the first index here refers to the input changing last. Type 1 collisions end with all inputs at the sensitizing value (0 for NOR gates and 1 for NAND gates) while Type 2 collisions end with all inputs except one at the sensitizing value and the remaining inputs at the opposite value. In NOR gates, Type 1 collisions generate rising output transitions and Type 2 collisions generate falling output transitions. The opposite happens to NAND gates. The main characteristics of the two collision types for NOR and NAND gates are summarized in Table 5.1.
136
Logic- T h i n g Simulation and the Degradation Delay Model
5.2.3 Exhaustive gate-level degradation model From what was stated in the previous section, the number of input collisions producing degradation ( n c o l )in an n-input gate is: nco, = n + n n = n ( n + 1 ) . (5.8) Considering that for each case, Eq. (5.1), (5.6) and (5.7) can be applied, it is possible to obtain particular values for the gate-level degradation A , B and C for each case as well. n values for type 1 collisions and n2 values for Type 2 collisions would be obtained. A convenient way to represent the multiple values of each degradation parameter is by means of an ndimension vector for Type 1 collisions and an n -by-n square matrix for Type 2 collisions. These will be called degradation parameters matrices. It is also adequate to define a general notation for these matrices to simplify later derivations that are common to NOR and NAND gates. This notation is as follows: i s = [As, As, ... As.],
. .I.
(5.9)
As11 . * . % I n
& = ...
...
(5.10)
In these expressions, A represents any of the degradation parameters ‘I:, T o ,A , B or C . Subscript S refers to parameters obtained for Type 1 collisions, where the last switching input takes sensitizing value S . In a similar way, subscript 3 refers to Type 2 collisions where the last changing input takes value 3 . When speaking of a particular type of gate, these subscripts may be substituted by more intuitive ones such as r and f meaning a final rising or falling output transition, respectively. The meaning of vector and matrix elements is as follows:
Asi (vector element): value of degradation parameter A for input under collision-i (Type 1 collision at the i-th input of the gate). Asij (matrix element): value of degradation parameter A for input under collision-ij (Type 2 collision where the i-th input changes after j-th input).
Chapter 5. Gate-Level DDM
137
Table 5.2 Sample vector/matrix form of gate-level degradation parameters for two-input NOR and NAND gates and the inverter.
Type of gate
INV
Parameter A
Parameter B
Parameter C
A, = A,
gr = B,
er = c,
= Bf
z.f = Cf
2,-
= Af
As an example, Table 5.2 includes the vector and matrix forms of gate-level degradation parameters for two-input NOR and NAND gates and the inverter. Finally, Eq. (5.6) and Eq. (5.7) can be written in a general vector and matrix form as follows:
z, V D D = 2,-I-B,C,,
(5.1 1) (5.12)
where s holds the type of collision (S for Type 1 and 3 for Type 2) and f i n is an all-I n-dimension vector or square matrix for Type I or Type 2 collisions, respectively.
138
Logic-Eming Simulation and the Degrudation Delay Model
5.3 Degradation Parameter Characterization Process In the previous section a complete delay model was proposed for multiinput NOR and NAND gates including the degradation effect. The model takes into account the following external variables: supply voltage, output load, input transition time and the time since the last output change. The set of parameters for an exhaustive characterization of a gate considering all the input collisions has also been analysed. The purpose of this section is to validate the proposed model. In a first step we will verify that the general model in Eq. (5.1) fits the behaviour of multi-input gates, as it did for the inverter. Secondly, a procedure to extract the gate-level degradation parameters of a gate will be set up, obtaining the matrices of degradation parameters 2, and ? corresponding to Eq. (5.1 1) and Eq. (5.12). The complexity of the characterization process that will illustrate the suitability of the approach to practical applications will also be analysed.
5.3.1 General degradation model validation
For each glitch input collision to a multi-input gate, it is possible to obtain a delay degradation curve as we did for the CMOS inverter in Sec. 3.2.2 (Fig. 3.5). The procedure consists of providing two consecutive input transitions and measuring, by electrical simulation, the propagation delay due to the second transition (t,), as well as the time elapsed since the first output transition ( T ) . This method is depicted in Fig. 5.1. By varying the gap between input transitions (T,) a set of t, and T pairs can be obtained and a degradation curve can be drawn. In Sec. 3.2.2 it was shown that these curves fit almost perfectly the basic DDM equation for the CMOS inverter. The same occurs in all the multi-input gates analysed and for all the possible glitch collisions. Fig. 5.2 shows an example for a two-input NAND gate. The value of the correlation coefficient indicates that the fitting to Eq. (5.1) is extraordinarily good. Once the degradation curve has been obtained, degradation parameters z and T o are extracted by applying linear regression to the simula-
139
Chapter 5. Gate-Level DDM
ini
I
.
I 1-
out
b I
Fig. 5.1 Delay degradation measuring in a gate where an input transition at thej-th input is followed by another input transition at the i-th input.
O.5OtPo = 82.81 0.25 ps To = - 11.76 0.40 PS coef. cox. = 0.999916
300
Fig. 5.2 Sample degradation curve for collision-21 in a two-input NAND gate, and values of parameters z and T o obtained by curve fitting. C, = 4CIN = 2 6 F , tpO = 3 1 0 . 3 ~ s .
tion data. The range of interest to apply the linear regression has been established in those points showing a value of the delay between the 50% and 95% of the normal propagation delay. To make the fitting, an average
140
Logic-Timing Simulation and the Degradation Delay Model
20 points homogeneously distributed in the range of interest are considered. The values of ‘I; and T o thus obtained are only valid for a given input collision and for particular external conditions: supply voltage, output load and input transition time. In the next section we will establish a procedure to obtain the gate-level degradation parameters (matrices 2 , B and ? ) through the characterization of multiple degradation curves.
5.3.2 Gate-level degradation parameters extraction To obtain the gate-level degradation parameters, for each input collision causing degradation, it is necessary to repeat the procedure to obtain ‘I; and T o many times for different values of the external variables: supply voltage ( V D D ) , output load (C,) and input transition time (q,,). As in chapter 4 for the technological degradation parameters a , b and c of the CMOS inverter, the variation of the gate-level degradation parameters with the supply voltage is almost negligible, that is, the gate-level degradation parameters are almost independent of the supply voltage. Therefore, during the characterization process of A , B and C a single typical value of V D D in the range of interest is considered. Another approach would be to use the two extreme values of V D D in the range of interest and to average the obtained values for the parameters. In any case, the characterization process with respect to V D D may be greatly simplified and the real complexity of the process lies in exploring the dependence on the output load and the input transition time. Thus, the characterization process is divided into two phases: (1) Variation with the output load based on Eq. (5.6) ( A and B calculation). (2) Variation with the input transition time based on Eq. (5.7) ( C calculation).
In the following sections, both phases are described in detail.
141
Chapter 5. Gate-Level DDM
t "2
c. corr. = 0.999996
6
4
8
cL/clN
Fig. 5.3 Sample parameters A and B extraction. The dependence of T with C, is always highly linear, as seen by the correlation coeficient. Example data: NAND2 gate, collision-11, C , = 6.52 fF .
5.3.2.1 Variation with the output load This phase of the characterization process is based on Eq. (5.6). The necessary data to fit A and B is obtained by varying the value of output load C , and extracting the value of T for every degradation curve as described above. For a given V D D A, and B are easily obtained from T and C, using linear regression. In Fig. 5.3 an example of this is given. C , values range from CL/CI, = 2 to CL/CIN = 10, where C , is the equivalent input capacitance of the gate. In all cases, a very high linear dependence is observed and only 4 to 10 points are enough to obtain very accurate values for A and B . Since parameters A and B do not depend on the input transition time, all the simulations in this phase are performed for a fixed typical value of this variable, equal to 2t,, , where t,, is the delay of the
142
Logic-Timing Simulation and the Degradation Delay Model
gate under the current conditions, when triggered by a step input. This typical value corresponds to moderate speed input ramps.
5.3.2.2 Variation with the input transition time
This phase is based on Eq. (5.7) and in the generation of different degradation curves by varying the value of the input transition time zin. From each degradation curve, a value of T o is extracted. A fixed typical value of the output load is used, for example C L = 4 C I N ,which represents a moderately loaded gate. From the set of zin and T o data, parameter C is easily obtained from slope m when plotting T o vs. T ~ Using ~ . Eq. (5.7) yields:
c
=
vDD('-m).
(5.13)
An example of this fitting is shown in Fig. 5.4. As with the CMOS inverter in Fig. 3.5, the fitting curve is accurate except for very small values of zin. The values used for zi, range from zi, = 0.1 t,, to zi, = lot,, ,thus covering a wide range of input transition times, from very slow to very fast.
5.3.3 Characterizationprocess complexiq The characterization process described in the previous sections needs to be applied to every input collisions causing degradation in order to perform an exhaustive gate-level analysis and parameter extraction of the degradation parameters. It is easy to imagine then how complex the characterization process of a multi-input gate may be. The overall complexity of the process may be measured in terms of the number of transient analysis needed to complete the characterization of a gate, since this is the basic simulation operation. Each transient analysis corresponds to the obtention of waves like those in Fig. 5.1. This transient analysis is carried out by using an accurate electrical simulator
Chapter 5. Gate-Level DDM
500
I
I
143
1
I
Fig. 5.4 Sample parameter C extraction. The dependence of T o with T~~ is always very linear, especially for T~~ 1 2tps. Example data: . NAND2 gate, collision-22, tps = 161 ps , C, = 4C,
such as SPICE or HSPICE. The following expression measures the total number of transient analysis (ntran) to fully characterize the degradation in a logic gate. (5.14) ntran = ( n A E + n C ) n c u r v e n v d d n c o l 3
where nAE is the number of values of C, during the obtention of A and B , nc is the number of values of T, for the obtention of C , ncurveis the number of points in each degradation curve, n v d d is the number of V D D values for which the characterization process is performed and n,,, is the number of possible input collisions producing degradation. In Eq. (5.8) it was seen that nCo1is equal to n ( n + 1 ) for an exhaustive characterization, where n is the number of input of the gate. Based on our own experience, good results are obtained for nAB = nc = 10 and ncurve= 20. nvdd will be 1 if using a single typical value or 2 when characterizing for both limits of a range. The number of necessary transient analysis for up to five inputs gates is shown in
144
Logic-lhing Simulation and the Degradation Delay Model
Table 5.3 Number of transient analysis needed to characterize a gate for the degradation effect, considering nAB = nC = 10, ncurve = 2 0 .
n
n(fi+l)
1
2
800
1600
2
6
2400
4800
3
12
4800
9600
4
20
8000
16000
5
30
12000
24000
%ran
(fi,dd=l)
fitran
(nvddc2)
Table 5.3, where the mentioned typical values are being used. As expected, the number of transient analysis for characterizing moderately complex gates is very high. Even worse is that this complexity increases quadratically with the number of inputs of the gate. The importance of measuring the number of transient analyses lies in the fact that the time necessary to carry out the characterization process (t,,,) will be proportional to the number of transient analyses: tcar ntran * (5.15) OC
This characterization time will determine the practical possibilities of implementing the characterization process and the usefulness of the model. In the following, the aspects affecting the characterization time will be analysed in closer detail. The total characterization time may be split into an operator time (top) and a simulation time ( tsim). The operator time includes all the tasks to be done by the person or system which controls the electrical simulator. These tasks are: Creation and editing of electrical simulator input files, Simulation launching (electrical simulator execution), Localization and storage of simulation results, Interpretation of results and decision-making, Data analysis: regression, curve fitting, parameter extraction, etc.
Chapter 5. Gate-Level DDM
145
The simulation time is the CPU time used by the electrical simulator in performing the total number of transient analysis. It is useful to define operator and simulation time per transient analysis to be able to calculate some time estimations. Characterization time may thus be written as: + tsim =
(5.16) where tfop is the average operator time per transient analysis and tfsimis the average simulation time per transient analysis. Using Eqs. (5.8), (5.14) and (5.16), it is easy to derive an expression of the characterization time as a function of the number of inputs of the gate and the rest of the parameters of the characterization process just defined: (5.17) = ( t f o p + t f s i r n ) ( n A B 4- r z C ) n c u r v e n v d d n ( n tcar
=
top
(tfop
+ tfsimlntran 9
As an example, we can make an estimation of the time used by a human operator to characterize a gate. Given the power of current computers, the simulation time per transient analysis will always be around one second or even much less, while the average operator time per transient analysis will be much greater even for a well-trained operator, making the simulation time almost negligible in this case, However, the operator often only has to alter the value of a single simulation parameter between transient analysis and we will also suppose that the operator is an expert typist and knows the characterization process very well. Thus, we can figure the average operator time per transient analysis in about nine seconds without being too optimistic, making an average total time per transient analysis of about ten seconds. With this information and the typical values for other characterization process parameters mentioned before, we can use Eq. (5.17) to obtain characterization time estimations for gates of various numbers of inputs. Results are shown in Table 5.4. The main conclusion of these simple and optimistic estimations is that the characterization times that may be expected when the characterization process is driven by a human operator are excessively large. From a practical point of view, the characterization of a whole library by these means is not possible because of the cost in time and human resources. Eq. (5.6) shows that there are two ways to reduce the characterization time for given technical resources: the reduction of the average operator time ( tf o p ) and the reduction of the number of transient analysis needed to
146
Logic-riming Simulation and the Degradation Delay Model
Table 5.4 Estimated times for the characterization of multiple input gates with respect to the degradation effect. Characterization process parameters nAB = nc = 10, ncurve - 2 0 , t f s i m = I s , t f o p = 9 s .
1
2h 13min
4h 26min
2
6h 40min
13h 20min
3
13h 20min
26h 40min
4
22h 13min
44h 26min
5
33h 20min
66h 40min
simulate ( n t r a n ) The . best option to reduce the operator time is to automate the characterization process by means of a computer program that is able to run the full characterization process without human intervention. Here we face a general problem with today’s delay models. Due to their complexity, it is necessary to develop an automatic characterization process or a detailed description of this process in order to be able to calculate the model parameters for a practical application. In fact, we think that the characterization algorithm for the parameters of a model must always accompany the model itself, but unfortunately, we often find delay model developments that pay minor attention to this point making it difficult to evaluate the practical usefulness and to reproduce these developments. In our case, we have paid great attention to the characterization problem and we have implemented an automatic characterization program called autoddm [Juan et al. (2001)l for the proposed model. This way, the operator time is almost eliminated and the characterization times are reduced at least in an order of magnitude and without human intervention. This makes it possible to characterize full cell libraries and the practical application of the DDM. Another important feature provided by an automatic characterization program is the possibility to obtain an important volume of results easily. The analysis of these results will allow us to explore how to improve the model and the characterization process itself. This line is developed in Sec. 5.4.
Chapter 5. Gate-Level DDM
147
Table 5.5 Degradation parameters obtained with autoddm for a NAND2 gate.
fall
rise
in
in2
in1
in2
208.6
252.7
90.59
126.2
B (ps x V/fF)
20.15
20.23
9.846
11.44
c (V)
1.330
1.135
1.987
2.541
A
(PS
x V)
Table 5.6 Characterization time factors for the three cases compared.
Type of system
tf(sec/tran)
System 1
2.34
System 2
0.179
Human operator
10
An example of a gate characterized using autoddm is presented in Table 5.5. The value of the parameters obtained by autoddm are at least as accurate as those obtained by a human operator. In fact, autoddm actually achieves better results than a human operator since it makes more elaborated calculations to obtain a more homogeneous distribution of points in each degradation curve. Nevertheless, the main result is related to the time gain of autoddm with respect to a human operator. As an example, we will compare three representative cases: two automatic systems using both versions of autoddm and a human operator. System 1 corresponds to autoddm-cis (HSPICE) running on a Sun Ultra-SPARC 11,400MHz work station with Solaris 7, while system 2 is autoddm-spice (SPICE3f5) running on a PC Pentium I1 266MHz with GNULinux 2.2. The characterization time factors for the three cases are shown in Table 5.6, where the value for the case of the human operator has been estimated as in the previous example. It is worth noting that System 2 is much faster than System 1. We have discovered that the main reason is the delay added at the beginning of each HSPICE simulation due to the licence management tasks which
148
Logic-Timing Simulation and the Degradation Delay Model
Table 5.7 Characterization times for a human operator and two computer-based systems, as a function of the number of inputs (n) and the number of transient analysis (nt,,).
Characterization time (D:H:M) n
ntran
1 (inverter)
Human
System 1
System 2
800
0:2:13
0:0:3 1
0:0:2.4
4 (gate)
3200
0:8:53
0:3:7
0:0:9.5
100 (small lib.)
80000
9:6:13
2:4:0
0:3:59
500 (big lib.)
400000
46:7:7
10:20:0
0:19:53
are run by this tool during the simulator set up. This is an important portion of the total simulation time. Table 5.7 compares the performance of the three examples as a function of the number of inputs to be characterized. The number of transient analysis is calculated using Eq. (5.16) with nAB = nc = 10 and n,,,,, = 20. The characterization time is calculated from Eq. (5.17). Four characterization tasks are studied: an inverter, a gate, a small library of gates and a large library of gates. According to these results, it is easy to conclude that the automation of the characterization process greatly improves the characterization time with respect to manual characterization. Comparing Systems 1 and 2, it is clear that the long HSPICE set up time represents a bottleneck in characterization time, which does not appear when using SPICE3f5. Furthermore, characterization of a whole library is not affordable using traditional methods but is viable using an automatic characterization tool.
5.4 Analysis of Results
In this section, we present a set of characterization results for several CMOS gates in a 0.35 pm technology. All the results have been obtained according to the procedure described in the previous section, using the automatic characterization program autoddm [Juan et al. (200l)]. The analysis of the results obtained will allow us to validate the model and to
Chapter 5. Gate-Level DDM
149
explore the possibilities of simplifying the model and the characterization process itself.
5.4.1 Characterization results
As an example, we have characterized the values of the gate-level degradation parameters corresponding to the exhaustive model of an inverter and NOR and NAND gates from two to four inputs. The data make up a representative group which will allow us to analyse the behaviour of the degradation parameters when we move from one gate’s input to another. The results are shown in Table 5.8 to Table 5.14. The values of the parameters have been ordered in matrix form according to the way indicated in Eq. (5.9) and Eq. (5.10), together with the fitting errors which affect each parameter, ordered in the same way. Likewise, in Fig. 5.5 to Fig. 5.8, the representation of this data is shown for gates with three and four inputs which are those that benefit the most from this representation. In each figure, the column on the left shows, for Type 1 collisions, the variation of each parameter when varying the index of the input on which the transitions take place. The column on the right corresponds to Type 2 collisions. Each curve shows the variation of the corresponding parameter according to the change of the index of the input where the first transition takes place (j). Where those corresponding to different indexes of second transition ( i ) are represented by different curves. Although this form of representation is a bit complex and difficult to understand at first, it greatly facilitates the analysis of the evolution of the degradation parameters at gate level when we change one input for another. The first remarkable result that can be extracted of these results is that the model itself works for all the analysed cases, i.e. that the degradation effect takes place for all the collisions where it is possible that this effect follows the exponential model of Eq. (5.1), and that the mentioned effect is adjusted in all the cases to the equations proposed in Eq. (5.1 1) and Eq. (5.12).
Logic-Timing Simulation and the Degradation Delay Model
150
Table 5.8 Characterization results for the INV gate.
Value Af
..
95.6642
Bf
-
Error
4.90254
f f
0.0621669
1.77021
f
0.237512
Ar
41.2724
2.4394
B,
3.01691
f f
0.0330395
C,
1.61225
-
+
0.143339
..
4.58996
Table 5.9 Characterization results for the NAND-2 gate.
Value
Error
208.623
252.685
f
Bf
20.1537
20.2306
f
0.0414983 0.0400409
cf
1.32955
1.13477
0.0516825 0.0489708
90.5916
89.8718
126.194
122.783
f f f
9.84602
9.86132
11.4375
11.4558
0.00266021 0.0237448
1.98706
1.98931
f f f
0.1908
0.193282
2.54086
2.53197
f
0.0908107
0.0973978
-
Ar ..
Br
-
Cr
1.48188
1.42983
2.17295
2.21266
0.0949944
0.847912
0.060851
0.061963
5.4.2 Simplified model
The most significant result according to the variation of the degradation parameters with respect to the input index is the little variation between them and index j in Type 2 collisions; this may be observed in the curves on the right-hand side of Fig. 5.5 to Fig. 5.8. This can be represented as: Ail = Ail = ... = Ail Vi, (5.18)
Chapter 5. Gate-Level DDM
151
Table 5.10 Characterization results for the NOR-2 gate.
Value
Error
A,
-
64.0181
142.057
f
Br
2.85134
2.43184
k
0.00745815 0.052653
Z.r
1.48774
1.45051
0.0889573 0.0862119
250.258
249.576
f f
272.206
267.789
4.84526
4.75679
5.26297
5.33624
1.91189 2.37859
I
Af
Bf
-
Cf
0.35954
2,53827
4.48156
6.72611
f
1.895
1.53491
-
+
0.0929639
0.139524
0.0393091
0.0318396
1.79618
k f
0.117185
0.127971
2.33789
f
0.109784
0.120789
Table 5.11 Characterization results for the NAND-3 gate.
Error
Value
A f 274.293 312.815 392.024 f
0.994886
Bf
15.66
15.6922 15.307 f
0.0359493 0.0803951 0.21692
Cf
1.3775
1.2401 1.01648 f
0.0625352 0.0356707 0.0496069
2.22491
6.00319
+-
4.75623
4.37637
4.83432
209.21 200.834 205.481 f
0.319648
1.14923
2.54721
246.768 244.442 241.607 k
1.33085
0.559743
1.07332
10.3478 10.3423 10.3423 f
0.171862
0.158136
0.174684
11.0124 11.2297 11.0896 f
0.0115502 0.0415264 0.092041
11.9314 11.8572 11.9236 f
0.048089 0.0202258 0.0387835
1.93524 1.85757 1.82014 f
0.0994368 0.121967
0.134235
2.52195 2.49735 2.4992
f
0.153945 0.166415
0.169257
2.92454 2.90585 2.89348
f 0.0504717 0.0609761 0.0629057
175.958 176.654 176.296 I
A,
-
i,
c,
where A represents, as in previous sections, any of the degradation parameters at gate level: A , B or C . This fact means that the magnitude
152
Logic-TimingSimulation and the Degradation Delay Model
Table 5.12 Characterizationresults for the NOR-3 gate.
Value
Error
A , 90.5908 144.228 317.492 f
i,.2.91873
1.74008
4.1815
15.0259
2.79995 2.55793 f
0.00812151 0.0195164 0.0701305
C, 1.57227 1.46403 1.30738 f
0.0936998 0.0719079 0.0535339
435.462 439.88 442.056 f
2.65176
1.74795
0.536838
_+
9.22769
1.73474
3.10664
523.997 505.569 509.658 f
14.8515
6.40267
5.84825
i f 474.327
-
484.18
487.05
5.33723 5.34891 5.34222 f
Bf 5.5423 5.48288 5.47164
0.0123766 0.00815824 0.00250559
_+
0.0430685 0.00809657 0.0144997
5.65634 5.73299 5.71286 &
0.0693167 0.0298833 0.0272956
1.90635 1.85453 1.82885 k
0.108535
0.107497
0.108478
2.40568 2.37431 2.34866 f
0.145032
0.152322
0.162668
*
cf
2.68495 2.66644 2.6571
f
0.0822999 0.0830649 0.0903395
of the degradation effect does not depend appreciably on the specific input that caused the last output transition. The intensity with which the degradation effect manifests itself in the delay caused by an input transition depends (among other things) on the time elapsed from the previous output transition. More exactly, it depends on how much the state of the gate has evolved since the last output transition (V,,/2 2 cross). Thus, the results described in Eq. (5.18) indicate that the evolution of the output from this point is practically independent of the specific input transition that caused the output transition. The main consequence of this result is that we can substantially reduce the number of necessary parameters to describe a gate, since we for only one value without making can substitute each line of a matrix a significant error: AjU Asi. (5.19)
&
To establish a model keeping in mind this result it is necessary to slightly modify the definition for the degradation parameters at gate level
153
Chapter 5. Gate-Level DDM
Type 2 collisions
Type 1 collisions 500
I
I
400
300 T
200 100
0 16 12
4
3
u2 1
0
2
3 1
2
3
i
Fig. 5.5 Characterization results for the NAND-3 gate.
given in Sec. 5.2.2 and to specify how the characterization process is simplified. Logically, this new model will be denominated simplijed degradation model at gate level. In the next Section, we will describe the new form of the equations for the degradation parameters for this simplified model, as well as its characterization process and the evaluation of the reduction in the complexity that the use of this model supposes.
5.5 Simplified Model Equations For Type 1 collisions there are no changes with respect to the exhaustive model and we must define a value of each degradation parameter for each corresponding to each input. Therefore, the n values of a parameter input are represented in a vector:
154
Logic- Timing Simulation and the Degradation Delay Model
Type 2 collisions
Type 1 collisions
600
-
400
200 0 8 6 0 4
2
0 4
3
u2 1
0
2
31
2
3
i
Fig. 5.6 Characterization results for the NOR-3 gate.
i s = [As, As2
... Asn] .
(5.20)
For Type 2 collisions, it is only necessary now to specifl one value for each input (A3!). This value is applied to all Type 2 collisions whose second input transition occurs in the i th input, independently of the input in which the previous transition occurred. For each parameter, the y1 corresponding values are grouped in a vector:
A-s
[
- As, As2
-
... AS.] .
(5.21)
When obtaining degradation parameters T and T o to calculate the delay, we can still use Eqs. (5.1 1) and (5.12), but now fin will be a vector in all the cases. To fully model a gate with respect to the degradation effect, we need 2n values for each degradation parameter at gate-level: A , B , and C. This supposes an important simplification of the total number of parame-
155
Chapter 5. Gate-Level DDM
Type 2 collisions
Type 1 collisions
20 0 15
3 ci2 1 0
2
3 i
4 1
2
3
4
j
Fig. 5.7 Characterization results for the NAND-4 gate.
ters necessary to specify for a gate, going from 3 n ( n + 1) in the exhaustive model to 6 n in the simplified model. For example, in a four input gate it means going from 60 to 24 parameters.
5.6 Simplified Model Characterization Process
The characterization process can be simplified in several ways in what concerns the simulation of Type 2 collisions. The simplification depends on the method chosen to obtain each parameter Asi from the n specific parameters Asij having j = 1, ..., n . We analyse several alternatives: Alternative 1: We obtain all the parameters Asij and calculate the average, which will be used as value Asi :
156
Logic-7Iming Simulation and the Degradation Delay Model
Type 1 collisions
1000,.
-
I
.
,
.
, .
Type 2 collisions I
.
,
.
,
200 10 8
6 '9
4
2 B
3
u2 1
0
3
2 l
3
2
4
I
Fig. 5.8 Characterizationresults for the NOR4 gate.
(5.22)
This alternative is the best approach because all the parameters substituted by the unique value are considered, but the characterization process is not simplified since it is necessary to continue calculating all the parameters and to simulate all the possible collisions with degradation. Alternative 2: We calculate the average using the values corresponding to the first and last inputs:
(5.23) The value obtained with this equation is also an intermediate value, since the parameters usually have a slightly growing tendency with
Chapter 5. Gate-Level DDM
157
Table 5.13 Characterization results for the NAND-4 gate. Value
Error
~
AJ-
341.335
363.03
432.19
533.097
f
0.0842815
5.12662
5.45369
8.7034
Bf
15.2991
15.4685
15.3365
14.7835
k
0.0017165
0.104411
0.111072
0.177258
1.49791
1.39779
1.27071
1.04927
f
0.0789028
0.0630349 0.0428602
0.039932
364.451
356.81
359.536
357.584
k
0.968629
0.538224
0.842334
1.23432
374.961
364.568
365.183
365.746
*
0.99551
4.8425
5.61232
5.9178
395.57
391.429
390.884
388.101
f
4.66836
2.41918
3.52567
0.645383
436.244
432.208
421.57
416.158
k
3.5395
2.76835
4.82
5.94019
14.7053
14.5088
14.4525
14.5096
k
0.0197276 0.0109617
0.0171554
0.0251387
15,2026
15.4239
15.4003
15.4015
k
0.020275
0.0986246
0.114303
0.120525
15.6956
15.7685
15.7861
15.833
f
0.0950781
0.0492702
0.0718054
0.0131442
16.3134
16.2464
16.3738
16.4578
k
0.072087
0.0563815
0.0981663
0.120981
1.97685
1.89809
1.8573
1.84559
f
0.181308
0.197349
0.209728
0.213072
2.49992
2.43175
2.40956
2.39455
k
0,0902938
0.113538
0.12124
0.123994
2.90296
2.90767
2.752
2.7491 1
k
0.151966
0.149143
0.0762476
0.0769128
3.2206
3.20356
3.1773
3.15793
f
0.0786307
0.0903683
0.103051
0.103476
cf
A,
Br
Cr
the input index. The characterization process is simplified with respect to the exhaustive characterization for gates of three or more inputs, needing to simulate 3n different collisions for each gate. Alternative 3: As already mentioned, the difference of Asij parameters for variations of j is very small. The simplest method, which practically conserves the same precision as the previous ones, consists then of approximating the group of parameters by any one of them: Asij = A s i k . (5.24) Any chosen value for k will lead to very similar results, but since we observe a slight tendency to monotony in the value of the degradation parameters, especially in parameter C, (Fig. 5.5 to Fig. 5.8), we have decided to take an intermediate value in the following way:
158
Logic-Eming Simulation and the Degradation Delay Model
Table 5.14 Characterization results for the NOR-4 gate. Value
Error
A,
112.819
145.08
275.101
568.706
f
0.29953
ir
2.71788
2.62542
2.41312
1.83907
f
0.001398
er
1.56364
1.47036
1.39764
1.29989
k
0.0907703 0.0672008
788.806
804.331
780.062
786.426
f
9.00339
824.225
824.258
823.485
824.397
f
860.778
847.25
852.561
850.086
875.267
876.37
881.897
7.32507
7.21159
7.43454
4.58216
0.0213864 0.0889865
-
I
Bf
z;-
37.6025 0,175503
0.0664211
0.0856349
8.62357
5.08827
4.48155
7.9038
13.0922
8.59059
11.3321
f
8.92408
7.58018
8.32645
12.9604
878.463
f
9.29546
9.45489
6.93043
0.98416
7.30652
7.29638
f
0.0420216
0.0402489
0.0237485
0.0209168
7.45502
7.44032
7.42662
k
0.0368895
0.0611053
0.040095
0.0528907
7.49901
7.5641
7.52869
7.54409
f
0.0416515 0.0353791
0.0388622
0.0604905
7.60508
7.60983
7.58054
7.61039
f
0.0433848
0.044129
0.0323465
0.0045934
1.80267
1.76748
1.69145
1.67959
f
0.0822654
0.067057
0.0654785
0.0644991
2.14557
2.09964
2.05788
2.02964
f
0.13408
0.0885353
0.0879834
0.0906515
2.42609
2.37594
2.3378
2.31878
f
0.115887
0,122862
0.127975
0,130361
2.74211
2.70625
2.67864
2.68137
k
0.14288
0.154096
0.16642
0.170049
Af
19.0659
k = int(?), n+l
(5.25)
where “int” is the integer function. This is the method that most greatly reduces the number of collisions to be analysed, with a total number of 2 n for the complete characterization of the gate. For this reason and because it practically conserves the same precision as any of the other alternatives, it is the method we adopted to characterize the simplified model. In Tables 5.15 to 5.20, as an example, we show the vectors of parameters for the simplified model corresponding to the gates of Tables 5.9 to 5.14. The reduction in the amount of collision cases that need be simulated for the simplified model using the third alternative has a direct influence
159
Chapter 5. Gate-LevelDDM
Table 5.15 Simplified model parameters for the NAND-2 gate. ~
~~
Value
Af
Error
20.2306
f f
0.0414983 0.0400409
1.32955
1.13477
f
0.0516825 0.0489708
90.5916
126.194
f
2.93246
4.258912
9.84602
11.4375
f
0.077263
0.0420448
1.98706
2.54086
f
0.195532
0.1062878
Bf
208.623
252.685
20.1537
Cf
Ar B,
Cr
1.48188
1.42983
Table 5.16 Simplified model parameters for the NOR-2 gate.
Value
Ar
Error
Br
208.623
252.685
f
20.1537
20.2306
f
0.0414983 0.0400409
Cr
1.32955
1.13477
0.0516825 0.0489708
90.5916
126.194
f f
9.84602
11.4375
1.98706
2.54086
Af Bf -
Cf
1.48188
1.42983
2.93246
4.258912
+
0.077263
0.0420448
f
0.195532
0.1062878
Table 5.17 Simplified model parameters for the NAND-3 gate.
Error
Value
Cf
Ar Br
Cr
208.623
252.685
20.1537
20.2306
1.32955
1.13477
90.5916
126.194
9.84602
1I .4375
1.98706
2.54086
f f
1.48188
1.42983
0.0414983 0.0400409
f f
0.0516825 0.0489708 2.93246
4.258912
f f
0.077263
0.0420448
0.195532
0.1062878
on the characterization time of a gate, since it reduces the amount of transient analysis to be simulated. Keeping in mind Eqs. (5.16) and (5.17), the
160
Logic-liming Simulation and the Degradation Delay Model
Table 5.18 Simplified model parameters for the NOR-3 gate.
Error
Value
Ar
208.623
252.685
Br
20.1537
20.2306
1.32955
1.13477
90.5916
126.194
B/
9.84602
z./
11.4375
1.98706
2.54086
Cr -
A/ *
+
-
*
f f
1.48188
1.42983
0.0414983 0.0400409 0.0516825
0.0489708
*
2.93246
4.258912
0.077263
0.0420448
f
0.195532
0.1062878
Table 5.19 Simplified model parameters for the NAND-4 gate.
Error
Value
A/
B/ c/ Ar
Br Cr
f f f
208.623
252.685
20.1537
20.2306
1.32955
1.13477
90.5916
126.194
*
9.84602
11.4375
1.98706
2.54086
1.48188
1.42983
0.0414983 0.0400409 0.0516825
0.0489708
2.93246
4.258912
k
0.077263
0.0420448
f
0.195532
0.1062878
Table 5.20 Simplified model parameters for the NOR-4 gate.
Error
Value
1.48188
1.42983
20.2306
f f
0.0414983
0.0400409
1.32955
1.13477
f
0.0516825 0.0489708
90.5916
126.194
f
2.93246
4.258912
9.84602
11.4375
f
0.077263
0.0420448
1.98706
2.54086
f
0.195532
0.1062878
Ar
208.623
252.685
B,
20.1537
Cr
-
A/
relationship between the characterization times of the simplified model and the exhaustive one is thus obtained:
Chapter 5. Gate-LevelDDM
161
tchar(SimP) - ntrun(sim~)- ncodsim~)- 2n -- - 2 . (5.26) tchur(exh> ntran(exh) ncoAexh) n(n + 11 n + 1 In Table 5.21 we show the value of this relationship for gates of up to five inputs. Apart from the important reduction in the characterization time, the most important conclusion is that in the simplified model the complexity of the characterization process presents a linear dependency on the number of inputs of the gate, and not the quadratic dependency of the exhaustive model. Table 5.21 Relationship between the characterization times of the simplified model and the exhaustive one.
1
2
2
100
2
6
4
0.67
3
12
6
0.50
4
20
8
0.40
5
30
10
0.33
5.6.1 Basic model
Due to the results observed in Figs. 5.5 to 5.8 it is possible to think about other simplification methods in order to reduce the number of parameters necessary to characterize a gate and, at the same time, to simplify the characterization process and to reduce even more the time required. Taking as example the curves corresponding to the NAND-4 gate of previous sections (this example follows the general characteristics observed in all the analysed gates) we present several ideas to obtain simpler models. In all the cases we refer to the variation of the parameters with the index i : Type 1 collisions, parameter A : this case shows'a not very lineal variation with the value of i f For this reason, linear adjustment would not
162
Logic-liming Simulation and the Degradation Delay Model
express in an appropriate way the dependence that is observed. More complex curves would be necessary. Type 1 collisions, parameter B : this parameter is approximately constant or suffers small and approximately linear variations. Type 1 collisions, parameter C: this parameter presents small and approximately linear variations. Type 2 collisions, parameter A : this parameter presents small but not linear variations. Type 2 collisions, parameter B : this parameter presents approximately linear small variations. Type 2 collisions, parameter C : this parameter presents accused variations and not too linear. In general, modelling these variations is not feasible in those cases in which two or three fitting parameters are needed along with a similar number of points to fit, which occurs in the case of gates with only a few inputs, since the number of points in each case is similar to the number of inputs of the gate. Also, these fitting processes are an additional source of error when calculating the delay. Thus, the method we propose is to continue using the simplified model explained in the previous section, without looking for new dependencies which will only simplify the model at a high cost in accuracy, Nevertheless, and especially due to the small variations with i that some parameters present (parameter B ,parameter A in type 2 collisions, and parameter C in type 1 collisions), we consider it interesting to explore a model simplified to the maximum allowing us to obtain an upper bound of the error which can be found using other less drastic simplified approaches. We will refer to this model as the basic degradation model at gate-level, and it consists of reducing each of the gate-level degradation parameters to only one value, without distinguishing among different inputs, but only among types of transitions (type 1 or type 2) corresponding to raising or falling outputs, depending on the case. The parameter characterization process of this model will also be simplified to the maximum. Obviously, we must expect important accuracy losses when using this model. The precision of the model will be evaluated in the subsequent sections.
Chapter 5. Gate-Level DDM
163
In the next section, we will formalize the equations which make up this model and its characterization process.
5.6.1.1 Basic model equations
According to the above-stated idea the matrices of degradation parameters at gate-level are reduced to a single value. If A is any of the parameters, these matrices can be expressed as: As = As
-
As = As.
(5.27)
Thus, the complete set of degradation parameters for a gate is reduced to six values, regardless of the number of gate inputs. These values are: (5.28) A s , B s , Cs, A s , B s , Cs.
5.6.1.2 Basic model characterization process For the characterization process, the simplest procedure consists of assigning the value obtained from the characterization of a certain collision to each parameter of Eq. (5.28), chosen according to this formula: ‘ S
=
A-S = A-Skl .
(5.29)
Keeping in mind the monotonous variation of the parameters within the index of the input, it is convenient to take intermediate values for k and I , for example: k = int(:]
+1
-i-).
I = int( n + l
(5.30)
Thus, k and 1 are also not coincident whenever the number of inputs of the gate allows for it. As an example, in Table 5.22, the vectors of the parameters are shown for the basic model corresponding to the gates of Tables 5.9 to 5.14.
164
Logic-Eming Simulation and the Degradation Delay Model
Table 5.22 Parameters for the basic model of the degradation effect at gate level.
NAND-2
Value
Error
Value
Error
A,
252.685 f
45.54388 A ,
126.194 f
38.53486
Bf Cf
20.2306 f
.1183983 B ,
11.4375
f
1.668743
1.13477 f
.2464625 C, 2.54086 f
,749332
NOR-2
Value
Error
Value
Error
A/
272.206 f
29.35611 A,. 142.057 k
78.39844
By Cf
5.26297
f 2.37859 f
.645704
B, 2.43184 f
.42695815
.710381
C, 1.45051 f
.1261873
Error
Value
Error
NAND-3 Value
Af
312.815 f
Bf C,
15.6922 f 1.2401
f
85.21219 A ,
200.834 f
47.51632
B,
11.2297 f
1.064762
.2732269 C,
2.49735 k
.8168868
.60212
NOR-3
Value
A, B,
Cf
Error
Value
f 54.6685 A,. 144.228 k 5.48288 f .3960767 B, 2.79995 f 2.37431 k .680135 C, 1.46403 f 484.18
Error 188.2899 .3121505 .2101839
NAND-4
Value
Error
Value
Error
Bf
k 109.6104 A , 391.429 f 62.76919 15.3365 f .730258 B, 15.7685 f 1.4759276
C,
1.27071 k
A,
432.19
.3061028 C, 2.90767 f
1.275152
For the model characterization, the process is simplified drastically, since the number of collisions (nco,)is now only two, regardless of the
Chapter 5. Gate-Level DDM
165
Table 5.23 Relationship between the characterization times of the simplified model and the exhaustive one (n,,,(bas) = 2 ).
n
nc,,(exh) nc,,(simP) n ( n + 1) 2n
tchar(bas) tchar(bas) tch ar(exh) t c , a Asimp)
1
2
2
1.00
1.oo
2
6
4
0.33
0.50
3
12
6
0.17
0.33
4
20
8
0.10
0.25
5
30
10
0.07
0.20
amount of gate inputs. Thus, performing an analysis similar to the one shown in Eq. (5.26), we can see how the basic model characterization time is related to those times for simplified and exhaustive models:
(5.31) The value of these relationships for gates of up to five inputs is shown in Table 5.23. For example, the characterization time for four input gates decreases in an order of magnitude with respect to the exhaustive characterization and to a quarter with respect to the time needed to characterize the simplified model.
5.6.2 Error estimationfor the propagation delay
The values of the parameters obtained for all the models are subject to errors which have their origin, in the first place, in the fitting process employed on the electric simulation data. In the case of the simplified and basic models, we also find the error generated by approximating the set of values corresponding to various inputs by only one value. In fact, in these models, the error due to the adjustment of each particular value becomes negligible compared to the error introduced by the simplification. Ultimately, our interest resides in being able to evaluate what impact these
166
Logic-&zingSimulation and the Degradation Delay Model
errors have in the final value of the calculated delay, especially the errors introduced in the simplified and basic models. In this section we will present the expressions which allow us to propagate the error of the degradation parameters to the propagation delay. For the sake of clarity, the details in the obtention of these expressions are shown at the end of the chapter in an appendix. Several general characteristics of the error propagation process are deduced from the expressions obtained. Later, as an example, we will apply the expressions obtained to the evaluation of the influence which the simplifications performed in previous sections produce in the error of a NAND-4 gate delay.
5.6.2.1 Expressionsfor error propagation In the first place we will define some concepts: We define the relative error of a magnitude x as: (5.32) where x is the value of the magnitude and Ax is the uncertainty or absolute error of this value. The relative error is always a positive quantity. We define the relative error of a magnitude x with respect to another magnitude y as: (5.33) We call sensitivity of magnitude x with respect to the magnitude y :
pj,
(5.34)
= Sj:&(y).
(5.35)
sj: = so Ey(X)
We can prove easily that
s: = sp;.
(5.36)
Chapter 5. Gate-Level DDM
167
This way, 5': represents how the relative error propagates from a magnitude x to another magnitude y which depends on the first one. Likewise, Eq. (5.36) allows us to obtain the sensitivity of a magnitude with respect to another by means of successive intermediate steps. The problem we want to solve is how to obtain of the sensitivity of the propagation delay ( t , ) with respect to the degradation parameters at gate-level (A, B, and C). In the first place, by applying Eq. (5.1) and the previous definitions, we can obtain the sensibilities of the delay with respect to parameters z and T o: (5.37) (5.38)
In the same way, by applying Eq. (5.11) and Eq. (5.12) we can obtain the sensitivities of z and T o with respect to A , B, and C s:' = 1BCL ' (5.39) 1+A (5.40)
1 s$, = -
(5.41) 1-- V D D 2c The obtention of these expressions is detailed in the appendix of this chapter. Finally, by applying Eq. (5.36) and the previous equations it is possible to obtain expressions of the sensitivity of t , with respect to A , B, and C. For the case of S," we have also used Eq. (5.11) and Eq. (5.12) to obtain a result as a function of A , B and C: (5.42)
168
Logic-Timing Simulation and the Degradation Delay Model
s,B
Si A '
=
(5.43)
1+-
BCL
s,c
C = s2-VDD
'in
-
'-
S2A
cBCL'in
+
'
(5.44)
In these expressions, we have introduced two coefficients (sI and s2 ) which facilitate the interpretation of the result. These coefficients depend exclusively on the degradation factor d = t,/t,,, in the following way: (5.45) These coefficients act by modulating the sensitivity of the delay depending on the quantity of the degradation effect which takes place. In Table 5.24 we show the values of s and s2 corresponding to several values of d.
,
Table 5.24 Values of s1 and s2 depending on the degradation factor.
d
Degradation %
0.90
10
0.256 0.111
0.80
20
0.402 0.250
0.70
30
0.516 0.429
0.60
40
0.611 0.667
0.50
50
0.693
s1
s2
1
Observing the previous expressions we can deduce several aspects about the sensitivity of the propagation delay with respect to degradation parameters at gate-level. We will enumerate some of them: Sensitivity with respect to any of the parameters increases with the percentage of degradation, due to the evolution of coefficients s, and s2 (Table 5.24). Sensitivity of t, with respect to A and B is always smaller than one unit and it varies in one way or another depending on the relative
Chapter 5. Gate-Level DDM
169
importance of the terms A and BCL . This means that the relative error of the delay due to A and B is always smaller than the relative error of parameters A and B. Parameter A expresses the remainder value of z when C L = 0 and its origin is in the capacity that the gate itself contributes to its output. This way, for BCL D A , the intrinsic output capacity of the gate, represented by A , is negligible compared to the output load capacity and this results in: Sf + 0 . Otherwise, for BC, G A , the output load capacity is negligible compared to the intrinsic output capacity of the gate, which yields:
s;B+o. t, becomes more sensitive to the variations of C for slow inputs with respect to the value of z , which, on the other hand, is usually of the same order of magnitude as the value of the propagation delay of the gate. The sensitivity of the delay with respect to C is modulated by factor C / V D , which represents, in relative terms, the voltage threshold of the input of a gate with respect to the supply voltage. The delay in inputs with lower thresholds (as those closer to the supply rail in a transistor chain) will present smaller sensitivity to variations of parameter C.
5.6.2.2 Example of error propagation towards the propagation delay
In this section we present an example which will allow us to evaluate the precision of the degradation model at gate level, represented by Eq. (5.1), Eq. (5.1 1) and Eq. (5.12), and the precision of the different proposed models: exhaustive, simplified and basic. The example consists in the analysis of the propagation delay error produced by a collision with degradation in a NAND gate. Three cases are considered: Case 1: The exhaustive model is used. We thus have to consider the values obtained for the degradation parameters obtained for each input collision in an independent way. In this case, the error of param-
170
Logic-7iming Simulation and the Degradation Delay Model
eters A , B, and C is produced only by an error of the fitting process for these parameters to the expressions in Eq. (5.11) and Eq. (5.12). Case 2: We use the parameters of the simplified model for the gate. In this case, the error we must propagate is due to the fitting process as well as to the simplification that this model supposes. Case 3: The parameters of the basic model are used. Again, the error is due partially to the fitting process, but mainly to the strong simplification process that this model supposes. Other details of the characterized example are: We analyse collision-32 of the NAND-4 gate in this section, i.e. a rising transition at input 2 followed by a falling transition at input 3. This gate has been chosen from those analysed in Figs. 5.5 to 5.8 because it presents the clearest variations of the parameters with the input index. Thus, we avoid having to study an excessively favourable case whose results would not be representative. We have chosen the collision-32 because it is an intermediate case and it also corresponds to the typical case we have employed to obtain the value of the parameters in the simplified and basic models. This way the comparison between the different proposed models is facilitated. We have chosen an output load corresponding to double the input capacity of the gate. Again, this case is not the most favourable for the sensitivity of the propagated error, which gives more generality to the example. We have used an input transition with a duration of T,, = 2 t,, ,where t,, is the delay for a step input. This case corresponds to a typical transition of moderate speed. The error of the three models will be evaluated for two different values of the degradation factor: moderate degradation ( d = 0.80) and strong degradation ( d = 0.50 ). As already mentioned, the error of the degradation parameters for the case of the exhaustive model is directly the fitting error, just as we can observe in Table 5.13. For the case of the simplified model, the fitting error and the approximation error have been added. It has been considered
Chapter 5. Gate-Level DDM
171
as approximation error the largest difference between each parameter and the group of values it represents: (5.46) approximation error = max { Asii - Asd, 'dj ] .
1
In a similar way, the approximation error for the basic model is: (5.47) approximation error = max{ IAzij - A31, 'di,j } .
In Table 5.25 the values of the degradation parameters are shown for the three mentioned models corresponding to collision-32 of the example, together with their corresponding errors. The value of the parameters has been extracted from the full set of values for this gate, presented in Table 5.13. The value of the parameters is the same for all the models (exhaustive, simplified and basic) because we have chosen collision-32 as an example, although the error which affects each parameter is different for each model depending on the approaches that each one of them implies. Table 5.25 Degradation parameters values and errors for the example collision.
Parameter Value Error exh. model Error simp. model Error basic model A
391.4
2.4
8.8
63
B
15.77
0.050
0.17
1.48
C
2.91
0.15
0.24
1.28
Other necessary data for the calculation of the propagation of the error are the specific values of the output load and the transition time which we calculated from the input capacity and t p s , according to the approaches previously presented: C, = 8fF C, = 2C, = 17fF, (5.48) t,, = 218ps z i , = 2t,, = 436ps. (5.49) On the other hand, the sensitivity of the delay with respect to the degradation parameters at gate level is obtained by applying Eq. (5.42), Eq. (5.43), Eq. (5.44), and the data of Table 5.24 and Table 5.25. Again the calculation is simplified because, for collision-32, the sensitivities are
172
Logic-RimingSimulation and the Degradation Delay Model
the same for the three models. In Table 5.26 the results are shown for the two mentioned cases of degradation ( d = 0.80 and d = 0.50 ). Table 5.26 Sensitivity of delay with respect to the different degradation parameters at gate level for two cases: moderate degradation (d = 0.80) and strong degradation (d = 0.50).
Factor
Moderate degradation (d = 0.80)
Strong degradation (d = 0.50)
sr,
0.233
0.406
s; s:
0.169
0.294
0.47
1.88
Finally, with the errors of Table 5.25 and the sensitivities estimated in Table 5.26 we can calculate the relative errors propagated to the delay by applying Eq. (5.35) for each pattern and for the two degradation cases. The results are shown in Table 5.27, Table 5.28, and Table 5.29. Table 5.27 Results of the propagation of the error from the degradation parameters at gate level to the propagation delay: relative errors of the degradation parameters. ~
~~~~
X
exh.
simp.
basic
A
0.61
2.2
16
B
0.32
1.07
9.4
C
5.1
8.08
44
In the light of these results, we can make the following observations: The relative error of the different parameters of the exhaustive model (Table 5.27) is very small for parameters A and B, and sensibly larger, but acceptable, for parameter C. In this model, the error is produced only by the fitting process, so it demonstrates the ability of the basic expressions of the model, Eq. (5.6) and Eq. (5.7), to adjust to the results of the electric simulation.
Chapter 5. Gate-Level DDM
173
Table 5.28 Results of the propagation of the error from the degradation parameters at gate level to the propagation delay: delay relative error for moderate degradation.
&,(t,) (%) (d = 0.80) X
exh.
simp.
basic
A
0.14
0.5 1
3.7
B
0.054
0.18
1.6
C
2.4
3.8
21
Table 5.29 Results of the propagation of the error from the degradation parameters at gate level to the propagation delay: delay relative error for strong degradation.
Ex(tp) (%) (d = 0.50) X
exh.
simp.
basic
A
0.25
0.89
6.5
B
0.094
0.31
2.8
c
9.6
15
83
For the simplified model, the error introduced by its parameters in the delay is of the same order, although always a bit larger that the one of the exhaustive model. This result justifies its use instead of the exhaustive model due to the important improvements it implies in the simplification of the model and in the improvement of characterization times. The error propagated by the parameters of the basic model is larger than the one of the exhaustive model in more than one order of magnitude in most of the cases. However, the final error it produces can be acceptable in some cases, as we will see later on. Parameters A and B show the best behaviour in the relative error of degradation parameters themselves as well as the smallest sensitivity in the delay error to them. The error propagated for these parameters is even located below 1% for the case of strong degradation in the exhaustive and simplified models, and close to 5% for the basic model.
174
Logic- Eming Simulation and the Degradation Delay Model
Parameter C propagates the largest error. This is due mainly to three reasons: a larger fitting error than the one already present in the exhaustive model, an appreciable variation with the input index which affects mainly the basic model error, and a larger sensitivity to the delay to variations of C, mainly when the degradation effect is stronger (Table 5.26). Even this way, for the case of moderate degradation, the error propagated towards the delay is acceptable for the exhaustive (2%) and simplified (4%) models, and it is not excessive in the case of the basic model (2 1%). For the case of strong degradation, the error introduced by the basic model is excessive (83%) and important in the exhaustive (9.6%) and simplified (15%) models. This fact is due to the behaviour which the sensitivity of the delay presents regarding parameter C which increases quickly in the cases of strong degradation and amplifies the error propagated from parameter C to the delay (Table 5.26). To conclude, we can note that the sensitivity of the propagation delay to the variations of the parameters A , B, and C are generally smaller than one unit. This makes the errors in these parameters, those produced by the fitting process as well as those produced by the simplification of the model, affect the propagation delay in an attenuated way. This behaviour of the sensitivity only changes in cases of strong degradation (close to %YO),where the sensitivity with respect to parameter C can be larger than one unit. This fact, together with the stronger incidence of the fitting error on parameter C, makes this parameter the most important source of error and determines the limits in which each version of the model can be applied, maintaining a certain degree of precision.
5.7 Discussion of Results
In this Chapter we have presented the extension to the gates of the degradation delay model for the CMOS inverter analysed in Chapters 3 and 4. This extension has been made in order to apply the model to the logic timing simulation at the gate-level, using standard library cells.
Chapter 5. Gate-Level DDM
175
In the first place, a model has been formulated which contemplates the exhaustive characterization of the set of degradation parameters (A, B, and C) for each possible input collision able to produce degradation. The model thus obtained describes in a complete and precise way the degradation effect in a gate. It is necessary to highlight that the model is not only presented, but also a detailed description of the necessary characterization process to obtain the values of the parameters is given, which is essential for making any feasible and reproducible model. Likewise, the complexity of this characterization process has been analysed. We have shown the necessity to automate the process to be able to obtain a usehl amount of data to drive the characterization process. In this sense a tool for automatic characterization has been developed which generates the complete set of degradation parameters from the description of a logic gate. This tool makes it feasible to characterize whole libraries of gates. Starting from the analysis of the characterization results for a representative group of gates, we have proposed a simplified model which reduces in a substantial way the number of parameters necessary to describe a gate with respect to the exhaustive model (almost 1/3 for four input gates) while conserving a precision similar to the one of the exhaustive model. The characterization time is reduced by the same factor. We have also presented a model of extreme simplicity named basic model which reduces to only six the number of parameters necessary to characterize the degradation in any gate, although it reduces the precision of the results. Finally, the propagation of the error from the degradation parameters to the propagation delay has been studied. This allows us to evaluate the precision of the fitting expressions on which the models are based, as well as the simplifications we have carried out. We have demonstrated that the error in parameters A and B is always attenuated when it propagates towards the delay. This means that a certain relative error in these parameters produces a smaller relative error in the delay. This attenuation grows as a smaller degradation takes place. However, parameter C appears as the main source of error in the models, especially in cases of strong degradation, in which the relative error in this parameter can be propagated to the propagation delay in an ampliJied way,
176
Logic-Timing Simulation and the Degradation Delay Model
We have carried out a detailed analysis of the error propagation in a representative example that reveals how the exhaustive model describes with great precision the degradation effect, which validates the basic expressions of the model. The simplified model is also valid and it has a precision similar to that of the exhaustive model, making it the preferred model for production. The basic model is even applicable in cases of moderate degradation (20%) in those cases in which a high precision is not needed. The results obtained in this Chapter indicate different continuation tasks concerning the study of the degradation effect modelling at gate level. Some of these tasks are: To explore more deeply the modelling of parameters T o and C, which are the main sources of error. To look for equivalencies in the value of the degradation parameters among different gates, as a way to additional simplifications of the model. To explore the dependence of parameters A , B, and C on the technological variables, as a way to extend the model to levels lower than that of the logic gate. To generalize the study of collisions to complex logical gates, extending the application of the model to macrocells.
5.8 Appendix: Calculation of Error Sensitivity in the Propagation Delay With Respect to the Degradation Parameter Error
In this appendix, we explain in detail the process of obtaining Eqs. (5.37) to (5.41). For more information you can consult the corresponding section. In the first place, we reproduce here the equations necessary for the explanation. The expression sensitivity of the magnitude x with respect to magnitude y refers to: (5.50)
Chapter 5. Gate-Level DDM
177
The basic equation of the DDM is: t, = t p o ( l - e
--T - T T
1.
(5.51)
Parameters z and To are expressed as a function of the degradation parameters at gate level as: A + BCL z = (5.52) VDD
(5.53)
5.8.1 Sensitivity of the propagation delay with respect to parameter z
First we calculate the partial derivative of t, with respect to z :
(5.54) From Eq. (5.51) we have: --T - T o
(-t,o)e
-
t,- t p o .
(5.55)
Therefore:
(5.56) We calculate the sensitivity: (5.57)
From Eq. (5.51) we have: (5.58)
Therefore:
(5.59)
178
Logic- Enzing Simulation and the Degradation Delay Model
5.8.2 Sensitivity of thepropagation delay with respect to To First we calculate the partial derivative and simplify by applying Eq. (5.55): (5.60) Now we calculate the sensitivity: (5.61)
5.8.3 Sensitivity ofparameter T with respect to A (5.62) We apply Eq. (5.52) to write the result as a function of A and B: A 1 = IA+BCj BCL * 1+A
':'
5.8.4 Sensitivity ofparameter
'I:
(5.63)
with respect to B
In a similar way: (5.64)
5.8.5 Sensitivity of To with respect to C (5.65)
Chapter 5. Gate-Level DDM
179
We apply Eq. (5.53) to write the result as a function of C:
(5.66)
This page intentionally left blank
Chapter 6
Logic Level Simulator Design and Implementation Jorge Juan Chic0 Paulino Ruiz de Clavijo Vkzquez
6.1 Introduction In previous chapters we have developed what we believe is a highly accurate delay model: the degradation delay model (DDM). We have also presented a new algorithm to handle the inertial effect in Sec. 3.4.2. To be able to exploit the model’s benefits we need to include it in a logic-level simulation tool. Conventional logic-level simulators like the VHDL or Verilog standard simulators, are not suited to implement the DDM nor the new inertial effect handling algorithm. Regarding the DDM, extra information not present in conventional event-driven simulators is necessary to take account of the degradation effect. On the other hand, the new inertial effect algorithm is threshold-based instead of delay-based, as implemented in conventional approaches. For these reasons, we have developed a new logic-level simulation tool which is able to implement the special characteristics of the DDM and the new inertial effect algorithm, besides the traditional techniques. This simulator is named HALOTIS, which stands for High Accuracy Logic TZming Simulator. Among the main features of HALOTIS are its modularity and object-oriented design. These make it possible to implement a variety of delay models apart from the DDM, which is useful for making comparisons between them. Furthermore, it can be easily extended with new delay models. HALOTIS reads Verilog format for
181
182
Logic-Timing Simulation and the Degradation Delay Model
compatibility with existing commercial tools, but the parser side is also modular and can be extended to support other formats. Although HALOTIS is still in active development, it is already a flexible and extensible logic-timing simulation tool. In the development of a complex software tool, it is necessary to use some development methodology. At the present time every methodology includes a group of basic tasks: analysis, design and implementation, traditionally called the software life-cycle. There are numerous methodologies of software development that cover the wide life-cycle. Besides these three basic tasks, the methodologies include other tasks or subdivide some tasks being able to process the different aspects of the software conceptually, mainly in the design stage. This subdivision of the basic tasks in the life-cycle originates different methodologies, some aimed to solve specific types of problems, and more general ones able to include several cases. The modelling concept is common to every methodology. A model is no more than a representation in some medium of the subset of the reality to be dealt with, that is to say, it can be considered as an abstraction of a certain reality. The model will allow us to capture and enumerate the requirements and the knowledge domain thoroughly, so that all the agents implied in the project can understand them and may agree with them. Lastly, it is necessary that all models incorporate a certain system of notation, which should be common to all the persons involved in the project. This notation gave way to a certain methodology. During the development of HALOTIS we have gone through the different stages of the life-cycle: problem analysis, design and implementation. The different tasks of the life-cycle can be simplified if the design is based on some software object-oriented methodology. Nowadays it is admitted that if the design of complex software is developed with an object-oriented methodology we can obtain a result which is, on one hand, easy to implement in a programming language, and on the other hand is easy to maintain, to debug and to expand. The objective of this chapter is to summarize some details about its design and implementation of the HALOTIS simulator. In the following sections we will present a brief introduction to the object-oriented methodology, a general description and requirements of HALOTIS, finishing off with some details about its implementation.
Chapter 6. Logic Level Simulator Design and Implementation
183
6.2 Object Oriented Methodologies: UML
6.2.1 UML introduction
Nowadays object-oriented design methodologies are widely accepted in software engineering. These methodologies first appeared around the middle of the 70’s and the early 80’s. During the period 1989-1994, the number of modelling languages increased considerably from less than ten to more than fifty, but many users were not satisfied with these techniques. This started the so-called war of methods, among which are Booch’93, OMT and Fusion. UML (Unified Modelling Language) [Rumbaugh et al. (1999)l appeared as the evolution of this collection of methodologies and has been standardized and accepted worldwide. First of all, UML is an object-oriented methodology. With the object concept we intend to group together in an abstract entity certain aspects of the domain of the problem which share some attributes, as occurs in our daily reality. In an object-oriented methodology, the designer should think about how to group the attributes of what he/she wants to model, thus defining different objects, so that the sum of all of the objects represents the whole domain of the problem. UML is also a language used to specify, build, visualize and document software systems. With UML we have a visual language for modelling software, but not a visual programming language, that is to say, from it we cannot derive the code automatically into some programming language. The excellent aspect of this methodology is that the architecture and structure of the system can be expressed and understood perfectly by different people of different knowledge areas. Also, with this methodology, we cover all the stages of software development: analysis, design, programming and testing. The history of UML started in October 1994 when Grady Booch and Jim Rumbaugh from Rational Software started to work on the unification of the modelling languages Booch and OMT. It is then that they started to be recognized worldwide as leaders in the development of object-oriented methodologies. They concluded their unification effort by writing a draft of version 0.8 of the so-called U n g e d Method in October 1995. Afterwards, and also in 1995, Ivar Jacobson, father of the OOSE methodology,
184
Logic-Timing Simulation and the Degradation Delay Model
joined Rational Software to create UML 0.9 and 0.91 in June and October 1996, respectively. After that, several companies’ joined Rational Software to produce UML 1.O and UML 1.1, which have evolved into UML 1.4 and 2.0 at present. UML has then been adopted by several organizations and companies as a standard methodology in the development of processes and products, with the advantage that, as an open standard, it is available to the scientific community.
6.2.2 UML representation Throughout this chapter we will use a set of graphic elements that are part of the UML methodology. These graphic elements form a standard and easy-to-use description language. This is one of the main objectives of the use of UML: to share a certain system of notation and to be able to exchange information without having to devote a great deal of effort to these tasks. UML has different visual constructions to represent the system, these are called views. Each of these views tries to represent different features of the software. During the various stages of the life-cycle we will use the UML views that we consider necessary according to the type of software we want to model. More precisely, we will use the following views:
Use Case Diagrams: It is desirable to do high-level system descriptions from a functional point of view. These diagrams describe the system’s functionality following a descending methodology, so that we start at a high-level vision of the system and we continue decomposing the system into more concrete parts. The objective of use case diagrams is to define a part of the system’s behaviour without showing the internal structure of the system. The notation consists of cir-
Among these companies are Microsoft, Hewlett-Packard, Oracle, Sterling Software MCI Systemhouse, Unisys, ICON Computing, IntelliCorp, i-Logix, IBM, ObjectTime, Platinum Technology, Ptech, Taskon, Reich Technologies and Softeam.
Chapter 6. Logic Level Simulator Design and Implementation
185
cles representing tasks that can be achieved, which are connected through lines with two qualification types: Uses: These represent an inclusive relationship, so that a task is formed internally by other tasks. Extends: These represent an extension relationship. We can understand them as different forms of realization of a task or a specialization of this task. Object Diagrams: These diagrams represent static aspects of the system being developed. These static features model the internal structure of the source code such as the internal representation of data stored in the system. This is the core of all software developments so it is very important to achieve a good modelling since we will thus obtain high quality software. Therefore, we should spend great effort on this task. These diagrams are formed by objects, represented by squared boxes, linked together through relationships which connect the objects. The set of objects and relationships is an abstraction of the reality that we want to represent. It should include all the elements and features of the system that we want to build. Activity Diagrams: With these diagrams we model the dynamic behaviour of the software. In UML notation, an activity diagram consists of a box divided into a series of columns where each column represents an objectlclass, so that when the object does some activity, the description of the activity that takes place is included and displayed in a box. The result of an activity is a set of data represented within a new box which is located on the boundary between two columns. With this representation we indicate that the resulting data flows between the classes associated to the columns. Finally the whole diagram is bound by arrows that show the order in which the system runs the different activities. Once the basic components of the UML methodology have been introduced, they will be used to describe the stages involved in the life cycle of software development. The following points enumerate these stages and the UML elements that are typically associated with them:
186
Logic-Timing Simulation and the Degradation Delay Model
(1) Global analysis or conceptualization:The main objective of this stage is to set up the overall picture of the problem to be solved. Sets of requirements, tasks and results are typically specified at this stage. (2) Analysis of requirements: In this stage, the sets of requirements of the first stage are better organized and further specified in order to detect possible inconsistencies, lack of features, redundancies, etc. (3) System design: With this stage we will obtain a global vision of the system from a high-level point of view. Use case diagrams are used during this stage. (4) Object design: Now the objective is to build an object model that will be implemented in the next stage. This model should represent precisely the reality of the system. Objects, classes, states and activity diagrams are the UML components to be used in this stage. (5) Implementation: The above mentioned components need now to be coded in a given programming language. The pros and cons of different languages should be taken into account in order to select the best option for our system.
The rest of this chapter is devoted to describing these stages in detail during the development of HALOTIS.
6.3 Global Analysis of HALOTIS We will start the global analysis by specifying the general requirements from the user’s point of view. We will also give a general description of the tool’s functionality, including aspects like the user interface, different hardware description languages that the tool must interpret, the output data.format, etc. The general objective is to build an event-driven simulation tool that can simulate digital circuits. The tool should be able to use different behavioural models, different circuit technologies and different sirnulation algorithms. The user should be able to specify behavioural models and simulation parameters by creating, editing or deleting these behavioural models or the parameters of the digital electronic components. A first type of user interaction is adding or modifying the application’s
Chapter 6. Logic Level Simulator Design and Implementation
187
HALOTIS
Netlist
Simulation
Cell Library
/ Prcgramrner
Behavioural models
Fig. 6.1 General high level system view.
source code, normally by adding or editing the code of a module corresponding to a given behavioural model or algorithm. The system should be modular enough to facilitate these tasks. This way of interaction, however, will be most commonly useful for future extensions of the tool capabilities by experienced users. A much more common task will be the modification of cell libraries which hold specific simulation data of the circuit’s building blocks. This data is typically obtained by a characterizing procedure. The user should be able to append, delete or modify cell libraries and the model parameters easily. After this first analysis, it is possible to obtain a general idea of the HALOTIS operation depicted in Fig. 6.1, following the UML notation by using a use case diagram. This diagram represents the complete system and establishes the border between the external elements through the rectangular box. Also, inside the rectangular box, three fundamental blocks or tasks are included, using ellipses for their representation. These tasks are strongly related to the main o