Beampattern optimisation for sub-arrayed MIMO radar for large arrays

The estimation of the direction of arrival (DOA) of signals in the far-field of an array has been an area of continued research. Recent advances in MIMO radar techniques have led to results whereby prior knowledge of the approximate target locations is used to generate arbitrary signals which are transmitted from an active array to improve DOA estimates. This would be a useful in a scenario such as target tracking. However, this neglects the complexities of the hardware required for larger arrays, and further, the amount of computation required on the transmit side alone. A sub-optimal method employing sub-arrays to reduce hardware requirements, and a low complexity algorithm to determine the optimal steering vectors for the arrays is presented and compared to the optimal full diversity transmit strategy.

[1]  Bernd Tibken,et al.  A new optimization problem for the solution of decision problems with applications to passenger occupation detection in cars , 2006, 2006 IEEE Conference on Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control.

[2]  S. Guu,et al.  On a Quadratic Optimization Problem with Equality Constraints , 1998 .

[3]  John B. Moore,et al.  A Newton-like method for solving rank constrained linear matrix inequalities , 2006, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[4]  J. R. Bar-on,et al.  Global optimization of a quadratic functional with quadratic equality constraints , 1994 .

[5]  M. Sellathurai,et al.  Resolution of two point targets using sub-arrayed MIMO radar , 2010, 2010 IEEE Radar Conference.

[6]  Stephen P. Boyd,et al.  Determinant Maximization with Linear Matrix Inequality Constraints , 1998, SIAM J. Matrix Anal. Appl..

[7]  Jian Li,et al.  Range Compression and Waveform Optimization for MIMO Radar: A CramÉr–Rao Bound Based Study , 2007, IEEE Transactions on Signal Processing.