A FAMILY OF NORMALIZED LEAST MEAN FOURTH ALGORITHMS
In this work, a family of normalized least mean fourth algorithms is presented. Unlike the LMF algorithm, the convergence behavior of these algorithms is independent of the input data correlation statistics. The first proposed algorithm uses a simple normalization of the regressor and is called simp...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | article |
| منشور في: |
2020
|
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/1466/1/poster_9_1569048847.pdf |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | In this work, a family of normalized least mean fourth algorithms is presented. Unlike the LMF algorithm, the convergence behavior of these algorithms is independent of the input data correlation statistics. The first proposed algorithm uses a simple normalization of the regressor and is called simply the NLMF. The second algorithm consists of a mixed normalized LMF (XE-NLMF) algorithm which is normalized by the mixed signal and error powers. Finally, the third algorithm, called the variable XE-NLMF, is a modified version of the XE-NLMF where the mixed-power parameter is time-varying. An enhancement in performance is obtained through the use of these techniques over the LMF algorithm. Moreover, the simulation results obtained confirm the theoretical predictions on the performance of these normalized LMF algorithms. |
|---|