A Novel General Graph-Based Simplex Algorithm Applied to IC Layout Compaction and Migration

In this paper, a novel method for solving the IC layout compaction problem is introduced. The solution supports all kinds of linear constraints and linear optimization functions. Graph-based techniques are employed so that all matrix operations in linear programming are replaced by much faster graph operations. The proposed algorithm outperforms all studied compaction methods by combining the generality of linear programming and the efficiency of graph-based methods. Correct and optimal migrated layouts were produced with significant improvement in performance.