An Algorithm for Near-Optimal Placement of Sensor Elements

David Pearson, S. Unnikrishna Pillai, Youngjik Lee

Research output: Contribution to journalArticlepeer-review

Abstract

An important question in array design is that of where to place the elements of a sparse array for optimal performance in terms of its ability to detect and resolve a greater number of sources than conventionally possible. In particular, it has been shown that when sensor elements are arranged in the minimum redundancy fashion [1], by performing an augmentation technique on the covariances obtained from the array outputs, an M element array can be made to estimate the directions of arrival of as many as M(M — l)/2 uncorrelated sources unambiguously. Constructive procedures are developed to evaluate integer locations for an array of given sensors that span a prescribed distance, such that any missing integer is expressible as the difference of two sensor locations. Further, new upper bounds for the ratio of the square of the minimum number of elements to the spanning distance are also established.

Original languageEnglish (US)
Pages (from-to)1280-1284
Number of pages5
JournalIEEE Transactions on Information Theory
Volume36
Issue number6
DOIs
StatePublished - Nov 1990

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'An Algorithm for Near-Optimal Placement of Sensor Elements'. Together they form a unique fingerprint.

Cite this