Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Application of cubic constraint approximation in the recursive design of FIR filters subject to output envelope constraints

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

1 Author(s)
Wei Xing Zheng ; Sch. of Sci., Univ. of Western Sydney, Sydney, NSW, Australia

The smoothing function used in the constraint approximation plays an important role in the adaptive envelope-constrained (EC) filtering algorithms presented. In this paper, a cubic smoothing function is proposed to implement the constraint approximation and the simplified line search technique is introduced to speed up the convergence rate. It is shown that the performance of the adaptive EC filtering algorithms can be greatly improved due to the use of the cubic constraint approximation and simplified line searches. In particular, the second-order convergence is established for the Newton-Raphson type algorithm. Numerical results are included to illustrate the effectiveness of these adaptive EC filtering algorithms

Published in:

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on  (Volume:48 ,  Issue: 5 )