A robust and scalable implementation of the Parks-McClellan algorithm for designing FIR filters - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Transactions on Mathematical Software Year : 2016

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

Silviu-Ioan Filip

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.
Fichier principal
Vignette du fichier
pm.pdf (714.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01136005 , version 1 (26-03-2015)
hal-01136005 , version 2 (22-04-2015)
hal-01136005 , version 3 (15-01-2016)
hal-01136005 , version 4 (27-04-2016)
hal-01136005 , version 5 (04-05-2016)

Identifiers

  • HAL Id : hal-01136005 , version 5

Cite

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

Share

Gmail Facebook X LinkedIn More