A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters

DOI10.1145/2904902zbMath1371.65013OpenAlexW2233904323WikidataQ113310185 ScholiaQ113310185MaRDI QIDQ5270769

Silviu-Ioan Filip

Publication date: 30 June 2017

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01136005v5/file/pm.pdf

zbMATH Keywords

algorithmsignal processingLebesgue constantbarycentric interpolationChebyshev approximationfinite impulse response filterscolleague matrixweighted minimax polynomial approximation

Mathematics Subject Classification ID

Related Items (3)

Computation of Chebyshev polynomials for union of intervals ⋮ High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function ⋮ firpm

Uses Software

• LAPACK
• MPFR
• Eigen
• Chebfun

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The stability of barycentric interpolation at the Chebyshev points of the second kind
• On the numerical determination of the best approximations in the Chebyshev sense
• On the calculation of approximate fekete points: the univariate case
• Computing the zeros, maxima and inflection points of Chebyshev, Legendre and Fourier series: solving transcendental equations by spectral interpolation and polynomial rootfinding
• Uniform approximation by discrete least squares polynomials
• Approximate Fekete points for weighted polynomial interpolation
• Computing approximate Fekete points by QR factorizations of Vandermonde matrices
• On selecting a maximum volume sub-matrix of a matrix and related problems
• The numerical stability of evaluation schemes for polynomials based on the Lagrange interpolation form
• Numerical experiments on the accuracy of the Chebyshev-Frobenius companion matrix method for finding the zeros of a truncated series of Chebyshev polynomials
• Barycentric rational interpolation with no poles and high rates of approximation
• Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
• Finding the Zeros of a Univariate Equation: Proxy Rootfinders, Chebyshev Interpolation, and the Companion Matrix
• Geometric weakly admissible meshes, discrete least squares approximations and approximate Fekete points
• MPFR
• Handbook of Floating-Point Arithmetic
• New improved method for the design of weighted- Chebyshev, nonrecursive, digital filters
• LAPACK Users' Guide
• The Discrete Cosine Transform
• LLL Algorithm and the Optimal Finite Wordlength FIR Design
• Barycentric Lagrange Interpolation
• The numerical stability of barycentric Lagrange interpolation
• Green's Functions for Multiply Connected Domains via Conformal Mapping
• Fast Algorithms for Polynomial Interpolation, Integration, and Differentiation
• Complex Chebyshev approximation for FIR filter design
• Stability of Barycentric Interpolation Formulas for Extrapolation
• Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
• The potential theory of several intervals and its applications

This page was built for publication: A Robust and Scalable Implementation of the Parks-McClellan Algorithm for Designing FIR Filters