• DocumentCode
    1544593
  • Title

    Pull up transistor folding

  • Author

    Li, Wing-Ning ; Sahni, Sartaj

  • Author_Institution
    Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
  • Volume
    9
  • Issue
    5
  • fYear
    1990
  • fDate
    5/1/1990 12:00:00 AM
  • Firstpage
    512
  • Lastpage
    521
  • Abstract
    A polynomial-time algorithm for the pull up transistor assignment problem is developed, and it is shown that the interval selection and interval selection with pull up transistor assignment problems are NP-hard. Heuristics for these problems are proposed and compared with that proposed by C. Lursinsap and G. Gajski (ibid., vol.7, no.8, p.887-96, 1988)
  • Keywords
    circuit layout CAD; computational complexity; polynomials; NP-hard problems; interval selection; polynomial-time algorithm; pull up transistor assignment; transistor folding; Computer science; Helium; NP-hard problem; Polynomials; Programmable logic arrays;
  • fLanguage
    English
  • Journal_Title
    Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0278-0070
  • Type

    jour

  • DOI
    10.1109/43.55181
  • Filename
    55181
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1544593