Placement Algorithms for Arbitrarily Shaped Blocks
- 1 January 1979
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 474-480
- https://doi.org/10.1109/dac.1979.1600152
Abstract
New placement algorithms have been developed which are suitable for the layout of Very Large Scale Integrated (VLSI) circuits. Hierarchical decomposition is used to reduce the circuit function to a size that can be comprehended by the designer and is computationally feasible to layout. At each hierarchical level the problem consists of the placement of interconnected rectangular blocks of arbitrary size and shape such that the area occupied by the blocks and their interconnections is minimal. Constructive initial placement and iterative improvement algorithms are presented.Keywords
This publication has 5 references indexed in Scilit:
- Initial Design Considerations For A Hierarchical Ic Design SystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Methods for Hierarchical Automatic Layout of Custom LSI Circuit MasksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- On the Optimum Two-Dimensional Allocation ProblemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Automatic layout of low-cost quick-turnaround random-logic custom LSI devicesPublished by Association for Computing Machinery (ACM) ,1976
- Multistage Cutting Stock Problems of Two and More DimensionsOperations Research, 1965