Agglomerative-Based Flip-Flop Merging and Relocation for Signal Wirelength and Clock Tree Optimization
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
en_US | |
dc.citation.issue |
3 | en_US |
dc.citation.volume |
18 | en_US |
dc.citation.woscount |
1 | |
dc.contributor.author |
Liu, Sean Shih-Ying | en_US |
dc.contributor.author |
Lo, Wan-Ting | en_US |
dc.contributor.author |
Lee, Chieh-Jui | en_US |
dc.contributor.author |
Chen, Hung-Ming | en_US |
dc.contributor.department |
電子工程學系及電子研究所 | zh_TW |
dc.contributor.department |
Department of Electronics Engineering and Institute of Electronics | en_US |
dc.date.accessioned |
2014-12-08T15:31:12Z | |
dc.date.available |
2014-12-08T15:31:12Z | |
dc.date.issued |
2013-07-01 | en_US |
dc.description.abstract |
In this article, we propose a flip-flop merging algorithm based on agglomerative clustering. Compared to previous state-of-the-art on flip-flop merging, our proposed algorithm outperforms that of Chang et al. [2010] and Wang et al. [2011] in all aspects, including number of flip-flop reductions, increase in signal wirelength, displacement of flip-flops, and execution time. Our proposed algorithm also has minimal disruption to original placement. In comparison with Jiang et al. [2011], Wang et al. [2011], and Chang et al. [2010], our proposed algorithm has the least displacement when relocating merged flip-flops. While previous works on flip-flop merging focus on the number of flip-flop reduction, we further evaluate the power consumption of clock tree after flip-flop merging. To further minimize clock tree wirelength, we propose a framework that determines a preferable location for relocated merged flip-flops for clock tree synthesis (CTS). Experimental results show that our CTS-driven flip-flop merging can reduce clock tree wirelength by an average of 7.82% with minimum clock network power consumption compared to all of the previous works. | en_US |
dc.identifier.doi |
10.1145/2491477.2491484 | en_US |
dc.identifier.issn |
1084-4309 | en_US |
dc.identifier.journal |
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1145/2491477.2491484 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/22215 | |
dc.identifier.wosnumber |
WOS:000322449700007 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Algorithms | en_US |
dc.subject |
Design | en_US |
dc.title |
Agglomerative-Based Flip-Flop Merging and Relocation for Signal Wirelength and Clock Tree Optimization | en_US |
dc.type |
Article | en_US |
檔案
- 000322449700007.pdf (1.25 MB, Adobe PDF)
所屬典藏: 期刊論文