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.

Raffaele Costa

dblp:78/1298 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1991
—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 · 93% Integrated circuit design · 7%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › module generation
cell generation
0.011991
Symbolic generation of constrained random logic cells · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Electronic design automation
physical design
0.011991
Symbolic generation of constrained random logic cells · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Electronic design automation › physical design
placement and routing
0.011991
Symbolic generation of constrained random logic cells · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Electronic design automation › physical design › VLSI layout
symbolic layout
0.011991
Symbolic generation of constrained random logic cells · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991

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

steiner tree routing · 0.0linear ordering · 0.0lee algorithm · 0.0
YearPublicationVenuePosition
1991 Symbolic generation of constrained random logic cells
abstract
A symbolic cell generator (SYC) that can generate the symbolic layout of a generic CMOS logic cell is presented. It accepts as input a SPICE-like netlist describing circuit components, connectivity, and the list of the I/O pins. Using this generator, the user can specify topological constraints on pin and transistor positions, the maximum lengths of polysilicon and diffusion wires, and a preferred layer for each electrical node. Cells are generated according to optimization criteria that take into account not only geometric factors, such as cell area, aspect ratio, and wirelength, but also electrical features, namely capacitance to the substrate and contact and via minimization. The generator's placement strategy includes transistor clustering into regions, global region placement by linear ordering, and two-dimensional local transistor placement. The routing combines Steiner trees and Lee algorithms. Object-oriented programming paradigms were used in the implementation of the program, written in C++ language. Experimental results for small and medium-sized cells are presented.>
Raffaele Costa, Francesco Curatelli, Daniele D. Caviglia, Giacomo M. Bisio
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1