DocumentCode :
1443388
Title :
Bounds for sparse planar and volume arrays
Author :
Meurisse, Yann ; Delmas, Jean-Pierre
Author_Institution :
Dept. Signal et Image, Inst. Nat. des Telecommun., Evry, France
Volume :
47
Issue :
1
fYear :
2001
fDate :
1/1/2001 12:00:00 AM
Firstpage :
464
Lastpage :
468
Abstract :
This paper improves and extends bounds on the numbers of sensors, redundancies, and holes for sparse linear arrays to sparse planar and volume arrays. As an application, the efficiency of regular planar and volume arrays with redundancies but no holes is deduced. Also, examples of new redundancy and hole square arrays, found by exhaustive computer search, are given
Keywords :
array signal processing; direction-of-arrival estimation; linear antenna arrays; planar antenna arrays; search problems; DOA estimation; antenna sensors; bounds; computer search; direction of arrival estimation; efficiency; hole square arrays; redundancies; regular planar array; sensors; sparse linear arrays; sparse volume planar; Adaptive filters; Adaptive signal processing; Algorithm design and analysis; Decoding; Notice of Violation; Parameter estimation; Quantization; Rivers; Signal processing; Signal processing algorithms;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.904563
Filename :
904563
Link To Document :
بازگشت