Optimal synthesis of difference patterns subject to arbitrary sidelobe bounds by using arbitrary array antennas

By Ovidio Mario Bucci, Michele D'Urso, Tommaso Isernia. 2005

61 citations recorded by the source corpus.

Subfields: Aerospace Engineering, Civil and Structural Engineering

View Paper: https://www.semanticscholar.org/paper/36465cf4f088aa2159e99440b1df53010ffb138b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Aerospace Engineering

In Civil and Structural Engineering

Citations in the corpus

Optimal Synthesis of Sum and Difference Patterns With Arbitrary Sidelobes Subject to Common Excitations Constraints (2010, background): “Therefore, exploiting the results achieved in [11] and [12] for the sum and difference patterns, respectively, the problem is formulated as the determination of the real and imaginary parts of the excitation coefficients (i.”
A Hybrid Approach to the Synthesis of Subarrayed Monopulse Linear Arrays (2009, methodology): “At the first step, the “optimal” subarray configuration is computed according to the procedure described in [8] by exploiting the relationship between the excitation coefficients of the optimal sum [13]–[16] and difference [9]–[11] modes.”
An Effective Hybrid Approach for the Optimal Synthesis of Monopulse Antennas (2007, methodology): “This can be done by paralleling, at the subarray level, the reasoning in [3] as follows: Find the weight coefficients”
A Fast Graph-Searching Algorithm Enabling the Efficient Synthesis of Sub-Arrayed Planar Monopulse Antennas (2009, methodology): “Inspired by the investigations on the synthesis of difference patterns carried out in [22], it has been shown in [10] that the definition of the sub-array weights for compromise monopulse array antennas can be formulated as the solution of a convex programming (CP) problem once the sub-array configu”
Application of Convex Relaxation to Array Synthesis Problems (2014, methodology): “APPENDIX II SYNTHESIS OF DIFFERENCE PATTERN The synthesis of a difference pattern can be formulated in a convex way as shown in [21].”
Optimal Synthesis of Robust Beamformer Weights Exploiting Interval Analysis and Convex Optimization (2014, background): “Let us consider that some classes of array synthesis problems [20][21][22] can be cast as convex programming (CP ) ones”