By Topic

Convex optimization based beam-space preprocessing with improved robustness against out-of-sector sources

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

4 Author(s)
Hassanien, A. ; Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, Ont., Canada ; Elkader, S.A. ; Gershman, A.B. ; Kon Max Wong

Beam-space data preprocessing is a powerful tool commonly used in array processing to reduce the computational burden and improve the performance of high-resolution direction-finding algorithms. However, currently used beam-space techniques appear to lack robustness in the presence of sources that are located outside the beam-space angular sectors-of-interest. In this paper, a new approach to beam-space preprocessing with an improved robustness against such out-of-sector interfering sources is developed. Our techniques design the beam-space matrix filter based on proper tradeoffs between the in-sector (passband) source distortion and out-of-sector (stopband) source attenuation. Computationally efficient convex formulations for these beam-space matrix filter design problems are derived using second-order cone (SOC) programming.

Published in:

Signal Processing, IEEE Transactions on  (Volume:54 ,  Issue: 5 )