Penzes, Paul Ivan (2002) EnergyDelay Complexity of Asynchronous Circuits. Computer Science Technical Reports, California Institute of Technology , Pasadena, CA. (Unpublished) https://resolver.caltech.edu/CaltechCSTR:2002.010
PDF
 Submitted Version
See Usage Policy. 767kB  

Postscript
 Submitted Version
See Usage Policy. 1MB 
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:2002.010
Abstract
In this thesis, a circuitlevel theory of energydelay complexity is developed for asynchronous circuits. The energydelay efficiency of a circuit is characterized using the metric Et^n, where E is the energy consumed by the computation, t is the delay of the computation, and n is a positive number that reflects a chosen tradeoff between energy and delay. Based on theoretical and experimental evidence, it is argued that for a circuit optimized for minimal Et^n, the consumed energy is independent, in first approximation, of the types of gates (NAND, NOR, etc.) used by the circuit and is solely dependent on n and the total amount of wiring capacitance switched during computation. Conversely, the circuit speed is independent, in first approximation, of the wiring capacitance and depends only on n and the types of gates used. The complexity model allows us to compare the energydelay efficiency of two circuits implementing the same computation. On the other hand, the complexity model itself does not say much about the actual transistor sizes that achieve the optimum. For this reason, the problem of transistor sizing of circuits optimize d for Et^n is investigated, as well. A set of analytical formulas that closely approximate the optimal transistor sizes are explored. An efficient iteration procedure that can further improve the original analytical solution is then studied. Based on these results, a novel transistorsizing algorithm for energydelay efficiency is introduced. It is shown that the Et^n metric for the energydelay efficiency index n ≥ 0 characterizes any optimal tradeoff between the energy and the delay of a computation. For example, any problem of minimizing the energy of a system for a given target delay can be restated as minimizing Et^n for a certain n. The notion of it minimumenergy function is developed and applied to the parallel and sequential composition of circuits in general and, in particular, to circuits optimized through transistor sizing and voltage scaling. Bounds on the energy and delay of the optimized circuits are computed, and necessary and sufficient conditions are given under which these bounds are reached. Necessary and sufficient conditions are also given under which components of a design can be optimized independently so as to yield a global optimum when composed. Through these applications, the utility of the minimumenergy function is demonstrated. The use of this minimumenergy function yields practical insight into ways of improving the overall energydelay efficiency of circuits.
Item Type:  Report or Paper (Technical Report) 

Additional Information:  © 2002 California Institute of Technology. Submitted May 24, 2002. I wish to thank Alain J. Mar t in for giving me the opportunity to work in his research group, for providing me with intriguing research topics and for being a patient and dedicated advisor. For six years he diligently guided my research and kept me enthusiastic about all aspects of computer science. It has been a truly unique experience to work with Alain. I also wish to thank the members of the Asynchronous VLSI Group at Caltech for many stimulating discussions: Andrew Lines, Rajit Manohar, Mika Nyström, Robert Southworth, Catherine Wong, Karl Papadantonakis, and Jose T ierno from IBM, TJ Watson Research Center. My Caltech years would have not been as pleasant without Rocio, Attila, Calin, and my fellow gr ocluate students in computer science. I thank you all! 
Group:  Computer Science Technical Reports 
Subject Keywords:  energy, delay, asynchronous circuits 
Series Name:  Computer Science Technical Reports 
DOI:  10.7907/Z9DV1GVX 
Record Number:  CaltechCSTR:2002.010 
Persistent URL:  https://resolver.caltech.edu/CaltechCSTR:2002.010 
Usage Policy:  You are granted permission for individual, educational, research and noncommercial reproduction, distribution, display and performance of this work in any format. 
ID Code:  27034 
Collection:  CaltechCSTR 
Deposited By:  Imported from CaltechCSTR 
Deposited On:  26 Sep 2002 
Last Modified:  03 Oct 2019 03:20 
Repository Staff Only: item control page