Year-end Sale % OFF 
Abstract
Channel routing is an important, time-consuming, and difficult problem in VLSI layout design, In this paper, we consider the two-terminal channel routing problem in the new routing model, called times square model (TSM); see, Lodj, Info. Proc. Lett., vol. 35, p. 41, 1990.; where the grid is composed of horizontal tracks, right tracks (with slope +60/spl deg/) and left tracks (with slope -60/spl deg/). We show a new lower bound [2d/3]-1 to the width of channel and present an optimal algorithm for two-terminal channel routing problems, which obtains [2d/3]+2 as an upper bound to the channel width where d is the channel density. The algorithm not only utilizes the horizontal tracks, but also the zig-zag connections, thus achieving the routing optimality.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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 callMore From: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Disclaimer: 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.
