• Title of article

    Transistor chaining in static CMOS functional cells of arbitrary planar topology Original Research Article

  • Author/Authors

    Bradley A. Carlson، نويسنده , , C.Y.Roger Chen، نويسنده , , Dikran S Meliksetian، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1998
  • Pages
    26
  • From page
    89
  • To page
    114
  • Abstract
    A technique for chaining the transistors in the layouts of static CMOS leaf cells is presented and analyzed. This new method is superior to existing techniques, since it can operate on a more general class of circuits and is very efficient. It is shown that the layout width of a CMOS leaf cell can be significantly reduced (nearly 40% in the average case) by transistor chaining. Moreover, more than half of the switching functions of four variables have optimal CMOS circuit implementations with non-series/parallel topologies. Therefore, the use of non-series/parallel circuits can have a positive global impact on layout area and performance. The transistor chaining technique presented in this paper produces the optimal solution for 82.5% of the circuits tested, and has linear time complexity.
  • Journal title
    Discrete Applied Mathematics
  • Serial Year
    1998
  • Journal title
    Discrete Applied Mathematics
  • Record number

    884848