Via Minimization in channel Routing by Layout Modification

Main Results: This paper outlines anew approach to the via minimization problem, that combines the advantages, of both layout modification [ 11 and constrained via minimization (CVM) techniques [2]. The given layout is gradually transformed to a routing instance in the overlap model (c.e., horizontal and vertical wire segments may occupy the same layer), by a sequence of track interchanges, without increasing routing area. The transformation is guided by the visibility relations among nets and certain other geometric factors.

[1]  Stephen K. Wismath,et al.  Characterizing bar line-of-sight graphs , 1985, SCG '85.

[2]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  Sumio Masuda,et al.  Via Minimization for Gridless Layouts , 1987, 24th ACM/IEEE Design Automation Conference.

[4]  Jason Cong,et al.  A layout modification approach to via minimization , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..