Jianfei An

Jianfei An

Auto-generated profile, based on publicly available information

Jianfei An

Institute of Electronic Engineering, China Academy of Engineering Physics, Mianyang, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2025 in IEEE Antennas and Wireless Propagation Letters
Verified
Journal Article
Closed access
ZCZhenmao Cui
Zhenmao Cui
RCRenai Chen
Renai Chen
QWQiang Wu
Qiang Wu
JLJie Liu
Jie Liu
YYYang Yu
Yang Yu
JAJianfei An
Jianfei An
In this work, the synthesis of partially subarrayed linear array is studied to obtain as few subarrays as possible. For the partially clustered array (PCA), the amplifiers are placed at the subarray level while the phase shifters are placed at the element level. By performing a matrix transformation on the equivalent excitation amplitude vector, the original synthesis problem of PCA is reformulated as a minimization problem of l0-norm. It is nonconvex and cannot be solved by the existing convex methods. Then, a new penalty dual decomposition (PDD) framework is proposed to address the task. The new approach can directly optimize the subarray number and simultaneously guarantee that the elements of subarrays are physically contiguous, while the excitation matching (EM) methods cannot. Numerical simulations show that the proposed method can get as few subarrays as possible in the synthesis of PCA.