?. ?-?s-?t?@bullet?s-?-?-s-??s, @. ?. ??-??@bullet???té-??s-?-?-?-?-É?s?-?-?-tr, ?. ????-?-?-?-??-?-?rt, ?. , ?. ?. et al., ?r??t à ??s s?????t???s? ??? ??ss? ?ét?r????r ??s ???t??rs ????tré? q?? ??????s??t s?sté??t?q?????t ??? ?rr??rs ??s ???s ????rt??t?s ?st ?? ?r???è?? très ???????? ??r??r ??????t ??s ?rr??rs ???rr???? ?st? ?? ?é?ér??? ?ss?? ????????? ???ér??t?s ?ét????s ??t été ?r???sé?s ???r ?? ?????? ??tt??t ????? ???r?t??ét?q?? st????st?q?? ???? ?? ???????s? st?t?q?? ????? ??s tr????? r???rq?????s ré???ts ???s ??r??t ??s é?é???ts ?? s???t??? à ??s ?r???è??s ???t???s?t??? ?t ??????t????? ???s s? t?ès??ss???? ??r?? ????tr?s ??? ???s ?rès? ??rs ±?? ?t??? ?? ???rr??r r????r??é?? ?? ? ?? s?rt?? ?? ?????r????t ??? s??s ?? ???r?t??ét?q?? ????t?r?????s? ?? ??tt? ?rr??r? ??s ??r??s ???rr??r r?t??r?é?s ??r ????? s??t ???? ???s ???s q?? ?? q?? ?? t???ér?t?r?? ??s ??r??t???s ?? ?? t??s??? ????????t?t???? ??s ??rt?r? ??t???s é???tr?????ét?q??s ??t??r ?? ????? ??s ?r??ts ???s ?? s??str?t ?? ??r???t? ?t?? ???s ?? ?? ??r???t ??té?ré? ??s ????s ?r????s ?? ???? ??????t ????????r ?? ?réq????? ??s ?s?????t??rs ?? ??????? ?q?? ???r????t êtr? t?t??????t ???r?s??s??t? ??é?t??r? ?? ???? ???t ?? ???s êtr? s??s??t? ?? ?ê?? ??????t????? ??s ?tt?q??s s?é???q??s ??????t êtr? ????s??é?s ???r ?é?r???r ?? q????té ?? ????é? ?t ???s? ?r?????s?r ??rt???s s?stè??s

?. ???-?-?tr?-?é?r?t-?-?-tr????@bullet-s?r-@bullet?-?-?-t?, ?. , ?. ??-?-?-Ér?t??rs-?r?t?, ?. , ?. et al., ??s???rs r??s??s? ?? tr????? ????str? très ???? ??s tr????? s?r ??s ???ér??t?s ????tt?s ?? ???r?t??ét?q?? ??s ?r????t??rs ?rés??té?s????rs r?????s? ?? s????rt ??tér??? ????ér?t???s é????é?s ?st ?é??ss??r? ???r ??rt????s ???????t???s s?é???q??s? ??s ???????t???s ?? tr??t????t ?? s????? ?t ??s ?????s ????t???t ??s ????s???s? ????rs?s? r?????s ??rré?s ?? r?????s ??rré?s ????rs?s? ????tr?s ???????t???s ?t???s??t ??s s???s? ??s???s? ????? ???ér??ts t???s ?? ?ét????s s??t ?r???sés ???s ?? ??ttér?t?r? ???r ??é?????t??? ?? ????t???s? ?? tr???? ???s ???? ??s ??s?s ???r?t??ét?q?? ??s ?r????t??rs ?t ?? ??rt??????r ??s ??ér?t???s ????? ?? ????s???? ??????rs?? ?? r????? ??rré? ?t ?? r????? ??rré? ????rs?? ???s ?????? ??s ?r????????s ?ét????s ??é?????t??? ??s ????t???s é?é???t??r?s ?sin? cos? exp? log? ?t??? s??t ?rés??té?s? P?r?? t??t?s ??s ?ét????s ??ss????s? ??s ???r?????t???s ???????????s s??t s?????t ?t???sé?s? ????s ??r??tt??t ??é?????r ???s ?? tr?????? ???s ???? tr??s ??????t ??t???r ??s ??ér?t??rs s?é???q??s ???r ??é?????t??? ?? ????t???s ??r ??s

R. Hartley and P. Corbett, Digit-serial processing techniques, IEEE Transactions on Circuits and Systems, vol.37, issue.6, pp.707-719, 1990.
DOI : 10.1109/31.55029

P. B. Denyer and S. G. Smith, Advanced Serial-Data Computation, J. Parallel Distributed Comput., (Special Issue on Parallelism in Computer Arithmetic), vol.5, issue.3, pp.228-249, 1988.

M. D. Ercegovac and T. Lang, On-Line arithmetic: A design methodology and applications in digital signal processing, VLSI Signal Processing, pp.252-263, 1988.

J. Moran, I. Rios, and J. Meneses, Signed digit arithmetic on FPGA's, " presented at the Int, FPGA: Logic and Applications, 1993.

X. Merrheim, Bases discretes et calcul des fonctions elementaires par materiel, 1994.

J. C. Bajard, J. Duprat, S. Kla, and J. M. Muller, Some Operators for On-Line Radix-2 Computations, Journal of Parallel and Distributed Computing, vol.22, issue.2, pp.336-345, 1994.
DOI : 10.1006/jpdc.1994.1093

M. D. Ercegovac, On-line arithmetic: An overview, Proc. SPIE Conf. Real-Time Signal Processing, pp.86-93, 1984.

A. Avizienis, Signed-digit number representations for fast parallel arithmetic, IRE Trans. Electron. Computers, vol.10, pp.389-400, 1961.
DOI : 10.1109/tec.1961.5219227

M. D. Ercegovac and K. S. Trivedi, On-line algorithms for division and multiplication, IEEE Trans. Computers, issue.26, pp.681-687, 1977.

P. Tu, On-line arithmetic algorithms for efficient implementation, Comput. Sci. Dep, 1990.

M. D. Ercegovac and T. Lang, On-the-Fly Conversion of Redundant into Conventional Representations, IEEE Transactions on Computers, vol.36, issue.7, pp.895-897, 1987.
DOI : 10.1109/TC.1987.1676986

R. Kasper, Motion control with field programmable gate arrays Tutorial: Tools for Real-Time Motion Control, MOVIC Conf, pp.1-20, 1998.

J. M. Muller, Arithmetique des Ordinateurs, 1989.
URL : https://hal.archives-ouvertes.fr/ensl-00086707

C. Canudas-de-wit, H. Olsson, K. J. Aström, and P. Lischinsky, A new model for control of systems with friction, IEEE Transactions on Automatic Control, vol.40, issue.3, pp.419-425, 1995.
DOI : 10.1109/9.376053

R. Forest, Arithmetique on-line en base 4 pour les controlleurs digitaux en automatique, Ecole Polytechnique de Lausanne, 1997.

M. D. Ercegovac and T. Lang, Division and Square Root: Digit- Recurrence Algorithms and Implementations, Boston: Kluwer Academic, 1994.

P. M. Farmwald, ªHigh Bandwidth Evaluation of Elementary Functions, Proc. Fifth IEEE Symp, 1981.

H. Hassler and N. Takagi, ªFunction Evaluation by Table Look- Up and Addition, Proc. 12th IEEE Symp, pp.10-16, 1995.
DOI : 10.1109/arith.1995.465382

C. Iordache and D. W. , Matula, ªOn Infinitely Precise Roundings for Division, Square-Root, Reciprocal and Square-Root Reciprocal, Proc. 14th IEEE Symp. Computer Arithmetic, pp.233-240, 1999.

M. Ito, N. Takagi, and S. Yajima, ªEfficient Initial Approximation and Fast Converging Methods for Division and Square Root, Proc. 12th IEEE Symp, pp.2-9, 1995.

V. K. Jain and L. Lin, ªHigh-Speed Double Precision Computation of Nonlinear Functions, Proc. 12th IEEE Symp, pp.107-114, 1995.

J. M. Muller, Elementary Functions, Algorithms and Implementation, 1997.
URL : https://hal.archives-ouvertes.fr/ensl-00000008

S. F. Oberman and M. J. Flynn, Division algorithms and implementations, IEEE Transactions on Computers, vol.46, issue.8, pp.833-854, 1997.
DOI : 10.1109/12.609274

M. Schulte and J. Stine, ªSymmetric Bipartite Tables for Accurate Function Approximation, Proc. 13th IEEE Symp, 1997.
DOI : 10.1109/arith.1997.614893
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.6368

P. T. Tang, ªTable Lookup Algorithms for Elementary Functions and Their Error Analysis, Proc. 10th IEEE Symp, pp.232-236, 1991.

W. F. Wong and E. Goto, Fast hardware-based algorithms for elementary function computations using rectangular multipliers, IEEE Transactions on Computers, vol.43, issue.3, pp.278-294, 1994.
DOI : 10.1109/12.272429

W. F. Wong and E. Goto, Fast evaluation of the elementary functions in single precision, IEEE Transactions on Computers, vol.44, issue.3, pp.453-457, 1995.
DOI : 10.1109/12.372037

T. Lang and P. Montuschi, Very high radix square root with prescaling and rounding and a combined division/square root unit, IEEE Transactions on Computers, vol.48, issue.8, pp.827-841, 1999.
DOI : 10.1109/12.795124

E. Antelo, T. Lang, and J. D. , Computation of ???(x/d) in a very high radix combined division/square-root unit with scaling and selection by rounding, IEEE Transactions on Computers, vol.47, issue.2, pp.152-161, 1998.
DOI : 10.1109/12.663761

D. , D. Sarma, and D. Matula, Faithful Bipartite ROM Reciprocal Tables, Proc. 12th IEEE Symp, pp.17-28, 1995.

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

M. Schulte and J. Stine, Approximating elementary functions with symmetric bipartite tables, IEEE Transactions on Computers, vol.48, issue.8, pp.842-847, 1999.
DOI : 10.1109/12.795125

J. Stine and M. Schulte, The Symmetric Table Addition Method for Accurate Function Approximation, The Journal of VLSI Signal Processing, vol.21, issue.2, pp.167-177, 1999.
DOI : 10.1023/A:1008004523235

J. Muller, A Few Results on Table-Based Methods, Reliable Computing, vol.5, issue.3, pp.279-288, 1999.
DOI : 10.1007/978-94-017-1247-7_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.7830

J. Muller, Elementary Functions, Algorithms and Implementation, 1997.
URL : https://hal.archives-ouvertes.fr/ensl-00000008

C. Iordache and D. W. Matula, Analysis of Reciprocal and Square Root Reciprocal Instructions in the AMD K6-2 Implementation of 3DNow!, Electronic Notes in Theoretical Computer Science, vol.24, 1999.
DOI : 10.1016/S1571-0661(05)80621-8

J. Detrey and F. De-dinechin, A VHDL library of LNS operators, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003, 2003.
DOI : 10.1109/ACSSC.2003.1292376

F. De-dinechin and A. Tisserand, Some improvements on multipartite table methods, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp.128-135, 2001.
DOI : 10.1109/ARITH.2001.930112
URL : https://hal.archives-ouvertes.fr/inria-00072577

D. Matula, Improved table lookup algorithms for postscaled division, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp.101-108, 2001.
DOI : 10.1109/ARITH.2001.930109

F. J. Taylor, R. Gill, J. Joseph, and J. Radke, A 20 bit logarithmic number system processor, IEEE Transactions on Computers, vol.37, issue.2, 1988.
DOI : 10.1109/12.2148

D. M. Lewis, An architecture for addition and subtraction of long word length numbers in the logarithmic number system, IEEE Transactions on Computers, vol.39, issue.11, 1990.
DOI : 10.1109/12.61042

J. N. Coleman and E. I. Chester, Arithmetic on the European logarithmic microprocessor, IEEE Transactions on Computers, vol.49, issue.7, pp.702-715, 2000.
DOI : 10.1109/12.863040

B. Lee and N. Burgess, A Dual-Path Logarithmic Number System Addition/Subtraction Scheme for FPGA, Proc. Field-Programmable Logic and Applications, 2003.
DOI : 10.1007/978-3-540-45234-8_78

W. Wong and E. Goto, Fast evaluation of the elementary functions in single precision, Proc. 36th Asilomar Conf. Signals, Systems, and Computers, pp.453-457, 1995.
DOI : 10.1109/12.372037

J. A. Piñ-eiro, J. D. Bruguera, and J. Muller, Faithful Powering Computation Using Table Look-Up and a Fused Accumulation Tree, Proc. 15th IEEE Symp. Computer Arithmetic, N. Burgess and L. Ciminiera, pp.40-47, 2001.

F. De-dinechin and J. Detrey, Multipartite Tables in Jbits for the Evaluation of Functions on FPGAs, Proc. IEEE Reconfigurable Architecture Workshop, Int'l Parallel and Distributed Symp, 2002.

D. J. Magenheimer, L. Peters, K. W. Pettis, and D. Zuras, Integer multiplication and division on the HP Precision Architecture, IEEE Transactions on Computers, vol.37, issue.8, pp.980-990, 1988.
DOI : 10.1109/12.2248

A. D. Booth, A SIGNED BINARY MULTIPLICATION TECHNIQUE, The Quarterly Journal of Mechanics and Applied Mathematics, vol.4, issue.2, pp.236-240, 1951.
DOI : 10.1093/qjmam/4.2.236

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

N. Boullis and A. Tisserand, Some Optimizations of Hardware Multiplication by Constant Matrices, Proc. 16th IEEE Symp. Computer Arithmetic (ARITH 16, pp.20-27, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00113092

M. Potkonjak, M. B. Srivastava, and A. P. 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

M. J. Flynn and S. F. Oberman, Advanced Computer Arithmetic Design, 2001.

R. I. 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

K. D. Chapman, Fast Integer Multipliers Fit in FPGAs, EDN Magazine, 1994.

S. Yu and E. E. Swartzlander, DCT Implementation with Distributed Arithmetic, IEEE Trans. Computers, vol.50, issue.9, pp.985-991, 2001.

P. Boonyanant and S. Tantaratana, FIR Filters with Punctured Radix-8 Symmetric Coefficients: Design and Multiplier-Free Realizations, Circuits, Systems & Signal Processing, vol.21, issue.4, pp.345-367, 2002.
DOI : 10.1007/s00034-002-0716-z

C. K. Pun, S. C. Chan, K. S. Yeung, and K. L. Ho, On the design and implementation of FIR and IIR digital filters with variable frequency characteristics, IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol.49, issue.11, pp.689-703, 2002.
DOI : 10.1109/TCSII.2002.807574

S. C. Chan and W. L. Ho, Multiplierless perfect reconstruction modulated filter banks with sum-of-powers-of-two coefficients, IEEE Signal Processing Letters, vol.8, issue.6, pp.163-166, 2001.
DOI : 10.1109/97.923040

V. S. Dimitrov, G. A. Jullien, and W. C. Miller, Theory and applications of the double-base number system, IEEE Transactions on Computers, vol.48, issue.10, pp.1098-1106, 1999.
DOI : 10.1109/12.805158

J. Li and S. Tantaratana, Multiplier-free realizations for FIR multirate converters based on mixed-radix number representation, IEEE Transactions on Signal Processing, vol.45, issue.4, pp.880-890, 1997.
DOI : 10.1109/78.564176

N. Homma, T. Aoki, and T. Higuchi, Evolutionary graph generation system with transmigration capability and its application to arithmetic circuit synthesis, IEE Proceedings - Circuits, Devices and Systems, vol.149, issue.2, pp.97-104, 2002.
DOI : 10.1049/ip-cds:20020261

P. Briggs and T. Harvey, Multiplication by Integer Constants, technical report, 1994.

M. F. Mellal and J. Delosme, Multiplier Optimization for Small Sets Of Coefficients, Proc. Int'l Workshop Logic and Architecture Synthesis, pp.13-22, 1997.

H. T. 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

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

M. Martínez-peiró, E. I. Boemo, and L. Wanhammar, Design of high-speed multiplierless filters using a nonrecursive signed common subexpression algorithm, IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol.49, issue.3, pp.196-203, 2002.
DOI : 10.1109/TCSII.2002.1013866

A. Vinod, E. Lai, A. Premkumar, and C. Lau, FIR filter implementation by efficient sharing of horizontal and vertical common subexpressions, Electronics Letters, vol.39, issue.2, pp.251-253, 2003.
DOI : 10.1049/el:20030150

A. Yurdakul, G. Dü-ndar, ]. A. Matsuura, M. Yukishita, and A. Nagoya, Fast and Efficient Algorithm for the Multiplierless Realisation of Linear DSP Transforms A Hierarchical Clustering Method for the Multiple Constant Multiplication Problem, IEE Proc. Circuits, Devices, and Systems, pp.20-211, 1997.

