Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. Set-membership adaptive reduced-rank affine projection algorithm
Loading...
Thumbnail Image

Set-membership adaptive reduced-rank affine projection algorithm

Author(s)
Sitjongsataporn, Suchada
Wiangtong, Theerayod
Date Issued
March 1, 2019
Type
Conference Paper
DOI
10.1109/iEECON45304.2019.8938861
Abstract
Set-membership filtering approach with the method of adaptive reduced-rank affine projection algorithm is presented. The distance between the present tap-weight vector and the update is used to accelerate the convergence and decreasing the update rates of proposed algorithm. For the error upper bound constraint, the adaptive averaging threshold parameter is introduced using the estimated auto-correlation between present and previous estimated error vector for controlling the update step-size. Simulation results of proposed algorithm verify the good performance concerning to the amount of updates and convergence rate compared with existing algorithm.
Citation
Ieecon 2019 7th International Electrical Engineering Congress Proceedings, 2019
Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback