Optimal Narrow Beam Low Sidelobe Synthesis for Arbitrary Arrays

The classical narrow main beam and low sidelobe synthesis problem is addressed and extended to arbitrary sidelobe envelopes in both one and two dimensional scenarios. The proposed approach allows also to handle arbitrary arrays. This extended basic synthesis problem is first rewritten as a convex op...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on antennas and propagation Vol. 58; no. 6; pp. 2130 - 2135
Main Authors Fuchs, Benjamin, Fuchs, Jean Jacques
Format Journal Article
LanguageEnglish
Published New York IEEE 01.06.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text
ISSN0018-926X
1558-2221
DOI10.1109/TAP.2010.2046863

Cover

More Information
Summary:The classical narrow main beam and low sidelobe synthesis problem is addressed and extended to arbitrary sidelobe envelopes in both one and two dimensional scenarios. The proposed approach allows also to handle arbitrary arrays. This extended basic synthesis problem is first rewritten as a convex optimization problem. This problem is then transformed into either a linear program or a second order cone program that can be solved efficiently by readily available software. The convex formulation is not strictly equivalent to the initial synthesis problem but arguments are given that establish that the obtained optimum is either identical or can be made as close as wanted to the desired one. Finally, numerical applications and a comparison with a classical solution are presented to both confirm the optimality of the solution and illustrate the potentialities of the proposed approach.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0018-926X
1558-2221
DOI:10.1109/TAP.2010.2046863