Monte Carlo Methods for 2-D Compaction

Mosteller, R. C. (1986) Monte Carlo Methods for 2-D Compaction. Technical Report. California Institute of Technology. [CaltechCSTR:1986.5230-tr-86]

Full text available as:

	Postscript - Requires a viewer, such as GhostView
	Other (Adobe PDF (9MB))

Abstract

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.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	14
Deposited By:	Caltech Library System
Deposited On:	24 April 2001
Record Number:	CaltechCSTR:1986.5230-tr-86
Official Persistent URL:	http://resolver.caltech.edu/CaltechCSTR:1986.5230-tr-86
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record