Proceedings ArticleDOI
Crosstalk minimization in two-layer channel routing
Ajit Pal,A. Singha,Somnath Ghosh,Rajat Kumar Pal +3 more
- Vol. 1, pp 408-411
Reads0
Chats0
TLDR
This paper shows that the crosstalk minimization problem in the reserved two-layer Manhattan routing model is NP-complete, even for the channels without any vertical constraints, and proposes simple and efficient polynomial time heuristic algorithms that reduce crosStalk more than 35% on average on a given routing solution of minimum area.Abstract:
As fabrication technology advances, devices and interconnection wires are placed in closer proximity and circuits operate at higher frequencies This results in crosstalk between wire segments Work on routing channels with reduced crosstalk is a very important area of current research In this paper we show that the crosstalk minimization problem in the reserved two-layer Manhattan routing model is NP-complete, even for the channels without any vertical constraints Since minimizing crosstalk is NP-complete, we propose simple and efficient polynomial time heuristic algorithms that reduce crosstalk more than 35% on average on a given routing solution of minimum arearead more
Citations
More filters
Algorithms for Reducing Crosstalk in Two-Layer Channel Routing
TL;DR: This paper has developed heuristic algorithms for computing reduced crosstalk two-layer channel routing solutions for simplest as well as general channel instances and the results obtained are highly encouraging.
Two Algorithms for Minimizing Crosstalk in Two-Layer Channel Routing
Achira Pal,Tarak Nath Mandal,Abhinandan Khan,Rajat Kumar Pal,Alak Kumar Datta,Atal Chaudhuri,Sap Abap +6 more
TL;DR: Performance of the algorithms is encouraging enough for most of the existing benchmark channels, and reduction in crosstalk for these channels is up to 28.34% for a given routing solution.
A Review on Crosstalk Avoidance and Minimization in VLSI Systems
Achira Pal,Tarak N. Mandal,Abhinandan Khan,Rajat Kumar Pal,Alak Kumar Datta,Atal Chaudhuri,Acharya Prafulla,Chandra Roy,Siksha Prangan +8 more
TL;DR: This paper has reviewed the effects and impact that crosstalk has on the performance and reliability of VLSI circuits and systems, and presented a concise but informative review on the various methods that researchers worldwide are implementing for a priori c Crosstalk avoidance or a posteriori crosStalk minimization in V LSI systems from the point of view of fabrication over the past few decades.
Journal ArticleDOI
Hardness of crosstalk minimization in two-layer channel routing
TL;DR: It has been shown that the crosstalk minimization problem in the reserved two-layer Manhattan routing model is NP-complete, even if channels are free from all vertical constraints, and that all results hold even if doglegging is allowed.
References
More filters
Proceedings ArticleDOI
Wire routing by optimizing channel assignment within large apertures
TL;DR: The purpose of this paper is to introduce a new wire routing method for two layer printed circuit boards based on the newly developed channel assignment algorithm and requires many via holes.
Journal ArticleDOI
Efficient Algorithms for Channel Routing
Takeshi Yoshimura,Ernest S. Kuh +1 more
TL;DR: Two new algorithms merge nets instead of assigning horizontal tracks to individual nets to route a specified net list between two rows of terminals across a two-layer channel in the layout design of LSI chips.
Proceedings ArticleDOI
Minimum crosstalk channel routing
TL;DR: A new approach is proposed to the gridded channel routing problem which utilizes existing channel routing algorithms and improves upon the routing results by permuting the routing tracks.
Algorithms for integrated circuit layout: an analytic approach
TL;DR: The major result presented in this dissertation is a polynomial time algorithm for a restricted case of the routing problem, which minimizes the area of a rectangle circumscribing the component and the wire paths.
Journal ArticleDOI
A general greedy channel routing algorithm
TL;DR: It is shown that track-oriented greedy algorithms can be modified to solve other channel routing problems, and modified algorithms have good performance and show strong potential to outperform existing algorithms.