{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:52:41Z","timestamp":1760237561298,"version":"build-2065373602"},"reference-count":35,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>High-dimensional system identification problems can be efficiently addressed based on tensor decompositions and modelling. In this paper, we design a recursive least-squares (RLS) algorithm tailored for the identification of trilinear forms, namely RLS-TF. In our framework, the trilinear form is related to the decomposition of a third-order tensor (of rank one). The proposed RLS-TF algorithm acts on the individual components of the global impulse response, thus being efficient in terms of both performance and complexity. Simulation results indicate that the proposed solution outperforms the conventional RLS algorithm (which handles only the global impulse response), but also the previously developed trilinear counterparts based on the least-mean- squares algorithm.<\/jats:p>","DOI":"10.3390\/a13060135","type":"journal-article","created":{"date-parts":[[2020,6,2]],"date-time":"2020-06-02T04:09:03Z","timestamp":1591070943000},"page":"135","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["A Recursive Least-Squares Algorithm for the Identification of Trilinear Forms"],"prefix":"10.3390","volume":"13","author":[{"given":"Camelia","family":"Elisei-Iliescu","sequence":"first","affiliation":[{"name":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura-Maria","family":"Dogariu","sequence":"additional","affiliation":[{"name":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 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, 1-3, Iuliu Maniu Blvd., 061071 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":"Andrei-Alexandru","family":"Enescu","sequence":"additional","affiliation":[{"name":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Silviu","family":"Ciochin\u0103","sequence":"additional","affiliation":[{"name":"Department of Telecommunications, University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071 Bucharest, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,6,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MSP.2014.2298533","article-title":"Tensors: A brief introduction","volume":"31","author":"Comon","year":"2014","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/MSP.2013.2297439","article-title":"Tensor decompositions for signal processing applications: From two-way to multiway component analysis","volume":"32","author":"Cichocki","year":"2015","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/MSP.2014.2329429","article-title":"Breaking the curse of dimensionality using decompositions of incomplete tensors: Tensor-based scientific computing in big data analysis","volume":"31","author":"Vervliet","year":"2014","journal-title":"IEEE Signal Process. Mag."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1109\/TSP.2016.2617858","article-title":"A tensor-based method for large-scale blind source separation using segmentation","volume":"65","author":"Debals","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"3551","DOI":"10.1109\/TSP.2017.2690524","article-title":"Tensor decomposition for signal processing and machine learning","volume":"65","author":"Sidiropoulos","year":"2017","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/j.sigpro.2017.12.015","article-title":"Tensor modelling of MIMO communication systems with performance analysis and Kronecker receivers","volume":"145","author":"Favier","year":"2018","journal-title":"Signal Process."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.sigpro.2018.12.010","article-title":"Separable linearly constrained minimum variance beamformers","volume":"158","author":"Ribeiro","year":"2019","journal-title":"Signal Process."},{"key":"ref_8","unstructured":"De Lathauwer, L. (1997). Signal Processing Based on Multilinear Algebra. [Ph.D. Thesis, Katholieke Universiteit Leuven]."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1137\/07070111X","article-title":"Tensor decompositions and applications","volume":"51","author":"Kolda","year":"2009","journal-title":"SIAM Rev."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1109\/LSP.2017.2685461","article-title":"On the identification of bilinear forms with the Wiener filter","volume":"24","author":"Benesty","year":"2017","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.dsp.2018.01.010","article-title":"Adaptive filtering for the identification of bilinear forms","volume":"75","author":"Paleologu","year":"2018","journal-title":"Digit. Signal Process."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.dsp.2018.09.005","article-title":"Efficient recursive least-squares algorithms for the identification of bilinear forms","volume":"83","author":"Stanciu","year":"2018","journal-title":"Digit. Signal Process."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Dogariu, L.-M., Ciochin\u0103, S., Paleologu, C., and Benesty, J. (2018). A connection between the Kalman filter and an optimized LMS algorithm for bilinear forms. Algorithms, 11.","DOI":"10.3390\/a11120211"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Ribeiro, L.N., de Almeida, A.L.F., and Mota, J.C.M. (2015, January 13\u201316). Identification of separable systems using trilinear filtering. Proceedings of the 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), Cancun, Mexico.","DOI":"10.1109\/CAMSAP.2015.7383768"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Rupp, M., and Schwarz, S. (2015, January 19\u201324). A tensor LMS algorithm. Proceedings of the 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brisbane, QLD, Australia.","DOI":"10.1109\/ICASSP.2015.7178591"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Dogariu, L.-M., Ciochin\u0103, S., Benesty, J., and Paleologu, C. (2019, January 1\u20133). An iterative Wiener filter for the identification of trilinear forms. Proceedings of the 2019 42nd International Conference on Telecommunications and Signal Processing (TSP), Budapest, Hungary.","DOI":"10.1109\/TSP.2019.8768839"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Dogariu, L.-M., Ciochin\u0103, S., Benesty, J., and Paleologu, C. (2019). System identification based on tensor decompositions: A trilinear approach. Symmetry, 11.","DOI":"10.3390\/sym11040556"},{"key":"ref_18","unstructured":"Haykin, S. (2002). Adaptive Filter Theory, Prentice-Hall. [4th ed.]."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5786","DOI":"10.1007\/s00034-019-01156-4","article-title":"Single-channel signal separation using spectral basis correlation with sparse nonnegative tensor factorization","volume":"38","author":"Parathai","year":"2019","journal-title":"Circuits Syst. Signal Process."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.dsp.2018.07.018","article-title":"Reverberant signal separation using optimized complex sparse nonnegative tensor deconvolution on spectral covariance matrix","volume":"83","author":"Woo","year":"2018","journal-title":"Digit. Signal Process."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"8142","DOI":"10.1109\/TIE.2018.2801809","article-title":"Variational Bayes sub-group adaptive sparse component extraction for diagnostic imaging system","volume":"65","author":"Gao","year":"2018","journal-title":"IEEE Trans. Ind. Electron."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/1099-128X(200005\/06)14:3<105::AID-CEM582>3.0.CO;2-I","article-title":"Towards a standardized notation and terminology in multiway analysis","volume":"14","author":"Kiers","year":"2000","journal-title":"J. Chemom."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Kroonenberg, P. (2008). Applied Multiway Data Analysis, Wiley.","DOI":"10.1002\/9780470238004"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0377-0427(00)00393-9","article-title":"The ubiquitous Kronecker product","volume":"123","year":"2000","journal-title":"J. Comput. Appl. Math."},{"key":"ref_25","unstructured":"Bertsekas, D.P. (1999). Nonlinear Programming, Athena Scientific. [2nd ed.]."},{"key":"ref_26","unstructured":"(2002). Digital Network Echo Cancellers, ITU. ITU-T Recommendations G.168."},{"key":"ref_27","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_28","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/97.700920","article-title":"On the evaluation of estimated impulse responses","volume":"5","author":"Morgan","year":"1998","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Ciochin\u0103, S., Paleologu, C., Benesty, J., and Enescu, A.A. (2009, January 9\u201310). On the influence of the forgetting factor of the RLS adaptive filter in system identification. Proceedings of the 2009 International Symposium on Signals, Circuits and Systems, Iasi, Romania.","DOI":"10.1109\/ISSCS.2009.5206117"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1793","DOI":"10.1109\/TASLP.2018.2842146","article-title":"Linear system identification based on a Kronecker product decomposition","volume":"26","author":"Paleologu","year":"2018","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Elisei-Iliescu, C., Paleologu, C., Benesty, J., and Ciochin\u0103, S. (2019, January 12\u201317). A recursive least-squares algorithm based on the nearest Kronecker product decomposition. Proceedings of the ICASSP 2019\u20142019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brighton, UK.","DOI":"10.1109\/ICASSP.2019.8682498"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/TASLP.2019.2903276","article-title":"Recursive least-squares algorithms for the identification of low-rank systems","volume":"27","author":"Paleologu","year":"2019","journal-title":"IEEE\/ACM Trans. Audio Speech Lang. Process."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/LSP.2006.876323","article-title":"A non-parametric VSS NLMS algorithm","volume":"13","author":"Benesty","year":"2006","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1109\/LSP.2008.2001559","article-title":"A robust variable forgetting factor recursive least-squares algorithm for system identification","volume":"15","author":"Paleologu","year":"2008","journal-title":"IEEE Signal Process. Lett."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Jouppi, N.P., Young, C., Patil, N., Patterson, D., Agrawal, G., Bajwa, R., Bates, S., Bhatia, S., Boden, N., and Borchers, A. (2017, January 24\u201328). In-datacenter performance analysis of a tensor processing unit. Proceedings of the 44th Annual International Symposium on Computer Architecture, Toronto, ON, Canada.","DOI":"10.1145\/3079856.3080246"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/6\/135\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:34:31Z","timestamp":1760175271000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/6\/135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,1]]},"references-count":35,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2020,6]]}},"alternative-id":["a13060135"],"URL":"https:\/\/doi.org\/10.3390\/a13060135","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,6,1]]}}}