Sparse linear array synthesis using artificial neural network and nonconvex optimization.

The concept of sparse array synthesis has attracted considerable attention due to its potential to reduce hardware costs in array design and enhance the efficiency of array aperture utilization. In contrast to conventional artificial neural networks (ANNs), a more efficient encoder–decoding ANN framework is proposed in this letter for designing sparse linear arrays. The decoder is pretrained with a randomly generated training set, enabling its ability to rapidly predictiction of far‐field patterns. This process considers the actual coupling effect among the antenna elements. The output of the encoder is used as the input of the decoder to synthesize the sparse arrays by providing the desired pattern to the encoder. During the training process, a novel lp ${l}_{p}$‐norm (0<p<1) $(0\lt p\lt 1)$ minimization nonconvex optimization method is integrated into the proposed framework to reduce the number of activated elements. The effectiveness and efficiency of the method are demonstrated through numerical and full‐wave simulations for synthesizing various linear sparse arrays, including large‐scale arrays. In comparison to existing algorithms, our proposed method exhibits superior computational efficiency and predicted accuracy with fewer elements. [ABSTRACT FROM AUTHOR]