DocumentCode :
3008151
Title :
An algorithm for optimal placement of sensor elements
Author :
Lee, Youngjik ; Pillai, S. Unnikrishna
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Polytech. Univ., New York, NY, USA
fYear :
1988
fDate :
11-14 Apr 1988
Firstpage :
2674
Abstract :
The problem of finding the optimal minimum-redundancy integer locations for an array of given sensors that span a prescribed distance N, such that any missing integer i (0<i<N) is expressible as the difference of two sensor locations, is addressed; a greedy algorithm is presented. This problem is formulated from a number-theoretic point of view and the actual algorithm for optimal sensor placement is described together with a modified version which reduces the computation time and required memory storage. It is shown that these greedy algorithms are clearly suboptimal, since for a given M the maximum attainable value for N is found to be less than NM
Keywords :
radar theory; signal processing; computation time; greedy algorithm; memory storage; minimum-redundancy integer locations; optimal placement; sensor elements; Astronomy; Contracts; Costs; Direction of arrival estimation; Greedy algorithms; Radar applications; Sensor arrays; Sensor phenomena and characterization; Sonar applications; Spaceborne radar;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on
Conference_Location :
New York, NY
ISSN :
1520-6149
Type :
conf
DOI :
10.1109/ICASSP.1988.197199
Filename :
197199
Link To Document :
بازگشت