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

Julian Culetu

dblp:65/815 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1998
—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 · 88% Integrated circuit design · 12%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
buffer insertion
0.011998
A Practical Repeater Insertion Method in High Speed VLSI Circuits · DAC 1998
Electronic design automation
physical design
0.011998
A Practical Repeater Insertion Method in High Speed VLSI Circuits · DAC 1998
Integrated circuit design › VLSI design
high-speed VLSI circuits
0.011998
A Practical Repeater Insertion Method in High Speed VLSI Circuits · DAC 1998
Electronic design automation › physical design
timing optimization
0.011998
A Practical Repeater Insertion Method in High Speed VLSI Circuits · DAC 1998

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

elmore delay model · 0.0SPICE RC model · 0.0
YearPublicationVenuePosition
1998 A Practical Repeater Insertion Method in High Speed VLSI Circuits
abstract
In today’s design of VLSI high speed circuits, frequency has a major impact on the number of repeaters that needs to be inserted. A microprocessor operating at less than 200Mhz might require several hundred repeaters, while one operating at greater than 500Mhz may require a number in the thousands. The following paper describes an efficient and simple way to automatically determine buffer placement based on maintaining equal transition time for all gate input signals across the net. A maximum allowable transition time is determined (limited by the frequency of the circuit), and correlated with the interconnect Elmore Delay. A Spice RC model having nodes with physical locations (X, Y coordinates) can be obtained by extraction tools providing standard parasitic format (SPF). This can then be used with the results of the algorithm for repeater placement to determine the exact physical location desired for each repeater. 1.
Julian Culetu, Chaim Amir, John MacDonald
DAC1