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

Dan Niu, Yasuaki Inoue, Zhou Jin, Xiao Wu

    研究成果: Conference contribution

    抄録

    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.

    本文言語English
    ホスト出版物のタイトルMidwest Symposium on Circuits and Systems
    出版社Institute of Electrical and Electronics Engineers Inc.
    2015-September
    ISBN(印刷版)9781467365574
    DOI
    出版ステータスPublished - 2015 9月 28
    イベント58th IEEE International Midwest Symposium on Circuits and Systems, MWSCAS 2015 - Fort Collins, United States
    継続期間: 2015 8月 22015 8月 5

    Other

    Other58th IEEE International Midwest Symposium on Circuits and Systems, MWSCAS 2015
    国/地域United States
    CityFort Collins
    Period15/8/215/8/5

    ASJC Scopus subject areas

    • 電子工学および電気工学
    • 電子材料、光学材料、および磁性材料

    フィンガープリント

    「A netlist implementation of the Newton fixed-point homotopy method for MOS transistor circuits」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル