Cart (Loading....) | Create Account
Close category search window
 

The data-selective constrained affine-projection algorithm

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)
Werner, S. ; Lab. of Signal Process., Helsinki Univ. of Technol., Espoo, Finland ; Apolinario, J.A., Jr. ; de Campos, M.L.R.

This paper introduces a constrained version of the recently proposed set-membership affine projection algorithm based on the set-membership criteria for coefficient update. The algorithm is suitable for linearly constrained minimum-variance filtering applications. The data-selective property of the proposed algorithm greatly reduces the computational burden as compared with a nonselective approach. Simulation results show the good performance in terms of convergence, final misadjustment, and reduced computational complexity

Published in:

Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on  (Volume:6 )

Date of Conference:

2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.