Feasible region approximation using convex polytopes

Sachin S. Sapatnekar, Pravin M. Vaidya, S. M. Kang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

A new technique for polytope approximation of the feasible region for a design is presented. This method is computationally less expensive than the simplicial approximation method. Results on several circuits are presented, and it is shown that the quality of the polytope approximation is substantially better than an ellipsoidal approximation.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
PublisherPubl by IEEE
Pages1786-1789
Number of pages4
ISBN (Print)0780312813
StatePublished - Jan 1 1993
EventProceedings of the 1993 IEEE International Symposium on Circuits and Systems - Chicago, IL, USA
Duration: May 3 1993May 6 1993

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume3
ISSN (Print)0271-4310

Other

OtherProceedings of the 1993 IEEE International Symposium on Circuits and Systems
CityChicago, IL, USA
Period5/3/935/6/93

Fingerprint Dive into the research topics of 'Feasible region approximation using convex polytopes'. Together they form a unique fingerprint.

  • Cite this

    Sapatnekar, S. S., Vaidya, P. M., & Kang, S. M. (1993). Feasible region approximation using convex polytopes. In Proceedings - IEEE International Symposium on Circuits and Systems (pp. 1786-1789). (Proceedings - IEEE International Symposium on Circuits and Systems; Vol. 3). Publ by IEEE.