scispace - formally typeset
Search or ask a question
Author

Ernest S. Kuh

Bio: Ernest S. Kuh is an academic researcher from University of California, Berkeley. The author has contributed to research in topics: Routing (electronic design automation) & Very-large-scale integration. The author has an hindex of 43, co-authored 153 publications receiving 6395 citations. Previous affiliations of Ernest S. Kuh include University of California & Bell Labs.


Papers
More filters
Journal ArticleDOI
TL;DR: Two new algorithms merge nets instead of assigning horizontal tracks to individual nets to route a specified net list between two rows of terminals across a two-layer channel in the layout design of LSI chips.
Abstract: In the layout design of LSI chips, channel routing is one of the key problems. The problem is to route a specified net list between two rows of terminals across a two-layer channel. Nets are routed with horizontal segments on one layer and vertical segments on the other. Connections between two layers are made through via holes. Two new algorithms are proposed. These algorithms merge nets instead of assigning horizontal tracks to individual nets. The algorithms were coded in Fortran and implemented on a VAX 11/780 computer. Experimental results are quite encouraging. Both programs generated optimal solutions in 6 out of 8 cases, using examples in previously published papers. The computation times of the algorithms for a typical channel (300 terminals, 70 nets) are 1.0 and 2.1 s, respectively.

539 citations

Journal ArticleDOI
TL;DR: An approach for transient simulation of lossy interconnects terminated in arbitrary nonlinear elements based on convolution simulation is presented in this article, where Pade approximations of each line's characteristics or each multiconductor line's modal functions are used to derive a recursive convolution formulation, which greatly reduces the amount of computation used to perform convolutions.
Abstract: An approach for transient simulation of lossy interconnects terminated in arbitrary nonlinear elements based on convolution simulation is presented. The Pade approximations of each line's characteristics or each multiconductor line's modal functions are used to derive a recursive convolution formulation, which greatly reduces the amount of computation used to perform convolutions. The approach can handle frequency-varying effects, such as skin effects, and general coupling situations. The errors introduced by Pade approximations are analyzed, and a scheme for determining the necessary order for an approximation is developed. The approach has been incorporated in the stepwise equivalent conductance timing simulator (SWEC) for digital CMOS circuits. Comparisons with SPICE3.e indicate that SWEC, which gives accurate results, can be one to two orders of magnitude faster. >

259 citations

Proceedings ArticleDOI
24 Jun 1990
TL;DR: A novel approach to clock routing that all but eliminates clock skew and yields excellent phase delay results for a wide range of chip sizes, net sizes (pin count), minimum feature sizes, and pin distributions on both randomly created and standard industrial benchmarks is presented.
Abstract: Routing techniques for optimizing clock signals in small-cell (e.g., standard-cell, sea-of-gate, etc.) application-specific ICs (ASICs) are addressed. In previously reported works, the routing of a clock net has been performed using ordinary global routing techniques based on a minimum spanning or minimal Steiner tree that have little understanding of clock-routing problems. The authors present a novel approach to the clock-routing that all but eliminates clock skew and yields excellent phase delay results for a wide range of chip sizes, net sizes (pin count), minimum feature sizes, and pin distributions on both randomly created and standard industrial benchmarks. For certain classes of pin distributions a decrease in skew with an increase in net size was proven theoretically and observed experimentally. A two to three order magnitude reduction in skew when compared to a minimum rectilinear spanning tree was observed. >

235 citations

Journal ArticleDOI
01 Feb 1990
TL;DR: The current status of VLSI layout and directions for future research are addressed, and the field of computational geometry and its application to layout-in particular, to gridless routing and compaction-are reviewed, and layout engines are considered.
Abstract: The current status of VLSI layout and directions for future research are addressed, with emphasis on the authors' own work Necessary terminology and definitions and, whenever possible, a precise formulation of the problems are provided Placement and floorplanning for both the sea-of-gates and building-block designs are examined The former emphasizes the connectivity specification, whereas the latter must also consider module shape and size Global routing based on a method of successive cuts on a chip is discussed This is a hierarchical top-down approach that is useful for both of the above designs A two-dimensional detailed routing problem and the rip-up and rerouting problem are also discussed The field of computational geometry and its application to layout-in particular, to gridless routing and compaction-are reviewed, and layout engines are considered >

