Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
An efficient finite element method for submicron IC capacitance extraction
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
An exact analytic technique for simulating uniform RC lines
EURO-DAC '92 Proceedings of the conference on European design automation
Accurate interconnect modeling: towards multi-million transistor chips as microwave circuits
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Hierarchical extraction of 3D interconnect capacitances in large regular VLSI structures
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
| Hi-index | 0.00 |
Accurate prediction of device current and the capacitance to be driven by that current is key to the design of integrated logic and memory circuits. A finite-element algorithm is described which simulates the capacitance of structures with general shape in two or three dimensions. Efficient solution of the linear equations is provided by the incomplete Cholesky conjugate gradient method. The model is used to simulate the wiring capacitance of a 1.25-micrometer VLSI technology. The predicted capacitances of closely spaced first-metal polycide-gate and second-metal conductors used in this technology agree with measured results. The simulated three-dimensional capacitance of a second-metal line crossing a first-metal line is twice that found when estimated by two-dimensional models. The effect of line-to-line capacitance on the noise margin of logic circuits and on the signal in a dynamic RAM is examined. This capacitance presents a limit to wiring density for logic circuits and is a significant signal detractor in dynamic RAMs with closely spaced metal or diffused bit lines.