Application of logical effort on design of arithmetic blocks

In this paper, we review the logical effort model presented in Sutherland et al. (1991). Based on the HSPICE simulation results using 0.18 /spl mu/m CMOS technology as applied to logic blocks used in arithmetic circuits; we analyze the efficiency of the model and also present modifications that include modeling of wire delay. We propose a new model for logical effort that better fits the behavior of these blocks. The results are applicable for evaluation of arithmetic units as well as for development of new arithmetic algorithms. Our ultimate objective is to close the gap between arithmetic algorithms and their performance in VLSI CMOS.

[1]  Ivan E. Sutherland,et al.  Logical effort: designing for speed on the back of an envelope , 1991 .

[2]  V.G. Oklobdzija,et al.  Application of logical effort on delay analysis of 64-bit static carry-lookahead adder , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[3]  Jan M. Rabaey,et al.  Digital Integrated Circuits: A Design Perspective , 1995 .

[4]  Hoang Dao,et al.  Application of logical effort techniques for speed optimization and analysis of representative adders , 2001, Conference Record of Thirty-Fifth Asilomar Conference on Signals, Systems and Computers (Cat.No.01CH37256).

[5]  Vojin G. Oklobdzija,et al.  High-performance system design : circuits and logic , 1999 .