Effective implementation and embedding algorithms of CEPTA method for finding DC operating points

Zhou Jin, Xiao Wu, Dan Niu, Yasuaki Inoue

    Research output: Contribution to journalArticlepeer-review

    9 Citations (Scopus)


    Recently, the compound element pseudo transient analysis, CEPTA, method is regarded as an efficient practical method to find DC operating points of nonlinear circuits when the Newton-Raphson method fails. In the previous CEPTA method, an effective SPICE3 implementation algorithm was proposed without expanding the Jacobian matrix. However the limitation of step size was not well considered. Thus, the non-convergence problem occurs and the simulation efficiency is still a big challenge for current LSI nonlinear cicuits, especially for some practical large-scale circuits. Therefore, in this paper, we propose a new SPICE3 implementation algorithm and an embedding algorithm, which is where to insert the pseudo capacitors, for the CEPTA method. The proposed implementation algorithm has no limitation for step size and can significantly improve simulation efficiency. Considering the existence of various types of circuits, we extend some possible embedding positions. Numerical examples demonstrate the improvement of simulation efficiency and convergence performance.

    Original languageEnglish
    Pages (from-to)2524-2532
    Number of pages9
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    Issue number12
    Publication statusPublished - 2013


    • Circuit simulation
    • DC operating point
    • Embedding position
    • Nonlinear circuit
    • Pseudo transient analysis
    • SPICE

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Computer Graphics and Computer-Aided Design
    • Applied Mathematics
    • Signal Processing


    Dive into the research topics of 'Effective implementation and embedding algorithms of CEPTA method for finding DC operating points'. Together they form a unique fingerprint.

    Cite this