CaltechAUTHORS
  A Caltech Library Service

Optimizing Minimum Redundancy Arrays for Robustness

Liu, Chun-Lin and Vaidyanathan, P. P. (2018) Optimizing Minimum Redundancy Arrays for Robustness. In: 52nd Asilomar Conference on Signals, Systems, and Computers. IEEE , Piscataway, NJ, pp. 79-83. ISBN 978-1-5386-9218-9. http://resolver.caltech.edu/CaltechAUTHORS:20190301-153800720

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20190301-153800720

Abstract

Sparse arrays have received considerable attention due to their capability of resolving O(N^2)uncorrelated sources with N physical sensors, unlike the uniform linear array (ULA) which identifies at most N−1 sources. This is because sparse arrays have an O(N^2)−long ULA segment in the difference coarray, defined as the set of differences between sensor locations. Among the existing array configurations, minimum redundancy arrays (MRA) have the largest ULA segment in the difference coarray with no holes. However, in practice, ULA is robust, in the sense of coarray invariance to sensor failure, but MRA is not. This paper proposes a novel array geometry, named as the robust MRA (RMRA), that maximizes the size of the hole-free difference coarray subject to the same level of robustness as ULA. The RMRA can be found by solving an integer program, which is computationally expensive. Even so, it will be shown that the RMRA still owns O(N^2) elements in the hole-free difference coarray. In particular, for sufficiently large N, the aperture for RMRA, which is approximately half of the size of the difference coarray, is bounded between 0.0625N^2 and 0.2174N^2.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ACSSC.2018.8645482DOIArticle
https://ieeexplore.ieee.org/document/8645482PublisherArticle
ORCID:
AuthorORCID
Vaidyanathan, P. P.0000-0003-3003-7042
Additional Information:© 2018 IEEE. This work was supported in parts by the ONR grants N00014-17-1-2732 and N00014-18-1-2390, the NSF grant CCF-1712633, the California Institute of Technology, the Ministry of Education, Taiwan, R.O.C, under Yushan Young Scholar Program (Grant No. NTU-107V0902), and National Taiwan University.
Funders:
Funding AgencyGrant Number
Office of Naval Research (ONR)N00014-17-1-2732
Office of Naval Research (ONR)N00014-18-1-2390
NSFCCF-1712633
CaltechUNSPECIFIED
Ministry of Education (Taipei)NTU-107V0902
National Taiwan UniversityUNSPECIFIED
Subject Keywords:Sparse arrays, minimum redundancy arrays, difference coarray, robustness, fragility
Record Number:CaltechAUTHORS:20190301-153800720
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:20190301-153800720
Official Citation:C. Liu and P. P. Vaidyanathan, "Optimizing Minimum Redundancy Arrays for Robustness," 2018 52nd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, 2018, pp. 79-83. doi: 10.1109/ACSSC.2018.8645482
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:93404
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:01 Mar 2019 23:44
Last Modified:01 Mar 2019 23:44

Repository Staff Only: item control page