Optimal compromise among sum and difference patterns

Ares, F.; Rodríguez, Juan Antonio; Moreno, E.; Rengarajan, S.R.

doi:10.1163/156939396x00919

Cited by 41 publications

(36 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The sum pattern is obtained by adding the outputs of all quadrants in phase, while the difference beams are generated with pairs of quadrants added in phase reversal. According to the sub-arraying strategy, each quadrant is then subdivided into Q sectors or sub-arrays [5]. Thus, for each difference mode, the synthesis problem is concerned with the definition of the aggregation vector C = {c n ∈ [1, Q] ; n = 1, .…”

Section: Mathematical Formulationmentioning

confidence: 99%

“…Since the available space is limited and because of the need of simple feed networks, an ever growing interest has been devoted to subarraying strategies [4][5][6][7][8][9]. In such a case, a set of excitations (either the sum or one difference) is fixed to the optimum, while the others are obtained by clustering the array elements into sub-arrays and weighting each of them.…”

Section: Introductionmentioning

confidence: 99%

“…To obtain good radar performances, the compromise solution should guarantee narrow beamwidth and low sidelobe levels (SLLs), high directivity, and deep normalized slope at boresight. Unfortunately, such requirements are incommensurable and the synthesis of compromise solutions has usually dealt with only the minimization of the SLLs [4][5][6][7][8][9][10] for a given beamwidth. Other studies concerned with linear arrays have also considered the maximization of the directivity [11].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Directivity Optimization in Planar Sub-Arrayed Monopulse Antenna

Rocca¹,

Manica²,

Massa³

2008

PIER Letters

View full text Add to dashboard Cite

Abstract-In this paper, the Contiguous Partition Method (CPM) is applied to the optimization of the directivity of difference patterns in monopulse planar array antennas. Since the excitations providing maximum directivity of planar arrays can be analytically computed and because of the excitation matching nature of the CPM, the problem at hand is recast as the synthesis of the difference compromise solution close as much as possible to the reference pattern with maximum directivity. Selected results are shown to point out the potentialities of the CPM-based approach.

show abstract

Section: Mathematical Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Directivity Optimization in Planar Sub-Arrayed Monopulse Antenna

Rocca¹,

Manica²,

Massa³

2008

PIER Letters

View full text Add to dashboard Cite

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.

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

“…A method to improve in a particular azimuthal sector the difference radiation pattern sidelobe level of a monopulse antenna of a corporate-fed array type is presented in [12]. Successively, an improved sub-arraying method has been investigated in [4]. The synthesis of planar arrays has been also addressed by means of a Simulated Annealing (SA) algorithm even though for assigned (i.e., not involved in the optimization) sub-array configurations.…”

Section: Introductionmentioning

confidence: 99%

On the Synthesis of Sub-Arrayed Planar Array Antennas for Tracking Radar Applications

Manica

Rocca

Massa

2008

Antennas Wirel. Propag. Lett.

View full text Add to dashboard Cite

The synthesis of compromise sum and difference patterns of large planar arrays is addressed in this letter by means of a suitable implementation of the Contiguous Partition Method (CP M ). By exploiting some properties of the solution space, the generation of compromise sum-difference patterns is recast as the searching of the optimal path in a graph that codes the admissible solution space. Some numerical experiments are provided in order to assess the effectiveness of the proposed method.

show abstract

Optimal compromise among sum and difference patterns

Cited by 41 publications

References 4 publications

Directivity Optimization in Planar Sub-Arrayed Monopulse Antenna

Directivity Optimization in Planar Sub-Arrayed Monopulse Antenna

Synthesis of compromise sum-difference arrays through time-modulation

On the Synthesis of Sub-Arrayed Planar Array Antennas for Tracking Radar Applications

Contact Info

Product

Resources

About