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

Efthymios Efstathiou

dblp:152/9055 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0001-5249-4311ORCID · reported

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

Systems, architecture and hardware · 1 · 1 since 2021

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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › parasitic extraction
capacitance extraction
0.712023
Deep-Learning-Driven Random Walk Method for Capacitance Extraction · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023
Electronic design automation › physical design
parasitic extraction
0.712023
Deep-Learning-Driven Random Walk Method for Capacitance Extraction · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2023

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

group-equivariant convolutional neural networks · 0.7green's function approximation · 0.7finite difference method · 0.7
YearPublicationVenuePosition
2023 Deep-Learning-Driven Random Walk Method for Capacitance Extraction
abstract
Random-walk-based methods for solving partial differential equations (PDEs) exhibit significant advantages and applicability to numerous domains. One of these is parasitic capacitance extraction in modern silicon technologies, where they are essentially called upon to solve a boundary-value problem. In this regime, fast and accurate calculation of Green’s function within the transition domains of the random walk is critical for competitive performance. Silicon processes in advanced nodes introduce complex or special dielectric structures that challenge currently established methods for characterizing Green’s function. In this article, a novel approximation method for Green’s function and Green’s function gradient is presented, which leverages group-equivariant convolutional neural networks (G-CNNs). This can accompany existing multitier Green’s function data precomputation schemes. Additionally, it enables performing the crucial step of sampling according to Green’s function without explicit calculation of Green’s function itself. A novel end-to-end random-walk architecture is discussed which incorporates such deep neural networks, and its utility is demonstrated through numerical experiments. The proposed scheme enjoys massive gains in terms of speed for advanced CMOS nm node setups with nonplanar dielectric media, compared to a straight finite differences method (FDM) solution, while maintaining good accuracy levels.
Marios Visvardis, Periklis Liaskovitis, Efthymios Efstathiou
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3