Abstract
Recently, an efficient and globally convergent Newton fixed-point homotopy method (NFPH) for MOS transistor circuits has been proposed to find dc solutions of nonlinear circuits. However, the programming of sophisticated homotopy methods is often difficult for non-experts. In this paper, an effective netlist implementation method for the MOS NFPH method is proposed and it can implement the MOS NFPH method from a good initial solution with various efficient techniques and without programming. Moreover, the “probe” algorithm in BJT circuits is extended to MOS NFPH method for achieving high efficiency and the existence theorem is given.
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.
