Abstract
In this paper, the problem of the optimal design of discrete coefficient FIR filters is considered. A novel hybrid descent method, consisting of a simulated annealing algorithm and a gradient-based method, is proposed. The simulated annealing algorithm operates on the space of orthogonal matrices and is used to locate descent points for previously converged local minima. The gradient-based method is derived from converting the discrete problem to a continuous problem via the Stiefel manifold, where convergence can be guaranteed. To demonstrate the effectiveness of the proposed hybrid descent method, several numerical examples show that better discrete filter designs can be sought via this hybrid descent method.
Acknowledgements
This research was supported by the Research Grants Council of HKSAR (PolyU 7191/06E) and the Research Committee of the Hong Kong Polytechnic University. We would like to thank the anonymous referees for their constructive comments.