Synthesis of Uniform Amplitude Focused Beam Arrays

Fuchs, Benjamin; Skrivervik, Anja K.; Mosig, J. R.

doi:10.1109/lawp.2012.2221452

Cited by 51 publications

(47 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The array satisfies the constraints with slightly better sidelobe, i.e. below -20dB, than those obtained in literature [9], [14]. The reason is attributed to the use of embedded element patterns having a cosine-like pattern.…”

Section: Numerical Resultsmentioning

confidence: 51%

See 1 more Smart Citation

Efficient array synthesis of printed arrays including mutual coupling

Van

Jha²,

Craeye

2016

2016 10th European Conference on Antennas and Propagation (EuCAP)

View full text Add to dashboard Cite

An efficient approach for array synthesis including the effect of mutual coupling is presented. The method is based on an iterative convex optimization scheme and on a fast full-wave simulation technique. The embedded element patterns (EEP), obtained by full-wave simulation at each iteration of the convex optimization, are exploited to take into account the mutual coupling. The final results, therefore, not only satisfy the predefined constraints but also guarantee the performance of the array. Numerical results of linear focused beam arrays are presented to show the effectiveness of the approach.

show abstract

Section: Numerical Resultsmentioning

confidence: 51%

“…w n = 1, and the array forms a focused (pencil) beam with minimum side-lobe levels (SLL) by optimizing the position of elements. Following the method proposed in [14], the problem can be formulated as a convex problem and solved by a sequential convex optimization scheme.…”

Section: B Synthesis Of Focused Beam Arraysmentioning

confidence: 99%

Efficient array synthesis of printed arrays including mutual coupling

Van

Jha²,

Craeye

2016

2016 10th European Conference on Antennas and Propagation (EuCAP)

View full text Add to dashboard Cite

show abstract

“…On top of being easy to implement and computationally effective, the method can be readily extended to synthesize uniform amplitude planar arrays as detailed in [7]. Moreover there is no restriction regarding the element patterns and stepped amplitude excitations can also be handled.…”

Section: Resultsmentioning

confidence: 99%

Synthesis of uniform amplitude arrays

Fuchs

Skrivevik

Mosig

2012

2012 15 International Symposium on Antenna Technology and Applied Electromagnetics

View full text Add to dashboard Cite

show abstract

“…Consider a planar array with M elements, where the m th element has a pattern of

g_{m} false(θ, φ false)

and is fed by a complex excitation of

w_{m}

. The far‐field response of the planar array can be expressed as

f false(θ, φ false) = {false\sum}_{m = 1}^{M} g_{m} false(θ, φ false) w_{m} e^{j 2 π (u x_{m} + v y_{m})},

where

x_{m}

and

y_{m}

denote the location of the m th element in the wavelengths, which are arbitrary, but fixed and known, and

u = sin (θ) cos (φ), v = sin (θ) sin (φ) .

Here, we denote

(θ_{0}, φ_{0})

as the desired direction, which yields

u_{0} = sin false(θ_{0} false) cos false(φ_{0} false)

and

v_{0} = sin false(θ_{0} false) sin false(φ_{0} false)

. We also define an undesired region S , which includes all undesired directions.…”

Section: Problem Formulationmentioning

confidence: 99%

“…We also assume that

g_{n} false(θ, φ false) = 1 false/ \sqrt{M}

for all θ and φ . For numerical implementation, we approximate the constraint tr( A ( θ , φ ) W ) ≤ ρ for all ( θ , φ ) ∈ S in (4) as

tr (boldA false(θ_{p}, φ_{q} false) boldW) \leq ρ, for p \in false{1, 2, \dots, N_{θ} and q \in false{1, 2, \dots, N_{φ} false},

where

(θ_{p}, φ_{q})

denotes one of

N_{θ} N_{φ}

sample points in the undesired region S . For the following analysis, we fixed the desired direction as

false(u_{0}, v_{0} false) = false(0, 0 false)

.…”

Section: Numerical Evaluationmentioning

confidence: 99%

Array pattern synthesis using semidefinite programming and a bisection method

et al. 2019

View full text Add to dashboard Cite

In this paper, we propose an array pattern synthesis scheme using semidefinite programming (SDP) under array excitation power constraints. When an array pattern synthesis problem is formulated as an SDP problem, it is known that an additional rank‐one constraint is generated inevitably and relaxed via semidefinite relaxation. If the solution to the relaxed SDP problem is not of rank one, then conventional SDP‐based array pattern synthesis approaches fail to obtain optimal solutions because the additional rank‐one constraint is not handled appropriately. To overcome this drawback, we adopted a bisection technique combined with a penalty function method. Numerical applications are presented to demonstrate the validity of the proposed scheme.

show abstract

Synthesis of Uniform Amplitude Focused Beam Arrays

Cited by 51 publications

References 12 publications

Efficient array synthesis of printed arrays including mutual coupling

Efficient array synthesis of printed arrays including mutual coupling

Synthesis of uniform amplitude arrays

Array pattern synthesis using semidefinite programming and a bisection method

Contact Info

Product

Resources

About