论文信息 - From O(k2N) to O(N): A fast complex-valued eigenvalue solver for large-scale on-chip interconnect analysis

From O(k2N) to O(N): A fast complex-valued eigenvalue solver for large-scale on-chip interconnect analysis

In general, the optimal computational complexity of Arnoldi iteration is O(k2N) for solving a generalized eigenvalue problem, with k being the number of dominant eigenvalues and N the matrix size. In this work, we reduce the computational complexity of the Arnoldi iteration from O(k2N) to O(N), thus paving the way for full-wave extraction of very large-scale on-chip interconnects, the k of which is hundreds of thousands. Numerical and experimental results have demonstrated the accuracy and efficiency of the proposed fast eigenvalue solver.

Cheng-Kok Koh | Jongwon Lee | Dan Jiao | Venkataramanan Balakrishnan

[1] Cheng-Kok Koh,et al. A linear-time eigenvalue solver for finite-element-based analysis of large-scale wave propagation problems in on-chip interconnect structures , 2008, 2008 IEEE Antennas and Propagation Society International Symposium.

[2] Kaushik Roy,et al. On-chip interconnect modeling by wire duplication , 2002, ICCAD 2002.

[3] D. Jiao,et al. A novel technique for full-wave modeling of large-scale three-dimensional high-speed on/off-chip interconnect structures , 2003, International Conference on Simulation of Semiconductor Processes and Devices, 2003. SISPAD 2003..

[4] Dan Jiao,et al. A Fast Frequency-Domain Eigenvalue-Based Approach to Full-Wave Modeling of Large-Scale Three-Dimensional On-Chip Interconnect Structures , 2008, IEEE Transactions on Advanced Packaging.