Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/62471
DC FieldValue
dc.titleNew clustering method based on general connectivity
dc.contributor.authorZhuang, Wenjun
dc.contributor.authorChing Lim, Yong
dc.contributor.authorSamudra, Ganesh
dc.contributor.authorYan, Neng
dc.date.accessioned2014-06-17T06:51:24Z
dc.date.available2014-06-17T06:51:24Z
dc.date.issued1994
dc.identifier.citationZhuang, Wenjun, Ching Lim, Yong, Samudra, Ganesh, Yan, Neng (1994). New clustering method based on general connectivity. VLSI Design 2 (2) : 131-141. ScholarBank@NUS Repository.
dc.identifier.issn1065514X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/62471
dc.description.abstractIn this paper, we present a novel concept of the general connectivity among cells. While conventional concept considers direct connections only, the new concept considers both the direct and indirect connections among cells leading to a model capturing a more precise relationship among cells. Based on the model, a new parallel clustering approach is proposed and analyzed. Another new concept of the stable cluster is introduced to improve the clustering result. In conjunction with the clustering process, an investigatory procedure which back tracks the cluster development process to check if all clusters are stable is also developed. Initial test runs, using the new clustering approach for placement, yield an encouraging 21.6% reduction on the number of feed-through in a complex ASIC design.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleVLSI Design
dc.description.volume2
dc.description.issue2
dc.description.page131-141
dc.description.codenVLDEE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications
Elements

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ANewClustering.pdf2.72 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

252
checked on Jan 20, 2022

Download(s)

3
checked on Jan 20, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.