A Caltech Library Service

Monte Carlo Methods for 2-D Compaction

Mosteller, R. C. (1986) Monte Carlo Methods for 2-D Compaction. California Institute of Technology . (Unpublished)

See Usage Policy.

Other (Adobe PDF (9MB))
See Usage Policy.


Use this Persistent URL to link to this item:


A new method of compaction for VLSI circuits is presented. Compaction is done simultaneously in two dimensions and uses a Monte Carlo simulation method often referred to as simulated annealing for optimization. A new curvilinear representation for VLSI circuits, specifically chosen to make the compaction efficient, is developed. Experiments with numerous cells are presented that demonstrate this method to be as good as, or better than the hand compaction previously applied to these cells. Hand compaction was the best previously known method of compaction. An experimental evaluation is presented of how the run time complexity grows as the number, N, of objects in the circuit increases. The results of this evaluation indicates that the run time growth is order O(N log(A))f(d) where f(d) is a function of the density, d, and A is the initial cell area. The function f(d) appears to have negligible or no dependence on N. A hierarchical composition approach is developed which takes advantage of the capability of the curvilinear representation and the 2- dimensional compaction technique.

Item Type:Report or Paper (Technical Report)
Group:Computer Science Technical Reports
Record Number:CaltechCSTR:1986.5230-tr-86
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26670
Deposited By: Imported from CaltechCSTR
Deposited On:24 Apr 2001
Last Modified:03 Oct 2019 03:16

Repository Staff Only: item control page