• DocumentCode
    2824945
  • Title

    How many critical paths classify a function? A study in design space extraction

  • Author

    Tyagi, Akhilesh

  • Author_Institution
    Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
  • fYear
    1991
  • fDate
    11-14 Jun 1991
  • Firstpage
    3146
  • Abstract
    A subproblem of the general design space extraction problem-classifying the design for a known function type such as an adder-is solved. An algorithm is presented that uses the distribution of critical path lengths as the basis for this classification. Experimental data are cited for a CAD tool implemented for the adder design space classification. This work also identifies the connection between the critical path lengths and the room for global optimization in a circuit
  • Keywords
    adders; circuit layout CAD; logic CAD; optimisation; CAD tool; adder; adder design; critical paths; design space extraction; function type; global optimization; subproblem; Adders; Algorithm design and analysis; Application software; Computer science; Data mining; Design automation; Design optimization; Logic design; Space exploration; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1991., IEEE International Sympoisum on
  • Print_ISBN
    0-7803-0050-5
  • Type

    conf

  • DOI
    10.1109/ISCAS.1991.176218
  • Filename
    176218