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

El‐Khamy, Said E.; Korany, Noha O.; Abdelhay, Magdy A.

doi:10.1049/iet-map.2018.5221

Cited by 6 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The l 0 -norm minimization problem is an NP-hard combinatorial optimization problem and generally impossible to solve, as its globally optimal solution usually requires an intractable combinatorial search, even for a modestsized array. In order to circumvent the intractable problem, we relax (11) by replacing the l 0 -norm with the following l 1norm min a a 1 under(2) (12) Note that the l 1 -norm is the closest convex function to l 0 -norm. An algorithm involves performing a sequence of reweighted convex l 1 minimization problems has been developed in [9]- [13], [26], [27].…”

Section: B the Synthesis Of Sparse Arraymentioning

confidence: 99%

Synthesis of Linear and Planar Arrays Via Sequential Convex Optimizations

Bai

Zhang

2020

IEEE Access

View full text Add to dashboard Cite

In this paper, an iterative procedure for the synthesis of sparse arrays radiating focused beampattern is presented. The proposed approach provides a signifcant reduction in the complexity of the beam forming network, which is fulfilled by reducing the number of antenna elements in the array. An iterative scheme is used where the prescribed pattern response in the mainlobe is cast as a multi-convex problem at each step that the nonconvex lower bound constraint is relaxed while including a reweighted l 1 -norm minimization based on the magnitudes of the elements. Thus, a sparse array with fewer elements (compared to other methods) and a better performance of beam pattern (e.g., narrower 3-dB beamwidth, lower maximum sidelobe level) is produced. The resulting sparse array is able to generate a steerable pencil beam, matching a given power mask and avoid to constraint the fitting of any a priori defined reference beam pattern. The practical array imperfections are also compensated in the optimization stage by using worstcase performance optimization technique. Examples concerning the design of linear and planar arrays show relevant savings of array elements with respect to conventional array techniques.INDEX TERMS Array pattern synthesis, multi-convex programming, sequential convex optimization, sparse array.

show abstract

Section: B the Synthesis Of Sparse Arraymentioning

confidence: 99%

Synthesis of Linear and Planar Arrays Via Sequential Convex Optimizations

Bai

Zhang

2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…(2016) and El‐Khamy et al. (2019), null steering is achieved by selecting a few perturbed elements using a compressed sensing approach.…”

Section: Introductionmentioning

confidence: 99%

Radiation Pattern Nulling in Phased Array Antennas Using Superior Discrete Fourier Transform and Dolph‐Tschebyscheff Based Synthesis Techniques

2022

View full text Add to dashboard Cite

This study proposes an improved method for sector nulling in the radiation pattern of rectangular phased array antennas using two different synthesis techniques; an orthogonal Discrete Fourier transform and a quasi‐orthogonal Dolph‐Tschebyscheff based technique. In traditional synthesis techniques, broad elemental beams serve as local field basis functions (FBFs) in an array. Instead, the proposed methods produce low sidelobe narrow beams as FBFs. A set of these FBFs can effectively constitute the array's radiation pattern in a confined angular region. By properly weighting these FBFs, sector pattern nulls in a designated angular range are synthesized without severely distorting the patterns outside this area. The FBFs' optimal weights can be efficiently calculated using a nonlinear minimum least squares error technique, which is later transformed into the array's elemental excitation coefficients. Along with faster convergence, this technique allows control over peak sidelobe level, null depth, and width, making it suitable for GPS anti‐jamming, 5G communications, and other applications requiring interference suppression.

show abstract

“…In the array pattern optimization with some desired constraints such as low sidelobe level, narrow beam width, and controlled nulls, many of the design parameters could be saved by choosing their values non-adaptive [7][8][9][10]. Other techniques include the use of thinning process especially for the large planar arrays where the optimization processes are slow and difficult [11][12][13][14][15][16].…”

Section: Introductionmentioning

confidence: 99%

Rectangular Grid Antennas With Various Boundary Square-Rings Array

Mohammed¹

2021

PIER Letters

View full text Add to dashboard Cite

Rectangular grid antennas are widely used in practice due to their advantages and versatility. This paper simplifies the design procedures of such antennas by optimizing their radiation characteristics using minimum number of the optimized elements while maintaining the same performance. The method consists of partitioning a fully square grid array into two unequally subplanar arrays. The first one contains the inner and the most central elements of the initial planar array in which they are chosen to be non-adaptive elements, while the remaining outer and boundary elements which constitute L number of the square-rings are chosen to be adaptive elements. Then, the optimization process is carried out on those outer rings instead of fully planar array elements. Compared to a standard N × M planar array with fully adaptive elements, the number of optimized elements could be reduced from N × M to 2{2L(N − L)}, so as to significantly reduce the system cost without affecting the overall array performance. Results of applying the proposed method to optimize a small 9 × 9, medium 20 × 20, and large 40 × 40 size planar arrays with various values of L are shown.

show abstract

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

Cited by 6 publications

References 20 publications

Synthesis of Linear and Planar Arrays Via Sequential Convex Optimizations

Synthesis of Linear and Planar Arrays Via Sequential Convex Optimizations

Radiation Pattern Nulling in Phased Array Antennas Using Superior Discrete Fourier Transform and Dolph‐Tschebyscheff Based Synthesis Techniques

Rectangular Grid Antennas With Various Boundary Square-Rings Array

Contact Info

Product

Resources

About