Mathematical optimization techniques for cognitive radar networks

This thesis discusses mathematical optimization techniques for waveform design in cognitive radars. These techniques have been designed with an increasing level of sophistication, starting from a bistatic model (i.e. two transmitters and a single receiver) and ending with a cognitive network (i.e. multiple transmitting and multiple receiving radars). The environment under investigation always features strong signal-dependent clutter and noise. All algorithms are based on an iterative waveform-filter optimization. The waveform optimization is based on convex optimization techniques and the exploitation of initial radar waveforms characterized by desired auto and cross-correlation properties. Finally, robust optimization techniques are introduced to account for the assumptions made by cognitive radars on certain second order statistics such as the covariance matrix of the clutter. More specifically, initial optimization techniques were proposed for the case of bistatic radars. By maximizing the signal to interference and noise ratio (SINR) under certain constraints on the transmitted signals, it was possible to iteratively optimize both the orthogonal transmission waveforms and the receiver filter. Subsequently, the above work was extended to a convex optimization framework for a waveform design technique for bistatic radars where both radars transmit and receive to detect targets. The method exploited prior knowledge of the environment to maximize the accumulated target return signal power while keeping the disturbance power to unity at both radar receivers. The thesis further proposes convex optimization based waveform designs for multiple input multiple output (MIMO) based cognitive radars. All radars within the system are able to both transmit and receive signals for detecting targets. The proposed model investigated two complementary optimization techniques. The first one aims at optimizing the signal to interference and noise ratio (SINR) of a specific radar while keeping the SINR of the remaining radars at desired levels. The second approach optimizes the SINR of all radars using a max-min optimization criterion. To account for possible mismatches between actual parameters and estimated ones, this thesis includes robust optimization techniques. Initially, the multistatic, signal-dependent model was tested against existing worst-case and probabilistic methods. These methods appeared to be over conservative and generic for the considered signal-dependent clutter scenario. Therefore a new approach was derived where uncertainty was assumed directly on the radar cross-section and Doppler parameters of the clutters. Approximations based on Taylor series were invoked to make the optimization problem convex and {subsequently} determine robust waveforms with specific SINR outage constraints. Finally, this thesis introduces robust optimization techniques for through-the-wall radars. These are also cognitive but rely on different optimization techniques than the ones previously discussed. By noticing the similarities between the minimum variance distortionless response (MVDR) problem and the matched-illumination one, this thesis introduces robust optimization techniques that consider uncertainty on environment-related parameters. Various performance analyses demonstrate the effectiveness of all the above algorithms in providing a significant increase in SINR in an environment affected by very strong clutter and noise

Target localization in passive and active systems : performance bonds

The main goal of this dissertation is to improve the understanding and to develop ways to predict the performance of localization techniques as a function of signal-to-noise ratio (SNR) and of system parameters. To this end, lower bounds on the maximum likelihood estimator (MLE) performance are studied. The Cramer-Rao lower bound (CRLB) for coherent passive localization of a near-field source is derived. It is shown through the Cramer-Rao bound that, the coherent localization systems can provide high accuracies in localization, to the order of carrier frequency of the observed signal. High accuracies come to a price of having a highly multimodal estimation metric which can lead to sidelobes competing with the mainlobe and engendering ambiguity in the selection of the correct peak. The effect of the sidelobes over the estimator performance at different SNR levels is analyzed and predicted with the use of Ziv-Zakai lower bound (ZZB). Through simulations it is shown that ZZB is tight to the MLEs performance over the whole SNR range. Moreover, the ZZB is a convenient tool to assess the coherent localization performance as a function of various system parameters. The ZZB was also used to derive a lower bound on the MSE of estimating the range and the range rate of a target in active systems. From the expression of the derived lower bound it was noted that, the ZZB is determined by SNR and by the ambiguity function (AF). Thus, the ZZB can serve as an alternative to the ambiguity function (AF) as a tool for radar design. Furthermore, the derivation is extended to the problem of estimating target’s location and velocity in a distributed multiple input multiple output (MIMO) radar system. The derived bound is determined by SNR, by the product between the number of transmitting antennas and the number of receiving antennas from the radar system, and by all the ambiguity functions and the cross-ambiguity functions corresponding to all pairs transmitter-target-receiver. Similar to the coherent localization, the ZZB can be applied to study the performance of the estimator as a function of different system parameters. Comparison between the ZZB and the MSE of the MLE obtained through simulations demonstrate that the bound is tight in all SNR regions

