Target Localization Accuracy Gain in MIMO Radar Based Systems

This paper presents an analysis of target localization accuracy, attainable by the use of MIMO (Multiple-Input Multiple-Output) radar systems, configured with multiple transmit and receive sensors, widely distributed over a given area. The Cramer-Rao lower bound (CRLB) for target localization accuracy is developed for both coherent and non-coherent processing. Coherent processing requires a common phase reference for all transmit and receive sensors. The CRLB is shown to be inversely proportional to the signal effective bandwidth in the non-coherent case, but is approximately inversely proportional to the carrier frequency in the coherent case. We further prove that optimization over the sensors' positions lowers the CRLB by a factor equal to the product of the number of transmitting and receiving sensors. The best linear unbiased estimator (BLUE) is derived for the MIMO target localization problem. The BLUE's utility is in providing a closed form localization estimate that facilitates the analysis of the relations between sensors locations, target location, and localization accuracy. Geometric dilution of precision (GDOP) contours are used to map the relative performance accuracy for a given layout of radars over a given geographic area.Comment: 36 pages, 5 figures, submitted to IEEE Transaction on Information Theor

Fast Implementation of Transmit Beamforming for Colocated MIMO Radar

Multiple-input Multiple-output (MIMO) radars benefit from spatial and waveform diversities to improve the performance potential. Phased array radars transmit scaled versions of a single waveform thereby limiting the transmit degrees of freedom to one. However MIMO radars transmit diverse waveforms from different transmit array elements thereby increasing the degrees of freedom to form flexible transmit beampatterns. The transmit beampattern of a colocated MIMO radar depends on the zero-lag correlation matrix of different transmit waveforms. Many solutions have been developed for designing the signal correlation matrix to achieve a desired transmit beampattern based on optimization algorithms in the literature. In this paper, a fast algorithm for designing the correlation matrix of the transmit waveforms is developed that allows the next generation radars to form flexible beampatterns in real-time. An efficient method for sidelobe control with negligible increase in mainlobe width is also presented

Target localization in MIMO radar systems

MIMO (Multiple-Input Multiple-Output) radar systems employ multiple antennas to transmit multiple waveforms and engage in joint processing of the received echoes from the target. MIMO radar has been receiving increasing attention in recent years from researchers, practitioners, and funding agencies. Elements of MIMO radar have the ability to transmit diverse waveforms ranging from independent to fully correlated. MIMO radar offers a new paradigm for signal processing research. In this dissertation, target localization accuracy performance, attainable by the use of MIMO radar systems, configured with multiple transmit and receive sensors, widely distributed over an area, are studied. The Cramer-Rao lower bound (CRLB) for target localization accuracy is developed for both coherent and noncoherent processing. The CRLB is shown to be inversely proportional to the signal effective bandwidth in the noncoherent case, but is approximately inversely proportional to the carrier frequency in the coherent case. It is shown that optimization over the sensors\u27 positions lowers the CRLB by a factor equal to the product of the number of transmitting and receiving sensors. The best linear unbiased estimator (BLUE) is derived for the MIMO target localization problem. The BLUE\u27s utility is in providing a closed-form localization estimate that facilitates the analysis of the relations between sensors locations, target location, and localization accuracy. Geometric dilution of precision (GDOP) contours are used to map the relative performance accuracy for a given layout of radars over a given geographic area. Coherent processing advantage for target localization relies on time and phase synchronization between transmitting and receiving radars. An analysis of the sensitivity of the localization performance with respect to the variance of phase synchronization error is provided by deriving the hybrid CRLB. The single target case is extended to the evaluation of multiple target localization performance. Thus far, the analysis assumes a stationary target. Study of moving target tracking capabilities is offered through the use of the Bayesian CRLB for the estimation of both target location and velocity. Centralized and decentralized tracking algorithms, inherit to distributed MIMO radar architecture, are proposed and evaluated. It is shown that communication requirements and processing load may be reduced at a relatively low performance cost

Impairments in ground moving target indicator (GMTI) radar

