A practical regularization technique for modified nodal analysis in large-scale time-domain circuit simulation

Fast full-chip time-domain simulation calls for advanced numerical integration techniques with capability to handle the systems with (tens of) millions of variables resulting from the modified nodal analysis (MNA). General MNA formulation, however, leads to a differential algebraic equation (DAE) system with singular coefficient matrix, for which most of explicit methods, which usually offer better scalability than implicit methods, are not readily available. In this paper, we develop a practical two-stage strategy to remove the singularity in MNA equations of large-scale circuit networks. A topological index reduction is first applied to reduce the DAE index of the MNA equation to one. The index-1 system is then fed into a systematic process to eliminate excess variables in one run, which leads to a nonsingular system. The whole regularization process is devised with emphasis on exact equivalence, low complexity, and sparsity preservation, and is thus well suited to handle extremely large circuits. © 2012 IEEE.published_or_final_versio

A constraint-aware heuristic path planner for finding energy-efficient paths on uneven terrains

2014-2015 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

Rapid replanning of energy-efficient paths for navigation on uneven terrains

2015-2016 > Academic research: refereed > Refereed conference paperAccepted ManuscriptPublishe

Effects of correlation-based VM allocation criteria to cloud data centers

2016-2017 > Academic research: refereed > Refereed conference paper201804_a bcmapreprint_postprin

DOCS: Domain-Aware Crowdsourcing System

published_or_final_versio

An Indexing Framework for Queries on Probabilistic Graphs

postprin

Development of packaging and electrical interfacing for electrical vehicles

Author name used in this publication: K. W. E. ChengAuthor name used in this publication: S. L. HoRefereed conference paper2006-2007 > Academic research: refereed > Refereed conference paperVersion of RecordPublishe

Multiobjective path planning on uneven terrains based on NAMOA*

2015-2016 > Academic research: refereed > Refereed conference paperAccepted ManuscriptPublishe

A stable matching-based virtual machine allocation mechanism for cloud data centers

2016-2017 > Academic research: refereed > Refereed conference paper201803_a bcwhpreprint_postprin

A block-diagonal structured model reduction scheme for power grid networks

We propose a block-diagonal structured model order reduction (BDSM) scheme for fast power grid analysis. Compared with existing power grid model order reduction (MOR) methods, BDSM has several advantages. First, unlike many power grid reductions that are based on terminal reduction and thus error-prone, BDSM utilizes an exact column-by-column moment matching to provide higher numerical accuracy. Second, with similar accuracy and macromodel size, BDSM generates very sparse block-diagonal reduced-order models (ROMs) for massive-port systems at a lower cost, whereas traditional algorithms such as PRIMA produce full dense models inefficient for the subsequent simulation. Third, different from those MOR schemes based on extended Krylov subspace (EKS) technique, BDSM is input-signal independent, so the resulting ROM is reusable under different excitations. Finally, due to its blockdiagonal structure, the obtained ROM can be simulated very fast. The accuracy and efficiency of BDSM are verified by industrial power grid benchmarks. © 2011 EDAA.published_or_final_versionDesign, Automation and Test in Europe Conference and Exhibition (DATE 2011), Grenoble, France, 14-18 March 2011. In Design, Automation, and Test in Europe Conference and Exhibition Proceedings, 2011, p. 44-4