A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters

Silviu-Ioan Filip 1
1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : With a long history dating back to the beginning of the 1970s, the Parks-McClellan algorithm is probably the most well-known alternative for designing finite impulse response filters. Despite being a standard routine in many signal processing packages, it is possible to find practical design specifications where such codes fail to work. In this paper, we introduce a new implementation of this algorithm. It is based on three main ingredients: (1) a new heuristic initialization strategy that generally improves the convergence properties of the Parks-McClellan routine, (2) numerically stable barycentric Lagrange interpolation formulas, and (3) colleague matrix-based rootfinding algorithms. We argue that our approach is very robust in practice, even for hard to design problems. The result, an open source C++ library, is capable of constructing filters where the final degree is more than 50000, outperforming other implementations.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.inria.fr/hal-01136005
Contributor : Silviu-Ioan Filip <>
Submitted on : Thursday, March 26, 2015 - 4:51:39 PM
Last modification on : Friday, April 20, 2018 - 3:44:26 PM
Long-term archiving on: Tuesday, April 18, 2017 - 12:12:20 AM

File

pm2015.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01136005, version 1

Citation

Silviu-Ioan Filip. A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters. 2015. ⟨hal-01136005v1⟩

Share

Metrics

Record views

297

Files downloads

3469