Cart (Loading....) | Create Account
Close category search window
 

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
$31 $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)
Ilsen, D. ; Vistec Semicond. Syst. GmbH, Weilburg ; Roebbers, E.J. ; Greuel, G.

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:

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

Date of Publication:

Nov. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.