Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/789083.1022832acmconferencesArticle/Chapter ViewAbstractPublication PagesdateConference Proceedingsconference-collections
Article

Crosstalk Reduction in Area Routing

Published: 03 March 2003 Publication History

Abstract

Interconnect delay dominates system delay in modern circuits, and with reduced feature sizes, coupling capacitance and signal crosstalk have become significant issues. By spacing interconnect wires effectively, and avoiding long parallel runs, coupling can be reduced; with current routing methods, however, this is difficult to achieve. In this paper, we present a new approach to area routing. Rather than inserting routes sequentially (using a performance driven maze router), multiple candidate routes for each connection are generated; excess routes are then eliminated iteratively. Experiments show that we obtain substantial reductions in coupling capacitance, without sacrificing routing completion rates.

References

[1]
{1} C. Albrecht. Global routing by new approximation algorithms for multicommodity flow. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 20(5):622-631, May 2001.
[2]
{2} M. Borah, R. M. Owens, and M. J. Irwin. An edge-based heuristic for Steiner routing. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 13(12):1563-1568, December 1994.
[3]
{3} J. P. Cohoon and P. L. Heck. Beaver: a computational geometry based tool for switchbox routing. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 7:684-697, 1988.
[4]
{4} J. Cong and P. H. Madden. Performance driven multi-layer general area routing for pcb/mcm designs. In Proc. Design Automation Conf, pages 356-361, 1998.
[5]
{5} Jason Cong, Jie Fang, and Kei-Yong Khoo. Via design rule consideration in multilayer maze routing algorithms. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 19(2):215-223, 2000.
[6]
{6} E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
[7]
{7} T. Gao and C. L. Liu. Minimum crosstalk channel routing. In Proc. Int. Conf. on Computer Aided Design , pages 692-696, November 1993.
[8]
{8} S.-W. Hur, A. Jagannathan, and J. Lillis. Timing driven maze routing. In Proc. Int. Symp. on Physical Design, pages 208-213, 1999.
[9]
{9} Ryan Kastner, Elaheh Bozogzadeh, and Majid Sarrafzadeh. Predictable routing. Proc. Int. Conf. on Computer Aided Design, pages 110-113, 2000.
[10]
{10} C. Y. Lee. An algorithm for path connection and its applications. IRE Transactions on Electronic Computers , EC-10(3):346-365, 1961.
[11]
{11} Xiaolin Liu and Ioannis G. Tollis. Improving over-the-cell channel routing in standard cell design. In Proc. Int. Conf. on Computer Aided Design, pages 606-609, 1994.
[12]
{12} H. Shin and A. Sangiovanni-Vincentelli. Mighty: a rip-up and reroute detailed router. In Proc. Int. Conf. on Computer Aided Design, pages 2-5, 1986.
[13]
{13} Hsiao-Ping Tseng and Carl Sechen. A gridless multi-layer router for standard cell circuits using CTM cells. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 18(10):1462-1479, 1999.
[14]
{14} R. Glenn Wood and Rob A. Rutenbar. FPGA routing and routability estimation via boolean satisfiability. In FPGA, pages 119-125, 1997.
[15]
{15} Qiong Yu, Sandeep Badida, and Naveed Sherwani. Algorithmic aspects of three dimensional mcm routing. In Proc. Design Automation Conf, page 24.5, 1994.

Cited By

View all
  • (2005)Moment-driven coupling-aware routing methodologyProceedings of the 15th ACM Great Lakes symposium on VLSI10.1145/1057661.1057754(390-395)Online publication date: 17-Apr-2005
  • (2005)Inductive and Capacitive Coupling Aware Routing Methodology Driven by a Higher Order RLCK Moment MetricProceedings of the conference on Design, Automation and Test in Europe - Volume 210.1109/DATE.2005.182(922-923)Online publication date: 7-Mar-2005

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DATE '03: Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
March 2003
1112 pages
ISBN:0769518702

Sponsors

Publisher

IEEE Computer Society

United States

Publication History

Published: 03 March 2003

Check for updates

Qualifiers

  • Article

Conference

DATE03
Sponsor:

Acceptance Rates

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Upcoming Conference

DATE '25
Design, Automation and Test in Europe
March 31 - April 2, 2025
Lyon , France

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 26 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2005)Moment-driven coupling-aware routing methodologyProceedings of the 15th ACM Great Lakes symposium on VLSI10.1145/1057661.1057754(390-395)Online publication date: 17-Apr-2005
  • (2005)Inductive and Capacitive Coupling Aware Routing Methodology Driven by a Higher Order RLCK Moment MetricProceedings of the conference on Design, Automation and Test in Europe - Volume 210.1109/DATE.2005.182(922-923)Online publication date: 7-Mar-2005

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media