An algorithm for near-optimal placement of sensor elements
Authors:
- S.U. PillaiSPS.U. Pillai
- Y. LeeYLY. Lee
- 1 November 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 36 (6) , 1280-1284
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.<>Keywords
This publication has 8 references indexed in Scilit:
- Array Signal Processing1989
- Nonuniform linear arrays: Graph-theoretic approach to minimum redundancyProceedings of the IEEE, 1986
- A new approach to array geometry for improved spatial spectrum estimationProceedings of the IEEE, 1985
- Notes on the Representation of 1,2, ……, N by differencesJournal of the London Mathematical Society, 1972
- Minimum-redundancy linear arraysIEEE Transactions on Antennas and Propagation, 1968
- A Note on Restricted Difference BasesJournal of the London Mathematical Society, 1963
- Note on Restricted Difference BasesJournal of the London Mathematical Society, 1957
- On the Representation of 1, 2, …, n by DifferencesJournal of the London Mathematical Society, 1956