A Kronecker product CLMS algorithm for adaptive beamforming

被引:21
|
作者
Kuhn, Eduardo Vinicius [1 ]
Pitz, Ciro Andre [2 ]
Matsuo, Marcos Vinicius [2 ]
Bakri, Khaled Jamal [3 ]
Seara, Rui [3 ]
Benesty, Jacob [4 ]
机构
[1] Univ Tecnol Fed Parana, Dept Elect Engn, LAPSE Elect & Signal Proc Lab, BR-85902490 Toledo, Parana, Brazil
[2] Univ Fed Santa Catarina, Dept Control Automat & Computat Engn, GEPS Elect Signal Proc Grp, BR-89036004 Blumenau, SC, Brazil
[3] Univ Fed Santa Catarina, Dept Elect & Elect Engn, LINSE Circuits & Signal Proc Lab, BR-88040900 Florianopolis, SC, Brazil
[4] Univ Quebec, Energy Mat & Telecommun Res Ctr, INRS EMT Natl Inst Sci Res, Montreal, PQ H5A 1K6, Canada
关键词
Adaptive beamforming; Antenna arrays; CLMS algorithm; Kronecker product; Mobile communications;
D O I
10.1016/j.dsp.2021.102968
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, an adaptive algorithm is derived by considering that the beamforming vector can be decomposed as a Kronecker product of two smaller vectors. Such a decomposition leads to a joint optimization problem, which is then solved by using an alternating optimization strategy along with the steepest-descent method. The resulting algorithm, termed here Kronecker product constrained least-mean-square (KCLMS) algorithm, exhibits (in comparison to the well-known CLMS) improved convergence speed and reduced computational complexity; especially, for arrays with a large number of antennas. Simulation results are shown aiming to confirm the robustness of the proposed algorithm under different operating conditions. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页数:8
相关论文
共 50 条
  • [21] A Kronecker product improvement to PCA for space time adaptive processing
    Ritcey, JA
    Chindapol, A
    CONFERENCE RECORD OF THE THIRTY-FOURTH ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2000, : 651 - 655
  • [22] RACNN algorithm for robust adaptive beamforming
    Liu, Fulai
    Feng, Liwen
    Qin, Hao
    Li, Long
    Gao, Yajie
    Du, Ruiyan
    WIRELESS NETWORKS, 2025, 31 (03) : 2215 - 2225
  • [23] An Approximate Algorithm for Robust Adaptive Beamforming
    Tomoaki Yoshida
    Youji Iiguni
    EURASIP Journal on Advances in Signal Processing, 2004
  • [24] An approximate algorithm for robust adaptive beamforming
    Yoshida, T
    Iiguni, Y
    EURASIP JOURNAL ON APPLIED SIGNAL PROCESSING, 2004, 2004 (17) : 2675 - 2683
  • [25] An approximate algorithm for robust adaptive beamforming
    Yoshida, T. (tomoaki@ansl.ntt.co.jp), 1600, Hindawi Publishing Corporation (2004):
  • [26] A STRUCTURED GRADIENT ALGORITHM FOR ADAPTIVE BEAMFORMING
    GODARA, LC
    GRAY, DA
    JOURNAL OF THE ACOUSTICAL SOCIETY OF AMERICA, 1989, 86 (03): : 1040 - 1046
  • [27] RLMS Algorithm for Fixed or Adaptive Beamforming
    Srar, Jalal Abdulsayed
    Chung, Kah-Seng
    2009 IEEE 9TH MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS (MICC), 2009, : 163 - 167
  • [28] Kronecker Product Approximation with Multiple Factor Matrices via the Tensor Product Algorithm
    Wu, King Keung
    Yam, Yeung
    Meng, Helen
    Mesbahi, Mehran
    2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2016, : 4277 - 4282
  • [29] An adaptive-adaptive beamforming algorithm with nulls widening
    Li, Rongfeng
    Zhao, Shifeng
    Dai, Lingyan
    Proceedings of the 2009 2nd International Congress on Image and Signal Processing, CISP'09, 2009,
  • [30] An Adaptive-Adaptive Beamforming Algorithm with Nulls Widening
    Li Rongfeng
    Zhao Shifeng
    Dai Lingyan
    PROCEEDINGS OF THE 2009 2ND INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING, VOLS 1-9, 2009, : 4061 - 4065