Deterministic analog circuit placement using hierarchically bounded enumeration and enhanced shape functions

Martin Strasser, Michael Eick, Helmut Gräb, Ulf Schlichtmann, Frank M. Johannes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

67 Scopus citations

Abstract

The analog placement algorithm Plantage, presented in this paper, generates placements for analog circuits with comprehensive placement constraints. Plantage Is based on a hierarchically bounded enumeration of basic building blocks, using B*-trees. The practically relevant solution space is thereby enumerated quasi-complete. The sets of possible placements of the basic building blocks are represented and combined in a new efficient way, using enhanced shape functions. The result of Plantage Is the Pareto front of placements with respect to different aspect ratios. The whole approach is deterministic, in contrast to existing analog placement algorithms.

Original languageEnglish
Title of host publication2008 IEEE/ACM International Conference on Computer-Aided Design Digest of Technical Papers, ICCAD 2008
Pages306-313
Number of pages8
DOIs
StatePublished - 2008
Event2008 International Conference on Computer-Aided Design, ICCAD - San Jose, CA, United States
Duration: 10 Nov 200813 Nov 2008

Publication series

NameIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
ISSN (Print)1092-3152

Conference

Conference2008 International Conference on Computer-Aided Design, ICCAD
Country/TerritoryUnited States
CitySan Jose, CA
Period10/11/0813/11/08

Fingerprint

Dive into the research topics of 'Deterministic analog circuit placement using hierarchically bounded enumeration and enhanced shape functions'. Together they form a unique fingerprint.

Cite this