N. Boullis and A. Tisserand, Some Optimizations of Hardware Multiplication by Constant Matrices, IEEE Transactions on Computers, vol.54, issue.10, pp.1271-1282, 2005.
DOI : 10.1109/TC.2005.168

URL : https://hal.archives-ouvertes.fr/lirmm-00113092

N. Brisebarre and J. Muller, Correctly Rounded Multiplication by Arbitrary Precision Constants, IEEE Transactions on Computers, vol.57, issue.2, pp.165-174, 2008.
DOI : 10.1109/TC.2007.70813

URL : https://hal.archives-ouvertes.fr/ensl-00000010

K. Chapman, Fast integer multipliers fit in FPGAs (EDN 1993 design idea winner) EDN magazine, 1994.

F. De-dinechin, J. Detrey, I. Trestian, O. Cret¸, R. Cret¸ et al., When FPGAs are better at floatingpoint than microprocessors, 2007.
URL : https://hal.archives-ouvertes.fr/ensl-00174627

F. De-dinechin and V. Lefèvre, Constant multipliers for FPGAs, Parallel and Distributed Processing Techniques and Applications, pp.167-173, 2000.
URL : https://hal.archives-ouvertes.fr/ensl-00269219

A. Dempster and M. Macleod, Constant integer multiplication using minimum adders. Circuits, Devices and Systems, IEE Proceedings, pp.407-413, 1994.
DOI : 10.1049/ip-cds:19941191

J. Detrey and F. De-dinechin, Floating-Point Trigonometric Functions for FPGAs, 2007 International Conference on Field Programmable Logic and Applications, pp.29-34, 2007.
DOI : 10.1109/FPL.2007.4380621

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Detrey, F. De-dinechin, and X. Pujol, Return of the hardware floating-point elementary function, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), pp.161-168, 2007.
DOI : 10.1109/ARITH.2007.29

URL : https://hal.archives-ouvertes.fr/ensl-00117386

V. Dimitrov, L. Imbert, and A. Zakaluzny, Multiplication by a Constant is Sublinear, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007.
DOI : 10.1109/ARITH.2007.24

URL : https://hal.archives-ouvertes.fr/lirmm-00158322

M. D. Ercegovac and T. Lang, Digital Arithmetic, 2003.
URL : https://hal.archives-ouvertes.fr/ensl-00542215

V. Lefèvre, Developments in Reliable Computing, chapter An Algorithm That Computes a Lower Bound on the Distance Between a Segment and Z 2, pp.203-212, 1999.

V. Lefèvre, Multiplication by an integer constant, 1999.

J. Muller, A. Tisserand, B. D. De-dinechin, and C. Monat, Division by Constant for the ST100 DSP Microprocessor, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), pp.124-130, 2005.
DOI : 10.1109/ARITH.2005.17

URL : https://hal.archives-ouvertes.fr/inria-00070661

Y. Voronenko and M. Püschel, Multiplierless multiple constant multiplication, ACM Transactions on Algorithms, vol.3, issue.2, 2007.
DOI : 10.1145/1240233.1240234

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=