By Topic

Algebraic and Combinatorial Algorithms for Translinear Network Synthesis

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

3 Author(s)
David Ilsen ; Vistec Semicond. Syst. GmbH, Weilburg ; Ernst Josef Roebbers ; Gert-Martin Greuel

We propose a new approach for static translinear network synthesis. We model the network topology in terms of graph theory, leading to a catalog of valid translinear networks. The catalog serves as a synthesis tool for circuits with given desired input-output behavior. Methods from algebraic geometry and computer algebra are used to match the desired behavior with the models from the catalog, turning our approach into a powerful synthesis tool for analog circuits. The strategy is applied successfully to new circuits for industrial use.

Published in:

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