File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: New optimization model for VLSI placement algorithms

TitleNew optimization model for VLSI placement algorithms
Authors
Issue Date1999
Citation
Proceedings - Ieee International Symposium On Circuits And Systems, 1999, v. 6, p. VI-398-VI-403 How to Cite?
AbstractThis research presents a new model which can be used to formulate cost functions for various VLSI placement problems. A formal proof indicating the close relationship of the parameter, namely crossing, with the conventional channel density is given. Such proof, which has never been established in the net length model. Theoretically, the crossing model has a lower bound of zero, i.e. no nets will make crosses with another. In addition, the crossing notion of a standard cell is inherently a two-dimensional model and its computation is localized to those cells connected it. Crossing model is intended to be applied on parallel optimization algorithm in future. The above advantages of our model will be illustrated by a post-optimization step after standard cell placement. At the same time, a heuristic algorithm with the complexity of the algorithm of O(n)+O(m2) is also proposed using the crossing model. A reduction of up to 5% of the layout area was achieved.
Persistent Identifierhttp://hdl.handle.net/10722/155093
ISSN

 

DC FieldValueLanguage
dc.contributor.authorCheung, Paul YSen_US
dc.contributor.authorYeung, Chris SKen_US
dc.contributor.authorKo, Robin WLen_US
dc.date.accessioned2012-08-08T08:31:50Z-
dc.date.available2012-08-08T08:31:50Z-
dc.date.issued1999en_US
dc.identifier.citationProceedings - Ieee International Symposium On Circuits And Systems, 1999, v. 6, p. VI-398-VI-403en_US
dc.identifier.issn0271-4310en_US
dc.identifier.urihttp://hdl.handle.net/10722/155093-
dc.description.abstractThis research presents a new model which can be used to formulate cost functions for various VLSI placement problems. A formal proof indicating the close relationship of the parameter, namely crossing, with the conventional channel density is given. Such proof, which has never been established in the net length model. Theoretically, the crossing model has a lower bound of zero, i.e. no nets will make crosses with another. In addition, the crossing notion of a standard cell is inherently a two-dimensional model and its computation is localized to those cells connected it. Crossing model is intended to be applied on parallel optimization algorithm in future. The above advantages of our model will be illustrated by a post-optimization step after standard cell placement. At the same time, a heuristic algorithm with the complexity of the algorithm of O(n)+O(m2) is also proposed using the crossing model. A reduction of up to 5% of the layout area was achieved.en_US
dc.languageengen_US
dc.relation.ispartofProceedings - IEEE International Symposium on Circuits and Systemsen_US
dc.titleNew optimization model for VLSI placement algorithmsen_US
dc.typeArticleen_US
dc.identifier.emailCheung, Paul YS:paul.cheung@hku.hken_US
dc.identifier.authorityCheung, Paul YS=rp00077en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0032631942en_US
dc.identifier.volume6en_US
dc.identifier.spageVIen_US
dc.identifier.epage398en_US
dc.identifier.scopusauthoridCheung, Paul YS=7202595335en_US
dc.identifier.scopusauthoridYeung, Chris SK=7201354219en_US
dc.identifier.scopusauthoridKo, Robin WL=7007059614en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats