Quantum Calculus-Based Two-Dimensional Least Mean Square Algorithm
Recent work of the one-dimensional q-LMS algorithm give insight that the Quantum Calculus based gradient called the q-gradient is capable of improving the convergence behavior in contrast to the standard LMS algorithm. The reason for this is the fact that the q-derivative takes larger steps in minimizing a cost function as it evaluates the secant in contrast to the tangent of the cost function. Motivated by this, we propose a two-dimensional version of the q-LMS algorithm. More precisely, we employ Quantum Calculus based q-gradient in steepest descent optimization of mean-square-error (MSE) cost function in 2D adaptive filtering scenario to obtain two-dimensional q-LMS (2D q-LMS) algorithm. A thorough analytical investigation of the proposed 2D q-LMS algorithm in both mean and mean-square sense is provided. Both the transient and steady-state convergence behaviours are examined. Consequently, excess MSE (EMSE) learning curve and its steady-state expression are evaluated in closed form. Simulation results are presented for the application of noise cancelation in images to show the superiority of the proposed 2D q-LMS algorithm.
Authors
- Ubaid M. Al‐Saggaf (ORCID: https://orcid.org/0000-0002-2925-5184)
- Azzedine Zerguine (ORCID: https://orcid.org/0000-0002-2621-4969)
- Muhammad Arif (ORCID: https://orcid.org/0000-0003-2945-2687)
- Muhammad Moinuddin (ORCID: https://orcid.org/0000-0003-4735-0692)
Institutions
- King Fahd University of Petroleum and Minerals (SA)
- King Abdulaziz University (SA)
- Silicon Austria Labs (Austria) (AT)
- University of Klagenfurt (AT)
Publication Details
- Published
- 2024-10-27
- DOI
- https://doi.org/10.1109/ieeeconf60004.2024.10942885
- Primary Topic
- Machine Learning and ELM
- Type
- article
- Field-Weighted Citation Impact
- 0.00