New Algorithms for Gate Sizing: A Comparative Study

  title={New Algorithms for Gate Sizing: A Comparative Study},
  author={Olivier Coudert and Ramsey W. Haddad and Srilatha Manne},
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. It has a signi cant impact on the delay, power dissipation, and area of the nal circuit. This paper compares ve gate sizing algorithms targeting discrete, non-linear, non-unimodal, constrained optimization. The goal is to overcome the non-linearity and nonunimodality of the delay and the power to achieve good quality results… CONTINUE READING

Figures, Tables, and Topics from this paper.


Publications citing this paper.

Similar Papers

Loading similar papers…