Modeling of Distributed RLC Interconnect and Transmission Line via Closed Forms and Recursive Algorithms
Modeling of Distributed RLC Interconnect and Transmission Line via Closed Forms and Recursive Algorithms
复制标题
通过封闭形式和递归算法对分布式 RLC 互连和传输线进行建模
DOI：
--
复制
发表时间：
2010
影响因子：
2.8
通讯作者：
Ben Wang
中科院分区：
文献类型：
--
作者：
Sheng;Ben Wang
本文提出了状态空间模型的封闭形式和传递函数模型的递归算法，用于快速准确地建模分布式RLC互连和传输线，这可能是均匀的或不均匀分布。所考虑的模型包括分布式RLC互连线有或没有外部源和负载连接。有效的封闭形式和递归算法不涉及任何矩阵求逆，LU矩阵分解，或矩阵乘法，从而大大降低了计算复杂度。特别地，对于任意均匀分布和非均匀分布的RLC互连线电路，闭型的计算复杂度分别为O（1）和O（m），其中m是系统阶数的整数倍.新的递归算法的特点是两个递归的s-多项式和低的计算复杂度。实例说明了新方法在时域和频域。与PSpice相比，新方法可以显著减少时间响应和Bode图的运行时间25% - 98.5%。研究结果可应用于RLC互连线的分析和模型降阶，为新方法的研究奠定基础。
This paper presents the closed forms of the state-space models and the recursive algorithms of the transfer function models for fast and accurate modeling of the distributed RLC interconnect and transmission lines, which may be evenly or unevenly distributed. Considered models include the distributed RLC interconnect lines with or without external source and load connection. The effective closed forms and recursive algorithms do not involve any matrix inverse, LU matrix factorization, or matrix multiplication, thus reducing the computation complexity dramatically. Especially, the computation complexity of the closed forms for any evenly or unevenly distributed RLC interconnect line circuits is only O(1) or O(m), respectively, in sense of the scalar multiplication times, where m ¿ N of the system order. The features of new recursive algorithms are two recursive s-polynomials and the low computation complexity. Examples illustrate the new methods in both time and frequency domains. Comparing with the PSpice, the new methods can dramatically reduce the runtime of the time responses and the Bode plots by 25% - 98.5% in the examples. The results can be applied to the RLC interconnect analysis and model reduction as a key to new approach.