J. W. Glaisher, Periods of reciprocals of integers prime to 10, Proc

E. Artzy, J. A. Hinds, and H. J. Saal, A fast division technique for constant divisors, Communications of the ACM, vol.19, issue.2, pp.98-101, 1976.
DOI : 10.1145/359997.360013

S. R. Li, Fast constant division routines, IEEE Transactions on Computers, vol.34, issue.9, pp.866-869, 1985.

P. Srinivasan and F. Petry, Constant-division algorithms, Proc. Computers and Digital Techniques, pp.334-340, 1994.
DOI : 10.1049/ip-cdt:19941414

O. Gustafsson and F. Qureshi, Addition Aware Quantization for Low Complexity and High Precision Constant Multiplication, IEEE Signal Processing Letters, vol.17, issue.2, pp.173-176, 2010.
DOI : 10.1109/LSP.2009.2036384

O. Gustafsson, Lower Bounds for Constant Multiplication Problems, IEEE Transactions on Circuits and Systems II: Express Briefs, vol.54, issue.11, pp.974-978, 2007.
DOI : 10.1109/TCSII.2007.903212

V. Dimitrov, L. Imbert, and A. Zakaluzny, Multiplication by a Constant is Sublinear, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), pp.261-268, 2007.
DOI : 10.1109/ARITH.2007.24
URL : https://hal.archives-ouvertes.fr/lirmm-00158322

R. Bernstein, Multiplication by integer constants, Software: Practice and Experience, vol.6, issue.7, pp.641-652, 1986.
DOI : 10.1002/spe.4380160704

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

O. Gustafsson, A. G. Dempster, K. Johansson, and M. D. Macleod, Simplified Design of Constant Coefficient Multipliers, Circuits, Systems, and Signal Processing, pp.225-251, 2006.
DOI : 10.1007/s00034-005-2505-5

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=10.1.1.319.4035

J. Thong and N. Nicolici, An Optimal and Practical Approach to Single Constant Multiplication, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.30, issue.9, pp.1373-1386, 2011.
DOI : 10.1109/TCAD.2011.2153853

L. Aksoy, E. Costa, P. Flores, and J. Monteiro, Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.27, issue.6, pp.1013-1026, 2008.
DOI : 10.1109/TCAD.2008.923242

N. Brisebarre, F. De-dinechin, and J. Muller, Integer and floatingpoint constant multipliers for FPGAs, Application-specific Systems, Architectures and Processors, pp.239-244, 2008.
DOI : 10.1109/asap.2008.4580184
URL : https://hal.archives-ouvertes.fr/ensl-00269219

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

M. Wirthlin, Constant Coefficient Multiplication Using Look-Up Tables, The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology, vol.36, issue.1, pp.7-15, 2004.
DOI : 10.1023/B:VLSI.0000008066.95259.b8

F. De-dinechin and B. Pasca, Designing Custom Arithmetic Data Paths with FloPoCo, IEEE Design & Test of Computers, vol.28, issue.4, 2011.
DOI : 10.1109/MDT.2011.44
URL : https://hal.archives-ouvertes.fr/ensl-00646282

J. Muller, N. Brisebarre, F. De-dinechin, C. Jeannerod, V. Lefèvre et al., Handbook of Floating- Point Arithmetic, 2009.
DOI : 10.1007/978-0-8176-4705-6
URL : https://hal.archives-ouvertes.fr/ensl-00379167

F. De-dinechin and B. Pasca, Floating-point exponential functions for DSP-enabled FPGAs, 2010 International Conference on Field-Programmable Technology, pp.110-117, 2010.
DOI : 10.1109/FPT.2010.5681764
URL : https://hal.archives-ouvertes.fr/ensl-00506125