H. Shin
ABSTRACT
A new heuristic two-dimensional symbolic layout-compaction approach is developed. After conventional one-dimensional compaction steps, all the components on the critical paths that define the height or width of the given layout are found and rearranged to reduce the layout size. During this process, constraints in both x and y directions are considered and pitch-matching of ports for hierarchical compaction can be achieved to reduce the amount of the design data. This approach generated the smallest area for several examples we have tried when compared with other published results. The expected run time can be bounded by Ο(T1), where T1 is the run time of a typical one-dimensional compactor.
- Boy87.D. Boycr, "Symbolic Layout Compaction Benchmarks," International Conference on Computer Design, pp 186- 191,209 - 217, October 1987.Google Scholar
- BuNe87.J. Burns and A. Newton, "Efficient Constraint Generation for Hierarchical Compaction," International Conference on Computer Design, pp 197 - 200, October 1987.Google Scholar
- Cho85.Y. E. Cho, "A Subjective Review of Compaction," Proceedings of 22nd Design Automation Conference, I~P 396 - 404, June 1985. Google ScholarDigital Library
- CrVa87.W. Crocker, R. Varadarjan, and C. Lo, "MACS: a Module Assembly and Compaction System," International Conference on Computer Design, pp 205 - 208, October 1987.Google Scholar
- Hsu79.M. Y. Hsueh, "Symbolic Layout and Compaction," U.C.Berkeley, UCB/ERL Report M79/80, 1979.Google Scholar
- LiWo83.Y. Liao and C. K. Wong, "An Algorithm to Compact a VLSI Symbohc Layout with Mixed Constraints," IEEE Transactions on CAD of 1CAS, Vol. 2, No. 2, April 1983.Google Scholar
- KeWa84.G. Kedem and H. Watanabe, "Graph-Optimization Techniques for IC Layout and Compaction," IEEE Transactions on CAD of lCAS Vol. 3, No. 1, January 1984.Google Scholar
- SaPa82.S. Sastry and A. Parker, "The Complexity of Two- Dimensional Compaction of VLSI Layouts," International Conference on Circuits and Computers, pp 402-406, 1982.Google Scholar
- ScLi83.M. Schlag, Y. 7_. Liao, and C. K. Wrong, "An Algorithm for Optimal Two-Dimensional Compaction of VLSI Layouts," Integration, pp 179 - 209, 1983.Google ScholarDigital Library
- ShSa86.H. Shin, A. Sangiovanni-Vincentelll, and C. Sequin, "Twodimensional Compaction by Zone-Refining," Proceedings of 23rd Design Automation Conference, pp 115 - 122, June 1986. Google ScholarDigital Library
- Tar83.R.E. Tarjan, "Data Structures and Network Algorithms," CBMS 44, SIAM, pp 97-111, 1983. Google ScholarDigital Library
- TaWe87.D. Tan and N. Weste, "Virtual Grid Symbolic Layout 1987," International Conference on Computer Design, pp 192 - 196, October 1987.Google Scholar
- WoMa83.W. Wolf, R. Mathews, J. Newkirk, and R. Dutton, "Two- Dimensional Compaction Strategies", Proceedings of Int. Conf. on CAD, pp 90 .- 91, t983.Google Scholar
Index Terms
- An efficient two-dimensional layout compaction algorithm
Recommendations
Algorithmic Aspects of One-Dimensional Layout Compaction
We present a theory of one-dimensional layout compaction that is based on the graph theoretic approach used in such compacters as reported in [5], [7], [11], and [26]. Compaction here consists of two steps. In the first stage, a directed graph is ...
An efficient two-dimensional compaction algorithm for VLSI symbolic layout
EURO-DAC '90: Proceedings of the conference on European design automationThe 2-dimensional compaction problem for VLSI symbolic layout is considered. Through carefully arranging the constraints among the elements which are represented as rectangles and the compaction strategies including the basic 2-dimensional compaction ...
Comments