Abstract
In this paper an algorithm is presented for routing a restricted class of channel routing problems in at most density plus two tracks. The underlying hardware model uses two layers of interconnect and supports orthogonal and diagonal wires. The essence of this model and the channel routing problems on this model are captured in a graph representation over a grid. The main part of this paper consists of a proof of this algorithm and its performance guarantee.
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.
