Synthesis of Sparse Linear Array for Directional Modulation via Convex Optimization

被引:23
|
作者
Hong, Tao [1 ]
Shi, Xiao-Pan [2 ]
Liang, Xue-Song [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Nanjing 210003, Jiangsu, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Coll Telecommun & Informat Engn, Nanjing 210003, Jiangsu, Peoples R China
基金
中国国家自然科学基金;
关键词
Convex optimization; directional modulation (DM); dynamic DM signal; information beam; physical layer security; power efficiency; sparse array; ANTENNA-ARRAY; COMMUNICATION;
D O I
10.1109/TAP.2018.2835641
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The design of a directional modulation (DM) signal by a phased array is one of the important topics in the field of physical layer security communication. In this paper, we synthesize a sparse array for DM based on convex optimization. The main idea is that a nonconvex optimization problem associated with l(0)-norm is formulated for synthesizing a sparse array. To solve this nonconvex optimization problem, two different solutions are employed to relax the nonconvex optimization problem in a convex way: one is based on iterative reweighted l(1)-norm resulting in a superdirective array, the other is based on mixed integer programming resulting in a nonsuperdirective array. Furthermore, multiple important metrics of a DM transmitter, such as power efficiency, information beamwidth, and dynamic DM signal, are also considered in the optimization problem to achieve better performance of the DM signal via a sparse array. Simulation results show that the proposed synthesis method provides greater flexibility of controlling the security performance, power efficiency, and static or dynamic DM signal while the number of excitations is less than the uniformly spaced linear array in the benchmark problems.
引用
收藏
页码:3959 / 3972
页数:14
相关论文
共 50 条
  • [31] Array Synthesis Problems via Convex Relaxation
    Fuchs, Benjamin
    2014 IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM (APSURSI), 2014, : 1361 - 1362
  • [32] Sparse Linear Array Designed via ULA Fitting
    Shi, Wanlu
    Li, Yingsong
    Huang, Zhixiang
    2022 IEEE 10TH ASIA-PACIFIC CONFERENCE ON ANTENNAS AND PROPAGATION, APCAP, 2022,
  • [33] Sparse Linear Array Design via Membrane Algorithm
    Gan, Na
    Cui, Guolong
    Yang, Jing
    Yu, Xianxiang
    Kong, Lingjiang
    2019 IEEE RADAR CONFERENCE (RADARCONF), 2019,
  • [34] Sparse Array Design via Integer Linear Programming
    Zhuang, Yangjingzhi
    Zhang, Xuejing
    He, Zishu
    Greco, Maria Sabrina
    Gini, Fulvio
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2024, 72 : 4812 - 4826
  • [35] Synthesis algorithm of directional modulation signals based on sparse arrays
    Ma W.
    Hong T.
    2018, Chinese Institute of Electronics (40): : 2816 - 2823
  • [36] Maximally Sparse, Steerable, and Nonsuperdirective Array Antennas via Convex Optimizations
    D'Urso, Michele
    Prisco, Giancarlo
    Tumolo, Roberto Michele
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2016, 64 (09) : 3840 - 3849
  • [37] Sparse Array Synthesis via Alternating Projections
    Quijano, Javier Leonardo Araque
    Vecchi, Giuseppe
    2009 IEEE ANTENNAS AND PROPAGATION SOCIETY INTERNATIONAL SYMPOSIUM AND USNC/URSI NATIONAL RADIO SCIENCE MEETING, VOLS 1-6, 2009, : 2779 - 2782
  • [38] Fast Sparse Recovery via Non-Convex Optimization
    Chen, Laming
    Gu, Yuantao
    2015 IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (GLOBALSIP), 2015, : 1275 - 1279
  • [39] Robust Sparse Recovery via Non-Convex Optimization
    Chen, Laming
    Gu, Yuantao
    2014 19TH INTERNATIONAL CONFERENCE ON DIGITAL SIGNAL PROCESSING (DSP), 2014, : 742 - 747
  • [40] Sparse Convex Optimization via Adaptively Regularized Hard Thresholding
    Axiotis, Kyriakos
    Sviridenko, Maxim
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 119, 2020, 119