• DocumentCode
    869389
  • Title

    On network partitioning algorithm of large-scale CMOS circuits

  • Author

    Deng, An-Cheng

  • Author_Institution
    Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA
  • Volume
    36
  • Issue
    2
  • fYear
    1989
  • fDate
    2/1/1989 12:00:00 AM
  • Firstpage
    294
  • Lastpage
    299
  • Abstract
    A topological partitioning algorithm which decouples the large-scale CMOS circuits into numerous small-scale subcircuits, in which each subcircuit can be individually analyzed with better overall efficiency, is discussed. The parasitic couplings between the partitioned subcircuits are shown to be negligible in most digital circuits. Bidirectional coupling between cross-coupled subcircuits is studied and a decoupling criterion is derived. The flexibility offered by the decoupled structure can be fully taken advantage of by using: (1) the latency; (2) the event-driven operation; and (3) the regular structure of the partitioned subcircuits. An experimental program, as a result from the partitioning algorithm, demonstrates a three-order-of-magnitude speed improvement over the SPICE program
  • Keywords
    CMOS integrated circuits; coupled circuits; network topology; decoupling criterion; efficiency; event-driven operation; large-scale CMOS circuits; latency; network partitioning algorithm; parasitic couplings; small-scale subcircuits; speed improvement; topological partitioning; Algorithm design and analysis; Circuit analysis computing; Circuit simulation; Coupling circuits; Delay; Digital circuits; Large-scale systems; MOS devices; MOSFET circuits; Nonlinear equations; Partitioning algorithms; SPICE; Switches; Switching circuits;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-4094
  • Type

    jour

  • DOI
    10.1109/31.20209
  • Filename
    20209