Effective approach for pattern synthesis of sparse reconfigurable antenna arrays with exact pattern matching

Abstract

An effective approach is presented for pattern synthesis of reconfigurable antenna arrays with non‐uniformly spaced arrangements. On the basis of the joint sparse model of multiple reference patterns, the proposed approach can dynamically reconfigure multiple radiation patterns with exactly matched pattern details and minimum number of antenna elements by joint optimisation of element positions and excitations. In this study, the design of sparse reconfigurable arrays is recast as a simultaneous sparse approximation problem and solved with the multi‐task Bayesian compressive sensing. The common element positions and individual element excitations for multiple radiation patterns are obtained simultaneously by searching out multiple weight vectors sharing the same prior probability. Several representative experiments are provided to validate the effectiveness of the proposed method for the design of maximally sparse reconfigurable antenna arrays with exact pattern matching.

Minimising number of perturbed elements in linear and planar adaptive arrays with broad nulls using compressed sensing approach

“…where A H is the Hermitian transpose of matrix A. The solution in (15) does not provide a localised (sparse) solution, so a fully adaptive array is required to achieve the desired nulls. We are interested in forming the required nulls by changing the complex weights of a minimum number of antenna elements.…”

“…This is achieved by forming the problem into a probabilistic formulation then solving it using a relevance vector machine technique solver. In [14], BCS is used to synthesise sparse planar arrays using single-task BCS and multi-task BCS (MT-BCS), and in [15], MT-BCS is used to design reconfigurable antenna arrays. The synthesis of reconfigurable sparse arrays using multiple measurement vectors focal underdetermined system solver (M-FOCUSS) was recently introduced in [16].…”

Advanced Marine Predator Algorithm for Circular Antenna Array Pattern Synthesis

“…Many research works have been dedicated to developing techniques for the pattern synthesis of antenna arrays with a narrow main lobe and reduced sidelobe level [ 2 , 6 ]. Pattern synthesis of different types of antenna such as linear array, circular array, hexagonal array, concentric circular array, time modulated arrays, and many more using some heuristic algorithms has been carried out by several researchers [ 7 , 8 , 9 , 10 , 11 ]. To solve the antenna array optimization, the choice of the optimization algorithm is essential, as is the objective function capturing the designated relevance of the antenna array.…”

Underwater Sparse Acoustic Sensor Array Design under Spacing Constraints Based on a Global Enhancement Whale Optimization Algorithm

“…Generally, the design problems of sparse sensor arrays are mainly divided into two types [4]: (1) The element positions are optimized to minimize the PSLL with a fixed number of array elements and aperture [5]. (2) The array beampattern is designed to match the desired beampattern by optimizing the array element positions and weights while reducing the number of array elements [6,7]. Some arrays, such as large towed arrays and the seabed array, are prone to shift in array position and change in array configuration during operation, which causes a mismatch between the real positions and the design ones.…”