Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kye S. Hedlund

dblp:58/3102 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1987
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 4 · 4 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Electronic design automation · 72% Performance modeling and evaluation · 15% Integrated circuit design · 13%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
circuit optimization
0.021987
Aesop: A Tool for Automated Transistor Sizing · DAC 1987
Electrical optimization of PLAs · DAC 1985
Electronic design automation › circuit sizing
transistor sizing
0.021987
Aesop: A Tool for Automated Transistor Sizing · DAC 1987
Electrical optimization of PLAs · DAC 1985
Electronic design automation › logic synthesis › programmable logic array
PLA optimization
0.011985
Electrical optimization of PLAs · DAC 1985
Integrated circuit design
low-power circuit design
0.021987
Aesop: A Tool for Automated Transistor Sizing · DAC 1987
Electrical optimization of PLAs · DAC 1985
Integrated circuit design
VLSI design
0.011986
Performance modeling in integrated curcuit design (tutorial) · SIGMETRICS 1986

Methods — techniques the papers use, named apart from their topics

linear optimization algorithms · 0.0power minimization · 0.0lumped RC delay model · 0.0delay minimization · 0.0
YearPublicationVenuePosition
1987 Aesop: A Tool for Automated Transistor Sizing
abstract
This work addresses the problem of automating the electrical optimization of combinatorial MOS circuits. Improvements to a circuit's speed, area and power consumption are sought through modifications to the transistor sizes in the circuit; no changes in the circuit structure, number of gates or clocking are introduced. Linear algorithms are presented for computing optimal transistor sizes to minimize delay, area or power. These algorithms are implemented in an interactive tool, Aesop. Aesop is a powerful and fast “what-if” tool that allows the designer to explore the space of designs having optimal transistor sizes. When compared to manual designs, the circuits produced by Aesop are typically faster or have substantially lower area and power consumption. Compared to untuned circuits, Aesop typically increases circuit speed by a factor of 2 to 4. Alternatively, power consumption and transistor area can be reduced by 25 — 50% with no sacrifice in circuit speed. These improvements are computed interactively on a professional workstation for circuits containing thousands of transistors.
Kye S. Hedlund
DAC1
1986 Performance modeling in integrated curcuit design (tutorial)
abstract
This tutorial is an introduction to performance modeling in the design of integrated circuits (ICs). It assumes no background in either electrical engineering or VLSI design; all relevant concepts and terminology will be introduced. The goal is to give an overview of the role of performance modeling in IC design, the current state of the art, central problems and research challenges.
Kye S. Hedlund
SIGMETRICS1
1985 Electrical optimization of PLAs
abstract
This work addresses the problem of improving an nMOS PLA's speed and power consumption through modifications to the transistor sizes in the PLA. A simplified model of gate delay (lumped RC model) is used that allows rapid estimation of delays thus allowing interactive computation of optimal transistor sizes. Algorithms are presented for: a) minimization of delay through the PLA b) minimization of power consumption subject to a bound on maximum delay. Both these minima are computed subject to bounds on the transistor sizes. A prototype electrical optimization tool was compared to the PLA generation tools in the Berkeley CAD tools package (eqntott and tpla). The maximum delay through a PLA can often be reduced by a factor of 2, and power consumption along the critical paths can be reduced by 10 - 30% without increasing maximum delay.
Kye S. Hedlund
DAC1
1982 Wafer scale integration of Configurable, Highly Parallel (CHiP) processors
Kye S. Hedlund, Lawrence Snyder 0001
ICPP1