By Topic

A penalty approach to iterative algorithms for envelope constrained filter design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Vo, B. ; Coop. Res. Center for Broadband Telecommun. & Networking, Curtin Univ. of Technol., Bentley, WA, Australia ; Cantoni, A. ; Teo, K.L.

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

Published in:

Signal Processing, IEEE Transactions on  (Volume:45 ,  Issue: 7 )