An algorithm for near-optimal placement of sensor elements

David Pearson, Unnikrishna Pillai, Youngjik Lee

Research output: Contribution to journalArticle

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, 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 - 1)/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. 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

Fingerprint

Sensors
redundancy
Direction of arrival
Redundancy
ability
performance

ASJC Scopus subject areas

  • Information Systems
  • Electrical and Electronic Engineering

Cite this

An algorithm for near-optimal placement of sensor elements. / Pearson, David; Pillai, Unnikrishna; Lee, Youngjik.

In: IEEE Transactions on Information Theory, Vol. 36, No. 6, 11.1990, p. 1280-1284.

Research output: Contribution to journalArticle

@article{90c4e54c0c60499baba3c557524bf973,
title = "An algorithm for near-optimal placement of sensor elements",
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, 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 - 1)/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. New upper bounds for the ratio of the square of the minimum number of elements to the spanning distance are also established.",
author = "David Pearson and Unnikrishna Pillai and Youngjik Lee",
year = "1990",
month = "11",
doi = "10.1109/18.59928",
language = "English (US)",
volume = "36",
pages = "1280--1284",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - An algorithm for near-optimal placement of sensor elements

AU - Pearson, David

AU - Pillai, Unnikrishna

AU - Lee, Youngjik

PY - 1990/11

Y1 - 1990/11

N2 - 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, 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 - 1)/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. New upper bounds for the ratio of the square of the minimum number of elements to the spanning distance are also established.

AB - 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, 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 - 1)/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. New upper bounds for the ratio of the square of the minimum number of elements to the spanning distance are also established.

UR - http://www.scopus.com/inward/record.url?scp=0025521224&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025521224&partnerID=8YFLogxK

U2 - 10.1109/18.59928

DO - 10.1109/18.59928

M3 - Article

AN - SCOPUS:0025521224

VL - 36

SP - 1280

EP - 1284

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -