Placement Algorithm for Automatic Generator of Schematic Diagram Using Net-List

Let-List로 부터 Schematic Diagram 자동 생성기의 배치 알고리즘

In this paper, we developed placement algorithm for drafting logic schmeatics. The algorithm of this system is to base placement on signal flow as opposed to connectivity. The key idea of this algorithm is that by dividing the schematic into simpler acyclic, uni-directional graphs, called tree. Then the components of tree and their interconnections have the characteristics that they can be laid out symmetrically without any crossovers. The interconnectivity between the trees are analyzed and a placement scheme is determined for them. Also, the trees are expended into their respective components. This algorithm is divided into four main phases: Initiate, Divide, Merge, Placement.