Efficient recursive least-squares algorithms for the identification of bilinear forms
•In this paper, we focus on the recursive least-squares algorithm for bilinear forms, i.e., RLS-BF.•The bilinear term is defined with respect to the impulse responses of a spatiotemporal model.•Low-complexity versions of the RLS-BF algorithm are proposed, based on the DCD method.•A robust variable-r...
Uložené v:
| Vydané v: | Digital signal processing Ročník 83; s. 280 - 296 |
|---|---|
| Hlavní autori: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Inc
01.12.2018
|
| Predmet: | |
| ISSN: | 1051-2004, 1095-4333 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | •In this paper, we focus on the recursive least-squares algorithm for bilinear forms, i.e., RLS-BF.•The bilinear term is defined with respect to the impulse responses of a spatiotemporal model.•Low-complexity versions of the RLS-BF algorithm are proposed, based on the DCD method.•A robust variable-regularized RLS-BF (VR-RLS-BF) algorithm is developed, using an estimate of the SNR.•Low-complexity versions of the VR-RLS-BF algorithm are derived, involving the DCD method.
Due to its fast convergence rate, the recursive least-squares (RLS) algorithm is very popular in many applications of adaptive filtering, including system identification scenarios. However, the computational complexity of this algorithm represents a major limitation in applications that involve long filters. Moreover, when the parameter space becomes large, the system identification problem is more challenging and the adaptive filters should be able to cope with this aspect. In this paper, we focus on the identification of bilinear forms, where the bilinear term is defined with respect to the impulse responses of a spatiotemporal model. From this perspective, the solution requires a multidimensional adaptive filtering technique. Recently, the RLS algorithm tailored for bilinear forms (namely RLS-BF) was developed for this purpose. In this framework, the contribution of this paper is mainly twofold. First, in order to reduce the computational complexity of the RLS-BF algorithm, two versions based on the dichotomous coordinate descent (DCD) method are proposed; due to its arithmetic features, the DCD algorithm represents one of the most attractive alternatives to solve the normal equations. However, in the bilinear context, we need to consider the particular structure of the input data and the additional related challenges. Second, in order to improve the robustness of the RLS-BF algorithm in noisy environments, a regularized version is developed, together with a method to find the regularization parameters, which are related to the signal-to-noise ratio (SNR). Furthermore, using a proper estimation of the SNR, a variable-regularized RLS-BF algorithm is designed and two DCD-based low-complexity versions are proposed. Due to their nature, these variable-regularized algorithms have good robustness features against additive noise, which make them behave well in different noisy condition scenarios. Simulation results indicate the good performance of the proposed low-complexity RLS-BF algorithms, with appealing features for practical implementations. |
|---|---|
| AbstractList | •In this paper, we focus on the recursive least-squares algorithm for bilinear forms, i.e., RLS-BF.•The bilinear term is defined with respect to the impulse responses of a spatiotemporal model.•Low-complexity versions of the RLS-BF algorithm are proposed, based on the DCD method.•A robust variable-regularized RLS-BF (VR-RLS-BF) algorithm is developed, using an estimate of the SNR.•Low-complexity versions of the VR-RLS-BF algorithm are derived, involving the DCD method.
Due to its fast convergence rate, the recursive least-squares (RLS) algorithm is very popular in many applications of adaptive filtering, including system identification scenarios. However, the computational complexity of this algorithm represents a major limitation in applications that involve long filters. Moreover, when the parameter space becomes large, the system identification problem is more challenging and the adaptive filters should be able to cope with this aspect. In this paper, we focus on the identification of bilinear forms, where the bilinear term is defined with respect to the impulse responses of a spatiotemporal model. From this perspective, the solution requires a multidimensional adaptive filtering technique. Recently, the RLS algorithm tailored for bilinear forms (namely RLS-BF) was developed for this purpose. In this framework, the contribution of this paper is mainly twofold. First, in order to reduce the computational complexity of the RLS-BF algorithm, two versions based on the dichotomous coordinate descent (DCD) method are proposed; due to its arithmetic features, the DCD algorithm represents one of the most attractive alternatives to solve the normal equations. However, in the bilinear context, we need to consider the particular structure of the input data and the additional related challenges. Second, in order to improve the robustness of the RLS-BF algorithm in noisy environments, a regularized version is developed, together with a method to find the regularization parameters, which are related to the signal-to-noise ratio (SNR). Furthermore, using a proper estimation of the SNR, a variable-regularized RLS-BF algorithm is designed and two DCD-based low-complexity versions are proposed. Due to their nature, these variable-regularized algorithms have good robustness features against additive noise, which make them behave well in different noisy condition scenarios. Simulation results indicate the good performance of the proposed low-complexity RLS-BF algorithms, with appealing features for practical implementations. |
| Author | Elisei-Iliescu, Camelia Stanciu, Cristian Ciochină, Silviu Paleologu, Constantin Benesty, Jacob Anghel, Cristian |
| Author_xml | – sequence: 1 givenname: Camelia surname: Elisei-Iliescu fullname: Elisei-Iliescu, Camelia email: camelia.elisei@romatsa.ro organization: University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071, Bucharest, Romania – sequence: 2 givenname: Cristian surname: Stanciu fullname: Stanciu, Cristian email: cristian@comm.pub.ro organization: University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071, Bucharest, Romania – sequence: 3 givenname: Constantin surname: Paleologu fullname: Paleologu, Constantin email: pale@comm.pub.ro organization: University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071, Bucharest, Romania – sequence: 4 givenname: Jacob surname: Benesty fullname: Benesty, Jacob email: benesty@emt.inrs.ca organization: INRS-EMT, University of Quebec, Montreal, QC, H5A 1K6, Canada – sequence: 5 givenname: Cristian surname: Anghel fullname: Anghel, Cristian email: canghel@comm.pub.ro organization: University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071, Bucharest, Romania – sequence: 6 givenname: Silviu surname: Ciochină fullname: Ciochină, Silviu email: silviu@comm.pub.ro organization: University Politehnica of Bucharest, 1-3, Iuliu Maniu Blvd., 061071, Bucharest, Romania |
| BookMark | eNp9kM9OwzAMhyM0JLbBA3DLC7Q4adou4oSm8UeaxIWdozR1WKauHUk2ibcnZZw47GTL9mfp983IpB96JOSeQc6AVQ-7vA2HnANb5CBzgPKKTBnIMhNFUUzGvmQZBxA3ZBbCDgBqwasp2aysdcZhH6lHc_TBnZB2qEPMwtdRewxUd5-Dd3G7D9QOnsYtUtcmwCVQRzf0dLC0cZ3rUfvxZB9uybXVXcC7vzonm-fVx_I1W7-_vC2f1pnhso5ZA4BVxYyQ7SJNrGxBVgUKaSxHUdtSgrEiLRClFpwXdWW5bMBiW4i2aYo5Yee_xg8heLTq4N1e-2_FQI1e1E4lL2r0okCq5CUx9T_GuPibI3rtuovk45nEFOnk0KswmjPYuuQuqnZwF-gf_XiBpg |
| CitedBy_id | crossref_primary_10_3390_math11040906 crossref_primary_10_3390_electronics10151790 crossref_primary_10_3390_electronics11020237 crossref_primary_10_1007_s13246_025_01631_0 crossref_primary_10_3390_pr7080546 crossref_primary_10_1016_j_dsp_2021_103359 crossref_primary_10_1016_j_sigpro_2018_12_010 crossref_primary_10_1002_rnc_5718 crossref_primary_10_3390_a13060135 crossref_primary_10_1049_iet_spr_2018_5115 crossref_primary_10_1016_j_bspc_2021_102830 crossref_primary_10_1016_j_bspc_2021_103427 crossref_primary_10_1007_s00034_023_02302_9 crossref_primary_10_3390_a11120211 crossref_primary_10_1016_j_dsp_2020_102825 crossref_primary_10_3390_sym13030481 crossref_primary_10_3390_s21103555 crossref_primary_10_3390_e26040316 crossref_primary_10_1109_TASLP_2019_2903276 |
| Cites_doi | 10.1049/iet-com.2016.1012 10.1109/LSP.2016.2570862 10.1016/j.dsp.2018.01.009 10.1016/S0165-1684(03)00044-6 10.1016/j.sigpro.2017.12.015 10.1109/97.700920 10.1109/TSP.2008.917874 10.1587/transfun.E94.A.1628 10.1109/TASL.2010.2097251 10.1109/ACCESS.2018.2794455 10.1109/LSP.2017.2685461 10.1109/TCSI.2009.2015725 10.1109/MSP.2014.2298533 10.1016/j.dsp.2006.04.005 10.1049/el:20040353 10.1109/TAC.2004.837592 10.1016/j.sigpro.2012.08.017 10.1109/TSP.2016.2617858 10.1016/S0377-0427(00)00393-9 10.1002/gamm.201310004 10.1016/j.dsp.2007.04.006 10.1016/j.dsp.2018.01.010 10.1016/S0165-1684(00)00085-2 10.1016/j.dsp.2016.09.001 10.1109/TSP.2013.2258340 10.1109/TASLP.2018.2842146 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier Inc. |
| Copyright_xml | – notice: 2018 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.dsp.2018.09.005 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1095-4333 |
| EndPage | 296 |
| ExternalDocumentID | 10_1016_j_dsp_2018_09_005 S1051200418307619 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 29G 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABJNI ABMAC ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K WUQ XPP ZMT ZU3 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c297t-b00e661c49d8c29f9d0963e49cf2e47f590cf429fee9a422376f29b0fed34dbb3 |
| ISICitedReferencesCount | 29 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000453637100025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1051-2004 |
| IngestDate | Sat Nov 29 07:10:15 EST 2025 Tue Nov 18 21:52:00 EST 2025 Fri Feb 23 02:45:25 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Variable regularization Adaptive filter System identification Recursive least-squares algorithm Bilinear forms Dichotomous coordinate descent |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-b00e661c49d8c29f9d0963e49cf2e47f590cf429fee9a422376f29b0fed34dbb3 |
| PageCount | 17 |
| ParticipantIDs | crossref_primary_10_1016_j_dsp_2018_09_005 crossref_citationtrail_10_1016_j_dsp_2018_09_005 elsevier_sciencedirect_doi_10_1016_j_dsp_2018_09_005 |
| PublicationCentury | 2000 |
| PublicationDate | December 2018 2018-12-00 |
| PublicationDateYYYYMMDD | 2018-12-01 |
| PublicationDate_xml | – month: 12 year: 2018 text: December 2018 |
| PublicationDecade | 2010 |
| PublicationTitle | Digital signal processing |
| PublicationYear | 2018 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Mahmood, Zidouri, Zerguine (br0040) May 2008; 18 Zakharov, White, Liu (br0060) July 2008; 56 Stanciu, Benesty, Paleologu, Gänsler, Ciochină (br0100) Feb. 2013; 93 Gesbert, Duhamel (br0200) 1996 Abrahamsson, Kay, Stoica (br0230) July 2007; 17 Haykin (br0010) 2002 Ribeiro, Schwarz, Rupp, de Almeida, Mota (br0280) 2017 Rupp, Schwarz (br0190) 2015 Paleologu, Benesty, Ciochină (br0480) Oct. 2018; 26 Zakharov, Nascimento (br0460) 2016 Bousse, Debals, De Lathauwer (br0270) Jan. 2017; 65 Rupp, Schwarz (br0180) 2015 Liu, Zhang, Sun (br0150) May 2017 Oyerinde (br0420) Apr. 2018; 75 Benesty, Paleologu, Ciochină (br0440) Aug. 2011; 19 Claser, Nascimento, Zakharov (br0130) 2016 Ribeiro, de Almeida, Mota (br0250) 2015 Zhang, Zakharov, Li (br0170) Jan. 2018; 6 Elisei-Iliescu, Paleologu, Benesty, Dobre, Ciochină (br0370) 2017 Albu (br0090) 2012 Elisei-Iliescu, Stanciu, Paleologu, Benesty, Anghel, Ciochină (br0140) 2017 Comon (br0240) May 2014; 31 Stenger, Kellermann, Rabenstein (br0210) 1999 da Silva, Comon, de Almeida (br0260) July 2016; 23 Zakharov, Tozer (br0050) Apr. 2004; 40 Paleologu, Benesty, Ciochină (br0360) Apr. 2018; 75 Kim, Lee, Chung, Lee (br0160) Jan. 2018; 65 Harville (br0380) 1997 Nishikawa, Ogawa, Albu (br0110) 2013 Hamidia, Amrouche (br0470) Jan. 2017; 60 Morgan, Benesty, Sondhi (br0390) July 1998; 5 Zakharov, Nascimento (br0120) June 2013; 61 da Costa, Favier, Romano (br0290) Apr. 2018; 145 Hansen (br0430) 1998 (br0020) 2003 Paleologu, Benesty, Ciochină (br0350) 2017 Sulyman, Zerguine (br0410) June 2003; 83 Benesty, Paleologu, Ciochină (br0330) May 2017; 24 Bai, Li (br0300) Nov. 2004; 49 Sayed (br0030) 2008 Liu, Zakharov, Weaver (br0070) Nov. 2009; 56 Stenger, Kellermann (br0220) Sept. 2000; 80 Benesty, Paleologu, Ciochină (br0450) Aug. 2011; 94-A Ciochină, Paleologu, Benesty (br0340) 2017 Grasedyck, Kressner, Tobler (br0320) Feb. 2013; 36 Stanciu, Paleologu, Benesty, Gänsler, Ciochină (br0080) 2012 Van Loan (br0310) 2000; 123 (10.1016/j.dsp.2018.09.005_br0020) 2003 Bousse (10.1016/j.dsp.2018.09.005_br0270) 2017; 65 Haykin (10.1016/j.dsp.2018.09.005_br0010) 2002 Hamidia (10.1016/j.dsp.2018.09.005_br0470) 2017; 60 Liu (10.1016/j.dsp.2018.09.005_br0070) 2009; 56 Stanciu (10.1016/j.dsp.2018.09.005_br0080) 2012 Elisei-Iliescu (10.1016/j.dsp.2018.09.005_br0140) 2017 Albu (10.1016/j.dsp.2018.09.005_br0090) 2012 Benesty (10.1016/j.dsp.2018.09.005_br0440) 2011; 19 Sayed (10.1016/j.dsp.2018.09.005_br0030) 2008 Liu (10.1016/j.dsp.2018.09.005_br0150) 2017 Morgan (10.1016/j.dsp.2018.09.005_br0390) 1998; 5 Mahmood (10.1016/j.dsp.2018.09.005_br0040) 2008; 18 da Silva (10.1016/j.dsp.2018.09.005_br0260) 2016; 23 Kim (10.1016/j.dsp.2018.09.005_br0160) 2018; 65 Nishikawa (10.1016/j.dsp.2018.09.005_br0110) 2013 Rupp (10.1016/j.dsp.2018.09.005_br0190) 2015 Stanciu (10.1016/j.dsp.2018.09.005_br0100) 2013; 93 da Costa (10.1016/j.dsp.2018.09.005_br0290) 2018; 145 Van Loan (10.1016/j.dsp.2018.09.005_br0310) 2000; 123 Paleologu (10.1016/j.dsp.2018.09.005_br0350) 2017 Gesbert (10.1016/j.dsp.2018.09.005_br0200) 1996 Bai (10.1016/j.dsp.2018.09.005_br0300) 2004; 49 Paleologu (10.1016/j.dsp.2018.09.005_br0480) 2018; 26 Rupp (10.1016/j.dsp.2018.09.005_br0180) 2015 Paleologu (10.1016/j.dsp.2018.09.005_br0360) 2018; 75 Zhang (10.1016/j.dsp.2018.09.005_br0170) 2018; 6 Grasedyck (10.1016/j.dsp.2018.09.005_br0320) 2013; 36 Hansen (10.1016/j.dsp.2018.09.005_br0430) 1998 Stenger (10.1016/j.dsp.2018.09.005_br0220) 2000; 80 Zakharov (10.1016/j.dsp.2018.09.005_br0060) 2008; 56 Ciochină (10.1016/j.dsp.2018.09.005_br0340) 2017 Zakharov (10.1016/j.dsp.2018.09.005_br0120) 2013; 61 Ribeiro (10.1016/j.dsp.2018.09.005_br0250) 2015 Benesty (10.1016/j.dsp.2018.09.005_br0330) 2017; 24 Ribeiro (10.1016/j.dsp.2018.09.005_br0280) 2017 Oyerinde (10.1016/j.dsp.2018.09.005_br0420) 2018; 75 Claser (10.1016/j.dsp.2018.09.005_br0130) 2016 Zakharov (10.1016/j.dsp.2018.09.005_br0460) 2016 Stenger (10.1016/j.dsp.2018.09.005_br0210) 1999 Benesty (10.1016/j.dsp.2018.09.005_br0450) 2011; 94-A Abrahamsson (10.1016/j.dsp.2018.09.005_br0230) 2007; 17 Comon (10.1016/j.dsp.2018.09.005_br0240) 2014; 31 Elisei-Iliescu (10.1016/j.dsp.2018.09.005_br0370) 2017 Harville (10.1016/j.dsp.2018.09.005_br0380) 1997 Sulyman (10.1016/j.dsp.2018.09.005_br0410) 2003; 83 Zakharov (10.1016/j.dsp.2018.09.005_br0050) 2004; 40 |
| References_xml | – volume: 75 start-page: 153 year: Apr. 2018 end-page: 167 ident: br0360 article-title: Adaptive filtering for the identification of bilinear forms publication-title: Digit. Signal Process. – volume: 56 start-page: 2425 year: Nov. 2009 end-page: 2438 ident: br0070 article-title: Architecture and FPGA design of dichotomous coordinate descent algorithms publication-title: IEEE Trans. Circuits Syst. I, Regul. Pap. – volume: 75 start-page: 168 year: Apr. 2018 end-page: 183 ident: br0420 article-title: An overview of channel estimation schemes based on regularized adaptive algorithms for OFDM-IDMA systems publication-title: Digit. Signal Process. – start-page: 2486 year: 2015 end-page: 2490 ident: br0190 article-title: Gradient-based approaches to learn tensor products publication-title: Proc. EUSIPCO – volume: 26 start-page: 1793 year: Oct. 2018 end-page: 1808 ident: br0480 article-title: Linear system identification based on a Kronecker product decomposition publication-title: IEEE/ACM Trans. Audio Speech Lang. Process. – year: 2013 ident: br0110 article-title: Fixed order implementation of kernel RLS-DCD adaptive filters publication-title: Proc. IEEE APSIPA – year: 2003 ident: br0020 publication-title: Adaptive Signal Processing–Applications to Real-World Problems – volume: 5 start-page: 174 year: July 1998 end-page: 176 ident: br0390 article-title: On the evaluation of estimated impulse responses publication-title: IEEE Signal Process. Lett. – volume: 19 start-page: 1734 year: Aug. 2011 end-page: 1742 ident: br0440 article-title: On regularization in adaptive filtering publication-title: IEEE Trans. Audio Speech Lang. Process. – year: 2002 ident: br0010 article-title: Adaptive Filter Theory – start-page: 6 year: 2016 end-page: 10 ident: br0130 article-title: A low-complexity RLS-DCD algorithm for Volterra system identification publication-title: Proc. EUSIPCO – volume: 65 start-page: 61 year: Jan. 2018 end-page: 65 ident: br0160 article-title: A delay relaxed RLS-DCD algorithm for real-time implementation publication-title: IEEE Trans. Circuits Syst. II, Express Briefs – volume: 23 start-page: 959 year: July 2016 end-page: 963 ident: br0260 article-title: A finite algorithm to compute rank-1 tensor approximations publication-title: IEEE Signal Process. Lett. – start-page: 145 year: 2016 end-page: 149 ident: br0460 article-title: Sparse sliding-window RLS adaptive filter with dynamic regularization publication-title: Proc. EUSIPCO – volume: 56 start-page: 3150 year: July 2008 end-page: 3161 ident: br0060 article-title: Low-complexity RLS algorithms using dichotomous coordinate descent iterations publication-title: IEEE Trans. Signal Process. – volume: 17 start-page: 756 year: July 2007 end-page: 773 ident: br0230 article-title: Estimation of the parameters of a bilinear model with applications to submarine detection and system identification publication-title: Digit. Signal Process. – start-page: 1 year: 2012 end-page: 4 ident: br0090 article-title: Leading element dichotomous coordinate descent exponential recursive least squares algorithm for multichannel active noise control publication-title: Proc. AAS Acoustics – start-page: 189 year: 2015 end-page: 192 ident: br0250 article-title: Identification of separable systems using trilinear filtering publication-title: Proc. IEEE CAMSAP – year: 1997 ident: br0380 article-title: Matrix Algebra from a Statistician's Perspective – volume: 93 start-page: 511 year: Feb. 2013 end-page: 516 ident: br0100 article-title: A widely linear model for stereophonic acoustic echo cancellation publication-title: Signal Process. – volume: 65 start-page: 346 year: Jan. 2017 end-page: 358 ident: br0270 article-title: A tensor-based method for large-scale blind source separation using segmentation publication-title: IEEE Trans. Signal Process. – volume: 83 start-page: 1255 year: June 2003 end-page: 1273 ident: br0410 article-title: Convergence and steady-state analysis of a variable step-size NLMS algorithm publication-title: Signal Process. – volume: 18 start-page: 307 year: May 2008 end-page: 320 ident: br0040 article-title: Performance analysis of a RLS-based MLP-DFE in time-invariant and time-varying channels publication-title: Digit. Signal Process. – year: 1999 ident: br0210 article-title: Adaptation of acoustic echo cancellers incorporating a memoryless nonlinearity publication-title: Proc. IEEE IWAENC – year: 2012 ident: br0080 article-title: An efficient RLS algorithm for stereophonic acoustic echo cancellation with the widely linear model publication-title: Proc. Inter-Noise – volume: 24 start-page: 653 year: May 2017 end-page: 657 ident: br0330 article-title: On the identification of bilinear forms with the Wiener filter publication-title: IEEE Signal Process. Lett. – start-page: 615 year: May 2017 end-page: 621 ident: br0150 article-title: VFF publication-title: IET Commun. – volume: 6 start-page: 4955 year: Jan. 2018 end-page: 4973 ident: br0170 article-title: Soft-decision-driven sparse channel estimation and turbo equalization for MIMO underwater acoustic communications publication-title: IEEE Access – volume: 36 start-page: 53 year: Feb. 2013 end-page: 78 ident: br0320 article-title: A literature survey of low-rank tensor approximation techniques publication-title: GAMM-Mitt. – year: 2017 ident: br0340 article-title: Analysis of an LMS algorithm for bilinear forms publication-title: Proc. IEEE DSP – start-page: 3347 year: 2015 end-page: 3351 ident: br0180 article-title: A tensor LMS algorithm publication-title: Proc. IEEE ICASSP – volume: 31 start-page: 44 year: May 2014 end-page: 53 ident: br0240 article-title: Tensors: a brief introduction publication-title: IEEE Signal Process. Mag. – volume: 60 start-page: 99 year: Jan. 2017 end-page: 112 ident: br0470 article-title: A new robust double-talk detector based on the Stockwell transform for acoustic echo cancellation publication-title: Digit. Signal Process. – volume: 94-A start-page: 1628 year: Aug. 2011 end-page: 1629 ident: br0450 article-title: Regularization of the RLS algorithm publication-title: IEICE Trans. Fundam. Electron. – volume: 61 start-page: 3198 year: June 2013 end-page: 3213 ident: br0120 article-title: DCD-RLS adaptive filters with penalties for sparse identification publication-title: IEEE Trans. Signal Process. – year: 2017 ident: br0370 article-title: An RLS algorithm for the identification of bilinear forms publication-title: Proc. IEEE SIITME – year: 2008 ident: br0030 article-title: Adaptive Filters – start-page: 168 year: 1996 end-page: 171 ident: br0200 article-title: Robust blind joint data/channel estimation based on bilinear optimization publication-title: Proc. IEEE WSSAP – start-page: 171 year: 2017 end-page: 175 ident: br0140 article-title: Robust variable regularized RLS algorithms publication-title: Proc. IEEE HSCMA – volume: 145 start-page: 304 year: Apr. 2018 end-page: 316 ident: br0290 article-title: Tensor modelling of MIMO communication systems with performance analysis and Kronecker receivers publication-title: Signal Process. – volume: 80 start-page: 1747 year: Sept. 2000 end-page: 1760 ident: br0220 article-title: Adaptation of a memoryless preprocessor for nonlinear acoustic echo cancelling publication-title: Signal Process. – volume: 40 start-page: 567 year: Apr. 2004 end-page: 569 ident: br0050 article-title: Multiplication-free iterative algorithm for LS problem publication-title: IEEE Electron. Lett. – start-page: 2689 year: 2017 end-page: 2693 ident: br0350 article-title: An NLMS algorithm for the identification of bilinear forms publication-title: Proc. EUSIPCO – year: 1998 ident: br0430 article-title: Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion – volume: 123 start-page: 85 year: 2000 end-page: 100 ident: br0310 article-title: The ubiquitous Kronecker product publication-title: J. Comput. Appl. Math. – volume: 49 start-page: 1929 year: Nov. 2004 end-page: 1940 ident: br0300 article-title: Convergence of the iterative Hammerstein system identification algorithm publication-title: IEEE Trans. Autom. Control – start-page: 2522 year: 2017 end-page: 2526 ident: br0280 article-title: A low-complexity equalizer for massive MIMO systems based on array separability publication-title: Proc. EUSIPCO – year: 2002 ident: 10.1016/j.dsp.2018.09.005_br0010 – start-page: 615 year: 2017 ident: 10.1016/j.dsp.2018.09.005_br0150 article-title: VFF ℓ1-norm penalised WL-RLS algorithm using DCD iterations for underwater acoustic communication publication-title: IET Commun. doi: 10.1049/iet-com.2016.1012 – volume: 23 start-page: 959 year: 2016 ident: 10.1016/j.dsp.2018.09.005_br0260 article-title: A finite algorithm to compute rank-1 tensor approximations publication-title: IEEE Signal Process. Lett. doi: 10.1109/LSP.2016.2570862 – year: 2017 ident: 10.1016/j.dsp.2018.09.005_br0340 article-title: Analysis of an LMS algorithm for bilinear forms – year: 1999 ident: 10.1016/j.dsp.2018.09.005_br0210 article-title: Adaptation of acoustic echo cancellers incorporating a memoryless nonlinearity – volume: 75 start-page: 168 year: 2018 ident: 10.1016/j.dsp.2018.09.005_br0420 article-title: An overview of channel estimation schemes based on regularized adaptive algorithms for OFDM-IDMA systems publication-title: Digit. Signal Process. doi: 10.1016/j.dsp.2018.01.009 – volume: 83 start-page: 1255 year: 2003 ident: 10.1016/j.dsp.2018.09.005_br0410 article-title: Convergence and steady-state analysis of a variable step-size NLMS algorithm publication-title: Signal Process. doi: 10.1016/S0165-1684(03)00044-6 – start-page: 171 year: 2017 ident: 10.1016/j.dsp.2018.09.005_br0140 article-title: Robust variable regularized RLS algorithms – volume: 145 start-page: 304 year: 2018 ident: 10.1016/j.dsp.2018.09.005_br0290 article-title: Tensor modelling of MIMO communication systems with performance analysis and Kronecker receivers publication-title: Signal Process. doi: 10.1016/j.sigpro.2017.12.015 – start-page: 2689 year: 2017 ident: 10.1016/j.dsp.2018.09.005_br0350 article-title: An NLMS algorithm for the identification of bilinear forms – volume: 5 start-page: 174 year: 1998 ident: 10.1016/j.dsp.2018.09.005_br0390 article-title: On the evaluation of estimated impulse responses publication-title: IEEE Signal Process. Lett. doi: 10.1109/97.700920 – volume: 56 start-page: 3150 year: 2008 ident: 10.1016/j.dsp.2018.09.005_br0060 article-title: Low-complexity RLS algorithms using dichotomous coordinate descent iterations publication-title: IEEE Trans. Signal Process. doi: 10.1109/TSP.2008.917874 – volume: 94-A start-page: 1628 year: 2011 ident: 10.1016/j.dsp.2018.09.005_br0450 article-title: Regularization of the RLS algorithm publication-title: IEICE Trans. Fundam. Electron. doi: 10.1587/transfun.E94.A.1628 – volume: 19 start-page: 1734 year: 2011 ident: 10.1016/j.dsp.2018.09.005_br0440 article-title: On regularization in adaptive filtering publication-title: IEEE Trans. Audio Speech Lang. Process. doi: 10.1109/TASL.2010.2097251 – start-page: 168 year: 1996 ident: 10.1016/j.dsp.2018.09.005_br0200 article-title: Robust blind joint data/channel estimation based on bilinear optimization – start-page: 3347 year: 2015 ident: 10.1016/j.dsp.2018.09.005_br0180 article-title: A tensor LMS algorithm – volume: 6 start-page: 4955 year: 2018 ident: 10.1016/j.dsp.2018.09.005_br0170 article-title: Soft-decision-driven sparse channel estimation and turbo equalization for MIMO underwater acoustic communications publication-title: IEEE Access doi: 10.1109/ACCESS.2018.2794455 – volume: 24 start-page: 653 year: 2017 ident: 10.1016/j.dsp.2018.09.005_br0330 article-title: On the identification of bilinear forms with the Wiener filter publication-title: IEEE Signal Process. Lett. doi: 10.1109/LSP.2017.2685461 – volume: 56 start-page: 2425 year: 2009 ident: 10.1016/j.dsp.2018.09.005_br0070 article-title: Architecture and FPGA design of dichotomous coordinate descent algorithms publication-title: IEEE Trans. Circuits Syst. I, Regul. Pap. doi: 10.1109/TCSI.2009.2015725 – year: 1998 ident: 10.1016/j.dsp.2018.09.005_br0430 – start-page: 145 year: 2016 ident: 10.1016/j.dsp.2018.09.005_br0460 article-title: Sparse sliding-window RLS adaptive filter with dynamic regularization – volume: 31 start-page: 44 year: 2014 ident: 10.1016/j.dsp.2018.09.005_br0240 article-title: Tensors: a brief introduction publication-title: IEEE Signal Process. Mag. doi: 10.1109/MSP.2014.2298533 – start-page: 1 year: 2012 ident: 10.1016/j.dsp.2018.09.005_br0090 article-title: Leading element dichotomous coordinate descent exponential recursive least squares algorithm for multichannel active noise control – volume: 17 start-page: 756 year: 2007 ident: 10.1016/j.dsp.2018.09.005_br0230 article-title: Estimation of the parameters of a bilinear model with applications to submarine detection and system identification publication-title: Digit. Signal Process. doi: 10.1016/j.dsp.2006.04.005 – year: 2013 ident: 10.1016/j.dsp.2018.09.005_br0110 article-title: Fixed order implementation of kernel RLS-DCD adaptive filters – volume: 40 start-page: 567 year: 2004 ident: 10.1016/j.dsp.2018.09.005_br0050 article-title: Multiplication-free iterative algorithm for LS problem publication-title: IEEE Electron. Lett. doi: 10.1049/el:20040353 – start-page: 2486 year: 2015 ident: 10.1016/j.dsp.2018.09.005_br0190 article-title: Gradient-based approaches to learn tensor products – volume: 49 start-page: 1929 year: 2004 ident: 10.1016/j.dsp.2018.09.005_br0300 article-title: Convergence of the iterative Hammerstein system identification algorithm publication-title: IEEE Trans. Autom. Control doi: 10.1109/TAC.2004.837592 – year: 1997 ident: 10.1016/j.dsp.2018.09.005_br0380 – volume: 65 start-page: 61 year: 2018 ident: 10.1016/j.dsp.2018.09.005_br0160 article-title: A delay relaxed RLS-DCD algorithm for real-time implementation publication-title: IEEE Trans. Circuits Syst. II, Express Briefs – year: 2012 ident: 10.1016/j.dsp.2018.09.005_br0080 article-title: An efficient RLS algorithm for stereophonic acoustic echo cancellation with the widely linear model – start-page: 6 year: 2016 ident: 10.1016/j.dsp.2018.09.005_br0130 article-title: A low-complexity RLS-DCD algorithm for Volterra system identification – volume: 93 start-page: 511 year: 2013 ident: 10.1016/j.dsp.2018.09.005_br0100 article-title: A widely linear model for stereophonic acoustic echo cancellation publication-title: Signal Process. doi: 10.1016/j.sigpro.2012.08.017 – volume: 65 start-page: 346 year: 2017 ident: 10.1016/j.dsp.2018.09.005_br0270 article-title: A tensor-based method for large-scale blind source separation using segmentation publication-title: IEEE Trans. Signal Process. doi: 10.1109/TSP.2016.2617858 – year: 2003 ident: 10.1016/j.dsp.2018.09.005_br0020 – year: 2008 ident: 10.1016/j.dsp.2018.09.005_br0030 – volume: 123 start-page: 85 year: 2000 ident: 10.1016/j.dsp.2018.09.005_br0310 article-title: The ubiquitous Kronecker product publication-title: J. Comput. Appl. Math. doi: 10.1016/S0377-0427(00)00393-9 – start-page: 189 year: 2015 ident: 10.1016/j.dsp.2018.09.005_br0250 article-title: Identification of separable systems using trilinear filtering – start-page: 2522 year: 2017 ident: 10.1016/j.dsp.2018.09.005_br0280 article-title: A low-complexity equalizer for massive MIMO systems based on array separability – volume: 36 start-page: 53 year: 2013 ident: 10.1016/j.dsp.2018.09.005_br0320 article-title: A literature survey of low-rank tensor approximation techniques publication-title: GAMM-Mitt. doi: 10.1002/gamm.201310004 – volume: 18 start-page: 307 year: 2008 ident: 10.1016/j.dsp.2018.09.005_br0040 article-title: Performance analysis of a RLS-based MLP-DFE in time-invariant and time-varying channels publication-title: Digit. Signal Process. doi: 10.1016/j.dsp.2007.04.006 – volume: 75 start-page: 153 year: 2018 ident: 10.1016/j.dsp.2018.09.005_br0360 article-title: Adaptive filtering for the identification of bilinear forms publication-title: Digit. Signal Process. doi: 10.1016/j.dsp.2018.01.010 – volume: 80 start-page: 1747 year: 2000 ident: 10.1016/j.dsp.2018.09.005_br0220 article-title: Adaptation of a memoryless preprocessor for nonlinear acoustic echo cancelling publication-title: Signal Process. doi: 10.1016/S0165-1684(00)00085-2 – volume: 60 start-page: 99 year: 2017 ident: 10.1016/j.dsp.2018.09.005_br0470 article-title: A new robust double-talk detector based on the Stockwell transform for acoustic echo cancellation publication-title: Digit. Signal Process. doi: 10.1016/j.dsp.2016.09.001 – year: 2017 ident: 10.1016/j.dsp.2018.09.005_br0370 article-title: An RLS algorithm for the identification of bilinear forms – volume: 61 start-page: 3198 year: 2013 ident: 10.1016/j.dsp.2018.09.005_br0120 article-title: DCD-RLS adaptive filters with penalties for sparse identification publication-title: IEEE Trans. Signal Process. doi: 10.1109/TSP.2013.2258340 – volume: 26 start-page: 1793 year: 2018 ident: 10.1016/j.dsp.2018.09.005_br0480 article-title: Linear system identification based on a Kronecker product decomposition publication-title: IEEE/ACM Trans. Audio Speech Lang. Process. doi: 10.1109/TASLP.2018.2842146 |
| SSID | ssj0007426 |
| Score | 2.3317559 |
| Snippet | •In this paper, we focus on the recursive least-squares algorithm for bilinear forms, i.e., RLS-BF.•The bilinear term is defined with respect to the impulse... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 280 |
| SubjectTerms | Adaptive filter Bilinear forms Dichotomous coordinate descent Recursive least-squares algorithm System identification Variable regularization |
| Title | Efficient recursive least-squares algorithms for the identification of bilinear forms |
| URI | https://dx.doi.org/10.1016/j.dsp.2018.09.005 |
| Volume | 83 |
| WOSCitedRecordID | wos000453637100025&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect database customDbUrl: eissn: 1095-4333 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007426 issn: 1051-2004 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWlgMcEE9RXvKBE1VQHs7GPlawiPZQIdFKe4scxy6p0mzZ7Fb9L_xZZmzHmy0PARKXaOWsd62ZTzOf7XkQ8jqXbMrTTEa1TKcR4zKOuOIiUsnU4AZDc17ZZhPF8TGfz8WnyeTbkAtz1RZdx6-vxeV_VTWMgbIxdfYv1B1-FAbgMygdnqB2eP6R4me2KARe8S_xLN2Gp7fYoSfqv64x22hftmeLZbP64moxWOrZ1D5qKDBIDJrtsMoPstp-zGHfN2fYaWQfQz8wj8ulGgwu0MaBNL1uokOgt71au7CSC902wQNg62LVuDfeyGyuslrba9i9dOR1qA5u04nANLs-Bkdgy6vxoUXCbwSAhGyarWBPoHqJU6X1TX5M5JjVlY0tNs_GJtd1gvLeO3X9cX9wDO6M4vxt3WOR0oTb4rZxvvGCITbxMy4DVwHGzh7y3CK7aZELMJm7B4ez-VFw9AWz3fzCsodLcxs-eOOPfk57RlTm5D655_cg9MBh5wGZ6O4huTuqTPmInAYU0YAiuoUiukERBYhQQBHdRhFdGDqgiFoUPSanH2Yn7z5GvgNHpFJRrLA7kwYCp5ioOYwYUcOON9NMKJNqVphcxMoAozFaC8lSjLAyqahio-uM1VWVPSE73aLTTwmNaw3slMupEoaB5CrNY6m1qmRSA8nkeyQeBFQqX54eu6S05RCHeF6CTEuUaRmLEmS6R96EKZeuNsvvvswGqZeeXDrSWAJEfj3t2b9Ne07ubGD_guyslmv9ktxWV6umX77yQPoOBReiWw |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+recursive+least-squares+algorithms+for+the+identification+of+bilinear+forms&rft.jtitle=Digital+signal+processing&rft.au=Elisei-Iliescu%2C+Camelia&rft.au=Stanciu%2C+Cristian&rft.au=Paleologu%2C+Constantin&rft.au=Benesty%2C+Jacob&rft.date=2018-12-01&rft.pub=Elsevier+Inc&rft.issn=1051-2004&rft.eissn=1095-4333&rft.volume=83&rft.spage=280&rft.epage=296&rft_id=info:doi/10.1016%2Fj.dsp.2018.09.005&rft.externalDocID=S1051200418307619 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1051-2004&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1051-2004&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1051-2004&client=summon |