Premium
An efficient algorithm for finding all DC solutions of piecewise‐linear circuits
Author(s) -
Yamamura Kiyotaka,
Machida Akinori
Publication year - 2008
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.472
Subject(s) - simplex algorithm , piecewise linear function , linear programming , algorithm , mathematics , monotone polygon , piecewise , regular polygon , simplex , electronic circuit , dual (grammatical number) , simple (philosophy) , mathematical optimization , computer science , combinatorics , mathematical analysis , engineering , philosophy , geometry , literature , epistemology , electrical engineering , art
An efficient algorithm is proposed for finding all DC solutions of transistor circuits where characteristics of transistors are represented by piecewise‐linear (PWL) convex monotone functions. This algorithm is based on a simple test (termed the linear programming, LP, test) for non‐existence of a solution to a system of PWL equations in a given region. In the conventional LP test, the system of PWL equations is transformed into an LP problem by surrounding component PWL functions by rectangles. Then the dual simplex method is applied, by which the number of pivotings per region becomes very small. In this letter, we propose a new LP test using the dual simplex method and triangles . The proposed test is not only efficient but also more powerful than the conventional test using the simplex method or rectangles. Copyright © 2008 John Wiley & Sons, Ltd.