C. S. Wallace, A Suggestion for a Fast Multiplier, EC-13, pp.14-17, 1964.
DOI : 10.1109/PGEC.1964.263830

L. Dadda, Some schemes for parallel multipliers, Alta Frequenza, vol.34, pp.349-356, 1965.

V. Oklobdzija, D. Villeger, and S. Liu, A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach, IEEE Transactions on Computers, vol.45, issue.3, pp.294-306, 1996.
DOI : 10.1109/12.485568

P. F. Stelling, C. U. Martel, V. G. Oklobdzija, and R. Ravi, Optimal circuits for parallel multipliers, IEEE Transactions on Computers, vol.47, issue.3, pp.273-285, 1998.
DOI : 10.1109/12.660163

E. E. Swartzlander, Merged Arithmetic, IEEE Transactions on Computers, vol.29, issue.10, pp.946-950, 1980.
DOI : 10.1109/TC.1980.1675482

A. K. Verma, P. Brisk, and P. Ienne, Data-Flow Transformations to Maximize the Use of Carry-Save Representation in Arithmetic Circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.27, issue.10, pp.1761-1774, 2008.
DOI : 10.1109/TCAD.2008.2003280

H. Parendeh-afshar, A. Neogy, P. Brisk, and P. Ienne, Compressor tree synthesis on commercial high-performance FPGAs, ACM Transactions on Reconfigurable Technology and Systems, vol.4, issue.4, 2011.
DOI : 10.1145/2068716.2068725

F. De-dinechin, M. Istoan, and G. Sergent, Fixed-point trigonometric functions on FPGAs, Highly-Efficient Accelerators and Reconfigurable Technologies, 2013.
DOI : 10.1145/2641361.2641375

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

F. De-dinechin and L. Didier, Table-Based Division by Small Integer Constants, pp.53-63, 2012.
DOI : 10.1049/ip-cdt:19941414

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

F. De-dinechin and B. Pasca, Designing Custom Arithmetic Data Paths with FloPoCo, IEEE Design & Test of Computers, vol.28, issue.4, pp.18-27, 2011.
DOI : 10.1109/MDT.2011.44

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

S. Banescu, F. De-dinechin, B. Pasca, and R. Tudoran, Multipliers for floating-point double precision and beyond on FPGAs, ACM SIGARCH Computer Architecture News, vol.38, issue.4, pp.73-79, 2010.
DOI : 10.1145/1926367.1926380

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

B. Pasca, Correctly rounded floating-point division for DSP-enabled FPGAs, 22nd International Conference on Field Programmable Logic and Applications (FPL), 2012.
DOI : 10.1109/FPL.2012.6339189

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

C. Baugh and B. Wooley, A Two's Complement Parallel Array Multiplication Algorithm, IEEE Transactions on Computers, vol.22, issue.12, pp.1045-1047, 1973.
DOI : 10.1109/T-C.1973.223648

G. Jaberipur, B. Parhami, and M. Ghodsi, An Efficient Universal Addition Scheme for All Hybrid-Redundant Representations with Weighted Bit-Set Encoding, Journal of VLSI signal processing systems for signal, image and video technology, vol.33, issue.1, pp.149-158, 2006.
DOI : 10.1007/s11265-005-4177-6

H. D. Nguyen, B. Pasca, and T. Preusser, FPGA-Specific Arithmetic Optimizations of Short-Latency Adders, 2011 21st International Conference on Field Programmable Logic and Applications, pp.232-237, 2011.
DOI : 10.1109/FPL.2011.49

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

H. Hassler and N. Takagi, Function evaluation by table look-up and addition, Proceedings of the 12th Symposium on Computer Arithmetic, pp.10-16, 1995.
DOI : 10.1109/ARITH.1995.465382