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 existing codes fail to work. Our goal is twofold: (1) 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), and (2) using them, describe a robust implementation which outperforms existing alternatives.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.inria.fr/hal-01136005
Contributor : Silviu-Ioan Filip <>
Submitted on : Friday, January 15, 2016 - 1:42:46 PM
Last modification on : Friday, April 20, 2018 - 3:44:26 PM

File

pm.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01136005, version 3

Citation

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

Share

Metrics

Record views

154

Files downloads

498