Abstract
This contribution presents new algorithms for the automatic simplified computation of symbolic transfer functions of linear circuits. The problem of symbolic simplification of transfer functions is defined and a set of algorithms able to cope with this problem and the simplified computation of poles and zeroes is developed and discussed. Results are reported with examples of circuits analyzed by our algorithms, showing good accuracy in their approximation, when compared to the corresponding SPICE simulations. Our technique merges the simplification procedure and the evaluation of the transfer functions, thus achieving significant improvements in terms of CPU time, compared with direct evaluation of the functions themselves.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
