Optimizing low-power high-speed full adders with simulated annealing

In this paper, a random search algorithm known as simulated annealing (SA) has been employed to optimize the sizing of a number of digital adder circuits. The SA algorithm is implemented in MATLAB; the cost function, a function of power and delay, is accurately computed using HSPICE for a 0.35 /spl mu/m technology. Using a piecewise linear and logarithmic cost function, the delay and power is optimized in an intelligent fashion. The results show a 60% reduction in power and a 65% reduction in delay with respect to previous designs based on analytical calculations.

[1]  Tarek Darwish,et al.  Performance analysis of low-power 1-bit CMOS full adder cells , 2002, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Rob A. Rutenbar,et al.  Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.

[3]  Kiyong Choi,et al.  Parasitic-aware synthesis of RF CMOS switching power amplifiers , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[4]  M. Chan,et al.  PROMPT3-a cell-based transistor sizing program using heuristic and simulated annealing algorithms , 1989, 1989 Proceedings of the IEEE Custom Integrated Circuits Conference.