Improving beampatterns of two-dimensional random arrays using convex optimization
Author(s) -
Peter Gerstoft,
William S. Hodgkiss
Publication year - 2011
Publication title -
the journal of the acoustical society of america
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.619
H-Index - 187
eISSN - 1520-8524
pISSN - 0001-4966
DOI - 10.1121/1.3556896
Subject(s) - beamforming , computer science , convex optimization , regular polygon , power (physics) , frequency domain , domain (mathematical analysis) , optimization problem , computational complexity theory , algorithm , mathematical optimization , mathematics , physics , telecommunications , mathematical analysis , geometry , quantum mechanics , computer vision
Sensors are becoming ubiquitous and can be combined in arrays for source localization purposes. If classical conventional beamforming is used, then random arrays have poor beampatterns. By pre-computing sensor weights, these beampatterns can be improved significantly. The problem is formulated in the frequency domain as a desired look direction, a frequency-independent transition region, and the power minimized in a rejection-region. Using this formulation, the frequency-dependent sensor weights can be obtained using convex optimization. Since the weights are data independent they can be pre-computed, the beamforming has similar computational complexity as conventional beamforming. The approach is demonstrated for real 2D arrays.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom