It has been pointed out that, in many cases, results generated by non-Manhattan channel routers will be better than those generated by Manhattan routers. Non-optimal bubble sort based algorithms for non-Manhattan channel routing have been proposed in the literature by also allowing connections in the +45/spl deg/ and /spl minus/45/spl deg/ directions. In this paper, optimal algorithms are proposed for the two-layer and three-layer non-Manhattan channel routing problems based on an identical problem formulation. The time complexities of our algorithms and the existing algorithm (which produces the best results so far) are O(K/sup 2/ * N) and O(K * N/sup 2/), respectively, where N is the number of terminals (i.e., the length) of the channel and N is the number of routing tracks (i.e., the height) in the channel. K is always less than N, and in most cases is much smaller than N. Clearly, a significant improvement in time complexity over the existing algorithm (which produces the best results so far) is achieved, while ensuring optimality. >
[1]
Peter Robinson,et al.
Channel routing by sorting
,
1991,
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2]
Akihiro Hashimoto,et al.
Wire routing by optimizing channel assignment within large apertures
,
1971,
DAC.
[3]
R. Pelavin,et al.
Hierarchical channel router
,
1988,
25 years of DAC.
[4]
David N. Deutsch.
A “DOGLEG” channel router
,
1976,
DAC 1976.
[5]
Deborah C. Wang.
Novel routing schemes for IC layout part I: two-layer channel routing
,
1991,
28th ACM/IEEE Design Automation Conference.
[6]
Takeshi Yoshimura,et al.
Efficient Algorithms for Channel Routing
,
1982,
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[7]
Ronald L. Rivest,et al.
A "Greedy" Channel Router
,
1982,
DAC 1982.