Home
Scholarly Works
Improving the Robustness of the Rare Algorithm...
Conference

Improving the Robustness of the Rare Algorithm Against Subarray Orientation Errors

Abstract

We study the problem of direction-of-arrival (DOA) estimation using partly calibrated arrays composed of multiple subarrays with unknown inter-subarray parameters and imperfectly known subarray orientations. The recently developed spectral and root variants of the rank reduction estimator (RARE) can handle scenarios where no calibration between subarrays is available but, un-fortunately, they are very sensitive to subarray orientation errors. Therefore, conventional RARE can be applied to such partly calibrated arrays only if all subarray misorientations are negligibly small. In this paper, we develop a new modification of RARE which improves its robustness against subarray misorientations. The performance of the proposed robust RARE algorithm is demonstrated to be close to the stochastic Cramer-Rae bound (CRB) of the considered estimation problem.

Authors

Elkader SA; Gershman AB; Wong KM

Volume

2

Pagination

pp. 241-244

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Publication Date

January 1, 2004

DOI

10.1109/icassp.2004.1326239

Name of conference

2004 IEEE International Conference on Acoustics, Speech, and Signal Processing

Labels

View published work (Non-McMaster Users)

Contact the Experts team