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

Martin Bächtold

dblp:46/571 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 3 · 3 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
3 papers
Electronic design automation · 76% Performance modeling and evaluation · 17% High-performance computing · 6%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
parasitic extraction
0.132000
A system for full-chip and critical net parasitic extraction for ULSI interconnects using a fast 3-D field solver · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2000
An error indicator and automatic adaptive meshing for electrostatic boundary element simulations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Enhanced multipole acceleration technique for the solution of large Poisson computations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation
physical design
0.132000
A system for full-chip and critical net parasitic extraction for ULSI interconnects using a fast 3-D field solver · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2000
An error indicator and automatic adaptive meshing for electrostatic boundary element simulations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Enhanced multipole acceleration technique for the solution of large Poisson computations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation
boundary element method
0.021997
An error indicator and automatic adaptive meshing for electrostatic boundary element simulations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Enhanced multipole acceleration technique for the solution of large Poisson computations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation
hardware verification and test
0.021997
An error indicator and automatic adaptive meshing for electrostatic boundary element simulations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Enhanced multipole acceleration technique for the solution of large Poisson computations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Performance modeling and evaluation
simulation
0.021997
An error indicator and automatic adaptive meshing for electrostatic boundary element simulations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Enhanced multipole acceleration technique for the solution of large Poisson computations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996
Electronic design automation › physical design › parasitic extraction
capacitance extraction
0.012000
A system for full-chip and critical net parasitic extraction for ULSI interconnects using a fast 3-D field solver · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2000
High-performance computing › scientific computing systems
adaptive mesh refinement
0.011997
An error indicator and automatic adaptive meshing for electrostatic boundary element simulations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Performance modeling and evaluation › numerical algorithms
fast multipole method
0.011996
Enhanced multipole acceleration technique for the solution of large Poisson computations · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1996

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

boundary element method · 0.13-d field solver · 0.0p-type refinement · 0.0h-type refinement · 0.0error indicator · 0.0poisson equation · 0.0multipole acceleration · 0.0
YearPublicationVenuePosition
2000 A system for full-chip and critical net parasitic extraction for ULSI interconnects using a fast 3-D field solver
abstract
As integrated circuit (IC) manufacturing technology pushes toward the deep submicron (DSM) regime, the interconnect behavior begins to dominate the overall chip performance. Traditional interconnect characterization methods do not offer the required accuracy or the versatility to tackle challenges of DSM design. We present a system for interconnect parasitic capacitance extraction using an extremely fast three-dimensional (3-D) solver, capable of handling general geometry configurations and providing high accuracy. The contributions in this work make 3-D field solvers an attractive and, for the first time, computationally feasible approach to calculating interconnect parasitics. The system represents a significant performance leap in 3-D interconnect characterization, making it well suited for full-chip extraction and for high-accuracy characterization of critical nets, block IP, and standard and custom cell designs.
Martin Bächtold, Mirko Spasojevic, Christian Lage, Per B. Ljung
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1997 An error indicator and automatic adaptive meshing for electrostatic boundary element simulations
abstract
Accurate electrostatic simulations are required for the analysis of micro electromechanical systems (MEMS) and interconnects in very large scale integration (VLSI) design. Typical simulations involve complex three-dimensional (3-D) geometries together with various dielectric materials, conductors, and boundary conditions. The boundary element method is well suited for such computations. For highly accurate solutions, the meshing of the geometry becomes increasingly important. A scheme is presented which allows generating an optimal mesh automatically based on a coarse initial discretization, e.g., a CAD model. An error indicator derived from boundary integral equations monitors the solution accuracy in each boundary element. H-type or p-type mesh refinement is applied to areas which contribute strongly to the overall error. The method applies to both two-dimensional (2-D) and 3-D simulations containing elements of various orders and shapes. The generated refined meshes result in significantly higher solution accuracy for a given simulation size.
Martin Bächtold, Markus Emmenegger, Jan G. Korvink, Henry Baltes
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1996 Enhanced multipole acceleration technique for the solution of large Poisson computations
abstract
The solution of Poisson's simulations in large, geometrically complex domains with various boundary conditions are of interest in many physical computations. In this paper, we focus on electrostatic analysis. This is important for microactuator (MEMS) and interconnect modeling and also in the simulation of the electrostatic properties in VLSI chips, such as CCD sensors and DRAM cells. The computation of the static electric potential and field distribution involves the solution of the Poisson's equation, or in case of charge free space, Laplace's equation. The boundary element method has proven to be well suited for the solution of these partial differential equations in both 2- and 3-D. The required computational resources can be significantly reduced with the use of multipole acceleration techniques. An enhanced multipole (MP) acceleration technique is presented, allowing for reduced computational time and memory requirements in all stages of the computational process: the assembly of the global system of equations, the solution of the system and the evaluation of the potential and flux at specified internal positions. Contrary to previous applications of MP acceleration to Poisson's equation, the method allows the treatment of a wider class of boundary conditions, including Neumann and floating. The method is applicable both in two and three dimensions using a constant or high order boundary elements.
Martin Bächtold, Jan G. Korvink, Henry Baltes
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1