A netlist implementation of the Newton fixed-point homotopy method for MOS transistor circuits

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.