Location of Repository

Scalable Symbolic Model Order Reduction ∗

By Yiyu Shi and Lei He

Abstract

Symbolic model order reduction (SMOR) is to reduce the complexity of a model with symbolic parameters. It is an important problem in analog circuit synthesis and digital circuit modeling with process variations. However, existing symbolic model order reduction (SMOR) methods do not scale well with the number of symbols or with the model order. This paper presents a scalable SMOR algorithm, namely S 2 MOR. We first separate the original multi-port multi-symbol system into a set of single-port systems by superposition theorem, and then integrate them together to form a lower-bordered block diagonal (LBBD) structured system. Each block is reduced independently, with a stochastic programming to distribute the given overall model order between blocks for best accuracy. The entire system is efficiently solved by lowrank update. Compared with existing SMOR algorithms, given the same memory space, S 2 MOR improves accuracy by up to 78 % at a similar reduction time. In addition, the factorization and simulation of the reduced model by S 2 MOR is up to 17× faster. 1

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.363.1604
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.bmas-conf.org/2008/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.