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

A netlist implementation of the Newton fixed-point homotopy method for MOS transistor circuits
复制标题

DOI:
10.1109/mwscas.2015.7282088
复制
发表时间:
2015-10
期刊:
2015 IEEE 58th International Midwest Symposium on Circuits and Systems (MWSCAS)
影响因子:
--
通讯作者:
Dan Niu;Y. Inoue;Zhou Jin;Xiao Wu
Dan Niu;Y. Inoue;Zhou Jin;Xiao Wu
中科院分区:
其他
文献类型:
--
作者:
Dan Niu;Y. Inoue;Zhou Jin;Xiao Wu

文献摘要

相似文献

近年来,提出了一种适用于MOS晶体管电路的全局收敛的牛顿不动点同伦方法来求解非线性电路的直流解。然而,对于非专家来说,复杂同伦方法的规划往往是困难的。本文提出了一种有效的MOS NFPH方法的网表实现方法,该方法可以在不编程的情况下,利用多种高效的技术从良好的初始解中实现MOS NFPH方法。此外,为了提高效率,将BJT电路中的“探针”算法扩展到MOS NFPH方法,并给出了存在性定理。
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.