Abstract
This paper presents new recursive procedures for designing optimum envelope-constrained (EC) filters. Using a constraint transcription technique, the inequality constrained quadratic programming problem associated with EC filtering can be approximated as an unconstrained minimization problem. Two types of optimization methods are developed to solve this unconstrained problem in a recursive adjusting manner. Simulations of the proposed recursive procedures are presented which support the theoretical predictions.
| Original language | English |
|---|---|
| Pages (from-to) | 1376-1379 |
| Number of pages | 4 |
| Journal | Proceedings - IEEE International Symposium on Circuits and Systems |
| Volume | 2 |
| Publication status | Published - 1995 |
| Event | Proceedings of the 1995 IEEE International Symposium on Circuits and Systems-ISCAS 95. Part 3 (of 3) - Seattle, WA, USA Duration: 30 Apr 1995 → 3 May 1995 |