F. Quereshi and O. Gustafsson, Low-complexity reconfigurable complex constant multiplication for FFTs, 2009 IEEE International Symposium on Circuits and Systems, pp.24-27, 2009.
DOI : 10.1109/ISCAS.2009.5117961

J. Thong and N. Nicolici, A novel optimal single constant multiplication algorithm, Proceedings of the 47th Design Automation Conference on, DAC '10, pp.613-616, 2010.
DOI : 10.1145/1837274.1837424

H. J. Kang and I. C. Park, FIR Filter Synthesis Algorithms for Minimizing the Delay and the Number of Adders, IEEE Trans. on Circuits and Systems II: Analog and Digital Signal Processing, vol.48, issue.8, pp.770-777, 2001.

R. Hartley, Subexpression sharing in filters using canonic signed digit multipliers, IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol.43, issue.10, pp.677-688, 1996.
DOI : 10.1109/82.539000

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

C. Wallace, A Suggestion for a Fast Multiplier, IEEE Transactions on Electronic Computers, vol.13, issue.1, pp.14-17, 1964.
DOI : 10.1109/PGEC.1964.263830

W. Gallagher and E. Swartzlander, High radix booth multipliers using reduced area adder trees, Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers, pp.545-549, 1994.
DOI : 10.1109/ACSSC.1994.471512

H. Nguyen and A. Chatterjee, Number-splitting with shift-and-add decomposition for power and hardware optimization in linear DSP synthesis, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol.8, issue.4, pp.419-424, 2000.
DOI : 10.1109/92.863621

M. Potkonjak, M. Srivastava, and A. Chandrakasan, Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.15, issue.2, pp.151-165, 1996.
DOI : 10.1109/43.486662

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

A. Yurdakul and G. Dündar, Multiplierless Realization of Linear DSP Transforms by Using Common Two-Term Expressions, The Journal of VLSI Signal Processing, vol.22, issue.3, pp.163-172, 1999.
DOI : 10.1023/A:1008125221674

A. Hosangadi, F. Fallah, and R. Kastner, Reducing Hardware Complexity of Linear DSP Systems by Iteratively Eliminating Two-Term Common Subexpressions, Proc. of Asia and South Pacific Design Automation Conference, pp.523-528, 2005.

L. Aksoy, E. Costa, P. Flores, and J. Monteiro, Optimization Algorithms for the Multiplierless Realization of Linear Transforms, ACM Transactions on Design Automation of Electronic Systems, vol.17, issue.1, 2012.
DOI : 10.1145/2071356.2071359

D. Bull and D. Horrocks, Primitive operator digital filters, IEE Proc. G: Circuits, Devices and Systems, pp.401-412, 1991.
DOI : 10.1049/ip-g-2.1991.0066

A. Dempster and M. Macleod, Use of minimum-adder multiplier blocks in FIR digital filters, IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol.42, issue.9, pp.569-577, 1995.
DOI : 10.1109/82.466647

O. Gustafsson and L. Wanhammar, A novel approach to multiple constant multiplication using minimum spanning trees, The 2002 45th Midwest Symposium on Circuits and Systems, 2002. MWSCAS-2002., pp.652-655, 2002.
DOI : 10.1109/MWSCAS.2002.1187124
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.321.1568

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

L. Aksoy, E. Gunes, and P. Flores, Search algorithms for the multiple constant multiplications problem: Exact and approximate, Microprocessors and Microsystems, vol.34, issue.5, pp.151-162, 2010.
DOI : 10.1016/j.micpro.2009.10.001

A. Dempster, O. Gustafsson, and J. Coleman, Towards an Algorithm for Matrix Multiplier Blocks, Proc. of IEEE European Conference on Circuit Theory and Design, pp.1-4, 2003.

O. Gustafsson, H. Ohlsson, and L. Wanhammar, Low-Complexity Constant Coefficient Matrix Multiplication Using a Minimum Spanning Tree, Proc. of Nordic Signal Processing Symposium, pp.141-144, 2004.

A. Avizienis, Signed-digit Number Representation for Fast Parallel Arithmetic, IRE Trans. on Electronic Computers EC, pp.10-389, 1961.
DOI : 10.1109/tec.1961.5219227

H. Garner, Number Systems and Arithmetic, Advances in Computers, vol.6, pp.131-194, 1965.
DOI : 10.1016/S0065-2458(08)60420-9

P. Cappello and K. Steiglitz, Some complexity issues in digital signal processing, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.32, issue.5, pp.1037-1041, 1984.
DOI : 10.1109/TASSP.1984.1164433

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

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

A. Hosangadi, F. Fallah, and R. Kastner, Simultaneous Optimization of Delay and Number of Operations in Multiplierless Implementation of Linear Systems, Proc. of International Workshop on Logic Synthesis, 2005.

A. Arfaee, A. Irturk, N. Laptev, F. Fallah, and R. Kastner, Xquasher, Proceedings of the 46th Annual Design Automation Conference on ZZZ, DAC '09, pp.254-257, 2009.
DOI : 10.1145/1629911.1629980

V. Lefevre, Multiplication by an Integer Constant, Institut National de Recherche en Informatique et en Automatique, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072430

L. Aksoy, E. Costa, P. Flores, and J. Monteiro, Finding the optimal tradeoff between area and delay in multiple constant multiplications, Microprocessors and Microsystems, vol.35, issue.8, pp.729-741, 2011.
DOI : 10.1016/j.micpro.2011.08.009