Consider the problem of performing one-dimensional circuit compaction for a layout containingnh horizontal wires andn layout cells. We present new and efficient constrain-graph-based algorithms for generating a compacted layout in which either the length of the longest wires or a user-specified tradeoff function between the layout width and the longest wire length is minimized. Both algorithms have anO(nh·nlogn) running time. The concept employed by our algorithms is that of assigning speeds to the layout cells. Speeds are computed by performing path computations in subgraphs of the constraint graphs. A compacted layout is generated over a number of iterations, with each iteration first determining speeds and then moving the layout elements to the right according to the computed speeds. Each iteration produces a better layout and after at mostn·nh iterations the final layout is produced.
CITATION STYLE
Hambrusch, S. E., & Tu, H. Y. T. (1993). New algorithms for minimizing the longest wire length during circuit compaction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 762 LNCS, pp. 446–455). Springer Verlag. https://doi.org/10.1007/3-540-57568-5_276
Mendeley helps you to discover research relevant for your work.