A theoretical approach to estimation of bounds on power consumption in digital multipliers
- 1 June 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
- Vol. 44 (6) , 473-481
- https://doi.org/10.1109/82.592578
Abstract
This paper presents a systematic theoretical approach for the analysis of bounds on powerconsumption in digital multipliers. This is because in many applications the maximum value ofpower consumption and not just the average power may be of importance to the designer. Themaximum values can be used to predict the maximum battery life in portable applications andalso determine the nature of heat sinks in non-portable applications. The proposed approachinvolves the development of state...Keywords
This publication has 17 references indexed in Scilit:
- Estimation Of Circuit Activity Considering Signal Correlations And Simultaneous SwitchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Maximum current estimation in CMOS circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Optimizing multipliers for WSIPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Systematic analysis of bounds on power consumption in pipelined and non-pipelined multipliersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Estimation of maximum transition counts at internal nodes in CMOS VLSI circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Power estimation methods for sequential logic circuitsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1995
- High-speed VLSI arithmetic processor architectures using hybrid number representationJournal of Signal Processing Systems, 1992
- Estimation of power dissipation in CMOS combinational circuits using Boolean function manipulationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- A Two's Complement Parallel Array Multiplication AlgorithmIEEE Transactions on Computers, 1973
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964