Improved recursive procedures for envelope-constrained filtering

Author

Zheng, W.X. ; Vo, B. ; Cantoni, A. ; Teo, K.L.

Author_Institution

Dept. of Math., Univ. of Western Sydney, Kingswood, NSW, Australia

Volume

2

fYear

1995

fDate

30 Apr-3 May 1995

Firstpage

1376

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

Keywords

convergence of numerical methods; filtering theory; iterative methods; minimisation; quadratic programming; constraint transcription technique; envelope-constrained filtering; inequality constrained quadratic programming problem; optimization methods; recursive procedures; unconstrained minimization problem; Adaptive filters; Algorithm design and analysis; Filtering; Finite impulse response filter; Least squares approximation; Mathematics; Minimization methods; Nonlinear filters; Predictive models; Quadratic programming;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on

Conference_Location

Seattle, WA

Print_ISBN

0-7803-2570-2

Type

conf

DOI

10.1109/ISCAS.1995.520403

Filename

520403