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 条
  • [41] Sparse convex optimization via adaptively regularized hard thresholding
    Axiotis, Kyriakos
    Sviridenko, Maxim
    Journal of Machine Learning Research, 2021, 22
  • [42] GRAPH-STRUCTURED SPARSE REGULARIZATION VIA CONVEX OPTIMIZATION
    Kuroda, Hiroki
    Kitahara, Daichi
    2022 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2022, : 5538 - 5542
  • [43] Sparse Convex Optimization via Adaptively Regularized Hard Thresholding
    Axiotis, Kyriakos
    Sviridenko, Maxim
    JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22 : 1 - 47
  • [44] Deterministic Synthesis Approach for Linear Sparse Array Antennas
    Kedar, Ashutosh
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2020, 68 (09) : 6667 - 6674
  • [45] Linear Sparse Array Synthesis With Minimum Number of Sensors
    Cen, Ling
    Ser, Wee
    Yu, Zhu Liang
    Rahardja, Susanto
    Cen, Wei
    IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2010, 58 (03) : 720 - 726
  • [46] Non-convex sparse regularization via convex optimization for blade tip timing
    Zhou, Kai
    Wang, Yanan
    Qiao, Baijie
    Liu, Junjiang
    Liu, Meiru
    Yang, Zhibo
    Chen, Xuefeng
    MECHANICAL SYSTEMS AND SIGNAL PROCESSING, 2025, 222
  • [47] Non-convex sparse regularization via convex optimization for impact force identification
    Liu, Junjiang
    Qiao, Baijie
    Wang, Yanan
    He, Weifeng
    Chen, Xuefeng
    MECHANICAL SYSTEMS AND SIGNAL PROCESSING, 2023, 191
  • [48] Compositional synthesis for linear systems via convex optimization of assume-guarantee contracts
    Ghasemi, Kasra
    Sadraddini, Sadra
    Belta, Calin
    AUTOMATICA, 2024, 169
  • [49] Synthesis of Distributed Array Consisting of Two Subarrays via Hybrid Method of Differential Evolution Optimization and Convex Optimization
    Fang, Shutao
    Li, Weiming
    Xue, Zhenghui
    Ren, Wu
    IEEE ANTENNAS AND WIRELESS PROPAGATION LETTERS, 2021, 20 (02): : 125 - 129
  • [50] PATTERN SYNTHESIS OF PLANAR ANTENNA ARRAY VIA CONVEX OPTIMIZATION FOR AIRBORNE FORWARD LOOKING RADAR
    Qu, Y.
    Liao, G. S.
    Zhu, S. Q.
    Liu, X. Y.
    PROGRESS IN ELECTROMAGNETICS RESEARCH-PIER, 2008, 84 : 1 - 10