In this paper, a new algorithm is proposed for digital filter design. Filter specifications are fixed as a mask defined by upper and lower bounds on the magnitude response of the filter. The filter is designed by minimizing a particular objective function measuring the average violation on mask constraints for a discrete set of frequencies. The minimization of the objective function is performed by a non monotone modification of the projected gradient algorithm. It allows to include the filter stability constraints in the optimization problem, while the non monotone approach avoids the local minima problem which is often encountered in non convex optimization problems. ©2007 IEEE.
A non-monotone optimization algorithm for IIR filter design / Mario, Antonelli; Rizzi, Antonello. - STAMPA. - (2007), pp. 372-377. (Intervento presentato al convegno 17th IEEE International Workshop on Machine Learning for Signal Processing tenutosi a Thessaloniki; Greece nel 27 August 2007 through 29 August 2007) [10.1109/mlsp.2007.4414335].
A non-monotone optimization algorithm for IIR filter design
RIZZI, Antonello
2007
Abstract
In this paper, a new algorithm is proposed for digital filter design. Filter specifications are fixed as a mask defined by upper and lower bounds on the magnitude response of the filter. The filter is designed by minimizing a particular objective function measuring the average violation on mask constraints for a discrete set of frequencies. The minimization of the objective function is performed by a non monotone modification of the projected gradient algorithm. It allows to include the filter stability constraints in the optimization problem, while the non monotone approach avoids the local minima problem which is often encountered in non convex optimization problems. ©2007 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
