Array Synthesis Using Weighted Alternating Projection and Proximal Splitting

Han, Yubing; Wan, Chuan; Sheng, Weixing; Tian, Buning; Yang, Hongtao

doi:10.1109/lawp.2015.2389804

Cited by 24 publications

(16 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• A simple iterative method to synthesize the coverage area with the objective of stretching its length toward the travel direction is described [16]. In this case, complex coefficients w n, m are taken as in (12), that is, w n, m ¼ a n, m e jk x Àk x, 0 ðÞ nÀ1…”

Section: Antenna Array Synthesis With Iterative Methodsmentioning

confidence: 99%

“…a n cos k x À k x, 0 ðÞ x n þ k y À k y, 0 ÀÁ y n ÂÃ (12) which is again a real function. As for the broadside array case, the optimization problem (9) in the known direction ϕ 0 ; θ 0 ðÞ can be simplified as (11) and written in the form of a linear program as described in [15].…”

Section: Non-broadside Arraymentioning

confidence: 99%

“…Possible applications for these methods are in the field of satellite communications where small antennas or antenna arrays are employed for illuminating a profiled reflector, as described in [8]. Besides the use of a profiled reflector, other techniques have been developed and proposed [9][10][11][12]. The minimum least square error (MLSE) criteria are used in [9] for the synthesis of a desired contoured pattern specified with points in the angular domain.…”

Section: Introductionmentioning

confidence: 99%

“…This reduces the number of optimization variables with respect to the conventional SPM [11]. Another example of synthesis technique which minimizes the difference with a desired pattern in an iterative fashion can be found in [12].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Array Pattern Synthesis for ETC Applications

Inserra¹

2019

Array Pattern Optimization

View full text Add to dashboard Cite

The problem of antenna array synthesis for radiation pattern defined on a planar surface will be considered in this chapter. This situation could happen when the electric field r-decay factor effect cannot be neglected, for example, an antenna array mechanically tilted and a pattern defined in terms of Cartesian coordinates, as in the electronic toll collection (ETC) scenario. Two possible approaches will be presented: the first one aims at the precise synthesis of the pattern in the case both a constant power-bounded area and a sidelobe suppression region are defined and required to be synthesized. The second approach instead devotes at stretching the coverage area toward the travel length (without considering a precise definition of the communication area) to increase the available identification time with an iterative methodology. For the latter, an antenna prototype has been fabricated, and measurement results have confirmed the approach validity.

show abstract

Section: Antenna Array Synthesis With Iterative Methodsmentioning

confidence: 99%

Section: Non-broadside Arraymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Array Pattern Synthesis for ETC Applications

Inserra¹

2019

Array Pattern Optimization

View full text Add to dashboard Cite

show abstract

“…To speed up the computation of Algorithm 1, we divide the16.9 -16.88 -16.86 -16.84 -16.82 -16.8 -16.78 -16.76 -16.74 -16.72 -16.7…”

mentioning

confidence: 99%

Monopulse Beam Synthesis Using a Sparse Single Layer of Weights

Kwak

Chun

2019

IEEE Trans. Antennas Propagat.

View full text Add to dashboard Cite

A conventional monopulse radar system uses three beams; sum beam, elevation difference beam and azimuth difference beam, which require different layers of weights to synthesize each beam independently. Since the multi-layer structure increases hardware complexity, many simplified structures based on a single layer of weights have been suggested. In this work, we introduce a new technique for finding disjoint and fully covering sets of weight vectors, each of which constitutes a sparse subarray, forming a single beam. Our algorithm decomposes the original non-convex optimization problem for finding disjoint weight vectors into a sequence of convex problems. We demonstrate the convergence of the algorithm and show that the interleaved array structure is able to meet difficult beam constraints.Index Terms-Monopulse radar, sparse array, interleaved array, convex optimization, argumentative reselection algorithm, alternating projection method.

show abstract

An efficient hybrid method for fast phased array pattern synthesizing

Zhou

Huang

et al. 2022

Int J RF Mic Comp-Aid Eng

View full text Add to dashboard Cite

A novel and fast array synthesis method simultaneously combining the advantages of genetic algorithm (GA), alternating projection method (APM), and differential evolution (DE) is proposed in this work. The APM adopts fast Fourier transform (FFT), and the far-field calculation is mathematically simplified to multiplication with a common matrix, which could be faster than inverted-FFT (IFFT) for thousands of individuals of the same small array. Then an effective fitness evaluating method with multi-objective is developed, which could be adjusted according to specific needs such as array side lobe suppression, beam-broaden, and beam-shaping. To demonstrate the feasibility of the proposed method, several array synthesis examples are presented and the results show that the proposed method has good robustness, convergence, and global searching ability.

show abstract

Array Synthesis Using Weighted Alternating Projection and Proximal Splitting

Cited by 24 publications

References 6 publications

Array Pattern Synthesis for ETC Applications

Array Pattern Synthesis for ETC Applications

Monopulse Beam Synthesis Using a Sparse Single Layer of Weights

An efficient hybrid method for fast phased array pattern synthesizing

Contact Info

Product

Resources

About