By Topic

Fast and Efficient Search for All DC Solutions of PWL Circuits by Means of Oversized Polyhedra

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Stefano Pastore ; Dipt. di Elettrotec., Elettron. e Inf., Univ. di Trieste, Trieste, Italy

A fast and efficient method for finding all dc solutions of resistive piecewise linear (PWL) circuits is proposed. This method is based on the introduction of suitable polyhedra, denoted as oversized, surrounding a sequence of certain portions of PWL characteristics. Unlike the minimum-sized polyhedra introduced in the standard polyhedral method, these oversized polyhedra are characterized by simple polygons (for example, triangles) with a low number of vertices. The overall algorithm is so structured according to a sequence of binary trees, composed of nodes connected by oriented arcs, and it is based on a linear programming test characterized by low-dimension tableaux. The advantages of using polyhedra with a few number of vertices are double: There are minor numerical errors in tableau solutions, and the total CPU time decreases remarkably. Therefore, it is possible to deal with higher rank circuits in comparison with the standard polyhedral method.

Published in:

IEEE Transactions on Circuits and Systems I: Regular Papers  (Volume:56 ,  Issue: 10 )