EDBT 2026 Demo / reviewers in the wild / expert
Chi Ping Ju
dblp:83/6967
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1989
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › physical design › parasitic extraction
interconnect capacitance extraction |
0.0 | 1 | 1989 | Three-dimensional capacitance computations for VLSI/ULSI interconnections · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989 |
Electronic design automation › physical design
parasitic extraction |
0.0 | 1 | 1989 | Three-dimensional capacitance computations for VLSI/ULSI interconnections · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989 |
Electronic design automation
physical design |
0.0 | 1 | 1989 | Three-dimensional capacitance computations for VLSI/ULSI interconnections · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989 |
Methods — techniques the papers use, named apart from their topics
successive over-relaxation · 0.0parallel processing · 0.0domain contraction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | Three-dimensional capacitance computations for VLSI/ULSI interconnectionsabstractThree-dimensional simulations of metallization wires of VLSI/ULSI interconnections that are plagued with unreasonably large memory requirements and execution times are discussed. A strategy is presented for overcoming these problems. A principal feature is the use of a domain contraction technique, which accounts for the fringing electric field throughout the infinite domain above and below the levels where the wires appear and provides a major reduction in the number of nodal points for a finite-difference computation. Moreover, an iterative method (successive over-relaxation) is used to alleviate memory requirements, a nonuniformly distributed nodal array is used to reduce the number of nodal points still further, and parallel processing is used to reduce execution time. It is argued that rounded edges and corners for the simulation of the wires are the only appropriate configurations at current levels of miniaturization. This avoids the problem of electric-field singularities at sharp edges and corners and results in significantly reduced capacitance coefficients.> Armen H. Zemanian, Reginald P. Tewarson, Chi Ping Ju, Juif Frank Jen |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 3 |