In this letter, an efficient and versatile method based on algorithm x and differential evolution algorithm (DEA) is proposed to synthesize irregular modular subarrayed planar phased arrays with exact tiling. To allev...
详细信息
In this letter, an efficient and versatile method based on algorithm x and differential evolution algorithm (DEA) is proposed to synthesize irregular modular subarrayed planar phased arrays with exact tiling. To alleviate the time-consuming problem of using algorithm x to synthesize large arrays, the proposed method obtains the subarray configuration with exact tiling through twice-partitioning operations. In the first partition process, the planar phased array is divided into several first-level subarrays. In the second partition process, the first-level subarrays are respectively divided into prespecified irregular modular subarrays, called second-level subarrays. All feasible schemes for dividing the first-level subarrays and second-level subarrays can be obtained by algorithm x. Through the above partition process, the partitioning paradigm can be represented by only a few variables, which can be optimized by swarm intelligence algorithms. In this letter, the variables representing the subarray configuration are optimized by DEA to obtain excellent radiation performances. Three representative numerical examples are presented and discussed to assess the validity, efficiency, and reliability of the proposed method.
Subarray is widely used in array antennas to decrease the system complexity, which would also increase the sidelobes during scanning. To solve this problem, subarray partition solutions with larger coverage and lower ...
详细信息
Subarray is widely used in array antennas to decrease the system complexity, which would also increase the sidelobes during scanning. To solve this problem, subarray partition solutions with larger coverage and lower sidelobes are selected from a series of results generated by search algorithms. However, searching for an appropriate result of a large array is time-consuming. In this study, to search subarray solutions of full coverage with less time, we introduce two pruning processes in algorithm x. Additionally, a pair of coefficients associated with the sidelobes is adopted for further pruning and reducing the sidelobes. Numerical experiments have been carried out and verified the effectiveness and the performance of the proposed method.
Subarray partition is usually employed in the design of array antennas. However, it is difficult to get an exact partition of an arbitrary antenna aperture with irregular-shaped subarrays. Based on the exact cover the...
详细信息
Subarray partition is usually employed in the design of array antennas. However, it is difficult to get an exact partition of an arbitrary antenna aperture with irregular-shaped subarrays. Based on the exact cover theory, a solution of the exact partition is developed using the algorithm x. We consider the fact that sometimes it would be unpractical to exactly partition an aperture with given-shaped subarrays. Therefore, the concept of slack unit is proposed to find the quasi-exact partition of apertures. Numerical experiments are carried out to demonstrate and validate the effectiveness of the algorithm x as well as the predominance of the irregular-shaped subarrays.
暂无评论