By Topic

Envelope-constrained filters: adaptive algorithms

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

4 Author(s)
Tseng, Chien Hsun ; Australian Telecommun. Res. Inst., Curtin Univ. of Technol., Perth, WA, Australia ; Kok Lay Teo ; Cantoni, Antonio ; Zhuquan Zang

We consider an envelope-constrained (EC) optimal filter design problem involving a quadratic cost function and a number of linear inequality constraints. Using the duality theory and the space transformation function, the optimal solution of the dual problem can be computed by finding the limiting point of an ordinary differential equation given in terms of the gradient flow. An iterative algorithm is developed via discretizing the differential equation. From the primal-dual relationship, the corresponding sequence of approximate solutions in the original EC filtering problem is obtained. Based on these results, an adaptive algorithm is constructed for solving the stochastic EC filtering problem in which the input signal is corrupted by an additive random noise. For illustration,a practical example is solved for both noise-free and noisy cases

Published in:

Signal Processing, IEEE Transactions on  (Volume:48 ,  Issue: 6 )