Orthogonal Hypergraph Drawing for Improved Visibility

Visualization of circuits is an important research area in electronic design automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses orthogonal lines to connect the gates. In our model we assume that between two consecutive layers every net is allowed to occupy only one track. This avoids unnecessary bends in the wires and helps to improve the clarity of the drawing. Then a crossing reduction step is applied to further improve the readability of the circuit schematics. First we assume that the nodes have already been fixed on a layered hypergraph structure. We consider the problem of assigning the hyperedges between two layers to tracks. The idea is to minimize the total number of hyperedge crossings. We prove that finding the best solution is NP-hard. Then, in contrast to many other approaches which route all the wiring after placing all nodes we focus on a new approach which dynamically reorders the nodes within the layers to further reduce the number of hyperedge crossings. An efficient algorithm is presented that minimizes the hyperedge crossings. Experimental results are provided which show that the drawings can be improved significantly while the running time remains moderate. Article Type Communicated by Submitted Revised regular paper Y. Kajitani and G. Liotta April 2004 November 2005 T. Eschbach et al., Orth. Hypergraph Drawing , JGAA, 10(2) 141–157 (2006)142

[1]  Bernd Becker,et al.  Orthogonal hypergraph routing for improved visibility , 2004, GLSVLSI '04.

[2]  Bernd Becker,et al.  Orthogonal circuit visualization improved by merging the placement and routing phases , 2005, 18th International Conference on VLSI Design held jointly with 4th International Conference on Embedded Systems Design.

[3]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[4]  Rolf Drechsler,et al.  Level assignment for displaying combinational logic , 2001, Proceedings Euromicro Symposium on Digital Systems Design.

[5]  Bernd Becker,et al.  k-Layer Straightline Crossing Minimization by Speeding Up Sifting , 2000, Graph Drawing.

[6]  Michael Jünger,et al.  Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[7]  Bernd Becker,et al.  Cross Reduction for Orthogonal Circuit Visualization , 2003, VLSI.

[8]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[9]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[10]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[11]  Peter Eades,et al.  Edge crossings in drawings of bipartite graphs , 1994, Algorithmica.

[12]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[13]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[14]  Georg Sander,et al.  Layout of Directed Hypergraphs with Orthogonal Hyperedges , 2003, GD.

[15]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[16]  F. Somenzi,et al.  Using lower bounds during dynamic BDD minimization , 2001 .

[17]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[18]  Thomas Lengauer,et al.  Combinatorial algorithms for integrated circuit layout , 1990, Applicable theory in computer science.

[19]  Georg Sander,et al.  A Fast Heuristic for Hierarchical Manhattan Layout , 1995, GD.

[20]  Paul Molitor,et al.  Using Sifting for k -Layer Straightline Crossing Minimization , 1999, GD.

[21]  Rolf Drechsler,et al.  Crossing Reduction by Windows Optimization , 2002, GD.

[22]  Rolf Drechsler,et al.  Recursive bi-partitioning of netlists for large number of partitions , 2002, Proceedings Euromicro Symposium on Digital System Design. Architectures, Methods and Tools.

[23]  Peter J. Ashenden,et al.  The Designer's Guide to VHDL , 1995 .

[24]  Andreas Kuehlmann,et al.  Formal verification of a PowerPC microprocessor , 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .