W. A. Abu-al-saud and G. L. Stüber, Efficient Wideband Channelizer for Software Radio Systems Using Modulated PR Filterbanks, IEEE Transactions on Signal Processing, vol.52, issue.10, pp.10-2807, 2004.
DOI : 10.1109/TSP.2004.834242

N. Achieser, On extremal properties of certain rational functions, Doklady Akad. Nauk, pp.495-499, 1930.

N. I. Achieser and C. J. Hyman, Theory of Approximation. Dover books on mathematics, 1956.

T. Achterberg, SCIP: solving constraint integer programs, Mathematical Programming Computation, vol.29, issue.2, pp.1-41, 2009.
DOI : 10.1007/s12532-008-0001-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.7376

J. W. Adams, A. N. Wilson, and J. , On the fast design of high-order FIR digital filters, IEEE Transactions on Circuits and Systems, vol.32, issue.9, pp.958-960, 1985.
DOI : 10.1109/TCS.1985.1085807

M. Ahsan and T. Saramäki, Two Novel Implementations of the Remez Multiple Exchange Algorithm for Optimum FIR Filter Design, 2012.
DOI : 10.5772/46477

M. Ajtai, -hard for randomized reductions (extended abstract), Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.284-293, 1998.
DOI : 10.1145/276698.276705

L. Aksoy, P. Flores, and J. Monteiro, Exact and Approximate Algorithms for the Filter Design Optimization Problem, IEEE Transactions on Signal Processing, vol.63, issue.1, pp.142-154, 2015.
DOI : 10.1109/TSP.2014.2366713

A. Antoniou, Accelerated procedure for the design of equiripple nonrecursive digital filters, IEE Proceedings G (Electronic Circuits and Systems), vol.129, issue.1, pp.1-10, 1982.
DOI : 10.1049/ip-g-1.1982.0001

A. Antoniou, New improved method for the design of weighted- Chebyshev, nonrecursive, digital filters, IEEE Transactions on Circuits and Systems, vol.30, issue.10, pp.740-750, 1983.
DOI : 10.1109/TCS.1983.1085296

A. Antoniou, Digital Signal Processing: Signals, Systems, and Filters, 2005.

A. I. Aptekarev, Sharp constants for rational approximations of analytic functions, Sbornik: Mathematics, vol.193, issue.1, pp.1-72, 2002.
DOI : 10.1070/SM2002v193n01ABEH000619

R. D. Armstrong and D. S. Kung, A dual method for discrete Chebychev curve fitting, Mathematical Programming, vol.1, issue.3, pp.186-199, 1980.
DOI : 10.1007/BF01581640

S. Arora, L. Babai, J. Stern, and Z. Sweedyk, The hardness of approximate optima in lattices, codes, and systems of linear equations, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp.724-733, 1993.
DOI : 10.1109/SFCS.1993.366815

L. Babai, On Lov??sz??? lattice reduction and the nearest lattice point problem, Combinatorica, vol.357, issue.1, pp.1-13, 1986.
DOI : 10.1007/BF02579403

I. Barrodale and C. Phillips, Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4], ACM Transactions on Mathematical Software, vol.1, issue.3, pp.264-270, 1975.
DOI : 10.1145/355644.355651

I. Barrodale, Y. , and A. , Algorithms for bestL 1 andL ??? linear approximations on a discrete set, Numerische Mathematik, vol.2, issue.3, pp.295-306, 1966.
DOI : 10.1007/BF02162565

R. H. Bartels and G. Golub, Numerical Analysis: Stable numerical methods for obtaining the Chebyshev solution to an overdetermined system of equations, Communications of the ACM, vol.11, issue.6, pp.401-406, 1968.
DOI : 10.1145/363347.363364

D. Belogus and N. Liron, DCR2: An improved algorithm forl ? rational approximation on intervals, Numerische Mathematik, vol.10, issue.1, pp.17-29, 1978.
DOI : 10.1007/BF01396011

S. N. Bernstein, Sur l'ordre de la meilleure approximation des fonctions continues par des polynômes de degré donné, Mémoires de l'Académie Royale de Belgique, pp.1-104, 1912.

J. Berrut and H. D. Mittelmann, Lebesgue constant minimizing linear rational interpolation of continuous functions over the interval, Computers & Mathematics with Applications, vol.33, issue.6, pp.77-86, 1997.
DOI : 10.1016/S0898-1221(97)00034-5

J. Berrut and H. Mittelmann, Matrices for the direct determination of the barycentric weights of rational interpolation, Journal of Computational and Applied Mathematics, vol.78, issue.2, pp.355-370, 1997.
DOI : 10.1016/S0377-0427(96)00163-X

H. Blatt, Exchange Algorithms, Error Estimations and Strong Unicity in Convex Programming and Chebyshev Approximation, Approximation Theory and Spline Functions, pp.23-63, 1984.
DOI : 10.1007/978-94-009-6466-2_2

H. F. Blichfeldt, Note on the Functions of the Form f (x) ? ?(x)+a 1 x n?1 +a 2 x n?2 +· · ·+a n Which in a Given Interval Differ the Least Possible From Zero, Transactions of the American Mathematical Society, vol.2, pp.1-100, 1901.

F. Bonzanigo, Some improvements to the design programs for equiripple FIR filters, ICASSP '82. IEEE International Conference on Acoustics, Speech, and Signal Processing, pp.274-277, 1982.
DOI : 10.1109/ICASSP.1982.1171739

´. E. Borel, Leçons sur les fonctions de variables réelles et les développements en séries de polynomes

P. Borwein and T. Erdélyi, Polynomials and polynomial inequalities, 2012.
DOI : 10.1007/978-1-4612-0793-1

L. Bos, S. De-marchi, A. Sommariva, and M. Vianello, Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra, SIAM Journal on Numerical Analysis, vol.48, issue.5, pp.1984-1999, 2010.
DOI : 10.1137/090779024
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.3810

L. P. Bos, J. Calvi, N. Levenberg, A. Sommariva, and M. Vianello, Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points, Mathematics of Computation, vol.80, issue.275, pp.275-1623, 2011.
DOI : 10.1090/S0025-5718-2011-02442-7
URL : https://hal.archives-ouvertes.fr/hal-00630924

L. P. Bos and N. Levenberg, On the calculation of approximate Fekete points: the univariate case, Electronic Transactions on Numerical Analysis, vol.30, pp.377-397, 2008.

J. P. Boyd, Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding, Journal of Engineering Mathematics, vol.27, issue.3, pp.203-219, 2006.
DOI : 10.1007/s10665-006-9087-5

J. P. Boyd, Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix. SIAM Rev, vol.55, issue.2, pp.375-396, 2013.

J. P. Boyd and D. H. Gally, Numerical experiments on the accuracy of the Chebyshev???Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials, Journal of Computational and Applied Mathematics, vol.205, issue.1, pp.1-281, 2007.
DOI : 10.1016/j.cam.2006.05.006

D. Braess, Nonlinear approximation theory, 2012.
DOI : 10.1007/978-3-642-61609-9

R. P. Brent, Algorithms for Minimization Without Derivatives, 1973.

N. Brisebarre, C. , and S. , Efficient polynomial L-approximations, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), pp.169-176, 2007.
DOI : 10.1109/ARITH.2007.17
URL : https://hal.archives-ouvertes.fr/inria-00119513

N. Brisebarre, F. De-dinechin, S. Filip, and M. Istoan, Automatic generation of hardware FIR filters from a frequency domain specification
URL : https://hal.archives-ouvertes.fr/hal-01308377

N. Brisebarre, S. Filip, and G. Hanrot, De nouveaux résultats sur la synthèse de filtres RIF, Proc. 25ème colloque du Groupement de Recherche en Traitement du Signal et des Images (GRETSI), 2015.

N. Brisebarre, S. Filip, and G. Hanrot, A Lattice Basis Reduction Approach for the Design of Quantized FIR Filters, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01308801

N. Brisebarre, J. Muller, and A. Tisserand, Computing machine-efficient polynomial approximations, ACM Transactions on Mathematical Software, vol.32, issue.2, pp.236-256, 2006.
DOI : 10.1145/1141885.1141890
URL : https://hal.archives-ouvertes.fr/ensl-00086826

N. Brunie, F. De-dinechin, M. Istoan, G. Sergent, K. Illyes et al., Arithmetic core generation using bit heaps, 2013 23rd International Conference on Field programmable Logic and Applications, 2013.
DOI : 10.1109/FPL.2013.6645544
URL : https://hal.archives-ouvertes.fr/ensl-00738412

C. S. Burrus, Multiband least squares FIR filter design, IEEE Transactions on Signal Processing, vol.43, issue.2, pp.412-421, 1995.
DOI : 10.1109/78.348124

C. S. Burrus, A. W. Soewito, and R. A. Gopinath, Least squared error FIR filter design with transition bands, IEEE Transactions on Signal Processing, vol.40, issue.6, pp.1327-1340, 1992.
DOI : 10.1109/78.139239

P. Businger and G. H. Golub, Linear least squares solutions by householder transformations, Numerische Mathematik, vol.4, issue.3, pp.269-276, 1965.
DOI : 10.1007/BF01436084

J. Calvi and N. Levenberg, Uniform approximation by discrete least squares polynomials, Journal of Approximation Theory, vol.152, issue.1, pp.82-100, 2008.
DOI : 10.1016/j.jat.2007.05.005
URL : https://hal.archives-ouvertes.fr/hal-00634965

A. J. Carpenter, A. Ruttan, and R. S. Varga, Extended numerical computations on the ???1/9??? conjecture in rational approximation theory, Rational approximation and interpolation, pp.383-411, 1984.
DOI : 10.1137/0720030

C. ¸-ivril, A. Ismail, and M. , On selecting a maximum volume sub-matrix of a matrix and related problems, Theoretical Computer Science, vol.410, pp.47-49, 2009.

O. S. Celis, Practical rational interpolation of exact and inexact data: theory and algorithms, 2008.

D. S. Chan and L. Rabiner, Analysis of quantization errors in the direct form for finite impulse response digital filters, IEEE Transactions on Audio and Electroacoustics, vol.21, issue.4, pp.4-354, 1973.
DOI : 10.1109/TAU.1973.1162497

S. C. Chan, K. M. Tsui, and S. H. Zhao, A Methodology for Automatic Hardware Synthesis of Multiplier-less Digital Filters with Prescribed Output Accuracy, APCCAS 2006, 2006 IEEE Asia Pacific Conference on Circuits and Systems, pp.61-64, 2006.
DOI : 10.1109/APCCAS.2006.342296

S. Chandrasekaran, M. Gu, X. Sun, J. Xia, and J. Zhu, A Superfast Algorithm for Toeplitz Systems of Linear Equations, SIAM Journal on Matrix Analysis and Applications, vol.29, issue.4, pp.1247-1266, 2008.
DOI : 10.1137/040617200

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

Y. Chen and P. Nguyen, BKZ 2.0: Better Lattice Security Estimates, Advances in Cryptology -ASIACRYPT 2011 -17th International Conference on the Theory and Application of Cryptology and Information Security, pp.1-20, 2011.
DOI : 10.1007/978-3-642-25385-0_1
URL : https://hal.archives-ouvertes.fr/hal-01109961

E. W. Cheney, Introduction to Approximation Theory, 1982.

E. W. Cheney and H. L. Loeb, Two new algorithms for rational approximation, Numerische Mathematik, vol.7, issue.1, pp.72-75, 1961.
DOI : 10.1007/BF01386002

S. Chevillard, Evaluation efficace de functions numériques. Outils et exemples, 2009.

S. Chevillard, J. Harrison, . Joldes¸, M. Joldes¸, and C. Lauter, Efficient and accurate computation of upper bounds of approximation errors, Theoretical Computer Science, vol.412, issue.16, pp.1523-1543, 2011.
DOI : 10.1016/j.tcs.2010.11.052
URL : https://hal.archives-ouvertes.fr/ensl-00445343

S. Chevillard, . Joldes¸, M. Joldes¸, C. Lauter, and . Sollya, Sollya: An Environment for the Development of Numerical Codes, Mathematical Software -ICMS 2010, pp.28-31, 2010.
DOI : 10.1007/978-3-642-15582-6_5
URL : https://hal.archives-ouvertes.fr/hal-00761644

C. W. Clenshaw, A note on the summation of Chebyshev series, Mathematics of Computation, vol.9, issue.51, pp.118-120, 1955.
DOI : 10.1090/S0025-5718-1955-0071856-0

W. J. Cody, Algorithm 715; SPECFUN---a portable FORTRAN package of special function routines and test drivers, ACM Transactions on Mathematical Software, vol.19, issue.1, pp.22-30, 1993.
DOI : 10.1145/151271.151273

W. J. Cody, G. Meinardus, and R. Varga, Chebyshev rational approximations to e???x in [0, +???) and applications to heat-conduction problems, Journal of Approximation Theory, vol.2, issue.1, pp.1-50, 1969.
DOI : 10.1016/0021-9045(69)90030-6

H. Cohen, A course in computational algebraic number theory, 2013.
DOI : 10.1007/978-3-662-02945-9

W. Cook, T. Koch, D. E. Steffy, and K. Wolter, A hybrid branch-and-bound approach for exact rational mixed-integer programming, Mathematical Programming Computation, vol.80, issue.2, pp.305-344, 2013.
DOI : 10.1007/s12532-013-0055-6

G. Cortelazzo, M. R. Lightner, and W. K. Jenkins, An alternate technique for min-max design of multiband finite impulse response digital filters, Circuits, Systems and Signal Processing, pp.3-285, 1983.
DOI : 10.1007/BF01599072

A. Curtis and M. R. Osborne, The Construction of Minimax Rational Approximations to Functions, The Computer Journal, vol.9, issue.3, pp.286-293, 1966.
DOI : 10.1093/comjnl/9.3.286

E. A. Da-silva, L. Lovisolo, A. J. Dutra, and P. S. Diniz, FIR Filter Design Based on Successive Approximation of Vectors, IEEE Transactions on Signal Processing, vol.62, issue.15, pp.15-3833, 2014.
DOI : 10.1109/TSP.2014.2324992

L. Dagum and R. Menon, OpenMP: an industry standard API for shared-memory programming, IEEE Computational Science and Engineering, vol.5, issue.1, pp.46-55, 1998.
DOI : 10.1109/99.660313

D. Day and L. Romero, Roots of Polynomials Expressed in Terms of Orthogonal Polynomials, SIAM Journal on Numerical Analysis, vol.43, issue.5, pp.1969-1987, 2005.
DOI : 10.1137/040609847

F. De-dinechin, M. Istoan, and A. Massouri, Sum-of-product architectures computing just right, 2014 IEEE 25th International Conference on Application-Specific Systems, Architectures and Processors, pp.41-47, 2014.
DOI : 10.1109/ASAP.2014.6868629
URL : https://hal.archives-ouvertes.fr/hal-00957609

C. De-la-vallée-poussin, Leçons sur l'approximation des fonctions d'une variable réelle, 1919.

D. Marchi, S. Piazzon, F. Sommariva, A. Vianello, and M. , Polynomial meshes: Computation and approximation, Proceedings of the 15th International Conference on Computational and Mathematical Methods in Science and Engineering, pp.414-425, 2015.

J. Descloux, D???g???n???rescence dans les approximations de Tschebyscheff lin???aires et discr???tes, Numerische Mathematik, vol.2, issue.1, pp.180-187, 1961.
DOI : 10.1007/BF01386018

R. A. Devore and G. G. Lorentz, Constructive Approximation, 1993.

P. S. Diniz, D. Silva, E. A. Netto, and S. L. , Digital signal processing: system analysis and design, 2010.
DOI : 10.1017/CBO9781139164580

I. Dinur, G. Kindler, R. Raz, and S. Safra, Approximating CVP to Within Almost-Polynomial Factors is NP-Hard, Combinatorica, vol.23, issue.2, pp.205-243, 2003.
DOI : 10.1007/s00493-003-0019-y
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4448

A. Dutt, M. Gu, and V. And-rokhlin, Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation, SIAM Journal on Numerical Analysis, vol.33, issue.5, pp.1689-1711, 1996.
DOI : 10.1137/0733082
URL : http://www.dtic.mil/get-tr-doc/pdf?AD=ADA267505

S. Ebert and U. Heute, Accelerated design of linear or minimum phase FIR filters with a Chebyshev magnitude response, IEE Proceedings G, Electronic Circuits and Systems, pp.267-270, 1983.
DOI : 10.1049/ip-g-1.1983.0050

M. Embree and L. N. Trefethen, Green's Functions for Multiply Connected Domains via Conformal Mapping, SIAM Review, vol.41, issue.4, pp.745-761, 1999.
DOI : 10.1137/S0036144598349277
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.210.1066

S. Filip, A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters, ACM Transactions on Mathematical Software, vol.43, issue.1, pp.1-7, 2016.
DOI : 10.1145/2904902
URL : https://hal.archives-ouvertes.fr/hal-01136005

M. S. Floater and K. Hormann, Barycentric rational interpolation with no poles and high rates of approximation, Numerische Mathematik, vol.28, issue.5, pp.315-331, 2007.
DOI : 10.1007/s00211-007-0093-y

L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier, and P. Zimmermann, MPFR, ACM Transactions on Mathematical Software, vol.33, issue.2, p.13, 2007.
DOI : 10.1145/1236463.1236468
URL : https://hal.archives-ouvertes.fr/inria-00070266

S. D. Galbraith, Mathematics of public key cryptography, 2012.
DOI : 10.1017/CBO9781139012843

C. F. Gauss and . Disquisitiones-arithmeticae, Lipsiae in commissis apud Gerh, Fleischer Jux, 1801.

W. Gautschi, Computational Methods in Special Functions?A Survey In Theory and Application of Special functions, pp.1-98, 1975.

W. Gautschi, Orthogonal polynomials: computation and approximation, 2004.

A. M. Gleixner, D. E. Steffy, and K. Wolter, Improving the accuracy of linear programming solvers with iterative refinement, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, ISSAC '12, pp.187-194, 2012.
DOI : 10.1145/2442829.2442858

A. M. Gleixner, D. E. Steffy, and K. Wolter, Iterative Refinement for Linear Programming, INFORMS Journal on Computing, vol.28, issue.3, 2015.
DOI : 10.1287/ijoc.2016.0692
URL : https://opus4.kobv.de/opus4-zib/files/5511/ZR-15-15.pdf

O. Goldreich, D. Micciancio, S. Safra, and J. Seifert, Approximating shortest lattice vectors is not harder than approximating closest lattice vectors, Information Processing Letters, vol.71, issue.2, pp.55-61, 1999.
DOI : 10.1016/S0020-0190(99)00083-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.4802

A. A. Gonchar, R. , and E. A. , EQUILIBRIUM DISTRIBUTIONS AND DEGREE OF RATIONAL APPROXIMATION OF ANALYTIC FUNCTIONS, Mathematics of the USSR-Sbornik 62, pp.305-348, 1989.
DOI : 10.1070/SM1989v062n02ABEH003242

F. Grenez, Design of linear or minimum-phase fir filters by constrained chebyshev approximation, Signal Processing, vol.5, issue.4, pp.325-332, 1983.
DOI : 10.1016/0165-1684(83)90091-9

O. Gustafsson, H. Johansson, and L. Wanhammar, An MILP approach for the design of linear-phase FIR filters with minimum number of signed-power-of-two terms, Proc. Eur. Conf. Circuit Theory Design, pp.217-220, 2001.

G. Hanrot, X. Pujol, and D. Stehlé, Analyzing Blockwise Lattice Algorithms Using Dynamical Systems, Advances in Cryptology -CRYPTO 2011 -31st Annual Cryptology Conference Proceedings (2011), pp.447-464, 2011.
DOI : 10.1007/978-3-642-22792-9_25
URL : https://hal.archives-ouvertes.fr/hal-00640638

M. Henk, Note on shortest and nearest lattice vectors, Information Processing Letters, vol.61, issue.4, pp.183-188, 1997.
DOI : 10.1016/S0020-0190(97)00019-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.6534

J. Hennessy, D. Patterson, and K. Asanovi´casanovi´c, Computer Architecture: A Quantitative Approach, 2012.

C. Hermite, Extraits de lettres de M. Ch. Hermite ?? M. Jacobi sur diff??rents objects de la th??orie des nombres. (Continuation)., Journal f??r die reine und angewandte Mathematik (Crelles Journal), vol.1850, issue.40, pp.279-315, 1850.
DOI : 10.1515/crll.1850.40.279

N. J. Higham and N. J. Higham, Accuracy and stability of numerical algorithms The numerical stability of barycentric Lagrange interpolation, SIAM IMA J. Numer. Anal, vol.103, issue.24, pp.547-556, 2002.

M. J. Hopper and M. J. Powell, A Technique that Gains Speed and Accuracy in the Minimax Solution of Overdetermined Linear Equations, Mathematical Software, vol.3, pp.15-32, 1977.
DOI : 10.1016/B978-0-12-587260-7.50006-6

J. Hwang and J. Ballagh, Building Custom FIR Filters Using System Generator, Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications FPL '02, pp.1101-1104, 2002.
DOI : 10.1007/3-540-46117-5_117
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.7548

I. Task and P. Ansi, Standard for Binary Floating-Point Arithmetic, pp.754-1985, 1985.

I. Task and P. , IEEE 754-2008, Standard for Floating-Point Arithmetic, 2008.

M. Ishikawa, M. Edahiro, T. Yoshimura, T. Miyazaki, S. I. Aikoh et al., Automatic layout synthesis for FIR filters using a silicon compiler, IEEE International Symposium on Circuits and Systems, pp.2588-2591, 1990.
DOI : 10.1109/ISCAS.1990.112538

D. Jackson, Uber die Genauigkeit der Annäherung stetiger Funktionen durch ganze rationale Funktionen gegebenen Grades und trigonometrische Summen gegebener Ordnung, Dieterich, 1911.

R. Jain, P. T. Yang, Y. , and T. , FIRGEN: a computer-aided design system for high performance FIR filter integrated circuits, IEEE Transactions on Signal Processing, vol.39, issue.7, pp.1655-1668, 1991.
DOI : 10.1109/78.134402

M. Javed and L. N. Trefethen, The Remez algorithm for trigonometric approximation of periodic functions, 2015.

J. F. Kaiser, Some practical considerations in the realization of linear digital filters, Proc. 3rd Allerton Annual Conference on Circuit and System Theory, pp.621-633, 1965.

R. Kannan, Improved algorithms for integer programming and related lattice problems, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.99-108, 1983.
DOI : 10.1145/800061.808749

R. Kannan, Minkowski's Convex Body Theorem and Integer Programming, Mathematics of Operations Research, vol.12, issue.3, pp.415-440, 1987.
DOI : 10.1287/moor.12.3.415
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=2568&context=compsci

L. J. Karam and J. Mcclellan, Complex Chebyshev approximation for FIR filter design, IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, pp.207-216, 1995.
DOI : 10.1109/82.372870

L. J. Karam and J. Mcclellan, Design of optimal digital FIR filters with arbitrary magnitude and phase responses, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96, pp.385-388, 1996.
DOI : 10.1109/ISCAS.1996.541727

E. H. Kaufman, D. J. Leeming, T. , and G. D. , A combined Remes-differential correction algorithm for rational approximation, Mathematics of Computation, vol.32, issue.141, pp.141-233, 1978.
DOI : 10.1090/S0025-5718-1978-0460989-8

D. Kodek and K. Steiglitz, Comparison of optimal and local search methods for designing finite wordlength FIR digital filters, IEEE Transactions on Circuits and Systems, vol.28, issue.1, pp.28-32, 1981.
DOI : 10.1109/TCS.1981.1084909

D. M. Kodek, Design of optimal finite wordlength FIR digital filters using integer programming techniques, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.28, issue.3, pp.3-304, 1980.
DOI : 10.1109/TASSP.1980.1163407

D. M. Kodek, Design of optimal finite wordlength FIR digital filters, Proc. of the European Conference on Circuit Theory and Design, ECCTD '99, pp.401-404, 1999.

D. M. Kodek, Performance limit of finite wordlength FIR digital filters, IEEE Transactions on Signal Processing, vol.53, issue.7, pp.2462-2469, 2005.
DOI : 10.1109/TSP.2005.849191

D. M. Kodek, LLL Algorithm and the Optimal Finite Wordlength FIR Design, IEEE Transactions on Signal Processing, vol.60, issue.3, pp.1493-1498, 2012.
DOI : 10.1109/TSP.2011.2177974

D. M. Kodek and M. Krisper, Telescoping rounding for suboptimal finite wordlength FIR digital filter design, Digital Signal Processing, vol.15, issue.6, pp.522-535, 2005.
DOI : 10.1016/j.dsp.2005.01.009

J. B. Kogut and D. K. Sinclair, Rational hybrid Monte??Carlo algorithm for theories with unknown spectral bounds, Physical Review D, vol.74, issue.11, pp.11-114505, 2006.
DOI : 10.1103/PhysRevD.74.114505

J. C. Lagarias, H. W. Lenstra-jr, and C. Schnorr, Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice, Combinatorica, vol.96, issue.4 (208), pp.4-333, 1990.
DOI : 10.1007/BF02128669

J. L. Lagrange, Recherches d'arithmetique, Nouv. Mem. Acad. Roy. Sc. Belles Lettres Berlin, pp.365-312, 1773.

M. Langhammer and B. Pasca, Floating-Point DSP Block Architecture for FPGAs, Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, FPGA '15, pp.117-125
DOI : 10.1145/2684746.2689071

P. J. Laurent, C. , and C. , An algorithm of successive minimization in convex programming, RAIRO. Analyse num??rique, vol.12, issue.4, pp.377-400, 1978.
DOI : 10.1051/m2an/1978120403771

C. Lauter and F. De-dinechin, Optimising polynomials for floating-point implementation, Real Numbers and Computers, pp.7-16, 2008.

F. Leja, Sur certaines suites liées aux ensembles plans et leur applicationàapplication`applicationà la représentation conforme, Annales Polonici Mathematici, vol.4, issue.1, pp.8-13, 1957.

A. K. Lenstra, J. Lenstra, H. W. Lovász, and L. , Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982.
DOI : 10.1007/BF01457454
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.318

E. Levin and E. B. Saff, Potential Theoretic Tools in Polynomial and Rational Approximation, Lecture Notes in Control and Information Science, vol.327, pp.71-94, 2006.
DOI : 10.1007/11601609_5

Y. C. Lim, Design of discrete-coefficient-value linear phase FIR filters with optimum normalized peak ripple magnitude, IEEE Transactions on Circuits and Systems, vol.37, issue.12, pp.12-1480, 1990.
DOI : 10.1109/31.101268

Y. C. Lim, P. , and S. R. , Discrete coefficient FIR digital filter design based upon an LMS criteria, IEEE Transactions on Circuits and systems, vol.30, pp.10-723, 1983.

Y. C. Lim, P. , and S. R. , FIR filter design over a discrete powers-of-two coefficient space, IEEE Transactions on Acoustics, Speech and Signal Processing, vol.31, issue.3, pp.583-591, 1983.

Y. C. Lim, S. R. Parker, and A. G. Constantinides, Finite word length FIR filter design using integer programming over a discrete coefficient space, IEEE Transactions on Acoustics, Speech and Signal Processing, vol.30, issue.4, pp.661-664, 1982.

Y. C. Lim, Y. Sun, Y. , and Y. J. , Design of discrete-coefficient FIR filters on loosely connected parallel machines, IEEE Transactions on Signal Processing, vol.50, issue.6, pp.1409-1416, 2002.

G. Litvinov, Approximate construction of rational approximations and the effect of error autocorrection, Applications. Russian Journal of Mathematical Physics, vol.1, issue.3, pp.313-352, 1994.

J. Lotze, S. A. Fahmy, J. Noguera, L. Doyle, and R. Esser, An FPGA-based cognitive radio framework, IET Irish Signals and Systems Conference (ISSC 2008), pp.138-143, 2008.
DOI : 10.1049/cp:20080652

H. J. Maehly, Methods for Fitting Rational Approximations, Parts II and III, Journal of the ACM, vol.10, issue.3, pp.257-277, 1963.
DOI : 10.1145/321172.321173

R. Marlow, C. Dobson, and P. Athanas, An enhanced and embedded GNU radio flow, 2014 24th International Conference on Field Programmable Logic and Applications (FPL), 2014.
DOI : 10.1109/FPL.2014.6927427

W. Mascarenhas, The stability of barycentric interpolation at the Chebyshev points of the second kind, Numerische Mathematik, vol.43, issue.2, pp.265-300, 2014.
DOI : 10.1007/s00211-014-0612-6

W. F. Mascarenhas and A. Camargo, On the backward stability of the second barycentric formula for interpolation, Dolomites Research Notes on Approximation, vol.7, pp.1-12, 2014.

W. F. Mascarenhas and A. P. De-camargo, The effects of rounding errors in the nodes on barycentric interpolation, Numerische Mathematik, vol.43, issue.2, pp.1-29, 2013.
DOI : 10.1007/s00211-014-0612-6

M. T. Mccallig, L. , and B. J. , Constrained ripple design of FIR digital filters, IEEE Transactions on Circuits and Systems, vol.25, issue.11, pp.893-902, 1978.
DOI : 10.1109/TCS.1978.1084405

J. H. Mcclellan, T. W. Parks, and L. Rabiner, A computer program for designing optimum FIR linear phase digital filters, IEEE Transactions on Audio and Electroacoustics, vol.21, issue.6, pp.506-526, 1973.
DOI : 10.1109/TAU.1973.1162525

G. Merchant and T. W. Parks, Efficient solution of a Toeplitz-plus-Hankel coefficient matrix system of equations, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.30, issue.1, pp.40-44, 1982.
DOI : 10.1109/TASSP.1982.1163845

U. Meyer-baese, Digital signal processing with field programmable gate arrays, of Signals and Communication Technology, 2007.
DOI : 10.1007/978-3-662-06728-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.423.5328

D. Micciancio and S. Goldwasser, Complexity of lattice problems: a cryptographic perspective, 2012.
DOI : 10.1007/978-1-4615-0897-7

J. M. Muller, N. Brisebarre, F. De-dinechin, C. P. 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

P. Nguyen and D. Stehlé, LLL on the Average, Proceedings of the 7th Algorithmic Number Theory Symposium (ANTS VII), pp.238-256, 2006.
DOI : 10.1007/11792086_18
URL : https://hal.archives-ouvertes.fr/hal-00107309

P. Q. Nguyen and D. Stehlé, Floating-Point LLL Revisited, Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.215-233, 2005.
DOI : 10.1007/11426639_13
URL : https://hal.archives-ouvertes.fr/inria-00000377

J. J. Nielsen, Design of linear-phase direct-form FIR digital filters with quantized coefficients using error spectrum shaping, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.37, issue.7, pp.1020-1026, 1989.
DOI : 10.1109/29.32280

A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing, 2010.

M. R. Osborne and G. A. Watson, On the Best Linear Chebyshev Approximation, The Computer Journal, vol.10, issue.2, pp.172-177, 1967.
DOI : 10.1093/comjnl/10.2.172
URL : http://comjnl.oxfordjournals.org/cgi/content/short/10/2/172

M. R. Osborne and G. A. Watson, A note on singular minimax approximation problems, Journal of Mathematical Analysis and Applications, vol.25, issue.3, pp.692-700, 1969.
DOI : 10.1016/0022-247X(69)90266-2
URL : http://doi.org/10.1016/0022-247x(69)90266-2

R. Pachón, Algorithms for Polynomial and Rational Approximation, 2010.

R. Pachón, P. Gonnet, and J. Van-deun, Fast and Stable Rational Interpolation in Roots of Unity and Chebyshev Points, SIAM Journal on Numerical Analysis, vol.50, issue.3, pp.1713-1734, 2012.
DOI : 10.1137/100797291

R. Pachón and L. N. Trefethen, Barycentric-Remez algorithms for best polynomial approximation in the chebfun system, BIT Numerical Mathematics, vol.2, issue.3, pp.721-741, 2009.
DOI : 10.1007/s10543-009-0240-1

T. W. Parks and J. H. Mcclellan, Chebyshev Approximation for Nonrecursive Digital Filters with Linear Phase, IEEE Transactions on Circuit Theory, vol.19, issue.2, pp.189-194, 1972.
DOI : 10.1109/TCT.1972.1083419

B. N. Parlett, R. , and C. , Balancing a matrix for calculation of eigenvalues and eigenvectors, Numerische Mathematik, vol.12, issue.4, pp.293-304, 1969.
DOI : 10.1007/BF02165404

D. Pelloni and F. Bonzanigo, On the design of high-order linear phase FIR filters, Digital Signal Processing, vol.1, pp.3-10, 1980.

F. Piazzon and M. Vianello, On the stability of Lebesgue constants, 2016.

M. J. Powell, Approximation Theory and Methods, 1981.

P. Prandoni and M. Vetterli, Signal processing for communications, 2008.

E. Z. Psarakis and G. Moustakides, A robust initialization scheme for the Remez exchange algorithm, IEEE Signal Processing Letters, vol.10, issue.1, pp.1-3, 2003.
DOI : 10.1109/LSP.2002.806701

M. Pusa, Numerical methods for nuclear fuel burnup calculations, 2013.

L. Rabiner, J. Kaiser, and R. W. Schafer, Some considerations in the design of multiband finite-impulse-response digital filters, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol.22, issue.6, pp.462-472, 1974.
DOI : 10.1109/TASSP.1974.1162607

H. Rack and M. Reimer, The numerical stability of evaluation schemes for polynomials based on the lagrange interpolation form, BIT, vol.15, issue.1, pp.101-107, 1982.
DOI : 10.1007/BF01934399

A. Ralston, Some Aspects of Degeneracy in Rational Approximations, IMA Journal of Applied Mathematics, vol.11, issue.2, pp.157-170, 1973.
DOI : 10.1093/imamat/11.2.157

L. Reichel, Newton interpolation at Leja points, BIT, vol.26, issue.2, pp.332-346, 1990.
DOI : 10.1007/BF02017352

E. Remes, Sur le calcul effectif des polynômes d'approximation de Tchebichef. Comptes rendus hebdomadaires des séances de l, Académie des Sciences, vol.199, pp.337-340, 1934.

E. Remes, Sur un procédé convergent d'approximations successives pour déterminer les polynômes d'approximation. Comptes rendus hebdomadaires des séances de l, Académie des Sciences, vol.198, pp.2063-2065, 1934.

H. Rutishauser, . Vorlesungenübervorlesungen¨vorlesungenüber-numerische, and . Mathematik, English translation, Lectures on Numerical Mathematics. Walter Gautschi, 1976.

H. E. Salzer, Lagrangian Interpolation at the Chebyshev Points xn, ?? ?? cos (????/n), ?? = 0(1)n; some Unnoted Advantages, The Computer Journal, vol.15, issue.2, pp.156-159, 1972.
DOI : 10.1093/comjnl/15.2.156
URL : http://comjnl.oxfordjournals.org/cgi/content/short/15/2/156

T. Saramäki, An efficient Remez-type algorithm for the design of optimum IIR filters with arbitrary partially constrained specifications, [Proceedings] 1992 IEEE International Symposium on Circuits and Systems, pp.2577-2580, 1992.
DOI : 10.1109/ISCAS.1992.230459

T. Saramäki, Generalizations of classical recursive digital filters and their design with the aid of a Remez-type algorithm, Proceedings of IEEE International Symposium on Circuits and Systems, ISCAS '94, pp.549-552, 1994.
DOI : 10.1109/ISCAS.1994.409047

C. Schneider, W. , and W. , Some new aspects of rational interpolation, Mathematics of Computation, vol.47, issue.175, pp.285-299, 1986.
DOI : 10.1090/S0025-5718-1986-0842136-8

C. P. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science, vol.53, issue.2-3, pp.201-224, 1987.
DOI : 10.1016/0304-3975(87)90064-8

A. Schönhage, Zur rationalen approximierbarkeit von e???x??ber [0, ???), Journal of Approximation Theory, vol.7, issue.4, pp.395-398, 1973.
DOI : 10.1016/0021-9045(73)90042-7

I. W. Selesnick, New exchange rules for IIR filter design, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, pp.2209-2212, 1997.
DOI : 10.1109/ICASSP.1997.599489

I. W. Selesnick, M. Lang, and C. S. Burrus, Magnitude squared design of recursive filters with the Chebyshev norm using a constrained rational Remez algorithm, Proceedings of IEEE 6th Digital Signal Processing Workshop, pp.23-26, 1994.
DOI : 10.1109/DSP.1994.379882

J. Shen and G. Strang, The asymptotics of optimal (equiripple) filters, IEEE Transactions on Signal Processing, vol.47, issue.4, pp.1087-1098, 1999.
DOI : 10.1109/78.752606

J. Shen, G. Strang, and A. J. Wathen, The Potential Theory of Several Intervals and Its Applications, Applied Mathematics and Optimization, vol.44, issue.1, pp.67-85, 2001.
DOI : 10.1007/s00245-001-0011-0

D. Shi, Y. , and Y. J. , Design of Linear Phase FIR Filters With High Probability of Achieving Minimum Number of Adders, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.58, issue.1, pp.126-136, 2011.
DOI : 10.1109/TCSI.2010.2055290

D. J. Shpak and A. Antoniou, A generalized Remez method for the design of FIR digital filters, IEEE Transactions on Circuits and Systems, vol.37, issue.2, pp.161-174, 1990.
DOI : 10.1109/31.45709

J. Skaf and S. P. Boyd, Filter Design With Low Complexity Coefficients, IEEE Transactions on Signal Processing, vol.56, issue.7, pp.3162-3169, 2008.
DOI : 10.1109/TSP.2008.919386
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4391

A. Smoktunowicz, Backward stability of Clenshaw's algorithm, Bit Numerical Mathematics, vol.42, issue.3, pp.600-610, 2002.
DOI : 10.1023/A:1022001931526

R. Smyk, FIReWORK: FIR filters hardware structures auto-generator, Journal of Applied Computer Science, vol.21, issue.1, pp.135-149, 2013.

A. Sommariva and M. Vianello, Computing approximate Fekete points by QR factorizations of Vandermonde matrices, Computers & Mathematics with Applications, vol.57, issue.8, pp.1324-1336, 2009.
DOI : 10.1016/j.camwa.2008.11.011

A. Sommariva and M. Vianello, Approximate Fekete points for weighted polynomial interpolation, Electronic Transactions on Numerical Analysis, vol.37, pp.1-22, 2010.

G. Stahl, Best uniform approximation of |x| on [?1, 1]. Russian Academy of Sciences, Sbornik Mathematics, vol.76, issue.2, pp.461-487, 1993.

E. Stiefel and . Uber-diskrete-und-lineare-tschebyscheff-approximationen, ???ber diskrete und lineare Tschebyscheff-Approximationen, Numerische Mathematik, vol.57, issue.1, pp.1-28, 1959.
DOI : 10.1007/BF01386369

E. Stiefel, Note on Jordan elimination, linear programming and Tchebycheff approximation, Numerische Mathematik, vol.1, issue.1, pp.1-17, 1960.
DOI : 10.1007/BF01386203

T. J. Stieltjes, Sur les polynômes de Jacobi Comptes rendus hebdomadaires des séances de l, Académie des Sciences, vol.100, pp.620-622, 1885.

G. Strang, The Discrete Cosine Transform, SIAM Review, vol.41, issue.1, pp.135-147, 1999.
DOI : 10.1137/S0036144598336745
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.474.9386

F. J. Taylor, Residue Arithmetic A Tutorial with Examples, Computer, vol.17, issue.5, pp.50-62, 1984.
DOI : 10.1109/MC.1984.1659138

P. L. Tchebycheff, Sur les questions de minima qui se rattachentàrattachent`rattachentà la représentation aproximative des fonctions, Mémoires de l'Académie impériale des Sciences de Saint-Pétersbourg, 1859.

