SearcharxivSearch

arXiv subjects

J. H. McClellan

Publications and source records attributed to J. H. McClellan.

2 recordsLinked to original sources

Super-Resolution DOA Estimation for Arbitrary Array Geometries Using a Single Noisy Snapshot

We address the problem of search-free DOA estimation from a single noisy snapshot for sensor arrays of arbitrary geometry, by extending a method of gridless super-resolution beamforming to arbitrary arrays with noisy measurements. The primal atomic norm minimization problem is converted to a dual problem in which the periodic dual function is represented with a trigonometric polynomial using truncated Fourier series. The number of terms required for accurate representation depends linearly on the distance of the farthest sensor from a reference. The dual problem is then expressed as a semidefinite program and solved in polynomial time. DOA estimates are obtained via polynomial rooting followed by a LASSO based approach to remove extraneous roots arising in root finding from noisy data, and then source amplitudes are recovered by least squares. Simulations using circular and random planar arrays show high resolution DOA estimation in white and colored noise scenarios.

eess.SP

Single Snapshot Super-Resolution DOA Estimation for Arbitrary Array Geometries

We address the problem of search-free direction of arrival (DOA) estimation for sensor arrays of arbitrary geometry under the challenging conditions of a single snapshot and coherent sources. We extend a method of searchfree super-resolution beamforming, originally applicable only for uniform linear arrays, to arrays of arbitrary geometry. The infinite dimensional primal atomic norm minimization problem in continuous angle domain is converted to a dual problem. By exploiting periodicity, the dual function is then represented with a trigonometric polynomial using a truncated Fourier series. A linear rule of thumb is derived for selecting the minimum number of Fourier coefficients required for accurate polynomial representation, based on the distance of the farthest sensor from a reference point. The dual problem is then expressed as a semidefinite program and solved efficiently. Finally, the searchfree DOA estimates are obtained through polynomial rooting, and source amplitudes are recovered through least squares. Simulations using circular and random planar arrays show perfect DOA estimation in noise-free cases.

eess.SP