Strength Reduction of Multipliers

This chapter presents a conversion technique for constant multiplications. The targeted multiplication operations (or MULs), which form a significant part of all MULs, are converted into (a number of) less complex, cheaper operations. Multiplier strength reduction is a well-known technique in hardware synthesis and has been used extensively for filter design in custom hardware. However, the specific context of embedded processors presents opportunities and trade-offs that have not been exploited before. The presented strength reduction significantly extends current multiplier strength reduction in compilers and can depend on a cost function in order to optimize performance, area, energy consumption and even operator accuracy, according to the requirements of a specific context. This approach enables the conversion of many more multiplications than are currently converted by state-of-the-art techniques. One of the main ways to exploit this transformation has been described in Chapter 9 where the SoftSIMD concept strongly benefits from the conversion of hardware multiplications into shift-and-add operations.

[1]  Diederik Verkest,et al.  Coffee: COmpiler Framework for Energy-Aware Exploration , 2008, HiPEAC.

[2]  R. Hartley Optimization of canonic signed digit multipliers for filter design , 1991, 1991., IEEE International Sympoisum on Circuits and Systems.

[3]  R. Hashemian A new method for conversion of a 2's complement to canonic signed digit number system and its representation , 1996, Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers.

[4]  R. M. Hewlitt,et al.  Canonical signed digit representation for FIR digital filters , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[5]  In-Cheol Park,et al.  Digital filter synthesis based on minimal signed digit representation , 2001, DAC '01.

[6]  Keith D. Cooper,et al.  Operator strength reduction , 2001, TOPL.

[7]  Vincent Lefèvre,et al.  Multiplication by an Integer Constant , 2001 .

[8]  Robert L. Bernstein Multiplication by integer constants , 1986, Softw. Pract. Exp..

[9]  Kaushik Roy,et al.  An Optimal Algorithm for Low Power Multiplierless FIR Filter Design using Chebychev Criterion , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[10]  Faouzi Kossentini,et al.  JPEG 2000 Image Coding Standard , 2006, Encyclopedia of Multimedia.

[11]  Youfeng Wu Strength reduction of multiplications by integer constants , 1995, SIGP.

[12]  Steven S. Muchnick,et al.  Advanced Compiler Design and Implementation , 1997 .

[13]  Liesbet Van der Perre,et al.  A Coarse-Grained Array based Baseband Processor for 100Mbps+ Software Defined Radio , 2008, 2008 Design, Automation and Test in Europe.