L. N. Trefethen, Approximation Theory and Approximation Practice, SIAM, 2013.

L. N. Trefethen and M. H. Gutknecht, The Carath??odory???Fej??r Method for Real Rational Approximation, SIAM Journal on Numerical Analysis, vol.20, issue.2, pp.420-436, 1983.
DOI : 10.1137/0720030

L. N. Trefethen, J. A. Weideman, and T. Schmelzer, Talbot quadratures and rational approximations, BIT Numerical Mathematics, vol.288, issue.3, pp.653-670, 2006.
DOI : 10.1007/s10543-006-0077-9
URL : http://eprints.maths.ox.ac.uk/1133/1/NA-05-20.pdf

P. Turán, On some open problems of approximation theory, Journal of Approximation Theory, vol.29, issue.1, pp.23-85, 1980.
DOI : 10.1016/0021-9045(80)90138-0

J. Van-de-pol, Lattice-based cryptanalysis, 2015.

J. Van-deun, Eigenvalue problems to compute almost optimal points for rational interpolation with prescribed poles, Numerical Algorithms, vol.24, issue.1???2, pp.1-4, 2007.
DOI : 10.1007/s11075-007-9109-z

J. Van-deun, Computing near-best fixed pole rational interpolants, Journal of Computational and Applied Mathematics, vol.235, issue.4, pp.1077-1084, 2010.
DOI : 10.1016/j.cam.2010.02.025

