Interconnect-Driven Floorplanning with Noise-Aware Buffer Planning
Crosstalk-induced noise has become a key problem in interconnect optimization when technology improves, spacing diminishes, and coupling capacitance/inductance increases. Buffer insertion/sizing is one of the most effective and popular techniques to reduce interconnect delay and decouple coupling ef...
Gespeichert in:
Veröffentlicht in: | IEICE transactions on fundamentals of electronics, communications and computer sciences communications and computer sciences, 2013-01, Vol.E96.A (12), p.2467-2474 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | jpn |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 2474 |
---|---|
container_issue | 12 |
container_start_page | 2467 |
container_title | IEICE transactions on fundamentals of electronics, communications and computer sciences |
container_volume | E96.A |
creator | Li, Katherine Shu-Min Ho, Yingchieh Chen, Liang-Bi |
description | Crosstalk-induced noise has become a key problem in interconnect optimization when technology improves, spacing diminishes, and coupling capacitance/inductance increases. Buffer insertion/sizing is one of the most effective and popular techniques to reduce interconnect delay and decouple coupling effects. It is traditionally applied to post-layout optimization. However, it is obviously infeasible to insert/size hundreds of thousands buffers during the post-layout stage when most routing regions are occupied. Therefore, it is desirable to incorporate buffer planning into floorplanning to ensure timing closure and design convergence. In this paper, we first derive formulae of buffer insertion for timing and noise optimization, and then apply the formulae to compute the feasible regions for inserting buffers to meet both timing and noise constraints. Experimental results show that our approach achieves an average success rate of 80.9% (78.2%) of nets meeting timing constraints alone (both timing and noise constraints) and consumes an average extra area of only 0.49% (0.66%) over the given floorplan, compared with the average success rate of 75.6% of nets meeting timing constraints alone and an extra area of 1.33% by the BBP method proposed previously. |
doi_str_mv | 10.1587/transfun.E96.A.2467 |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1541443413</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1541443413</sourcerecordid><originalsourceid>FETCH-LOGICAL-j1613-542c1b44282f6ea6a1cdff0e7d5d0f327b614841697e65c0edad8863809a16003</originalsourceid><addsrcrecordid>eNotj71OwzAURi0EElXpE7BkZHHwjX8zpqWFShUwwFw5zjUYBafYCX19KtHpW46OzkfILbASpNH3Y7Ix-ymW61qVTVkJpS_IDLSQFDjXl2TGalDUSGauySLn0DJQ0hjN5Iwst3HE5IYY0Y30IYVfjMWmH4Z06G2MIX4UxzB-Fs9DyEibo01YLCfvMRWvZ-CGXHnbZ1ycd07eN-u31RPdvTxuV82OfoECTqWoHLRCVKbyCq2y4DrvGepOdszzSrcKhBGgao1KOoad7YxR3LDagmKMz8ndv_eQhp8J87j_Dtlhf8rAYcp7kAKE4OJ0-g-kv1Cw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1541443413</pqid></control><display><type>article</type><title>Interconnect-Driven Floorplanning with Noise-Aware Buffer Planning</title><source>J-STAGE Free</source><creator>Li, Katherine Shu-Min ; Ho, Yingchieh ; Chen, Liang-Bi</creator><creatorcontrib>Li, Katherine Shu-Min ; Ho, Yingchieh ; Chen, Liang-Bi</creatorcontrib><description>Crosstalk-induced noise has become a key problem in interconnect optimization when technology improves, spacing diminishes, and coupling capacitance/inductance increases. Buffer insertion/sizing is one of the most effective and popular techniques to reduce interconnect delay and decouple coupling effects. It is traditionally applied to post-layout optimization. However, it is obviously infeasible to insert/size hundreds of thousands buffers during the post-layout stage when most routing regions are occupied. Therefore, it is desirable to incorporate buffer planning into floorplanning to ensure timing closure and design convergence. In this paper, we first derive formulae of buffer insertion for timing and noise optimization, and then apply the formulae to compute the feasible regions for inserting buffers to meet both timing and noise constraints. Experimental results show that our approach achieves an average success rate of 80.9% (78.2%) of nets meeting timing constraints alone (both timing and noise constraints) and consumes an average extra area of only 0.49% (0.66%) over the given floorplan, compared with the average success rate of 75.6% of nets meeting timing constraints alone and an extra area of 1.33% by the BBP method proposed previously.</description><identifier>ISSN: 0916-8508</identifier><identifier>EISSN: 1745-1337</identifier><identifier>DOI: 10.1587/transfun.E96.A.2467</identifier><language>jpn</language><subject>Buffers ; Insertion ; Interconnections ; Joining ; Meetings ; Noise ; Optimization ; Time measurements</subject><ispartof>IEICE transactions on fundamentals of electronics, communications and computer sciences, 2013-01, Vol.E96.A (12), p.2467-2474</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,27905,27906</link.rule.ids></links><search><creatorcontrib>Li, Katherine Shu-Min</creatorcontrib><creatorcontrib>Ho, Yingchieh</creatorcontrib><creatorcontrib>Chen, Liang-Bi</creatorcontrib><title>Interconnect-Driven Floorplanning with Noise-Aware Buffer Planning</title><title>IEICE transactions on fundamentals of electronics, communications and computer sciences</title><description>Crosstalk-induced noise has become a key problem in interconnect optimization when technology improves, spacing diminishes, and coupling capacitance/inductance increases. Buffer insertion/sizing is one of the most effective and popular techniques to reduce interconnect delay and decouple coupling effects. It is traditionally applied to post-layout optimization. However, it is obviously infeasible to insert/size hundreds of thousands buffers during the post-layout stage when most routing regions are occupied. Therefore, it is desirable to incorporate buffer planning into floorplanning to ensure timing closure and design convergence. In this paper, we first derive formulae of buffer insertion for timing and noise optimization, and then apply the formulae to compute the feasible regions for inserting buffers to meet both timing and noise constraints. Experimental results show that our approach achieves an average success rate of 80.9% (78.2%) of nets meeting timing constraints alone (both timing and noise constraints) and consumes an average extra area of only 0.49% (0.66%) over the given floorplan, compared with the average success rate of 75.6% of nets meeting timing constraints alone and an extra area of 1.33% by the BBP method proposed previously.</description><subject>Buffers</subject><subject>Insertion</subject><subject>Interconnections</subject><subject>Joining</subject><subject>Meetings</subject><subject>Noise</subject><subject>Optimization</subject><subject>Time measurements</subject><issn>0916-8508</issn><issn>1745-1337</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNotj71OwzAURi0EElXpE7BkZHHwjX8zpqWFShUwwFw5zjUYBafYCX19KtHpW46OzkfILbASpNH3Y7Ix-ymW61qVTVkJpS_IDLSQFDjXl2TGalDUSGauySLn0DJQ0hjN5Iwst3HE5IYY0Y30IYVfjMWmH4Z06G2MIX4UxzB-Fs9DyEibo01YLCfvMRWvZ-CGXHnbZ1ycd07eN-u31RPdvTxuV82OfoECTqWoHLRCVKbyCq2y4DrvGepOdszzSrcKhBGgao1KOoad7YxR3LDagmKMz8ndv_eQhp8J87j_Dtlhf8rAYcp7kAKE4OJ0-g-kv1Cw</recordid><startdate>20130101</startdate><enddate>20130101</enddate><creator>Li, Katherine Shu-Min</creator><creator>Ho, Yingchieh</creator><creator>Chen, Liang-Bi</creator><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130101</creationdate><title>Interconnect-Driven Floorplanning with Noise-Aware Buffer Planning</title><author>Li, Katherine Shu-Min ; Ho, Yingchieh ; Chen, Liang-Bi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-j1613-542c1b44282f6ea6a1cdff0e7d5d0f327b614841697e65c0edad8863809a16003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>jpn</language><creationdate>2013</creationdate><topic>Buffers</topic><topic>Insertion</topic><topic>Interconnections</topic><topic>Joining</topic><topic>Meetings</topic><topic>Noise</topic><topic>Optimization</topic><topic>Time measurements</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Katherine Shu-Min</creatorcontrib><creatorcontrib>Ho, Yingchieh</creatorcontrib><creatorcontrib>Chen, Liang-Bi</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEICE transactions on fundamentals of electronics, communications and computer sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Katherine Shu-Min</au><au>Ho, Yingchieh</au><au>Chen, Liang-Bi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Interconnect-Driven Floorplanning with Noise-Aware Buffer Planning</atitle><jtitle>IEICE transactions on fundamentals of electronics, communications and computer sciences</jtitle><date>2013-01-01</date><risdate>2013</risdate><volume>E96.A</volume><issue>12</issue><spage>2467</spage><epage>2474</epage><pages>2467-2474</pages><issn>0916-8508</issn><eissn>1745-1337</eissn><abstract>Crosstalk-induced noise has become a key problem in interconnect optimization when technology improves, spacing diminishes, and coupling capacitance/inductance increases. Buffer insertion/sizing is one of the most effective and popular techniques to reduce interconnect delay and decouple coupling effects. It is traditionally applied to post-layout optimization. However, it is obviously infeasible to insert/size hundreds of thousands buffers during the post-layout stage when most routing regions are occupied. Therefore, it is desirable to incorporate buffer planning into floorplanning to ensure timing closure and design convergence. In this paper, we first derive formulae of buffer insertion for timing and noise optimization, and then apply the formulae to compute the feasible regions for inserting buffers to meet both timing and noise constraints. Experimental results show that our approach achieves an average success rate of 80.9% (78.2%) of nets meeting timing constraints alone (both timing and noise constraints) and consumes an average extra area of only 0.49% (0.66%) over the given floorplan, compared with the average success rate of 75.6% of nets meeting timing constraints alone and an extra area of 1.33% by the BBP method proposed previously.</abstract><doi>10.1587/transfun.E96.A.2467</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0916-8508 |
ispartof | IEICE transactions on fundamentals of electronics, communications and computer sciences, 2013-01, Vol.E96.A (12), p.2467-2474 |
issn | 0916-8508 1745-1337 |
language | jpn |
recordid | cdi_proquest_miscellaneous_1541443413 |
source | J-STAGE Free |
subjects | Buffers Insertion Interconnections Joining Meetings Noise Optimization Time measurements |
title | Interconnect-Driven Floorplanning with Noise-Aware Buffer Planning |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T07%3A19%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Interconnect-Driven%20Floorplanning%20with%20Noise-Aware%20Buffer%20Planning&rft.jtitle=IEICE%20transactions%20on%20fundamentals%20of%20electronics,%20communications%20and%20computer%20sciences&rft.au=Li,%20Katherine%20Shu-Min&rft.date=2013-01-01&rft.volume=E96.A&rft.issue=12&rft.spage=2467&rft.epage=2474&rft.pages=2467-2474&rft.issn=0916-8508&rft.eissn=1745-1337&rft_id=info:doi/10.1587/transfun.E96.A.2467&rft_dat=%3Cproquest%3E1541443413%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1541443413&rft_id=info:pmid/&rfr_iscdi=true |