A Practical Diophantine Approximation for Sparse Linear Array Direction Finding

You are here: Homepage > Search

A Practical Diophantine Approximation for Sparse Linear Array Direction Finding

Sirianunpiboon, Songsri / Ly, Peter Q. C. / Elton, Stephen D.

This article presents a computationally efficient, fixed complexity algorithm for estimating the angle of arrival of a radio frequency signal that impinges on a sparse linear array of sensors. The likelihood function for the bearing estimation problem is reduced to an inhomogeneous Diophantine approximation problem involving an unknown set of integer multiples of $2\pi$. In solving for the integers, we propose a modification to the Cassels algorithm and generate an approximate linearized maximum-likelihood (ML) estimate of bearing. The number of iterations for convergence of the algorithm can be precomputed, which allows the algorithm to have fixed computational complexity. The proposed technique applies to a large class of array configurations, allowing the array configuration to be chosen to optimize estimation performance rather than to suit the algorithm. The simulation results show the performance of the proposed bearing estimation algorithm to be very close to that of ML estimation, but with a significantly reduced computational overhead.