Bounds for sparse planar and volume arrays

Citation
Y. Meurisse et Jp. Delmas, Bounds for sparse planar and volume arrays, IEEE INFO T, 47(1), 2001, pp. 464-468
Citations number
11
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
47
Issue
1
Year of publication
2001
Pages
464 - 468
Database
ISI
SICI code
0018-9448(200101)47:1<464:BFSPAV>2.0.ZU;2-6
Abstract
This correspondence improves and extends bounds on the numbers of sensors, redundancies, and holes for sparse linear arrays to sparse planar and volum e arrays. As an application, the efficiency of regular planar and volume ar rays with redundancies but no holes is deduced. Also, examples of new redun dancy and hole square arrays, found by exhaustive computer search, are give n.