Abstract
The purpose of this note is to discuss some aspects of recently proposed fractional-order variants of complex least mean square (CLMS) and normalized least mean square (NLMS) algorithms in Shah et al. (Nonlinear Dyn. 88(2):839–858, 2017). It is observed that these algorithms do not always converge, whereas they have apparently no advantage over the CLMS and NLMS algorithms whenever they converge. Our claims are based on analytical reasoning and are supported by numerical simulations.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
