1. Low-Power Multipliers with Data Wordlength Reduction Kyungtae Han (khan@mail.utexas.edu) Brian L. Evans (bevans@ece.utexas.edu) Earl E. Swartzlander, Jr. (eswartzla@aol.com) Dept. of Electrical and Computer Engineering The University of Texas at Austin Austin, TX 78712 USA Asilomar Conference on Signals, Systems & Computers November 2nd, 2005

2. 2 Outline Introduction Wordlength reduction Power consumption Analysis in switching expectation FPGA dynamic power estimation Conclusion

3. 3 Introduction Minimize power dissipation due to limited battery power and cooling system Multipliers often a major source of power consumption in typical DSP applications Multi-precision multipliers can select smaller multipliers (8, 16 or 24 bits) to reduce power consumption Wordlength reduction to select any word size [Han, Evans, and Swartzlander 2004]

4. 4 Wordlength Reduction in Multiplication Input data wordlength reduction –Smaller bits enough to represent, e.g. π x π ≈ 9 Truncation Signed right shift –Move toward the least significant bit (LSB) –Signed bit extended for arithmetic right shift Sign bit

5. 5 Power Reduction via Wordlength Reduction Power dissipation –Switching power consumption –Static power consumption Switching power consumption –Switching activity parameter, α –Reduce α by wordlength reduction What is relationship between wordlength and switching parameter, α, in power consumption? CLCL Load capacitance V dd Operating voltage f clk Operating frequency

6. 6 Switching Activity in Multipliers Logic delay and propagation cause glitches Proposed analytical method –Hard to estimate glitches in closed form –Analyze switching activity w/r to input data wordlength –Does not consider multiplier architecture Simulation method –Count all switching activities (transition counts in logic) –Power estimation (Xilinx XPower) –Considers multiplier architecture

7. 7 Analytical Method Consider stream of data for one of the multiplicands Compare two adjacent numbers in stream after reduction Expectation of bit switching, x, with probability P x –L-bit input data –Truncate input data to M bits (N bits are removed) –N-bit signed right shift in L-bit input (Y is sign bit) S …… L bits M bitsN bits S …… SS … SS …

8. 8 Analytical Method X has binomial distribution Always L/2 (independent on M and N)

9. 9 Analytical Method InputSwitching expectation Full length used L/2 Truncate N bits M/2 N-bit signed right shift L/2 Wordlength (L) = 16

10. 10 Wallace vs. Booth Multipliers Tree dot diagram in 4-bit Wallace multiplier Radix-4 multiplier based on Booth’s recoding (Χ ● a = P) Asymmetric (one operand recoded) Symmetric

11. 11 Dynamic Power Consumption for Wallace Multiplier (1MHz) Reduction (56%) 16-bit x 16-bit multiplier (Simulated on XC3S200- 5FT256 FPGA) Swapping (recode,nonrecode)

12. 12 Dynamic Power Consumption for Radix-4 Modified Booth Multiplier (1MHz) Reduction (31%) Sensitive (13%) Swapping (recode,nonrecode) 16-bit x 16-bit multiplier (Simulated on XC3S200- 5FT256 FPGA)

13. 13 Conclusion Truncation to 8 bits reduces est. power consumption by 56% in Wallace and 31% in Booth 16-bit multipliers Signed right shift exhibits no est. power reduction in Wallace multiplier (for any shift) and 25% reduction in Booth multipliers (for 8-bit shift) Power consumption in tree-based multiplier –Highly depends on input data –Simulation of all switching activity matches analysis of switching activity in reduced multiplicands in Wallace mult. Operand swapping can reduce power consumption –In Booth multiplier, non-recoded operand 13% more sensitive in power consumption

14. 14 Thank You!

15. 15 Backup Slides

16. 16 Dynamic Power Consumption 16-bit x 16-bit multiplier (Simulated on XC3S200- 5FT256 FPGA) Wallace multiplier (1 MHz) Radix-4 modified Booth multiplier (1 MHz) 56% 31% Swapping