首页> 外文会议>IEEE Antennas and Propagation Society International Symposium >Electromagnetics-Based Co-Simulation of Linear Network and Nonlinear Circuits Accelerated by Time-Domain Orthogonal Finite-Element Reduction-Recovery Method
【24h】

Electromagnetics-Based Co-Simulation of Linear Network and Nonlinear Circuits Accelerated by Time-Domain Orthogonal Finite-Element Reduction-Recovery Method

机译:基于电磁的基于线性网络和非线性电路的共模,通过时域正交有限元减少恢复方法加速

获取原文

摘要

The co-simulation of electromagnetic structures and nonlinear circuits has been explored in the framework of the finite-difference time-domain method, the time-domain finiteelement method [1], and the time-domain integral equation method. However, they often have been found not amenable for on-chip VLSI design because of unique on-chip modeling challenges and large number of nonlinear devices. Recently, a time-domain layered finite-element reduction-recovery (LAFE-RR) based nonlinear-linear cosimulation algorithm was developed for solving large-scale integrated circuits and package problems [2-3]. This method can reduce the system matrix of 0(N) rigorously to that of 0(M) for any multilayered structure, with N being the number of unknowns in the entire 3-D structure, and M the number of unknowns on a single surface. Furthermore, the reduction from O(N) to O(M) was achieved analytically. The reduced linear-nonlinear coupled system is solved and the rest of the unknowns are then recovered in linear complexity. However, the reduced single-surface linear-nonlinear system is a strongly coupled system which either introduces a dense submatrix in the Jacobian matrix of the Newton's method or introduces extra iterations in the solution procedure. When the number of devices is large, the large dense submatrix or the large number of iterations will limit the capacity of this algorithm.
机译:在有限差分时域方法,时域贴心方法[1]和时域积分方程方法的框架中,已经探讨了电磁结构和非线性电路的共模。然而,由于片上芯片建模挑战和大量非线性设备,它们通常已被发现不适合片内的VLSI设计。最近,开发了一种基于时域分层有限元缩减回收(Lafe-RR)的非线性线性辅助算法,用于解决大规模集成电路和包装问题[2-3]。该方法可以严格地将0(n)的系统矩阵减少到任何多层结构的0(m),n为整个3-d结构中未知数的数量,并且在单个表面上的未知数的数量。此外,分析地实现了从O(n)至O(m)的减少。求解减小的线性非线性耦合系统,然后以线性复杂性回收未知数的其余部分。然而,减少的单表面线性非线性系统是强耦合系统,可以在牛顿方法的雅各比矩阵中引入密集的子矩阵,或者在解决方案过程中引入额外的迭代。当设备数量大时,大密度的次数或大量迭代将限制该算法的容量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号