Hybrid approach for sub-arrayed monopulse antenna synthesis

Rocca, Paolo; Manica, Luca; Massa, Andrea

doi:10.1049/el:20083167

Cited by 21 publications

(14 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…I). Such an event further confirms the importance of exploiting the partial convexity of the problem at hand [10] [15]. As far as the Hybrid − ACO is concerned, the convergence pattern faithfully matches the reference one and outperforms the solution of the Hybrid − BEM [15] as well as that of the "bare" ACO of more than 3.5 dB and 2.4 dB, respectively.…”

Section: Numerical Resultssupporting

confidence: 63%

See 1 more Smart Citation

Ant colony based hybrid approach for optimal compromise sum‐difference patterns synthesis

Rocca¹,

Manica²,

Massa³

2009

Micro & Optical Tech Letters

Self Cite

View full text Add to dashboard Cite

Dealing with the synthesis of monopulse array antennas, many stochastic optimization algorithms have been used for the solution of the so-called optimal compromise problem between sum and difference patterns when sub-arrayed feed networks are considered. More recently, hybrid approaches, exploiting the convexity of the functional with respect to a sub-set of the unknowns (i.e., the sub-array excitation coefficients) have demonstrated their effectiveness. In this letter, an hybrid approach based on the Ant Colony Optimization (ACO) is proposed. At the first step, the ACO is used to define the sub-array membership of the array elements, while, at the second step, the sub-array weights are computed by solving a convex programming problem.

show abstract

Section: Numerical Resultssupporting

confidence: 63%

“…Unlike [15] [16], the grouping of the array elements is determined by solving the excitation matching problem through the ACO-based global optimization [14]. At the second step, the computation of the sub-array weights is recast as the solution of a standard quadratic programming aimed at enforcing peak sidelobe level control.…”

Section: Introductionmentioning

confidence: 99%

Ant colony based hybrid approach for optimal compromise sum‐difference patterns synthesis

Rocca¹,

Manica²,

Massa³

2009

Micro & Optical Tech Letters

Self Cite

View full text Add to dashboard Cite

show abstract

“…Towards this end, the sub-array weights are now computed solving a Convex Programming (CP ) problem as in [9] starting from the sub-array configuration obtained by means of the CP M . the results of the hybrid approach (CP M − CP , [18]) as well as those synthesized by the CP M and in [9]. With reference to the configuration in Tab.…”

Section: Numerical Resultsmentioning

confidence: 99%

Boresight Slope Optimization of Subarrayed Linear Arrays Through the Contiguous Partition Method

Manica

Rocca

Pastorino

et al. 2009

Antennas Wirel. Propag. Lett.

Self Cite

View full text Add to dashboard Cite

The optimization of the normalized boresight slope of the difference pattern in sub-arrayed linear monopulse antennas is presented. The knowledge of the independently optimum difference excitations, which provide the maximum normalized boresight slope, is exploited with an efficient excitation matching technique based on the contiguous partition method. A set of numerical experiments are provided to assess the effectiveness of the proposed method in reaching the best achievable performances even though with a small number of sub-arrays. Index TermsMonopulse array antennas, Sum and difference patterns, Boresight slope.

show abstract

“…In such a case, the optimal sum pattern is usually generated through an independent beam-forming network, whereas the sub-optimal difference one is obtained spatially aggregating the elements into sub-arrays and assigning a suitable weight to each of them. Towards this purpose, analytical procedures [12] [13], stochastic optimization algorithms [14][15] [16] [17], and hybrid methods [18] [19] have been successfully applied.…”

Section: Introductionmentioning

confidence: 99%

Synthesis of compromise sum-difference arrays through time-modulation

Rocca

Manica

Poli

et al. 2009

IET Radar Sonar Navig.

Self Cite

View full text Add to dashboard Cite

In this paper, time-modulation is exploited for the synthesis of monopulse sub-arrayed antennas. The solution of the compromise sum-difference problem is obtained by setting the set of static excitations to an optimal sum set and synthesizing the "best compromise" difference pattern through a Continuous Partition Method (CP M ) based approach. The array elements are aggregated into sub-arrays controlled by means of RF switches with optimized "on" time-durations. The switch-on instants of the pulse sequences are then computed by means of a particle swarm optimizer to reduce the interferences caused by the sideband radiations. A selected set of numerical results is reported to assess the potentialities of time-modulation in dealing with the synthesis problem at hand.

show abstract

Hybrid approach for sub-arrayed monopulse antenna synthesis

Cited by 21 publications

References 10 publications

Ant colony based hybrid approach for optimal compromise sum‐difference patterns synthesis

Ant colony based hybrid approach for optimal compromise sum‐difference patterns synthesis

Boresight Slope Optimization of Subarrayed Linear Arrays Through the Contiguous Partition Method

Synthesis of compromise sum-difference arrays through time-modulation

Contact Info

Product

Resources

About