21 December 2020 in IEEE Transactions on Antennas and Propagation
The synthesis of irregular phased arrays subject to constraint on directivity is fulfilled by convex optimization. In particular, based on the membership between the antenna elements and subarrays, the dictionary matrix, the resulting sparse excitation vector and the sparse binary vector are introduced to describe the array pattern and exact tiling of the aperture. Therefore, the synthesis of irregular phased arrays without overlaps and holes satisfying given maximum SLL and minimum directivity can be summarized as a mixed integer non-convex programming problem, where both the subarray tiling configurations and the associated complex excitations are optimized simultaneously. To avoid the non-convexities, some mathematical transformations in terms of directivity are implemented and the binary sparse vector is relaxed to be a real sparse vector by the minimization of the weighted l1-norm. Consequently, the non-convex problem is reduced to iterative convex optimization problems, where several convex optimization problems are included and can be efficiently solved using convex optimization solver. The excellent performances of the proposed method are verified by comparing with previously reported methods through several numerical examples.
5 January 2022 in IEEE Transactions on Antennas and Propagation
A novel and effective method for the design of maximum directivity irregular phased arrays is proposed in this article. By decomposing the radiation pattern of irregular arrays (IAs) into the product of subarray pattern and subarray array factor, the principal factor for the reduction of directivity and the appearance of high sidelobes is analyzed. Aimed at maximizing directivity of IAs, a binary quadratic optimization problem (BQOP) is established for the design of subarray tiling configuration, where the directivities at considered scanning angles satisfying given peak sidelobes level (SLL) is maximized. To consider the directivities at all the scanning angles within given scan ranges, a concept of “generalized directivity” is introduced and defined. Meanwhile, it is known that high directivity usually enables to suppress high SLL to a great extent. Therefore, the BQOP is reduced to a simplified binary quadratic problem (SBQP) for the maximization of the “generalized directivity” without the high-dimensional constraint on SLL. The associated complex excitations at subarray level are solved using convex optimization after the subarray tiling configuration is determined. By comparing to the reported state-of-the-art methods, several representative numerical examples are implemented to assess the effectiveness of the proposed method.
11 June 2021 in IEEE Antennas and Wireless Propagation Letters
An effective optimization method is proposed for the synthesis of sparse antenna arrays subject to constraint on directivity in this letter. Based on the framework of thinned arrays synthesis, a real-value mixed integer programming problem for the minimization of the number of elements under given maximum sidelobe level, scan range, and minimum directivity in a limited array aperture is established. In order to solve this problem efficiently, an iterative convex optimization method is proposed, where the strategies of weighted l 1 -norm minimization and the polygonal expansion and contraction of the element position are integrated together organically. Owing to the adoption of such two strategies, both the search space regarding the element positions and the convergence speed can be controlled flexibly. Several representative numerical examples are presented in comparison with reported advanced methods to demonstrate the effectiveness of the proposed method.
28 June 2019 in IEEE Transactions on Antennas and Propagation
A novel iterative convex optimization algorithm is proposed for the efficient synthesis of 4D antenna arrays in this paper. A general non-convex programming problem in terms of pencil beam synthesis at the center frequency and the suppression of multiple sidebands with different time schemes is firstly established. In order to decrease the non-convexity with respect to equivalent excitations, the non-convex programming problem is then decomposed into a convex optimization problem at the center frequency and a simplified non-convex optimization problem at sidebands. Based on the optimized results at the center frequency, an iterative convex optimization algorithm that consists in solving a sequence of convex optimization problems is adopted to solve the non-convex optimization problem efficiently. Owing to the introduction of iterative idea and convex optimization, the propose method achieves a good trade-off between the optimization time and the optimality of the solution for the synthesis of 4D antenna arrays of various scales. Numerical examples of uniformly or nonuniformly spaced 4D antenna arrays are presented to demonstrate the excellent performance of the proposed algorithm in comparison with those of the previously reported methods.
4 May 2021 in IEEE Transactions on Antennas and Propagation
A novel method based on the combination of scattering-matrix approach and microwave network theory is proposed for the realization of in-band scattering and radiation tradeoff of broadband phased arrays. In particular, the proposed method is able to efficiently predict both radiation performances and scattering characteristics of finite phased arrays with element-independent matching networks (EIMNs)/loads. The in-band scattering and radiation tradeoff of finite arrays can be achieved by the optimization of the loaded EIMNs/loads. Moreover, the accuracy of this method is guaranteed by considering some factors, such as the EM coupling and the edge effects of finite arrays. To verify the effectiveness of the proposed method, a $1\times16$ linear array operating at 8.0–10.0 GHz for scanning up to 45° is designed as the reference prototype and the quasi-coaxial lines are served as the EIMNs. The optimized results show that an obvious scattering reduction is achieved throughout the operating bandwidth in comparison with the reference array. Finally, the optimized linear array is fabricated and measured, and good agreement is obtained to further demonstrate the effectiveness of the proposed method.
22 November 2019 in IEEE Transactions on Vehicular Technology
A novel direction of arrival (DOA) estimation method for four-dimensional (4-D) linear arrays with optimized time sequences using the sparse signal recovery is proposed in this paper. By establishing the sparse signal recovery model applied to DOA estimation of 4-D linear arrays, it is found that the time sequences have great influence on sparse signal recovery. Thus mutual coherence and covariance matrix of noise are introduced to evaluate its influence quantificationally. The differential evolutionary (DE) algorithm is then used for the optimization of time sequences such that the capability of sparse signal recovery is improved and the noise after time modulation is close to Gaussian white noise. It can be found that the unidirectional phase center motion (UPCM) scheme is an excellent candidate by the optimization of an 8-element 4-D linear array. By comparison with the previous methods, simulated results demonstrate that the proposed method has distinct advantages over other methods in probability of resolution and estimation accuracy, especially for the cases where the number of snapshots is small and the SNR is low. Furthermore, an S band 4-D linear array with eight elements is designed and measured to demonstrate the performance of DOA estimation by the proposed method.