By Topic

Optimal via minimisation by selection of layer assignment and routing ordering in a bubble-sorting-based non-Manhattan channel

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yan, J.-T. ; Dept. of Comput. Sci. & Inf. Eng., Chung Hua Univ., Taiwan, Taiwan

It is well known that a non-Manhattan channel router never uses more tracks than a Manhattan router in a channel. For a bubble-sorting-based non-Manhattan channel, all the nets can be routed by k bubble-sorting swap passes in an optimal bubble-sorting solution, and these k swap passes can be further mapped onto k 1-track-routing processes in a two-layer routing model. However, these proposed bubble-sorting-based non-Manhattan routers do not consider an optimal routing ordering for physical mapping of the k swap passes, and redundant vias are yielded in a random routing ordering. Based on the result of k swap passes in an optimal bubble-sorting solution: (i) optimal via minimisation by the selection of layer assignment and routing ordering in a bubble-sorting-based non-Manhattan channel is proposed; and (ii) the time complexity of this proposed algorithm is proven to be in O(k2) time, where k is the number of swap passes in an optimal bubble-sorting solution.

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:150 ,  Issue: 1 )