http://iet.metastore.ingenta.com
1887

Linearly-constrained line-search algorithm for adaptive filtering

Linearly-constrained line-search algorithm for adaptive filtering

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A linearly-constrained line-search adaptive filtering algorithm has been developed by incorporating the linear constraints into the least squares problem and searching the solution (filter weights) along the Kalman gain vector. The proposed algorithm performs close to the constrained recursive least squares algorithm while having a computational complexity comparable to the constrained least mean square algorithm. Simulations demonstrate its effectiveness.

References

    1. 1)
      • M.L.R. de Campos , S. Werner , J.A. Apolinário , S. Chrandran . (2004) Constrained adaptive filters, Adaptive antenna arrays: trends and applications.
    2. 2)
      • P.S.R. Diniz . (2008) Adaptive filtering: algorithms and practical implementations.
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2012.2714
Loading

Related content

content/journals/10.1049/el.2012.2714
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address