Adaptive step-size sign least mean squares
In this paper, we propose a novel structure for adaptive sign least mean squares (ASLMS). A powerful adaptation scheme is used to adapt the step-size of the sign function inside the recursion of the sign algorithm. It is shown how the algorithm can be implemented with no real multiplication. Simulat...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | article |
| منشور في: |
2004
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14451/1/14451_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14451/2/14451_2.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | In this paper, we propose a novel structure for adaptive sign least mean squares (ASLMS). A powerful adaptation scheme is used to adapt the step-size of the sign function inside the recursion of the sign algorithm. It is shown how the algorithm can be implemented with no real multiplication. Simulation results show that the performance of the proposed algorithm can be made arbitrarily close to that of the original least means squares algorithm. |
|---|