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 approach 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 existing codes fail to work. Our goal is twofold. We first examine and present solutions for the practical difficulties related to weighted minimax polynomial approximation problems on multi-interval domains (i.e., the general setting under which the Parks-McClellan algorithm operates). Using these ideas, we then describe a robust implementation of this algorithm. It routinely outperforms existing minimax filter design routines.
Complete list of metadatas

https://hal.inria.fr/hal-01136005
Contributor : Silviu-Ioan Filip <>
Submitted on : Wednesday, May 4, 2016 - 12:08:05 PM
Last modification on : Thursday, February 7, 2019 - 5:05:43 PM

File

pm.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01136005, version 5

Collections

Citation

Silviu-Ioan Filip. A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters. ACM Transactions on Mathematical Software, Association for Computing Machinery, 2016, 43 (1), pp.7:1 - 7:24. ⟨hal-01136005v5⟩

Share

Metrics

Record views

334

Files downloads

375