By Topic

Optimal Polarization Synthesis of Arbitrary Arrays With Focused Power Pattern

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fuchs, B. ; Lab. of Electromagn. & Acoust., Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland ; Fuchs, J.J.

The joint synthesis of the spatial power pattern and polarization of arbitrary arrays is addressed. Specifically, the proposed approach gives the solution to a frequently encountered problem, namely the array design (i.e., the determination of the radiating element weightings) to achieve a pattern that is arbitrarily upper bounded, while its polarization is optimized in a given angular region. Any state of polarization (elliptical, circular and linear) can be synthesized and there is no restriction regarding the array geometry and element patterns. The synthesis problem is rewritten as a convex optimization problem, that is efficiently solved using readily available software. This ensures the optimality of the proposed solution. Various numerical results are presented to validate the proposed method and illustrate its potentialities. The synthesis of a sequentially rotated array is first addressed. Then a linear array of equispaced randomly oriented dipoles is considered. Finally, a conformal and a planar array of patches, where the mutual coupling effects are considered, are synthesized to radiate a linear and a circular polarization.

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:59 ,  Issue: 12 )