Large array beamforming via semidefinite programming

H.G. Hoang, H.D. Tuan, Ba-Ngu Vo

    Research output: Chapter in Book/Conference paperConference paper

    Abstract

    Bounding the sidelobe and mainlobe levels of an array with complex weights is attractive in that it allows direct control of the radiation pattern. In this paper we propose an efficient beamforming technique for synthesizing the patterns of large arrays with bound constraints on the sidelobe and mainlobe levels. It is shown that the pattern synthesis problem can be posed as a convex semi-infinite programme (SIP) which is then turned into a semidefinite programme (SDP) via a novel linear matrix inequality (LMI) characterization of semi-infinite trigonometric polynomial constraints. In contrast to existing SDP formulations which require a large number of additional variables, our SDP representation only uses a minimal number of additional variables. This subsequently enables the design of patterns for arrays with several hundred elements to be efficiently achieved on a standard personal computer using existing SDP solvers.
    Original languageEnglish
    Title of host publication2006 IEEE International Symposium on Signal Processing and Information Technology, Vols 1 and 2
    Place of PublicationPicastaway, NJ, USA
    Pages857-862
    Volume1
    DOIs
    Publication statusPublished - 2006
    Event2006 IEEE International Symposium on Signal Processing and Information Technology - Vancouver, Canada
    Duration: 27 Aug 200630 Aug 2006

    Conference

    Conference2006 IEEE International Symposium on Signal Processing and Information Technology
    Country/TerritoryCanada
    CityVancouver
    Period27/08/0630/08/06

    Fingerprint

    Dive into the research topics of 'Large array beamforming via semidefinite programming'. Together they form a unique fingerprint.

    Cite this