By Topic

Dual forms for constrained adaptive filtering

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

2 Author(s)
Fertig, L.B. ; Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; McClellan, J.H.

A new structure for constrained adaptive filtering is proposed. It is based on a “dual” solution of the constrained minimization problems that arise in optimal broadband adaptive array processing. The dual solution is unique in the sense that its update equations involve the Lagrange multipliers rather than the adaptive filter weights. The dual approach is shown to be applicable to two types of adaptive filtering (or beamforming) problems. One is the linearly constrained power minimization beamformer and the other is the norm constrained robust beamformer. In each case, the equations defining the dual structure are derived, and the convergence of the resulting iteration is analyzed. Simulation results are included to illustrate the performance of the dual algorithms compared with the primal methods. It is shown that the convergence and computational complexity of the dual algorithms are similar to that of RLS-type algorithms

Published in:

Signal Processing, IEEE Transactions on  (Volume:42 ,  Issue: 1 )