Gate sizing: a general purpose optimization approach
Olivier Coudert · 1996
Gate sizing consists of choosing for each node of a mapped network a gate implementation in the library so that some cost function is optimized under some constraints. The methods previously proposed to address this problem suffer from problems that makes them difficult to apply on real-life large circuits. This paper presents the gate sizing algorithm GS, which has the following characteristics. It is a general purpose optimizer, e.g., it can optimize the power or/and area under some delay constraints, or the delay under some power or/and area constraints. It is oriented to a pure combinatorial optimization, and addresses non-linear, non-unimodal, constrained optimization, which enables it to handle complex cost models. It can take into account user defined or library dependent design rules. It can be applied on large circuits within a reasonable CPU time, e.g., 10000 nodes in 2 hours.