Hardware acceleration for full-wave analysis of integrated circuits

As circuit speeds increase and sizes decrease, lumped sum and quasi-static methods become inaccurate and rigorous analysis via the Method of Moments is then required to achieve accurate results. Unfortunately, this requires the solution of a large, dense matrix. Despite algorithmic advances, there is still a need for solving the system in less time. To this end, we have developed a prototype solver that implements a state-of-the-art algorithm in an accelerated hardware environment. In this paper, we examine our progress to date, which consists of the development of a matrix-vector-multiply unit, the key component of the design.

[1]  S. Kapur,et al.  N-body problems: IES3: Efficient electrostatic and electromagnetic simulation , 1998, IEEE Computational Science and Engineering.

[2]  Vikram Jandhyala,et al.  Oct-tree-based multilevel low-rank decomposition algorithm for rapid 3-D parasitic extraction , 2004, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  D.W. Prather,et al.  Hardware acceleration of the 3D finite-difference time-domain method , 2004, IEEE Antennas and Propagation Society Symposium, 2004..

[4]  S. Kapur,et al.  IES/sup 3/: efficient electrostatic and electromagnetic simulation , 1998 .