Iterative algorithms for envelope constrained filter design

Author

Vo, B. ; Cantoni, Antonio ; Teo, K.L.

Author_Institution

Telecommun. Res. Inst., Curtin Univ. of Technol., Bentley, WA, Australia

Volume

2

fYear

1995

fDate

9-12 May 1995

Firstpage

1288

Abstract

The discrete-time envelope constrained (EC) filtering problem can be formulated as a quadratic programming (QP) problem with linear inequality constraints. In this paper, the QP problem is approximated by an unconstrained minimization problem with two parameters. These parameters can be selected so that given an acceptable deviation from the norm of the optimal EC filter, the solution to the unconstrained problem satisfies both the deviation and envelope constraints. Newton´s method with line search is applied to solve the unconstrained problem iteratively

Keywords

FIR filters; Newton method; digital filters; filtering theory; minimisation; quadratic programming; FIR filter; Newton´s method; discrete-time envelope; envelope constrained filter design; iterative algorithms; line search; linear inequality constraints; quadratic programming problem; unconstrained minimization problem; Adaptive filters; Australia; Filtering; Finite impulse response filter; Iterative algorithms; Least squares approximation; Nonlinear filters; Quadratic programming; Signal design; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1995. ICASSP-95., 1995 International Conference on

Conference_Location

Detroit, MI

ISSN

1520-6149

Print_ISBN

0-7803-2431-5

Type

conf

DOI

10.1109/ICASSP.1995.480475

Filename

480475