High-Dimensional Extension of the TICER Algorithm

被引:5
|
作者
Hao, Limin [1 ]
Shi, Guoyong [1 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Elect Informat & Elect Engn, Dept Micro Nano Elect, Shanghai 200240, Peoples R China
关键词
Integrated circuit modeling; Approximation algorithms; Impedance; Passive networks; Capacitance; Symmetric matrices; Transfer functions; Driving point impedance (DPI); model order reduction; post-layout simulation; realizable RC reduction; time-constant equilibration reduction (TICER); REALIZABLE REDUCTION; MODEL; CIRCUITS; RC;
D O I
10.1109/TCSI.2021.3106390
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The TICER (TIme-Constant Equilibration Reduction) algorithm is a well-known resistor-capacitor (RC) network reduction algorithm. It finds wide applications in integrated circuit post-layout simulation tools. However, the original algorithm is one-dimensional in that each step eliminates one circuit node to obtain an approximately equivalent circuit by connecting additional elements to the neighboring nodes after each elimination. This work extends the TICER algorithm to its high-dimensional version in the sense that each step eliminates a subcircuit as a whole to obtain an approximately equivalent circuit, again by connecting extra elements to the neighboring nodes after each elimination. In practice the high-dimensional TICER (HD-TICER) algorithm finds many advantages over the classical one-dimensional TICER (1D-TICER) algorithm, which is a special case of the HD-TICER algorithm. An elegant mathematical derivation of the HD-TICER algorithm is provided by applying the notion of driving point impedance (DPI). The advantages of the HD-TICER algorithm are demonstrated by application to reductions of some purely resistive networks and RC networks. An approximate time constant estimation method is also provided for selection of a subblock circuit to eliminate.
引用
收藏
页码:4722 / 4734
页数:13
相关论文
共 50 条
  • [21] A Small World Algorithm For High-Dimensional Function Optimization
    Li Xiaohu
    Zhang Jinhua
    Wang Sunan
    Li Maolin
    Li Kunpeng
    IEEE INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN ROBOTICS AND AUTOMATION, 2009, : 55 - 59
  • [22] Chaotic Cuckoo Search Algorithm for High-dimensional Functions
    Ouyang, Aijia
    Pan, Guo
    Yue, Guangxue
    Du, Jiayi
    JOURNAL OF COMPUTERS, 2014, 9 (05) : 1282 - 1290
  • [23] Clustering algorithm of high-dimensional data based on units
    School of In formation Engineering, Hubei Institute for Nationalities, Enshi 445000, China
    Jisuanji Yanjiu yu Fazhan, 2007, 9 (1618-1623): : 1618 - 1623
  • [24] A fast iterative algorithm for high-dimensional differential network
    Zhou Tang
    Zhangsheng Yu
    Cheng Wang
    Computational Statistics, 2020, 35 : 95 - 109
  • [25] An effective and efficient algorithm for high-dimensional outlier detection
    Aggarwal, CC
    Yu, PS
    VLDB JOURNAL, 2005, 14 (02): : 211 - 221
  • [26] A node elimination algorithm for cubature of high-dimensional polytopes
    Slobodkins, Arkadijs
    Tausch, Johannes
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2023, 144 : 229 - 236
  • [27] A fast shadowing algorithm for high-dimensional ODE systems
    Hayes, Wayne B.
    Jackson, Kenneth R.
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2007, 29 (04): : 1738 - 1758
  • [28] A Range Query Parallel Algorithm in High-dimensional Space
    Xu, Hongbo
    Yao, Nianmin
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY, PTS 1-4, 2013, 263-266 : 2308 - 2313
  • [29] Algorithm to estimate the Hurst exponent of high-dimensional fractals
    Carbone, Anna
    PHYSICAL REVIEW E, 2007, 76 (05):
  • [30] SARA: A memetic algorithm for high-dimensional biomedical data
    Baliarsingh, Santos Kumar
    Muhammad, Khan
    Bakshi, Sambit
    APPLIED SOFT COMPUTING, 2021, 101