Cramer-Rao bound approach to super-resolution array design

This paper is concerned with the design of super-resolution Direction Finding (DF) arrays that satisfy prespecified Cramer-Rao Bounds (CRB) on error variance. The sensor placement problem is formulated in the framework of subspace-based DF techniques and a novel approach to the design problem, based on the concept of the CRB, is proposed. This is constructed using the prespecified performance levels that yield the sensor locations of the desired array.

[1]  I. Introductiok,et al.  A Mathematical Theory of Antenna Arrays with Randomly Spaced Elements , 1963 .

[2]  Vittorio Murino,et al.  Simulated annealing approach for the design of unequally spaced arrays , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.

[3]  G. Nemhauser,et al.  Dynamic programming applied to unequally spaced arrays , 1964 .

[4]  James P. Reilly,et al.  Optimal design of linear array of sensors , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.

[5]  Randy L. Haupt,et al.  Thinned arrays using genetic algorithms , 1993, Proceedings of IEEE Antennas and Propagation Society International Symposium.

[6]  Hamid Reza Karimi,et al.  Comparison of the ultimate direction-finding capabilities of a number of planar array geometries , 1997 .

[7]  R. Leahy,et al.  On the design of maximally sparse beamforming arrays , 1991 .

[8]  Ralph Otto Schmidt,et al.  A signal subspace approach to multiple emitter location and spectral estimation , 1981 .