Beam Pattern Optimization Via Unequal Ascending Clusters

Authors

DOI:

https://doi.org/10.26636/jtit.2023.168523

Keywords:

beam pattern, clustered array, genetic algorithm, sidelobe

Abstract

In this paper, two different architectures based on completely and sectionally clustered arrays are proposed to improve the array patterns. In the wholly clustered arrays, all elements of the ordinary array are divided into multiple unequal ascending clusters. In the sectionally clustered arrays, two types of architectures are proposed by dividing a part of the array into clusters based on the position of specific elements. In the first architecture of sectionally clustered arrays, only those elements that are located on the sides of the array are grouped into unequal ascending clusters, and other elements located in the center are left as individual and unoptimized items (i.e. uniform excitation). In the second architecture, only some of the elements close the center are grouped into unequal ascending clusters, and the side elements were left individually and without optimization. The research proves that the sectionally clustered architecture has many advantages compared to the completely clustered structure, in terms of the complexity of the solution. Simulation results show that PSLL in the side clustered array can be reduced to more than −28 dB for an array of 40 elements. The PSLL was −17 dB in the case of a centrally clustered array, whereas the complexity percentage in the wholly clustered array method was 12 .5 %, while the same parameter for the partially clustered array method equaled 10%.

Downloads

Download data is not yet available.

References

[1] X. Zhao, Q. Yang, and Y. Zhang, “Synthesis of sub-arrayed linear array via l1-norm minimization compressed sensing method”, IEEE Asia-Pacific Conference on Antennas and Propagation; APCAP), 2018; https://doi.org/10.1109/APCAP.2018.8538246.
View in Google Scholar

[2] A.J. Abdulqader, J.R. Mohammed, and R.H. Thaher, “Antenna pattern optimization via clustered arrays”, Progress in Electromagnetics Research M, vol. 95, pp. 177–187, 2020; https://doi.org/10.2528/PIERM20042307.
View in Google Scholar

[3] A.J. Abdulqader, J.R. Mohammed, and R.H. Thaher, “Unconventional and irregular clustered arrays”, 1st International Ninevah Conference on Engineering and Technology; INCET 2021), 2021; https://doi.org/10.1088/1757-899X/1152/1/012003.
View in Google Scholar

[4] R.J. Mailloux, S.G. Santarelli, T.M. Roberts, and D. Luu, “Irregular polyomino-shaped subarrays for space-based active arrays”, Int. J. of Antennas Propag., vol. 2009, Article ID 956524, 2009; https://doi.org/10.1155/2009/956524.
View in Google Scholar

[5] X. Chen, Y. Sun, F. Xu, and X. Yang, “Sub-array partition method based on particle swarm optimisation for large aperture phased array radar”, The Journal of Engineering, vol. 2019, no. 19, pp. 6318 –6321, 2019; https://doi.org/10.1049/joe.2019.0278.
View in Google Scholar

[6] J.R. Mohammed, R.H. Thaher, and A.J. Abdulqader, “Linear and planar array pattern nulling via compressed sensing”, Journal of Telecommunications and Information Technology, no. 3, pp. 50 –55 , 2021; https://doi.org/10.26636/jtit.2021.152921.
View in Google Scholar

[7] X. Zhao, Q. Yang, and Y. Zhang, “Synthesis of minimally sub-arrayed linear arrays via compressed sensing method”, IEEE Antennas and Wireless Propag. Lett., vol. 18, no. 3, pp. 487– 491, 2019; https://doi.org/10.1109/LAWP.2019.2894826.
View in Google Scholar

[8] G. Oliveri, M. Salucci, and A. Massa, “Synthesis of modular contiguously clustered linear arrays through a sparseness-regularized solver”, IEEE Transactions on Antennas and Propagation, vol. 64 , no. 10, pp. 4277–4287 , 2016; https://doi.org/10.1109/TAP.2016.2595623.
View in Google Scholar

Downloads

Submitted

2023-04-12

Published

2023-03-30

Issue

Section

ARTICLES FROM THIS ISSUE

How to Cite

[1]
A. J. Abdulqader, J. R. Mohammed, and Y. E. Mohammad Ali, “Beam Pattern Optimization Via Unequal Ascending Clusters”, JTIT, vol. 91, no. 1, pp. 1–7, Mar. 2023, doi: 10.26636/jtit.2023.168523.

Most read articles by the same author(s)