Optimal MIMO Sparse Array Design Based on Simulated Annealing Particle Swarm Optimization

被引:0
|
作者
He, Xiaoyuan [1 ]
Alistarh, Cristian [1 ]
Podilchak, Symon K. [1 ]
机构
[1] Univ Edinburgh, Inst Digital Commun IDCOM, Edinburgh, Midlothian, Scotland
关键词
Sparse array; multiple-input multiple-output array design; simulated annealing-particle swarm optimization; peak side lobe level; main lobe half-power 3dB beamwidth; RADAR;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Compared to conventional uniformly spaced arrays, sparse arrays are effective and economical for many application scenarios. For example, sparse arrays can lower the peak sidelobe level (PSLL) or narrow the main lobe half-power 3dB beamwidth (3dB BW) of the array pattern with fewer elements. This can help to save on the number of antennas, and the supporting hardware costs, as well as improve the angular resolution which is useful for automotive radar systems and target identification applications. Furthermore, when fewer elements are employed, as in sparse arrays, the spacing between the elements can become larger, which can lead to a reduction in the mutual coupling. This paper will focus on implementing a hybrid approach to numerically determine an optimal 4x4 multiple-input multiple-output (MIMO) array considering simulated annealing and particle swarm optimization (SA-PSO). Results will show that the technique can achieve lower PSLL or narrower 3dB BW with 8 fewer elements when compared to a corresponding 16 element uniform linear array (ULA). To the best knowledge of the authors, this is the first time that such comparisons and design techniques have been applied to sparse MIMO arrays whilst considering a hybrid SA-PSO synthesis algorithm.
引用
收藏
页数:5
相关论文
共 50 条
  • [41] Simulated Annealing Particle Swarm Optimization for High-Efficiency Power Amplifier Design
    Li, Chuan
    You, Fei
    Yao, Tingting
    Wang, Jinchen
    Shi, Wen
    Peng, Jun
    He, Songbai
    [J]. IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES, 2021, 69 (05) : 2494 - 2505
  • [42] Optimal Location of FACTS Devices Using Adaptive Particle Swarm Optimization Hybrid with Simulated Annealing
    Ajami, Ali
    Aghajani, Gh
    Pourmahmood, M.
    [J]. JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY, 2010, 5 (02) : 179 - 190
  • [43] Hybridizing particle swarm optimization with simulated annealing and differential evolution
    Mirsadeghi, Emad
    Khodayifar, Salman
    [J]. Cluster Computing, 2021, 24 (02): : 1135 - 1163
  • [44] Hybridizing particle swarm optimization with simulated annealing and differential evolution
    Mirsadeghi, Emad
    Khodayifar, Salman
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (02): : 1135 - 1163
  • [45] Matching Sensor Ontologies with Simulated Annealing Particle Swarm Optimization
    Zhu, Hai
    Xue, Xingsi
    Geng, Aifeng
    Ren, He
    [J]. MOBILE INFORMATION SYSTEMS, 2021, 2021
  • [46] Hybridizing particle swarm optimization with simulated annealing and differential evolution
    Emad Mirsadeghi
    Salman Khodayifar
    [J]. Cluster Computing, 2021, 24 : 1135 - 1163
  • [47] Optimal design method for sparse array of MIMO radar
    Tang J.
    Liu Z.
    Xie R.
    Zeng B.
    [J]. Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2022, 44 (12): : 3661 - 3666
  • [48] Array design with accelerated particle swarm optimization
    [J]. 1600, AMSE Press, 16 Avenue Grauge Blanche, Tassin-la-Demi-Lune, 69160, France (57):
  • [49] Optimization of hydropower station operation by using particle swarm algorithm based on simulated annealing
    Shen, Jianjian
    Cheng, Chuntian
    Liao, Shengli
    Zhang, Jun
    [J]. Shuili Fadian Xuebao/Journal of Hydroelectric Engineering, 2009, 28 (03): : 10 - 15
  • [50] Modified adaptive particle swarm optimization algorithm based on probabilistic leap and simulated annealing
    College of Astronautics, Northwestern Polytechnical University, Xi'an 710072, China
    [J]. Kongzhi yu Juece Control Decis, 2009, 4 (617-620+627):