Optimal array pattern synthesis using semidefinite programming

Authors:
Fan Wang;V. Balakrishnan;P.Y. Zhou;J.J. Chen;R. Yang;C. Frank
Affiliations:
Adv. Radio Technol., Motorola Inc., Arlington Heights, IL, USA;-;-;-;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2003

Citing 0
Cited 5

Nonlinear least-square solution to flat-top pattern synthesis using arbitrary linear array

Signal Processing
Spectral factorization for integer-interval sampled sequence and its applications in array processing

Signal Processing
Array pattern synthesis via sparse weight vector finding and convex programming

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Selective frequency invariant uniform circular broadband beamformer

EURASIP Journal on Advances in Signal Processing - Special issue on microphone array speech processing
A second-order cone bounding algorithm for robust minimum variance beamforming

Switching and Learning in Feedback Systems

Quantified Score

Hi-index	35.68

Visualization

Abstract

We present algorithms for the solution of two problems in array pattern synthesis. The first is the design of nonuniform arrays with a desired magnitude response. The second is that of robust design, i.e., design in the presence of uncertainties. Constraints such as power limitation can be addressed with both problems. The algorithms that we present are based on semidefinite programming, for which efficient software is readily available. We present examples that illustrate the effectiveness of our approach.