Robustness of Coarrays of Sparse Arrays to Sensor Failures
Chun-Lin Liu, P. P. Vaidyanathan
Abstract
Sparse arrays can identify O(N <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) uncorrelated sources using N physical sensors. This property is because the difference coarray, defined as the differences between sensor locations, has uniform linear array (ULA) segments of length O(N <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ). It is empirically known that, for sparse arrays like minimum redundancy arrays, nested arrays, and coprime arrays, this O(N <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) segment is susceptible to sensor failure, which is an important issue in practical systems. This paper presents the (k-)essentialness property, which characterizes the combinations of the failing sensors that shrink the difference coarray. Based on this, the notion of fragility is proposed to quantify the reliability of sparse arrays with faulty sensors, along with comprehensive studies of their properties. It is demonstrated through examples that there do exist sparse arrays that are as robust as ULA and at the same time, they enjoy O(N <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) consecutive elements in the difference coarray.
BibTeX
@inproceedings{icassp2018_robustnessofcoar,
title = {Robustness of Coarrays of Sparse Arrays to Sensor Failures},
author = {Chun-Lin Liu and P. P. Vaidyanathan},
booktitle = {ICASSP 2018},
year = {2018}
}