Radars on multiple distributed airborne or ground based moving platforms are of increasing interest, since they can be deployed in close proximity to the event under investigation and thus offer remarkable sensing opportunities. Ground moving target indicator (GMTI) detects and localizes moving targets in the presence of ground clutter and other interference sources. Space-time adaptive processing (STAP) implemented with antenna arrays has been a classical approach to clutter cancellation in airborne radar. One of the challenges with STAP is that the minimum detectable velocity (MDV) of targets is a function of the baseline of the antenna array: the larger the baseline (i.e., the narrower the beam), the lower the MDV. Unfortunately, increasing the baseline of a uniform linear array (ULA) entails a commensurate increase in the number of elements. An alternative approach to increasing the resolution of a radar, is to use a large, but sparse, random array. The proliferation of relatively inexpensive autonomous sensing vehicles, such as unmanned airborne systems, raises the question whether is it possible to carry out GMTI by distributed airborne platforms. A major obstacle to implementing distributed GMTI is the synchronization of autonomous moving sensors. For range processing, GMTI processing relies on synchronized sampling of the signals received at the array, while STAP processing requires time, frequency and phase synchronization for beamforming and interference cancellation. Distributed sensors have independent oscillators, which are naturally not synchronized and are each subject to different stochastic phase drift. Each sensor has its own local oscillator, unlike a traditional array in which all sensors are connected to the same local oscillator. Even when tuned to the same frequency, phase errors between the sensors will develop over time, due to phase instabilities. These phase errors affect a distributed STAP system. In this dissertation, a distributed STAP application in which sensors are moving autonomously is envisioned. The problems of tracking, detection for our proposed architecture are of important. The first part focuses on developing a direct tracking approach to multiple targets by distributed radar sensors. A challenging scenario of a distributed multi-input multi-output (MIMO) radar system (as shown above), in which relatively simple moving sensors send observations to a fusion center where most of the baseband processing is performed, is presented. The sensors are assumed to maintain time synchronization, but are not phase synchronized. The conventional approach to localization by distributed sensors is to estimate intermediate parameters from the received signals, for example time delay or the angle of arrival. Subsequently, these parameters are used to deduce the location and velocity of the target(s). These classical localization techniques are referred to as indirect localization. Recently, new techniques have been developed capable of estimating target location directly from signal measurements, without an intermediate estimation step. The objective is to develop a direct tracking algorithm for multiple moving targets. It is aimed to develop a direct tracking algorithm of targets state parameters using widely distributed moving sensors for multiple moving targets. Potential candidate for the tracker include Extended Kalman Filter. In the second part of the dissertation,the effect of phase noise on space-time adaptive processing in general, and spatial processing in particular is studied. A power law model is assumed for the phase noise. It is shown that a composite model with several terms is required to properly model the phase noise. It is further shown that the phase noise has almost linear trajectories. The effect of phase noise on spatial processing is analyzed. Simulation results illustrate the effect of phase noise on degrading the performance in terms of beam pattern and receiver operating characteristics. A STAP application, in which spatial processing is performed (together with Doppler processing) over a coherent processing interval, is envisioned

Sparsity based methods for target localization in multi-sensor radar

In this dissertation, several sparsity-based methods for ground moving target indicator (GMTI) radar with multiple-input multiple-output (MIMO) random arrays are proposed. MIMO random arrays are large arrays that employ multiple transmitters and receivers, the positions of the transmitters and the receivers are randomly chosen. Since the resolution of the array depends on the size of the array, MIMO random arrays obtain a high resolution. However, since the positions of the sensors are randomly chosen, the array suffers from large sidelobes which may lead to an increased false alarm probability. The number of sensors of a MIMO random array required to maintain a certain level of peak sidelobes is studied. It is shown that the number of sensors scales with the logarithm of the array aperture, in contrast with a ULA where the number of elements scales linearly with the array aperture. The problem of sparse target detection given space-time observations from MIMO random arrays is presented. The observations are obtained in the presence of Gaussian colored noise of unknown covariance matrix, but for which secondary data is available for its estimation. To solve the detection problem two sparsity-based algorithms, the MP-STAP and the MBMP-STAP algorithms are proposed that utilizes knowledge of the upper bound on the number of targets. A constant false alarm rate (CFAR) sparsity based detector that does not utilize any information on the number of targets referred to as MP-CFAR and MBMP-CFAR are also developed. A performance analysis for the new CFAR detector is also derived, the metrics used to describe the performance of the detector are the probability of false alarm and the probability of detection. A grid refinement procedure is also proposed to eliminate the need for a dense grid which would increase the computational complexity significantly. Expressions for the computational complexity of the proposed CFAR detectors are derived. It is shown that the proposed CFAR detectors outperforms the popular adaptive beamformer at a modest increase in computational complexity

Neural Networks for improved signal source enumeration and localization with unsteered antenna arrays

