Generalized method of the time-domain circuit simulation based on LIM with MNA formulation

Abstract

In this paper, we show the generalized method of the time-domain circuit simulation based on LIM. First, the formulation of the circuit for LIM is modified and generalized. Furthermore, the modified simulation algorithm is suggested. As a result, our method is applicable to any structure of circuits. Some example circuits are simulated and the proposed method is compared with the conventional ones, in order to show the validity and efficiency of our method.

Fast Circuit Simulation Based on Parallel-Distributed LIM using Cloud Computing System

“…Unlike the conventional SPICE-like simulators which require the time-consuming LU decomposition of large scale coefficient matrices, the LIM algorithm does not need directly the matrix operations. In fact, because of its linearly-increasing characteristic of the calculation amount of the LIM algorithm, LIM-based simulation is much faster than the conventional methods for largescale networks [1][2][3][4][5].…”

“…LIM has been proactively proposed as one of the fast transient simulation methods applicable to large networks [1][2][3][4][5]. The algorithm of LIM is analogous to the relaxation-based one which does not need matrix operations and it seems that this is suitable for the parallel implementation.…”

Competing and Accommodating Behaviors of Peace SOM

“…Since the plane circuit shown in Fig. 1 is linear, the output functions (6) and (7) are redefined by the linear ones as Úݽ ´Øµ Úܽ ´Øµ (10) Úݾ ´Øµ Úܾ ´Øµ…”

“…However, these methods need to solve a set of linear equations simultaneously, which prohibits the application of these methods to the large scale problems. To analyze the large scale and stiff circuits, we use the leapfrog method [10] which is a derivative of FDTD method [11] for circuit simulation [9].…”

“…Alternatively, the implicit numerical integration methods such as backward Euler, backward difference, and Gear methods [8], which are used in SPICE-like simulators, are applicable to solving the stiff problems, but these methods are computationally inefficient since they need to solve a set of equations simultaneously at each time point. To reduce the computational costs, we introduce the leapfrog method [9], [10], where the state vectors in the first and second layers are decoupled and updated by turns in the manner as the forward Euler method. This method is a derivative of FDTD method [11] which is known as a Maxwell's solver.…”