Back to search

University of Thessaly (UTH)

Efficient techniques for handling and sparsification of dense matrices in very large-scale circuit simulation

Abstract

dc:description

The integration of more components into modern Systems-on-Chip (SoCs) due to the ever increasing technology scaling has led to very large parasitic networks consisting of million of nodes, which have to be simulated in many times or frequencies to verify the proper operation of chip. Moreover, because of the aggressive technology scaling, the reliability analysis of a SoC requires to take into account, except for the self-inductance which was sufficient in older technologies, but also the mutual inductance between the different subsystems in SoC. However, the inclusion of all mutual inductive couplings results in a fully dense inductance matrix that renders the circuit simulation computationally expensive. Model Order Reduction (MOR) techniques have been employed routinely to substitute the large scale parasitic model by a model of lower order with similar response at the input/output ports. However, all established MOR techniques result in dense system matrices that render their simulation impractical.To this end, in this dissertation we present efficient techniques for the solution of the linear systems arising in transient analysis of large mutually inductive circuits, as well as a methodology for the sparsification of the dense matrices resulting from MOR. The proposed techniques for solving the linear systems in transient analysis involve the compression of the dense inductance matrix, approximating suitably sub-blocks of it by low-rank products and the development of a general purpose preconditioner for the iterative solution of the transient linear system (which comprises sparse blocks alongside the dense inductance block). On the other hand, our proposed methodology for the sparsification of the dense MOR matrices employs a sequence of algorithms based on the computation of the nearest diagonally dominant matrix, which has a direct correspondence to graph and the subsequent sparsification of that graph. Experimental results for the sparsification of the dense MOR matrices indicate that high sparsity ratio of the reduced system matrices can be achieved with very small loss of accuracy, while the proposed techniques for solving the linear systems in transient analysis of large mutually inductive circuits indicate substantial compression rates of the dense inductance matrix without compromising accuracy, along with considerable reduction in iteration count and execution time of iterative solution methods.

Degree

thesis:*
Grantor dc:publisher
University of Thessaly (UTH)
Year dc:date
2019

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Antoniadis, Charalampos
  • Αντωνιάδης, Χαράλαμπος

Subjects

dc:subject × 17

Rights

Language dc:language
eng

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/46569

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Antoniadis, Charalampos; Αντωνιάδης, Χαράλαμπος. Efficient techniques for handling and sparsification of dense matrices in very large-scale circuit simulation. University of Thessaly (UTH), 2019. http://hdl.handle.net/10442/hedi/46569