Beyond the spatio-temporal limits of atmospheric radars: inverse problem techniques and MIMO systems

The Earth’s upper atmosphere (UA) is a highly dynamic region dominated by atmospheric waves and stratified turbulence covering a wide range of spatio-temporal scales. A comprehensive study of the UA requires measurements over a broad range of frequencies and spatial wavelengths, which are prohibitively costly. To improve the understanding of the UA, an investment in efficient and large observational infrastructures is required. This work investigates remote sensing techniques based on MIMO and inverse problems techniques to improve the capabilities of current atmospheric radars

The University Defence Research Collaboration In Signal Processing

This chapter describes the development of algorithms for automatic detection of anomalies from multi-dimensional, undersampled and incomplete datasets. The challenge in this work is to identify and classify behaviours as normal or abnormal, safe or threatening, from an irregular and often heterogeneous sensor network. Many defence and civilian applications can be modelled as complex networks of interconnected nodes with unknown or uncertain spatio-temporal relations. The behavior of such heterogeneous networks can exhibit dynamic properties, reflecting evolution in both network structure (new nodes appearing and existing nodes disappearing), as well as inter-node relations. The UDRC work has addressed not only the detection of anomalies, but also the identification of their nature and their statistical characteristics. Normal patterns and changes in behavior have been incorporated to provide an acceptable balance between true positive rate, false positive rate, performance and computational cost. Data quality measures have been used to ensure the models of normality are not corrupted by unreliable and ambiguous data. The context for the activity of each node in complex networks offers an even more efficient anomaly detection mechanism. This has allowed the development of efficient approaches which not only detect anomalies but which also go on to classify their behaviour

OFDM passive radar employing compressive processing in MIMO configurations

A key advantage of passive radar is that it provides a means of performing position detection and tracking without the need for transmission of energy pulses. In this respect, passive radar systems utilising (receiving) orthogonal frequency division multiplexing (OFDM) communications signals from transmitters using OFDM standards such as long term evolution (LTE), WiMax or WiFi, are considered. Receiving a stronger reference signal for the matched filtering, detecting a lower target signature is one of the challenges in the passive radar. Impinging at the receiver, the OFDM waveforms supply two-dimensional virtual uniform rectangul ararray with the first and second dimensions refer to time delays and Doppler frequencies respectively. A subspace method, multiple signals classification (MUSIC) algorithm, demonstrated the signal extraction using multiple time samples. Apply normal measurements, this problem requires high computational resources regarding the number of OFDM subcarriers. For sub-Nyquist sampling, compressive sensing (CS) becomes attractive. A single snap shot measurement can be applied with Basis Pursuit (BP), whereas l1-singular value decomposition (l1-SVD) is applied for the multiple snapshots. Employing multiple transmitters, the diversity in the detection process can be achieved. While a passive means of attaining three-dimensional large-set measurements is provided by co-located receivers, there is a significant computational burden in terms of the on-line analysis of such data sets. In this thesis, the passive radar problem is presented as a mathematically sparse problem and interesting solutions, BP and l1-SVD as well as Bayesian compressive sensing, fast-Besselk, are considered. To increase the possibility of target signal detection, beamforming in the compressive domain is also introduced with the application of conve xoptimization and subspace orthogonality. An interference study is also another problem when reconstructing the target signal. The networks of passive radars are employed using stochastic geometry in order to understand the characteristics of interference, and the effect of signal to interference plus noise ratio (SINR). The results demonstrate the outstanding performance of l1-SVD over MUSIC when employing multiple snapshots. The single snapshot problem along with fast-BesselK multiple-input multiple-output configuration can be solved using fast-BesselK and this allows the compressive beamforming for detection capability

Source localization via time difference of arrival

Accurate localization of a signal source, based on the signals collected by a number of receiving sensors deployed in the source surrounding area is a problem of interest in various fields. This dissertation aims at exploring different techniques to improve the localization accuracy of non-cooperative sources, i.e., sources for which the specific transmitted symbols and the time of the transmitted signal are unknown to the receiving sensors. With the localization of non-cooperative sources, time difference of arrival (TDOA) of the signals received at pairs of sensors is typically employed. A two-stage localization method in multipath environments is proposed. During the first stage, TDOA of the signals received at pairs of sensors is estimated. In the second stage, the actual location is computed from the TDOA estimates. This later stage is referred to as hyperbolic localization and it generally involves a non-convex optimization. For the first stage, a TDOA estimation method that exploits the sparsity of multipath channels is proposed. This is formulated as an f1-regularization problem, where the f1-norm is used as channel sparsity constraint. For the second stage, three methods are proposed to offer high accuracy at different computational costs. The first method takes a semi-definite relaxation (SDR) approach to relax the hyperbolic localization to a convex optimization. The second method follows a linearized formulation of the problem and seeks a biased estimate of improved accuracy. A third method is proposed to exploit the source sparsity. With this, the hyperbolic localization is formulated as an an f1-regularization problem, where the f1-norm is used as source sparsity constraint. The proposed methods compare favorably to other existing methods, each of them having its own advantages. The SDR method has the advantage of simplicity and low computational cost. The second method may perform better than the SDR approach in some situations, but at the price of higher computational cost. The l1-regularization may outperform the first two methods, but is sensitive to the choice of a regularization parameter. The proposed two-stage localization approach is shown to deliver higher accuracy and robustness to noise, compared to existing TDOA localization methods. A single-stage source localization method is explored. The approach is coherent in the sense that, in addition to the TDOA information, it utilizes the relative carrier phases of the received signals among pairs of sensors. A location estimator is constructed based on a maximum likelihood metric. The potential of accuracy improvement by the coherent approach is shown through the Cramer Rao lower bound (CRB). However, the technique has to contend with high peak sidelobes in the localization metric, especially at low signal-to-noise ratio (SNR). Employing a small antenna array at each sensor is shown to lower the sidelobes level in the localization metric. Finally, the performance of time delay and amplitude estimation from samples of the received signal taken at rates lower than the conventional Nyquist rate is evaluated. To this end, a CRB is developed and its variation with system parameters is analyzed. It is shown that while with noiseless low rate sampling there is no estimation accuracy loss compared to Nyquist sampling, in the presence of additive noise the performance degrades significantly. However, increasing the low sampling rate by a small factor leads to significant performance improvement, especially for time delay estimation