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

E. Aykut Dengi

dblp:13/5605 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 4 · 2 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
4 papers
Electronic design automation · 95% Integrated circuit design · 5%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.132004
A synthesis flow toward fast parasitic closure for radio-frequency integrated circuits · DAC 2004
Boundary Element Method Macromodels for 2-D Hierachical Capacitance Extraction · DAC 1998
Hierarchical 2-D Field Solution for Capacitance Extraction for VLSI Interconnect Modeling · DAC 1997
Electronic design automation › physical design › parasitic extraction
capacitance extraction
0.131998
Boundary Element Method Macromodels for 2-D Hierachical Capacitance Extraction · DAC 1998
Hierarchical 2-D Field Solution for Capacitance Extraction for VLSI Interconnect Modeling · DAC 1997
A Sparse Image Method for BEM Capacitance Extraction · DAC 1996
Electronic design automation
analog and RF circuit synthesis
0.012004
A synthesis flow toward fast parasitic closure for radio-frequency integrated circuits · DAC 2004
Electronic design automation › physical design
layout synthesis
0.012004
A synthesis flow toward fast parasitic closure for radio-frequency integrated circuits · DAC 2004
Electronic design automation › physical design › placement
timing-driven placement
0.012004
A synthesis flow toward fast parasitic closure for radio-frequency integrated circuits · DAC 2004
Electronic design automation
interconnect modeling
0.021998
Boundary Element Method Macromodels for 2-D Hierachical Capacitance Extraction · DAC 1998
Hierarchical 2-D Field Solution for Capacitance Extraction for VLSI Interconnect Modeling · DAC 1997
Integrated circuit design › interconnect
VLSI interconnect
0.011997
Hierarchical 2-D Field Solution for Capacitance Extraction for VLSI Interconnect Modeling · DAC 1997
Electronic design automation
boundary element method
0.011996
A Sparse Image Method for BEM Capacitance Extraction · DAC 1996

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

boundary element method · 0.1parasitic estimation · 0.0incremental global routing · 0.0device tuning · 0.0macromodeling · 0.0hierarchical field solution · 0.0preconditioning · 0.0
YearPublicationVenuePosition
2004 A synthesis flow toward fast parasitic closure for radio-frequency integrated circuits
abstract
An electrical and physical synthesis flow for high-speed analog and radio-frequency circuits is presented in this paper. Novel techniques aiming at fast parasitic closure are employed throughout the flow. Parasitic corners generated based on the earlier placement statistics are included for circuit resizing to enable parasitic robust designs. A performance-driven placement with simultaneous fast incremental global routing is proposed to achieve accurate parasitic estimation. Device tuning is utilized during layout to compensate for layout induced performance degradations. This methodology allows sophisticated macromodels of performances versus device variables and parasitics to be used during layout synthesis to make it truly performance-driven. Experimental results of a 4GHz LNA and a mixer demonstrate fast parasitic closure with this methodology.
E. Aykut Dengi, Ronald A. Rohrer, Rob A. Rutenbar, L. Richard Carley
DAC2
1998 Boundary Element Method Macromodels for 2-D Hierachical Capacitance Extraction
abstract
We presen t a new algorithm for computing the capacitance of three-dimensional perfect electrical conductors of complex structures. The new algorithm is significantly faster and uses muc h less memory than previous best algorithms, and is kernel independent.
E. Aykut Dengi, Ronald A. Rohrer
DAC1
1997 Hierarchical 2-D Field Solution for Capacitance Extraction for VLSI Interconnect Modeling
abstract
A hierarchical two-dimensional field solution technique isintroduced for capacitance extraction for VLSI interconnectmodeling. As a basis for compromise between the efficiencyof Boolean rules-based extraction and the accuracy of flatfield solution, this hierarchical approach can handlerealistic conductor cross-sections and multiple conformaland/or planarized dielectrics.
E. Aykut Dengi, Ronald A. Rohrer
DAC1
1996 A Sparse Image Method for BEM Capacitance Extraction
abstract
Boundary element methods (BEM) are often used for complex 3-D capacitance extraction because of their efficiency, ease of data preparation, and automatic handling of open regions.BEM capacitance extraction, however, yields a dense set of linear equations that makes solving via direct matrix methods such as Gaussian elimination prohibitive for large problem sizes.Although iterative, multipole-accelerated techniques have produced dramatic improvements in BEM capacitance extraction, accurate sparse approximations of the electrostatic potential matrix are still desirable for the following reasons.First, the corresponding capacitance models are sufficient for a large number of analysis and design applications.Moreover, even when the utmost accuracy is required, sparse approximations can be used to precondition iterative solution methods.In this paper, we propose a definition of electrostatic potential that can be used to formulate sparse approximations of the electrostatic potential matrix in both uniform and multilayered planar dielectrics.Any degree of sparsity can be obtained, and unlike conventional techniques which discard the smallest matrix terms, these approximations are provably positive definite for the troublesome cases with a uniform dielectric and without a groundplane.
Byron Krauter, E. Aykut Dengi, Lawrence T. Pileggi
DAC3