A New Hybrid Descent Method with Application to the Optimal Design of Finite Precision FIR Filters
In this paper, the problem of the optimal design of discrete coefficient FIR filters is considered. A novelhybrid descent method, consisting of a simulated annealing algorithm and a gradient-based method, isproposed. The simulated annealing algorithm operates on the space of orthogonal matrices and...
| Main Authors: | , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Taylor & Francis
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/30127 |
| _version_ | 1848752998998605824 |
|---|---|
| author | Yiu, Ka Fai Yan, Wei-Yong Teo, Kok Lay Low, Siow |
| author_facet | Yiu, Ka Fai Yan, Wei-Yong Teo, Kok Lay Low, Siow |
| author_sort | Yiu, Ka Fai |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | In this paper, the problem of the optimal design of discrete coefficient FIR filters is considered. A novelhybrid descent method, consisting of a simulated annealing algorithm and a gradient-based method, isproposed. The simulated annealing algorithm operates on the space of orthogonal matrices and is used tolocate descent points for previously converged local minima. The gradient-based method is derived fromconverting the discrete problem to a continuous problem via the Stiefel manifold, where convergence canbe guaranteed. To demonstrate the effectiveness of the proposed hybrid descent method, several numericalexamples show that better discrete filter designs can be sought via this hybrid descent method. |
| first_indexed | 2025-11-14T08:17:32Z |
| format | Journal Article |
| id | curtin-20.500.11937-30127 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:17:32Z |
| publishDate | 2009 |
| publisher | Taylor & Francis |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-301272017-09-13T16:08:12Z A New Hybrid Descent Method with Application to the Optimal Design of Finite Precision FIR Filters Yiu, Ka Fai Yan, Wei-Yong Teo, Kok Lay Low, Siow simulating annealing finite precision FIR filter design Hybrid descent method In this paper, the problem of the optimal design of discrete coefficient FIR filters is considered. A novelhybrid descent method, consisting of a simulated annealing algorithm and a gradient-based method, isproposed. The simulated annealing algorithm operates on the space of orthogonal matrices and is used tolocate descent points for previously converged local minima. The gradient-based method is derived fromconverting the discrete problem to a continuous problem via the Stiefel manifold, where convergence canbe guaranteed. To demonstrate the effectiveness of the proposed hybrid descent method, several numericalexamples show that better discrete filter designs can be sought via this hybrid descent method. 2009 Journal Article http://hdl.handle.net/20.500.11937/30127 10.1080/10556780903254104 Taylor & Francis fulltext |
| spellingShingle | simulating annealing finite precision FIR filter design Hybrid descent method Yiu, Ka Fai Yan, Wei-Yong Teo, Kok Lay Low, Siow A New Hybrid Descent Method with Application to the Optimal Design of Finite Precision FIR Filters |
| title | A New Hybrid Descent Method with Application to the Optimal Design of Finite Precision FIR Filters |
| title_full | A New Hybrid Descent Method with Application to the Optimal Design of Finite Precision FIR Filters |
| title_fullStr | A New Hybrid Descent Method with Application to the Optimal Design of Finite Precision FIR Filters |
| title_full_unstemmed | A New Hybrid Descent Method with Application to the Optimal Design of Finite Precision FIR Filters |
| title_short | A New Hybrid Descent Method with Application to the Optimal Design of Finite Precision FIR Filters |
| title_sort | new hybrid descent method with application to the optimal design of finite precision fir filters |
| topic | simulating annealing finite precision FIR filter design Hybrid descent method |
| url | http://hdl.handle.net/20.500.11937/30127 |