Tensor-Based Efficient Multi-Interferer RFI Excision Algorithms for SIMO Systems

被引:17
|
作者
Getu, Tilahun Melkamu [1 ,2 ]
Ajib, Wessam [2 ]
Yeste-Ojeda, Omar A. [1 ,3 ]
机构
[1] Ecole Technol Super, Montreal, PQ H3C 1K3, Canada
[2] Univ Quebec Montreal, Montreal, PQ H2L 2C4, Canada
[3] Natl Radio Astron Observ, Charlottesville, VA 22902 USA
关键词
RFI excision; multi-linear subspace estimation; multi-linear projection; joint enumeration; perturbation analysis; CHANNEL ORDER ESTIMATION; PERFORMANCE ANALYSIS; MITIGATION; TIME;
D O I
10.1109/TCOMM.2017.2694006
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Radio frequency interference (RFI) is causing performance loss in microwave radiometry, radio astronomy, and satellite communications. As the number of interferers increases, the performance loss gets more severe and RFI excision becomes more difficult. In this regard, this paper introduces the multi-linear algebra framework to the multi-interferer RFI (MI-RFI) excision research by proposing a multi-linear subspace estimation and projection (MLSEP) algorithm for single-input multiple-output (SIMO) systems suffering from MI-RFI. Having employed smoothed observation windows, a smoothed MLSEP (s-MLSEP) algorithm, which enhances MLSEP, is also proposed. MLSEP and s-MLSEP require the knowledge of the number of interferers and their respective channel order. Accordingly, a novel smoothed matrix-based joint number of interferers and channel order enumerator is proposed. Performance analyses corroborate that both MLSEP and s-MLSEP can excise all interferers when the perturbations get infinitesimally small. For such perturbations, the analyses also attest that s-MLSEP exhibit a faster convergence to a zero excision error than MLSEP which, in turn converges faster than a subspace projection algorithm. Despite its slight complexity, simulations and performance assessment on real-world data demonstrate that MLSEP outperforms projection-based RFI excision algorithms. Simulations also corroborate that s-MLSEP outperforms MLSEP as the smoothing factor gets smaller.
引用
收藏
页码:3037 / 3052
页数:16
相关论文
共 50 条
  • [21] Orthogonal multi-view tensor-based learning for clustering
    Ma, Shuangxun
    Liu, Yuehu
    Liu, Guangcan
    Zheng, Qinghai
    Zhang, Chi
    NEUROCOMPUTING, 2022, 500 : 592 - 603
  • [22] Multi-View Robust Tensor-Based Subspace Clustering
    Al-Sharoa, Esraa M.
    Al-Wardat, Mohammad A.
    IEEE ACCESS, 2022, 10 : 134292 - 134306
  • [23] Analytical Performance Assessment of Multi-Dimensional Matrix- and Tensor-Based ESPRIT-Type Algorithms
    Roemer, Florian
    Haardt, Martin
    Del Galdo, Giovanni
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (10) : 2611 - 2625
  • [24] Tensor-Based Approaches for Nonlinear and Multilinear Systems Modeling and Identification
    Favier, Gerard
    Kibangou, Alain
    ALGORITHMS, 2023, 16 (09)
  • [25] Tensor-Based Joint Channel Estimation for Multi-Way Massive MIMO Hybrid Relay Systems
    Du, Jianhe
    Ye, Siyu
    Jin, Libiao
    Li, Xingwang
    Ngo, Hien Quoc
    Dobre, Octavia A.
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2022, 71 (09) : 9571 - 9585
  • [26] Multi-property Tensor-Based Learning for Abnormal Event Detection
    Bakalos, Nikolaos
    Doulamis, Nikolaos
    Doulamis, Anastasios
    Makantasis, Konstantinos
    ADVANCES IN VISUAL COMPUTING, ISVC 2022, PT I, 2022, 13598 : 325 - 335
  • [27] Tensor-based consensus learning for incomplete multi-view clustering
    Mu, Jinshuai
    Song, Peng
    Yu, Yanwei
    Zheng, Wenming
    EXPERT SYSTEMS WITH APPLICATIONS, 2023, 234
  • [28] Tensor-Based Uniform and Discrete Multi-View Projection Clustering
    Ma, Linlin
    Li, Haomin
    Zang, Wenke
    Liu, Xincheng
    Sun, Minghe
    ELECTRONICS, 2025, 14 (04):
  • [29] Tensor-Based Optimal Temperature Control of CRACs in Multi-Datacenters
    Wang, Qingzhu
    Yu, Yonghao
    Li, Bin
    Zhu, Yihai
    IEEE ACCESS, 2019, 7 : 41445 - 41453
  • [30] Tensor-based restricted kernel machines for multi-view classification
    Houthuys, Lynn
    Suykens, Johan A. K.
    INFORMATION FUSION, 2021, 68 : 54 - 66