A penalty approach to iterative algorithms for envelope constrained filter design

The discrete-time envelope-constrained (EC) filtering problem can be formulated as a quadratic programming (QP) problem with affine inequality constraints. This QP problem is approximated by an unconstrained minimization problem with two parameters. Descent direction-based algorithms are applied to solve the unconstrained problem iteratively. It is shown that these algorithms converge.