Large-Scale Sparse Antenna Array Optimization for RCS Reduction With an AM-FCSN

被引:0
|
作者
Ji, Lixia [1 ]
Ren, Zhigang [2 ]
Chen, Yiqiao [2 ]
Zeng, Hao [1 ]
机构
[1] Chongqing Univ, Sch Microelect & Commun Engn, Chongqing 400044, Peoples R China
[2] Southwest Inst Elect Technol, Chengdu 610036, Peoples R China
关键词
Fully convolutional shortcut network based on an attention mechanism (AM-FCSN); hybrid-interval particle swarm optimization (HIPSO); large-scale sparse antenna array; radar cross section (RCS); DOA ESTIMATION; PHASED-ARRAYS; RADAR; DESIGN; ENHANCEMENT; LSTM;
D O I
10.1109/JSEN.2024.3516038
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The existing deep learning methods for radar cross section (RCS) reduction are unsuitable for large-scale sparse arrays because their large scales result in large numbers of classes and high network complexity levels. This article proposes a new deep learning method to solve these problems. First, a hybrid-interval particle swarm optimization (HIPSO) algorithm is presented. The number of classes is reduced using the presented HIPSO algorithm, which adaptively adjusts the sampling interval. Then, a fully convolutional shortcut network based on an attention mechanism (AM-FCSN) is designed. The optimal spatial arrangement is selected by the designed AM-FCSN. Finally, simulations show that the proposed HIPSO algorithm reduces the number of classes from O(10(4)) to O(10(2)). Moreover, compared with different neural networks, the proposed AM-FCSN achieves computational complexity and parameter complexity reductions of 38.46% and 80.2%, respectively, while attaining higher accuracy. The proposed method can effectively reduce the large-scale sparse array RCS in real time.
引用
收藏
页码:5782 / 5794
页数:13
相关论文
共 50 条
  • [31] RCS reduction of Vivaldi antenna array using a PSS boundary
    Zhang, Guoquan
    Xu, Liming
    Chen, Aixin
    ISAPE 2008: THE 8TH INTERNATIONAL SYMPOSIUM ON ANTENNAS, PROPAGATION AND EM THEORY, PROCEEDINGS, VOLS 1-3, 2008, : 345 - 347
  • [32] Application of artificial magnetic conductor in RCS reduction of array antenna
    Liuchen
    Tengfei
    Wuhuifeng
    2018 INTERNATIONAL CONFERENCE ON MICROWAVE AND MILLIMETER WAVE TECHNOLOGY (ICMMT2018), 2018,
  • [33] Sidelobe reduction of large-scale antenna array for 5G beamforming via hierarchical cuckoo search
    Sun, Geng
    Liu, Yanheng
    Li, Jionghui
    Zhang, Ying
    Wang, Aimin
    ELECTRONICS LETTERS, 2017, 53 (16) : 1158 - 1159
  • [34] Sparse Sensor Array Based Damage Monitoring and Assessment for Large-scale Structures
    Qiu, Wen
    Bao, Cheng
    Bao, Qiao
    Hu, Weiwei
    Wang, Qiang
    2021 PROCEEDINGS OF THE 40TH CHINESE CONTROL CONFERENCE (CCC), 2021, : 4380 - 4384
  • [35] Optimization of large-scale truss structures using sparse SAND formulations
    Wang, Qian
    Arora, Jasbir S.
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2007, 69 (02) : 390 - 407
  • [36] Improved Evolutionary Operators for Sparse Large-Scale Multiobjective Optimization Problems
    Kropp, Ian
    Nejadhashemi, A. Pouyan
    Deb, Kalyanmoy
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2024, 28 (02) : 460 - 473
  • [37] Large-Scale Spectrum Allocation for Cellular Networks via Sparse Optimization
    Zhuang, Binnan
    Guo, Dongning
    Wei, Ermin
    Honig, Michael L.
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2018, 66 (20) : 5470 - 5483
  • [38] An efficient sparse approach to sensitivity generation for large-scale dynamic optimization
    Barz, Tilman
    Kuntsche, Stefan
    Wozny, Guenter
    Arellano-Garcia, Harvey
    COMPUTERS & CHEMICAL ENGINEERING, 2011, 35 (10) : 2053 - 2065
  • [39] Sparse Large-Scale Multiobjective Optimization by Identifying Nonzero Decision Variables
    Wang, Xiangyu
    Cheng, Ran
    Jin, Yaochu
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2024, 54 (10): : 6280 - 6292
  • [40] Large-Scale Optimization Algorithms for Sparse Conditional Gaussian Graphical Models
    McCarter, Calvin
    Kim, Seyoung
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 51, 2016, 51 : 529 - 537