Systematic analysis of bounds on power consumption in pipelined and non-pipelined multipliers

The paper presents a systematic theoretical approach for the analysis of bounds on power consumption in Baugh-Wooley, binary tree and Wallace tree multipliers. This is achieved by first developing state transition diagrams (STDs) for the sub circuits making up the multipliers. The STD is comprised of states and edges, with the edges representing a transition (switching activity) from one state to another in the sub circuit. Then, maximum (minimum) energy values associated with the edges constituting the STDs are used to derive the zipper (lower) bound in both non pipelined and p-bit level pipelined multipliers. It is shown that as p is decreased, the upper bound approaches the lower bound. Moreover, based on the theoretical analysis we conclude that the upper bound in a Baugh-Wooley multiplier has a cubic dependence on the word length, while that in a binary tree multiplier has a quadratic dependence on the word length.

[1]  K. Roy,et al.  Estimation Of Circuit Activity Considering Signal Correlations And Simultaneous Switching , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[2]  Sung-Mo Kang,et al.  Estimation of maximum transition counts at internal nodes in CMOS VLSI circuits , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[3]  Mary Jane Irwin,et al.  Power-delay characteristics of CMOS adders , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[4]  Earl E. Swartzlander,et al.  Estimating the power consumption of CMOS adders , 1993, Proceedings of IEEE 11th Symposium on Computer Arithmetic.

[5]  Farid N. Najm,et al.  Transition density: a new measure of activity in digital circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Keshab K. Parlzi HIGH-SPEED VLSI ARITHMETIC PROCESSOR ARCHITECTURES USING HYBRID NUMBER REPRESENTATION' , 1991 .

[7]  Radu Marculescu,et al.  Switching activity analysis considering spatiotemporal correlations , 1994, ICCAD.

[8]  Keshab K. Parhi,et al.  HEAT: hierarchical energy analysis tool , 1996, DAC '96.

[9]  E BryantRandal Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

[10]  Ravishankar K. Iyer,et al.  Measurement and modeling of computer reliability as affected by system activity , 1986, TOCS.

[11]  Chi-Ying Tsui,et al.  Power estimation methods for sequential logic circuits , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[12]  Jiing-Yuan Lin,et al.  A cell-based power estimation in CMOS combinational circuits , 1994, ICCAD.

[13]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[14]  Ibrahim N. Hajj,et al.  Maximum current estimation in CMOS circuits , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[15]  Keshab K. Parhi,et al.  High-speed VLSI arithmetic processor architectures using hybrid number representation , 1992, J. VLSI Signal Process..

[16]  Keshab K. Parhi,et al.  A hierarchical approach to transistor-level power estimation of arithmetic units , 1996, 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing Conference Proceedings.

[17]  R. Marculescu,et al.  Switching Activity Analysis Considering Spatioternporal Correlations , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[18]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..