V. Lefèvre, Multiplication par une Constante, Re´seaux et Systèmes Re´partis, CalculateursParallèles, vol.13, pp.4-5, 2001.

R. Pa-s-sko, P. Schaumont, V. Derudder, S. Vernalde, and D. Dura-c-cková, A new algorithm for elimination of common subexpressions, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.18, issue.1, pp.58-68, 1999.
DOI : 10.1109/43.739059

A. G. Dempster, O. Gustafsson, and J. O. Coleman, Towards an Algorithm for Matrix Multiplier Blocks, Proc. European Conf. Circuit Theory Design, 2003.

H. Samueli, An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficients, IEEE Transactions on Circuits and Systems, vol.36, issue.7, pp.1044-1047, 1989.
DOI : 10.1109/31.31347

C. Machine-efficient-polynomial-approximations, N. Brisebarre-universitéuniversit´université, J. Monnet, S. Etienne, L. N. Lyon et al., Polynomial approximations are almost always used when implementing functions on a computing system In most cases, the polynomial that best approximates (for a given distance and in a given interval) a function has coefficients that are not exactly representable with a finite number of bits. And yet, the polynomial approximations that are actually implemented do have coefficients that are represented with a finite?and sometimes small?number of bits. This is due to the finiteness of the floating-point representations (for software implementations), and to the need to have small, hence fast and/or inexpensive, multipliers (for hardware implementations) We then have to consider polynomial approximations for which the degree-i coefficient has at most m i fractional bits; in other words, it is a rational number with denominator 2 m i . We provide a general and efficient method for finding the best polynomial approximation under this constraint. Moreover, our method also applies if some other constraints (such as requiring some coefficients to be equal to some predefined constants or minimizing relative error instead of absolute error) are required

. Allée-d-'italie, F-69364 Lyon Cedex 07 France; email: Nicolas.Brisebarre@ens-lyon.fr, J.-M

L. Muller, . Ens-lyon-jean-michel, . Muller@ens-lyon.-fr-;-a, . Tisserand, L. Inria et al., 46 Allée d'Italie, F-69364 Lyon Cedex 07 France 46 Allée d'Italie, F-69364 Lyon Cedex 07 France; email: Arnaud.Tisserand@ens-lyon.fr. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee, p.1515

A. , C. And, and F. Irigoin, Scanning polyhedra with do loops, Proceedings of the 3rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP'91), 1991.

B. , P. And-erdélyi, and T. , Polynomials and Polynomials Inequalities, Graduate Texts in Mathematics, vol.161, 1995.

C. , J. Feautrier, P. And-risset, and T. , Construction of do loops from systems of affine constraints, Parall. Process. Lett, vol.5, pp.421-436, 1995.

C. , M. Harrison, J. And-tang, and P. T. , Scientific Computing on Itanium-Based Systems, 2002.

F. , L. Parker, and I. B. , Chebyshev Polynomials in Numerical Analysis, 1972.

H. , L. And, and B. Salvy, On integer Chebyshev polynomials, Math. Computat, vol.66, issue.218, pp.763-770, 1997.

H. , J. F. Cheney, E. W. Lawson, C. L. Maehly, H. J. Mesztenyi et al., Computer Approximations, 1968.

L. Verge, H. Va-n-dongen, V. And-wilde, and D. K. , Loop nest synthesis using the polyhedral library, 1994.
URL : https://hal.archives-ouvertes.fr/inria-00074384

P. , J. Bruguera, J. And-muller, and J. , Faithful powering computation using table look-up and a fused accumulation tree, Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15). Burgess and Ciminiera Eds, pp.40-58, 2001.

S. , S. And, and P. T. Tang, New algorithms for improved transcendental functions on IA- 64, Proceedings of the 14th IEEE Symposium on Computer, pp.4-11, 1999.

T. Polylib, Polylib, a library of polyhedral functions, version 5.20.0. http://icps. u-strasbg.fr/polylib/. THE SPACES PROJECT MPFR, the multiple precision floating point reliable library, 2004.

W. , B. Cao, J. And-cheng, and J. , High-performance architectures for elementary function generation, Proceedings of the 15th IEEE Symposium on Computer Arithmetic, 2001.