Ho , Charlotte Yuk Fan and Ling, Bingo Wing-Kuen and Liu, Yan-Qun and Tam, Peter Kwong-Shun and Teo, Kok-Lay (2006) Efficient algorithm for solving semi-infinite programming problems and their applications to nonuniform filter bank designs. IEEE Transactions on Signal Processing , 54 (11). 4223 -4232. ISSN 1053-587X
|
PDF
Efficient_Algorithm_for_Solving_Semi-infinite.pdf - Whole Document Download (343Kb) |
Abstract
An efficient algorithm for solving semi-infinite programming problems is proposed in this paper. The index set is constructed by adding only one of the most violated points in a refined set of grid points. By applying this algorithm for solving the optimum nonuniform symmetric/antisymmetric linear phase finite-impulse-response (FIR) filter bank design problems, the time required to obtain a globally optimal solution is much reduced compared with that of the previous proposed algorithm
| Item Type: | Article |
|---|---|
| Additional Information: | An efficient algorithm for solving semi-infinite programming problems is proposed in this paper. The index set is constructed by adding only one of the most violated points in a refined set of grid points. By applying this algorithm for solving the optimum nonuniform symmetric/antisymmetric linear phase finite-impulse-response (FIR) filter bank design problems, the time required to obtain a globally optimal solution is much reduced compared with that of the previous proposed algorithm |
| Keywords: | semi-infinite programming, dual parameterization, nonuniform filter banks |
| Subjects: | H Engineering > H600 Electronic and Electrical Engineering |
| Divisions: | College of Sciences > Faculty of Science > Lincoln School of Engineering |
| Depositing User: | Rosaline Smith |
| Date Deposited: | 22 Jun 2010 20:42 |
| Last Modified: | 13 Mar 2013 08:39 |
| URI: | http://eprints.lincoln.ac.uk/id/eprint/2699 |
Actions (login required)
![]() |
View Item |
