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.
Type de document :
Article dans une revue
ACM Transactions on Mathematical Software, Association for Computing Machinery, 2016
Liste complète des métadonnées

https://hal.inria.fr/hal-01136005
Contributeur : Silviu-Ioan Filip <>
Soumis le : mercredi 4 mai 2016 - 12:08:05
Dernière modification le : vendredi 27 avril 2018 - 14:40:07

Fichier

pm.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. 〈hal-01136005v5〉

Partager

Métriques

Consultations de la notice

257

Téléchargements de fichiers

233