Low power reconfigurable multiplier with reordering of partial products

In any general purpose processor the use of conventional full precision multipliers results in increase in the power, area and computational time. So, multipliers being the basic key element of any computation unit take its own importance in decreasing the power as well as increase in the speed. Twin Precision Multipliers has flexible and reconfigurable computational units are creating a trend which overcomes the drawback of the conventional full precision multipliers and also resulting in higher computational throughput of the processors. This paper proposes low power reconfigurable multiplier architecture based reordering of partial products, which reduces the power consumption based on partial products reordering. Reordering of partial products technique is applied on both High Performance Multiplication (HPM) and Dadda column reduction techniques to obtain low power reconfigurable twin precision multiplier.

[1]  Marc Tremblay,et al.  VIS speeds new media processing , 1996, IEEE Micro.

[2]  Magnus Själander,et al.  Multiplication Acceleration Through Twin Precision , 2009, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[3]  Sundeepkumar Agarwal,et al.  Energy-Efficient, High Performance Circuits for Arithmetic Units , 2008, 21st International Conference on VLSI Design (VLSID 2008).

[4]  Koji Inoue,et al.  Multiplier energy reduction through bypassing of partial products , 2002, Asia-Pacific Conference on Circuits and Systems.

[5]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[6]  Magnus Själander,et al.  A low-leakage twin-precision multiplier using reconfigurable power gating , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[7]  Earl E. Swartzlander,et al.  A comparison of Dadda and Wallace multiplier delays , 2003, SPIE Optics + Photonics.

[8]  Magnus Själander,et al.  An efficient twin-precision multiplier , 2004, IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings..

[9]  Bruce A. Wooley,et al.  A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.

[10]  Mary Sheeran,et al.  Multiplier reduction tree with logarithmic logic depth and regular connectivity , 2006, 2006 IEEE International Symposium on Circuits and Systems.