Thomas Eschbach

Learn More
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(More)
Visualization of circuits is an important research area in electronic design automation. Locating errors in a large design may require a high-quality graphical representation of a circuit that allows humans to understand it. Usually, drawing a circuit is based on visualizing the corresponding graph or hypergraph structure where nodes are connected by(More)
! " # $ % &' & #( & ) &' &' ' * ,+-& .* / * 10324 $ 5. &6 7 8 9 .*&:+-&'; . < / =: & >$ 5 &? ( .*( ;@>$ @=8. # (5 & & & $ # < ' ' 5 ? ( 7 A7 B(C / 5 3 D +-&' E # 5+/ 0GF =$H +# A?; .I J 5 K & +L M J. # 5() <(C="&' . # (N E 5 ' & A7( &' &8 5 C+ &' O &D 5 & ' & + K$=% E # .*($ O & HP 5+Q 5 C+-& O & $ & +% % ,AR =! ( R ! ! '& S ( & ' 5.* 7 T (5&' &O 5& 0 U@ :(More)
Visualization of circuits is an important research area in electronic design and automation. One commonly accepted method to visualize a circuit aligns the gates to layers and uses orthogonal lines to connect the gates. Our approach introduces the restriction that every net is allowed to occupy only one track. This avoids unnecessary bends in the wires and(More)
The high complexity of circuits which currently consist of several millions of transistors, can only be managed using a concise design flow. Recently, the one-pass synthesis paradigm came up, i.e. to consider the whole design process as one flow instead of isolated steps. In this context, designing circuits based on the mapping of binary decision diagrams(More)
In many application in VLSI CAD, a given netlist has to be partitioned into smaller sub-designs which can be handled much better. In this paper we present a new recursive bi-partitioning algorithm that is especially applicable, if a large number of final partitions, e.g. more than 1000, has to be computed. The algorithm consists of two steps. Based on(More)
In various areas of c o m p u t e r science and m a t h e mat ics , including scienti f ic comput ing , task scheduling and VLSI design, t h e graph concept i s used f o r modeling purposes, and graph parti t ioning algorithms are required t o obtain solutions. E.g., w i t h increasing complexit ies of circuit design t h e circuit graphs m a y have several(More)