{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:54:54Z","timestamp":1776124494721,"version":"3.50.1"},"reference-count":29,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006595","name":"Unitatea Executiva Pentru Finantarea Invatamantului Superior a Cercetarii Dezvoltarii si Inovarii","doi-asserted-by":"publisher","award":["PN-III-P1-1.1-TE-2019-0420"],"award-info":[{"award-number":["PN-III-P1-1.1-TE-2019-0420"]}],"id":[{"id":"10.13039\/501100006595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The principal issue in acoustic echo cancellation (AEC) is to estimate the impulse response between the loudspeaker and microphone of a hands-free communication device. This application can be addressed as a system identification problem, which can be solved by using an adaptive filter. The most common one for AEC is the normalized least-mean-square (NLMS) algorithm. It is known that the overall performance of this algorithm is controlled by the value of its normalized step size parameter. In order to obtain a proper compromise between the main performance criteria (e.g., convergence rate\/tracking versus accuracy\/robustness), this specific term of the NLMS algorithm can be further controlled and designed as a variable parameter. This represents the main motivation behind the development of variable step size algorithms. In this paper, we propose a variable step size NLMS (VSS-NLMS) algorithm that exploits the data reuse mechanism, which aims to improve the convergence rate\/tracking of the algorithm by reusing the same set of data (i.e., the input and reference signals) several times. Nevertheless, we involved an equivalent version of the data reuse NLMS, which provides the convergence modes of the algorithm. Based on this approach, a sequence of normalized step sizes can be a priori scheduled, which is advantageous in terms of the computational complexity. The simulation results in the context of AEC supported the good performance features of the proposed VSS-NLMS algorithm.<\/jats:p>","DOI":"10.3390\/a15040111","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T00:05:18Z","timestamp":1648166718000},"page":"111","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["A Variable Step Size Normalized Least-Mean-Square Algorithm Based on Data Reuse"],"prefix":"10.3390","volume":"15","author":[{"given":"Alexandru-George","family":"Rusu","sequence":"first","affiliation":[{"name":"Department of Telecommunications, University Politehnica of Bucharest, 060042 Bucharest, Romania"},{"name":"Department of Research and Development, Rohde & Schwarz Topex, 020335 Bucharest, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0379-2360","authenticated-orcid":false,"given":"Constantin","family":"Paleologu","sequence":"additional","affiliation":[{"name":"Department of Telecommunications, University Politehnica of Bucharest, 060042 Bucharest, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0036-5865","authenticated-orcid":false,"given":"Jacob","family":"Benesty","sequence":"additional","affiliation":[{"name":"INRS-EMT, University of Quebec, Montreal, QC H5A 1K6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silviu","family":"Ciochin\u0103","sequence":"additional","affiliation":[{"name":"Department of Telecommunications, University Politehnica of Bucharest, 060042 Bucharest, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"key":"ref_1","unstructured":"Haykin, S. (2002). Adaptive Filter Theory, Prentice-Hall. [4th ed.]."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Benesty, J., and Huang, Y. (2003). Adaptive Signal Processing\u2014Applications to Real-World Problems, Springer.","DOI":"10.1007\/978-3-662-11028-7"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Diniz, P.S.R. (2013). Adaptive Filtering: Algorithms and Practical Implementation, Springer. [4th ed.].","DOI":"10.1007\/978-1-4614-4106-9"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Gay, S.L., and Benesty, J. (2000). Acoustic Signal Processing for Telecommunication, Kluwer Academic Publisher.","DOI":"10.1007\/978-1-4419-8644-3"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Benesty, J., G\u00e4nsler, T., Morgan, D.R., Sondhi, M.M., and Gay, S.L. (2001). Advances in Network and Acoustic Echo Cancellation, Springer.","DOI":"10.1007\/978-3-662-04437-7"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"H\u00e4nsler, E., and Schmidt, G. (2004). Acoustic Echo and Noise Control\u2014A Practical Approach, Wiley.","DOI":"10.1002\/0471678406"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1109\/89.861368","article-title":"Proportionate normalized least-mean-squares adaptation in echo cancelers","volume":"8","author":"Duttweiler","year":"2000","journal-title":"IEEE Trans. Speech Audio Process."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Benesty, J., and Gay, S.L. (2002, January 13\u201317). An improved PNLMS algorithm. Proceedings of the 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing, Orlando, FL, USA.","DOI":"10.1109\/ICASSP.2002.1006134"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1794","DOI":"10.1109\/TSP.2006.872533","article-title":"Proportionate adaptive algorithms for network echo cancellation","volume":"54","author":"Deng","year":"2006","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1109\/TASL.2009.2025903","article-title":"A class of sparseness-controlled algorithms for echo cancellation","volume":"17","author":"Loganathan","year":"2009","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1109\/TASL.2011.2125955","article-title":"Proportionate affine projection sign algorithms for network echo cancellation","volume":"19","author":"Yang","year":"2011","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1109\/TASLP.2015.2499602","article-title":"Proportionate adaptive filtering for block-sparse system identification","volume":"24","author":"Liu","year":"2016","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"ref_13","first-page":"1902","article-title":"Proportionate maximum versoria criterion based adaptive algorithm for sparse system identification","volume":"69","author":"Radhika","year":"2021","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/LSP.2006.876323","article-title":"A nonparametric VSS NLMS algorithm","volume":"13","author":"Benesty","year":"2006","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_15","unstructured":"Iqbal, M.A., and Grant, S.L. (April, January 31). Novel variable step size NLMS algorithms for echo cancellation. Proceedings of the 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, Las Vegas, NV, USA."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Rotaru, M., Albu, F., and Coand\u0103, H. (2012, January 15\u201316). A variable step size modified decorrelated NLMS algorithm for adaptive feedback cancellation in hearing aids. Proceedings of the 2012 10th International Symposium on Electronics and Telecommunications, Timisoara, Romania.","DOI":"10.1109\/ISETC.2012.6408070"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2368","DOI":"10.1109\/TASLP.2016.2556280","article-title":"Robust variable step size decorrelation normalized least-mean-square algorithm and its application to acoustic echo cancellation","volume":"24","author":"Zhang","year":"2016","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1109\/TASLP.2017.2671422","article-title":"Statistical convergence analysis for optimal control of DFT-domain adaptive echo canceler","volume":"25","author":"Yang","year":"2017","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3235","DOI":"10.1109\/78.875480","article-title":"Convergence analysis of the binormalized data-reusing LMS algorithm","volume":"48","author":"Diniz","year":"2000","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/TSP.2002.806562","article-title":"Set-membership binormalized data-reusing LMS algorithms","volume":"51","author":"Diniz","year":"2003","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_21","unstructured":"Benesty, J., and G\u00e4nsler, T. (2003, January 8\u201311). On data reuse adaptive algorithms. Proceedings of the International Workshop on Acoustic Echo and Noise Control (IWAENC), Kyoto, Japan."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/TSP.2003.821338","article-title":"Low-complexity data reusing methods in adaptive filtering","volume":"52","author":"Soni","year":"2004","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_23","unstructured":"Vinhoza, T.T.V., de Lamare, R.C., and Sampaio-Neto, R. (2006, January 14\u201319). Low complexity blind constrained data-reusing algorithms based on minimum variance and constant modulus criteria. Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing Proceedings, Toulouse, France."},{"key":"ref_24","unstructured":"Paleologu, C., and Benesty, J. (2012, January 27\u201331). A practical data reuse adaptive algorithm for acoustic echo cancellation. Proceedings of the 2012 Proceedings of the 20th European Signal Processing Conference (EUSIPCO), Bucharest, Romania."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Rusu, A.G., Dogariu, L.M., Ciochin\u0103, S., and Paleologu, C. (2021, January 13\u201315). A data reuse approach for an optimized LMS algorithm. Proceedings of the 2021 International Conference on Speech Technology and Human-Computer Dialogue (SpeD), Bucharest, Romania.","DOI":"10.1109\/SpeD53181.2021.9587371"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"4646","DOI":"10.1109\/JLT.2021.3076067","article-title":"Nonlinear coherent optical systems in the presence of equalization enhanced phase noise","volume":"39","author":"Jin","year":"2021","journal-title":"J. Light. Technol."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"43136","DOI":"10.1364\/OE.445400","article-title":"Joint estimation of dynamic polarization and carrier phase with pilot-based adaptive equalizer in PDM-64 QAM transmission system","volume":"29","author":"Yang","year":"2021","journal-title":"Opt. Express"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1734","DOI":"10.1109\/TASL.2010.2097251","article-title":"On regularization in adaptive filtering","volume":"19","author":"Benesty","year":"2011","journal-title":"IEEE Trans. Audio Speech Lang. Process."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"3141","DOI":"10.1109\/TSP.2005.851110","article-title":"Gradient-based variable forgetting factor RLS algorithm in time-varying environments","volume":"53","author":"Leung","year":"2005","journal-title":"IEEE Trans. Signal Process."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/4\/111\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:42:48Z","timestamp":1760136168000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/15\/4\/111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,24]]},"references-count":29,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2022,4]]}},"alternative-id":["a15040111"],"URL":"https:\/\/doi.org\/10.3390\/a15040111","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,24]]}}}