Abstract
Evolution in fabrication technology has allowed the transistors, gates, and connecting wires to be placed in more close proximity in a VLSI chip. The transistors and connecting wires are being placed at more close proximity, leading to the reduction of the interconnection delay as well as crosstalk noise between the overlapping wires. Minimization of crosstalk is an important constraint in computing routing solution of a channel instance. In this paper, first we present a survey of two heuristic algorithms for producing two-layer minimum crosstalk VH channel routing solution. Then, we concentrate on crosstalk minimization for producing three-layer HVH channel routing solution of a given channel instance. Two different algorithms to produce minimum crosstalk three-layer HVH channel routing solutions have been proposed in this paper. The results computed from each of the algorithms are very promising and far better than the results computed for several two-layer routing solutions. For very small number of nets, our algorithms can produce sometimes 100% crosstalk reduction.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
