Hans-Rudolf Heeb

dblp:42/187 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1992
—ORCID · none

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

Systems, architecture and hardware · 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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
layout synthesis
0.011992
A module generator based on the PQ-tree algorithm · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Electronic design automation › physical design
module generation
0.011992
A module generator based on the PQ-tree algorithm · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Electronic design automation
physical design
0.011992
A module generator based on the PQ-tree algorithm · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
Electronic design automation › physical design
placement
0.011992
A module generator based on the PQ-tree algorithm · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992

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

top-down cell generation · 0.0PQ-tree algorithm · 0.0
YearPublicationVenuePosition
1992 A module generator based on the PQ-tree algorithm
abstract
GRAPES, a system for module generation that produces faster and denser layout than conventional CAD tools, is described. The layout style produced by GRAPES resembles standard cell layout (vertical polysilicon wires crossing horizontal diffusion stripes) or sea-of-gates macro layout. Contrary to standard cells or macros, the complexity of the individual cells is not limited by any library, cells can be stretched, feedthroughs can run across them, and the transistors can be permuted and sized individually. Cells and rows are produced at the same time in a top-down procedure. A novel algorithm based on the PQ-tree algorithm orders the individual transistor gates in each row such the several rows abut, with no routing channels between the rows. The most critical nets can usually be connected by abutment, even when they connect several cells in different rows. In a comparison with a commercial standard-cell tool, GRAPES produced layout that is about two times smaller and has up to six times shorter total wire length.>
Hans-Rudolf Heeb, Wolfgang Fichtner
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1