Layout compaction with attractive and repulsive constraints

A one-dimensional VLSI layout compaction algorithm with attractive and repulsive constraints is proposed. Depending on these constraints, the proposed algorithm shrinks (expands) the spaces among the specified layout elements without causing any design rule violations. The resultant layout has less cross-talks and delay. The proposed network simplex algorithm experimentally proves to be efficient in both time and space.<
>