A novel quantum calculus-based complex least mean square algorithm (q-CLMS)

• Main Authors: Sadiq, A., Naseem, I., Khan, S., Moinuddin, M., Togneri, R., Bennamoun, M.
• Format: Article
• Published: 2023
• Online Access: http://scholars.utp.edu.my/id/eprint/34320/; https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129087312&doi=10.1007%2fs10489-022-03514-3&partnerID=40&md5=474668d0eae78cf221a81ab8ccef95e3

The Least Mean Square (LMS) algorithm has a slow convergence rate as it is dependent on the eigenvalue spread of the input correlation matrix. In this research, we solved this problem by introducing a novel adaptive filtering algorithm for complex domain signal processing based on q-derivative. The proposed algorithm is based on Wirtinger calculus and is called as q- Complex Least Mean Square (q-CLMS) algorithm. The proposed algorithm could be considered as an extension of the q-LMS algorithm for the complex domain. Transient and steady-state analyses of the proposed q-CLMS algorithm are performed and exact analytical expressions for mean analysis, mean square error (MSE), excess mean square error (EMSE), mean square deviation (MSD) and misadjustment are presented. Extensive experiments have been conducted and a good match between the simulation results and theoretical findings is reported. The proposed q-CLMS algorithm is also explored for whitening applications with satisfactory performance. A modification of the proposed q-CLMS algorithm called Enhanced q-CLMS (Eq-CLMS) is also proposed. The Eq-CLMS algorithm eliminates the need for a pre-coded value of the q-parameter thereby automatically adapting to the best value. Extensive experiments are performed on system identification and channel equalization tasks and the proposed algorithm is shown to outperform several benchmark and state-of-the-art approaches namely Complex Least Mean Square (CLMS), Normalized Complex Least Mean Square (NCLMS), Variable Step Size Complex Least Mean Square (VSS-CLMS), Complex FLMS (CFLMS) and Fractional-ordered-CLMS (FoCLMS) algorithms. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.