Advanced modular cell placement system with overlap remover with minimal noise
First Claim
1. A computer implemented method for optimizing cell placement for integrated circuit design, comprising the steps of:
- (a) assigning a plurality of cells to one column of an integrated circuit surface abstraction; and
(b) arranging cells in the one column to remove overlap between cells while maintaining a running summation of positive and negative cell movement distances for cells in the one column.
10 Assignments
0 Petitions
Accused Products
Abstract
A method for refining the position of linearly aligned cells on the surface of a semiconductor chip is disclosed herein. The method comprises defining an array of spaces between cells based on maximum and minimum cell positions, establishing a minimum spacing between cells, and linearly shifting cells in a predetermined manner such that no cells are closer to one another than the minimum spacing between cells. Linear shifting is accomplished by shifting any cell in a positive direction if the spacing associated the cell is less than the minimum spacing between cells; shifting any cell in a negative direction if the spacing associated with the cell is greater than the minimum spacing between cells, but only if all cells on the negative side of the cell have been shifted in their maximum negative direction; and performing positive shifting and negative shifting until all cells have been shifted such that no space between cells is less than the negative space between cells.
-
Citations
20 Claims
-
1. A computer implemented method for optimizing cell placement for integrated circuit design, comprising the steps of:
-
(a) assigning a plurality of cells to one column of an integrated circuit surface abstraction; and (b) arranging cells in the one column to remove overlap between cells while maintaining a running summation of positive and negative cell movement distances for cells in the one column. - View Dependent Claims (2, 3, 4)
-
-
5. A method for efficiently placing a plurality of elements on a surface divided into a plurality of regions each having at least one linear channel thereon, comprising the steps of:
-
(a) indexing elements in each linear channel; (b) computing an array representing relative element positions; and (c) modifying said array such that elements do not overlap. - View Dependent Claims (6, 7, 8, 9, 10, 11, 12)
-
-
13. A method for refining the position of linearly aligned cells on the surface of a semiconductor chip, comprising the steps of:
-
(a) defining an array of spaces between cells based on maximum and minimum cell positions; (b) establishing a minimum spacing between the cells; and (c) linearly shifting cells in a predetermined manner such that no cells are closer to one another than the minimum spacing between cells, while maintaining a running summation of positive and negative cell movement distances for the cells. - View Dependent Claims (14, 15, 16)
-
-
17. A system for efficiently locating a plurality of linearly aligned elements, comprising:
-
(a) computing a spacing array based on maximum and minimum element positions; and (b) modifying element alignment based on keeping spacing between elements greater than a minimum spacing value, while maintaining a running summation of positive and negative element adjustment distances.
-
-
18. A computer storage device containing instructions for a computer to optimize cell placement in an integrated circuit including the following computer implemented steps:
-
(a) assigning a plurality of cells to one column of an integrated circuit surface abstraction; and (b) arranging cells in the one column as necessary to remove overlap between cells while maintaining a running summation of positive and negative cell movement distances for cells in the one column. - View Dependent Claims (19, 20)
-
Specification