In this paper, a novel algorithm for creating efficient reduced-order macromodels from massively coupled interconnect structures is described. The new algorithm addresses the difficulty associated with the reduction of networks with a large number of input/output terminals, that often results in large and dense reduced-order models. Application of the proposed reduction algorithm leads to reduced-order models that are sparse and block-diagonal in nature. An additional advantage of the proposed algorithm is that it does not assume any correlation between the responses at ports and thereby overcomes the accuracy degradation that is normally associated with the existing singular value decomposition based terminal reduction techniques. Also, the presented algorithm is highly suited for multithreading implementation and thus facilitates parallel transient simulation. Validity and efficiency of the proposed algorithm are demonstrated through computational results.

Additional Metadata
Keywords Clustering, high-speed interconnects, Krylov subspace, macromodeling, model order reduction, moment-matching, multiconductor transmission lines, parallel processing, passivity, projection, stability
Persistent URL
Journal IEEE Transactions on Components, Packaging and Manufacturing Technology
Nouri, B. (Behzad), Nakhla, M.S, & Achar, R. (2013). Efficient reduced-order macromodels of massively coupled interconnect structures via clustering. IEEE Transactions on Components, Packaging and Manufacturing Technology, 3(5), 826–840. doi:10.1109/TCPMT.2012.2234503