Spatial Compressive Sensing for MIMO Radar

We study compressive sensing in the spatial domain to achieve target localization, specifically direction of arrival (DOA), using multiple-input multiple-output (MIMO) radar. A sparse localization framework is proposed for a MIMO array in which transmit and receive elements are placed at random. This allows for a dramatic reduction in the number of elements needed, while still attaining performance comparable to that of a filled (Nyquist) array. By leveraging properties of structured random matrices, we develop a bound on the coherence of the resulting measurement matrix, and obtain conditions under which the measurement matrix satisfies the so-called isotropy property. The coherence and isotropy concepts are used to establish uniform and non-uniform recovery guarantees within the proposed spatial compressive sensing framework. In particular, we show that non-uniform recovery is guaranteed if the product of the number of transmit and receive elements, MN (which is also the number of degrees of freedom), scales with K(log(G))^2, where K is the number of targets and G is proportional to the array aperture and determines the angle resolution. In contrast with a filled virtual MIMO array where the product MN scales linearly with G, the logarithmic dependence on G in the proposed framework supports the high-resolution provided by the virtual array aperture while using a small number of MIMO radar elements. In the numerical results we show that, in the proposed framework, compressive sensing recovery algorithms are capable of better performance than classical methods, such as beamforming and MUSIC.Comment: To appear in IEEE Transactions on Signal Processin

Scientific applications of radio and radar tracking in the space program Conference proceedings

Radar and radio tracking applications in space progra

Blind Estimation of Multiple Carrier Frequency Offsets

Multiple carrier-frequency offsets (CFO) arise in a distributed antenna system, where data are transmitted simultaneously from multiple antennas. In such systems the received signal contains multiple CFOs due to mismatch between the local oscillators of transmitters and receiver. This results in a time-varying rotation of the data constellation, which needs to be compensated for at the receiver before symbol recovery. This paper proposes a new approach for blind CFO estimation and symbol recovery. The received base-band signal is over-sampled, and its polyphase components are used to formulate a virtual Multiple-Input Multiple-Output (MIMO) problem. By applying blind MIMO system estimation techniques, the system response is estimated and used to subsequently transform the multiple CFOs estimation problem into many independent single CFO estimation problems. Furthermore, an initial estimate of the CFO is obtained from the phase of the MIMO system response. The Cramer-Rao Lower bound is also derived, and the large sample performance of the proposed estimator is compared to the bound.Comment: To appear in the Proceedings of the 18th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), Athens, Greece, September 3-7, 200

Development and Evaluation of a Multistatic Ultrawideband Random Noise Radar

This research studies the AFIT noise network (NoNET) radar node design and the feasibility in processing the bistatic channel information of a cluster of widely distributed noise radar nodes. A system characterization is used to predict theoretical localization performance metrics. Design and integration of a distributed and central signal and data processing architecture enables the Matlab®-driven signal data acquisition, digital processing and multi-sensor image fusion. Experimental evaluation of the monostatic localization performance reveals its range measurement error standard deviation is 4.8 cm with a range resolution of 87.2(±5.9) cm. The 16-channel multistatic solution results in a 2-dimensional localization error of 7.7(±3.1) cm and a comparative analysis is performed against the netted monostatic solution. Results show that active sensing with a low probability of intercept (LPI) multistatic radar, like the NoNET, is capable of producing sub-meter accuracy and near meter-resolution imagery