225 citations

Journal ArticleDOI
01 Jul 1965
TL;DR: The universality of the state-variable approach to network analysis is demonstrated in general discussions and specific examples as mentioned in this paper, and a brief guide of the current research where the state variable analysis is brought to bear upon certain qualitative aspects of classical and non-classical network behavior is discussed.
Abstract: The universality of the state-variable approach to network analysis is demonstrated in general discussions and specific examples. The method of formulation of the state equations for an arbitrary lumped, linear, finite, reciprocal, passive, time-invariant network is presented fully, while the relaxation of these restrictions is indicated in detail; i.e., the state-variable characterization of active, nonreciprocal, time-variable, and nonlinear networks is discussed. Finally, there is a brief guide of the current research where the state-variable analysis is brought to bear upon certain qualitative aspects of classical and nonclassical network behavior.

221 citations


Cited by
More filters
Book ChapterDOI
15 Aug 1999
TL;DR: In this paper, the authors examine specific methods for analyzing power consumption measurements to find secret keys from tamper resistant devices. And they also discuss approaches for building cryptosystems that can operate securely in existing hardware that leaks information.
Abstract: Cryptosystem designers frequently assume that secrets will be manipulated in closed, reliable computing environments. Unfortunately, actual computers and microchips leak information about the operations they process. This paper examines specific methods for analyzing power consumption measurements to find secret keys from tamper resistant devices. We also discuss approaches for building cryptosystems that can operate securely in existing hardware that leaks information.

6,757 citations

Book
30 Jun 2002
TL;DR: This paper presents a meta-anatomy of the multi-Criteria Decision Making process, which aims to provide a scaffolding for the future development of multi-criteria decision-making systems.
Abstract: List of Figures. List of Tables. Preface. Foreword. 1. Basic Concepts. 2. Evolutionary Algorithm MOP Approaches. 3. MOEA Test Suites. 4. MOEA Testing and Analysis. 5. MOEA Theory and Issues. 3. MOEA Theoretical Issues. 6. Applications. 7. MOEA Parallelization. 8. Multi-Criteria Decision Making. 9. Special Topics. 10. Epilog. Appendix A: MOEA Classification and Technique Analysis. Appendix B: MOPs in the Literature. Appendix C: Ptrue & PFtrue for Selected Numeric MOPs. Appendix D: Ptrue & PFtrue for Side-Constrained MOPs. Appendix E: MOEA Software Availability. Appendix F: MOEA-Related Information. Index. References.

5,994 citations

Journal ArticleDOI
TL;DR: This paper provides a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions and shows that elitism is shown to be an important factor for improving evolutionary multiobjectives search.
Abstract: In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function involves a particular feature that is known to cause difficulty in the evolutionary optimization process, mainly in converging to the Pareto-optimal front (e.g., multimodality and deception). By investigating these different problem features separately, it is possible to predict the kind of problems to which a certain technique is or is not well suited. However, in contrast to what was suspected beforehand, the experimental results indicate a hierarchy of the algorithms under consideration. Furthermore, the emerging effects are evidence that the suggested test functions provide sufficient complexity to compare multiobjective optimizers. Finally, elitism is shown to be an important factor for improving evolutionary multiobjective search.

4,867 citations

Journal ArticleDOI
TL;DR: This study provides a rigorous analysis of the limitations underlying this type of quality assessment in multiobjective evolutionary algorithms and develops a mathematical framework which allows one to classify and discuss existing techniques.
Abstract: An important issue in multiobjective optimization is the quantitative comparison of the performance of different algorithms. In the case of multiobjective evolutionary algorithms, the outcome is usually an approximation of the Pareto-optimal set, which is denoted as an approximation set, and therefore the question arises of how to evaluate the quality of approximation sets. Most popular are methods that assign each approximation set a vector of real numbers that reflect different aspects of the quality. Sometimes, pairs of approximation sets are also considered. In this study, we provide a rigorous analysis of the limitations underlying this type of quality assessment. To this end, a mathematical framework is developed which allows one to classify and discuss existing techniques.

3,702 citations