J. Van-deun, K. Deckers, A. Bultheel, and J. Weideman, Algorithm 882, ACM Transactions on Mathematical Software, vol.35, issue.2, p.14, 2008.
DOI : 10.1145/1377612.1377618

J. Van-deun and L. N. Trefethen, A robust implementation of the Carath??odory-Fej??r method for rational approximation, BIT Numerical Mathematics, vol.74, issue.2, pp.1039-1050, 2011.
DOI : 10.1007/s10543-011-0331-7

P. Van-emde-boas, Another NP-complete problem and the complexity of computing short vectors in a lattice, 1981.

R. S. Varga and A. J. Carpenter, On the bernstein conjecture in approximation theory, Constructive Approximation, vol.199, issue.32, pp.333-348, 1985.
DOI : 10.1007/BF01890040

R. S. Varga, A. Ruttan, and A. J. Carpenter, Numerical results on best uniform approximation of |x| on, Mathematics of the USSR-Sbornik 74, pp.271-290, 1993.

L. Veidinger, On the numerical determination of the best approximations in the Chebyshev sense, Numerische Mathematik, vol.13, issue.No. 67, pp.99-105, 1960.
DOI : 10.1007/BF01386215

S. Verdoolaege, isl: An Integer Set Library for the Polyhedral Model, International Congress on Mathematical Software, pp.299-302, 2010.
DOI : 10.1007/978-3-642-15582-6_49

M. Vetterli, J. Kova?evi´kova?evi´c, and V. K. Goyal, Foundations of signal processing, 2014.

J. L. Walsh, Existence and uniqueness of rational functions of best approximation, Transactions of the American Mathematical Society, vol.33, issue.3, pp.668-689, 1931.
DOI : 10.1090/coll/020/12

J. L. Walsh, On approximation to an analytic function by rational functions of best approximation, Mathematische Zeitschrift, vol.34, issue.1, pp.163-176, 1934.
DOI : 10.1007/BF01170632

G. A. Watson, Approximation theory and numerical methods, 1980.

G. A. Watson, Approximation in normed linear spaces, Journal of Computational and Applied Mathematics, vol.121, issue.1-2, pp.1-36, 2000.
DOI : 10.1016/S0377-0427(00)00333-2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.8584

M. Webb, L. N. Trefethen, and P. Gonnet, Stability of Barycentric Interpolation Formulas for Extrapolation, SIAM Journal on Scientific Computing, vol.34, issue.6, pp.3009-3015, 2012.
DOI : 10.1137/110848797

D. Wei, Design of discrete-time filters for efficient implementation, 2011.

S. E. Weinstein, Approximations of functions of several variables: Product Chebychev approximations, I, Journal of Approximation Theory, vol.2, issue.4, pp.433-447, 1969.
DOI : 10.1016/0021-9045(69)90012-4

H. Werner, Die konstruktive Ermittlung der Tschebyscheff-Approximierenden im Bereich der rationalen funktionen, Archive for Rational Mechanics and Analysis, vol.41, issue.1, pp.368-384, 1962.
DOI : 10.1007/BF00253944

H. Werner, J. Stoer, and W. Bommas, Rational Chebyshev approximation, Numerische Mathematik, vol.10, issue.4, pp.289-306, 1967.
DOI : 10.1007/BF02162028

B. Widrow and I. Kollár, Quantization noise, 2008.
DOI : 10.1017/CBO9780511754661

A. Wipf, Statistical Approach to Quantum Field Theory: An Introduction, Lecture Notes in Physics, vol.100, 2012.
DOI : 10.1007/978-3-642-33105-3

G. B. Wright, M. Javed, H. Montanelli, and L. N. Trefethen, Extension of Chebfun to Periodic Functions, SIAM Journal on Scientific Computing, vol.37, issue.5, pp.554-573, 2015.
DOI : 10.1137/141001007

L. Yang and G. B. Giannakis, Ultra-wideband communications - An idea whose time has come, IEEE Signal Processing Magazine, vol.21, issue.6, pp.26-54, 2004.
DOI : 10.1109/MSP.2004.1359140

P. T. Yang, R. Jain, T. Yoshino, W. Gass, and A. Shah, A functional silicon compiler for high speed FIR digital filters, International Conference on Acoustics, Speech, and Signal Processing, pp.1329-1332, 1990.
DOI : 10.1109/ICASSP.1990.115625

J. Yli-kaakinen and T. Saramaki, A Systematic Algorithm for the Design of Lattice Wave Digital Filters With Short-Coefficient Wordlength, IEEE Transactions on Circuits and Systems I: Regular Papers, vol.54, issue.8, pp.1838-1851, 2007.
DOI : 10.1109/TCSI.2007.902513

P. Zahradnik and M. Vlcek, Robust analytical design of equiripple comb FIR filters, 2008 IEEE International Symposium on Circuits and Systems, pp.1128-1131, 2008.
DOI : 10.1109/ISCAS.2008.4541621