2007
DOI: 10.1109/tcsii.2007.896935
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Variable Gain Homotopy Method Using the SPICE-Oriented Approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 18 publications
0
7
0
Order By: Relevance
“…Five types of practical circuits widely used in analog LSIs are considered in this comparison. These circuits consist of an Ebers-Moll BJT and have convergence issues in the SPICE software but are frequently used as a test circuits [7,8]:…”
Section: Comparison Of the Proposed Algorithm And Other Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Five types of practical circuits widely used in analog LSIs are considered in this comparison. These circuits consist of an Ebers-Moll BJT and have convergence issues in the SPICE software but are frequently used as a test circuits [7,8]:…”
Section: Comparison Of the Proposed Algorithm And Other Methodsmentioning
confidence: 99%
“…The continuation method, proposed in [3][4][5][6][7][8][9][10][11], is an effective method to solve nonlinear circuits. The continuation method is based on 3 steps:…”
Section: Introductionmentioning
confidence: 99%
“…Probability-one homotopy algorithms are a class of embedding algorithms that promise global convergence [5,61]. Various homotopy algorithms have been introduced for finding multiple solutions of nonlinear circuit equations [4,40] and for finding dc operating points of transistor circuits [16,24,28,43,56,58,68]. Homotopy algorithms were implemented in a number of developed stand-alone circuit simulators [69,70], simulators developed based on SPICE [55,58], and proprietary industrial tools designed for simulation of analog circuits such as ADVICE at AT&T [12,34,51,52] and TITAN at Siemens [33].…”
Section: Parameter Embedding and Continuation Methodsmentioning
confidence: 99%
“…The solution is unique if the extended Jacobian matrix (27) is of full rank. Conditions (28) define the starting value of λ, the starting point for x, and ensure that the sign and the magnitude ofẏ are fixed in the implementation. The solutionẏ is found by solving linear differential equation (29) using standard linear solvers via the QR factorization algorithm [30].…”
Section: Numerical Solvermentioning
confidence: 99%
“…Hence, it is much simpler than the method using DC analysis. If we already have the netlist of the original circuit N, then we can obtain the netlist of N p through a small modification to that of N. It is noted that the proposed method is a kind of SPICE-oriented approach [16].…”
Section: Methods Using Transient Analysismentioning
confidence: 99%