Direction of Arrival estimation using unsteered antenna arrays, unlike mechanically scanned or phased arrays, requires complex algorithms which perform poorly with small aperture arrays or without a large number of observations, or snapshots. In general, these algorithms compute a sample covriance matrix to obtain the direction of arrival and some require a prior estimate of the number of signal sources. Herein, artificial neural network architectures are proposed which demonstrate improved estimation of the number of signal sources, the true signal covariance matrix, and the direction of arrival. The proposed number of source estimation network demonstrates robust performance in the case of coherent signals where conventional methods fail. For covariance matrix estimation, four different network architectures are assessed and the best performing architecture achieves a 20 times improvement in performance over the sample covariance matrix. Additionally, this network can achieve comparable performance to the sample covariance matrix with 1/8-th the amount of snapshots. For direction of arrival estimation, preliminary results are provided comparing six architectures which all demonstrate high levels of accuracy and demonstrate the benefits of progressively training artificial neural networks by training on a sequence of sub- problems and extending to the network to encapsulate the entire process

Mathematical optimization and game theoretic methods for radar networks

Radar systems are undoubtedly included in the hall of the most momentous discoveries of the previous century. Although radars were initially used for ship and aircraft detection, nowadays these systems are used in highly diverse fields, expanding from civil aviation, marine navigation and air-defence to ocean surveillance, meteorology and medicine. Recent advances in signal processing and the constant development of computational capabilities led to radar systems with impressive surveillance and tracking characteristics but on the other hand the continuous growth of distributed networks made them susceptible to multisource interference. This thesis aims at addressing vulnerabilities of modern radar networks and further improving their characteristics through the design of signal processing algorithms and by utilizing convex optimization and game theoretic methods. In particular, the problems of beamforming, power allocation, jammer avoidance and uncertainty within the context of multiple-input multiple-output (MIMO) radar networks are addressed. In order to improve the beamforming performance of phased-array and MIMO radars employing two-dimensional arrays of antennas, a hybrid two-dimensional Phased-MIMO radar with fully overlapped subarrays is proposed. The work considers both adaptive (convex optimization, CAPON beamformer) and non-adaptive (conventional) beamforming techniques. The transmit, receive and overall beampatterns of the Phased-MIMO model are compared with the respective beampatterns of the phased-array and the MIMO schemes, proving that the hybrid model provides superior capabilities in beamforming. By incorporating game theoretic techniques in the radar field, various vulnerabilities and problems can be investigated. Hence, a game theoretic power allocation scheme is proposed and a Nash equilibrium analysis for a multistatic MIMO network is performed. A network of radars is considered, organized into multiple clusters, whose primary objective is to minimize their transmission power, while satisfying a certain detection criterion. Since no communication between the clusters is assumed, non-cooperative game theoretic techniques and convex optimization methods are utilized to tackle the power adaptation problem. During the proof of the existence and the uniqueness of the solution, which is also presented, important contributions on the SINR performance and the transmission power of the radars have been derived. Game theory can also been applied to mitigate jammer interference in a radar network. Hence, a competitive power allocation problem for a MIMO radar system in the presence of multiple jammers is investigated. The main objective of the radar network is to minimize the total power emitted by the radars while achieving a specific detection criterion for each of the targets-jammers, while the intelligent jammers have the ability to observe the radar transmission power and consequently decide its jamming power to maximize the interference to the radar system. In this context, convex optimization methods, noncooperative game theoretic techniques and hypothesis testing are incorporated to identify the jammers and to determine the optimal power allocation. Furthermore, a proof of the existence and the uniqueness of the solution is presented. Apart from resource allocation applications, game theory can also address distributed beamforming problems. More specifically, a distributed beamforming and power allocation technique for a radar system in the presence of multiple targets is considered. The primary goal of each radar is to minimize its transmission power while attaining an optimal beamforming strategy and satisfying a certain detection criterion for each of the targets. Initially, a strategic noncooperative game (SNG) is used, where there is no communication between the various radars of the system. Subsequently, a more coordinated game theoretic approach incorporating a pricing mechanism is adopted. Furthermore, a Stackelberg game is formulated by adding a surveillance radar to the system model, which will play the role of the leader, and thus the remaining radars will be the followers. For each one of these games, a proof of the existence and uniqueness of the solution is presented. In the aforementioned game theoretic applications, the radars are considered to know the exact radar cross section (RCS) parameters of the targets and thus the exact channel gains of all players, which may not be feasible in a real system. Therefore, in the last part of this thesis, uncertainty regarding the channel gains among the radars and the targets is introduced, which originates from the RCS fluctuations of the targets. Bayesian game theory provides a framework to address such problems of incomplete information. Hence, a Bayesian game is proposed, where each radar egotistically maximizes its SINR, under a predefined power constraint