Target parameter estimation for spatial and temporal formulations in MIMO radars using compressive sensing

Conventional algorithms used for parameter estimation in colocated multiple-input-multiple-output (MIMO) radars require the inversion of the covariance matrix of the received spatial samples. In these algorithms, the number of received snapshots should be at least equal to the size of the covariance matrix. For large size MIMO antenna arrays, the inversion of the covariance matrix becomes computationally very expensive. Compressive sensing (CS) algorithms which do not require the inversion of the complete covariance matrix can be used for parameter estimation with fewer number of received snapshots. In this work, it is shown that the spatial formulation is best suitable for large MIMO arrays when CS algorithms are used. A temporal formulation is proposed which fits the CS algorithms framework, especially for small size MIMO arrays. A recently proposed low-complexity CS algorithm named support agnostic Bayesian matching pursuit (SABMP) is used to estimate target parameters for both spatial and temporal formulations for the unknown number of targets. The simulation results show the advantage of SABMP algorithm utilizing low number of snapshots and better parameter estimation for both small and large number of antenna elements. Moreover, it is shown by simulations that SABMP is more effective than other existing algorithms at high signal-to-noise ratio

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

Global optimization methods for localization in compressive sensing

The dissertation discusses compressive sensing and its applications to localization in multiple-input multiple-output (MIMO) radars. Compressive sensing is a paradigm at the intersection between signal processing and optimization. It advocates the sensing of “sparse” signals (i.e., represented using just a few terms from a basis expansion) by using a sampling rate much lower than that required by the Nyquist-Shannon sampling theorem (i.e., twice the highest frequency present in the signal of interest). Low-rate sampling reduces implementation’s constraints and translates into cost savings due to fewer measurements required. This is particularly true in localization applications when the number of measurements is commensurate to antenna elements. The theory of compressive sensing provides precise guidance on how the measurements should be acquired, and which optimization algorithm should be used for signal recovery. The first part of the dissertation addresses the application of compressive sensing for localization in the spatial domain, specifically direction of arrival (DOA), using 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, a bound on the coherence of the resulting measurement matrix is obtained, and conditions under which the measurement matrix satisfies the so-called isotropy property are detailed. The coherence and isotropy concepts are used to establish uniform and non-uniform recovery guarantees within the proposed spatial compressive sensing framework. In particular, it is shown 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. The second part of the dissertation focuses on the sparse recovery problem at the heart of compressive sensing. An algorithm, dubbed Multi-Branch Matching Pursuit (MBMP), is presented which combines three different paradigms: being a greedy method, it performs iterative signal support estimation; as a rank-aware method, it is able to exploit signal subspace information when multiple snapshots are available; and, as its name foretells, it possesses a multi-branch structure which allows it to trade-off performance (e.g., measurements) for computational complexity. A sufficient condition under which MBMP can recover a sparse signal is obtained. This condition, named MB-coherence, is met when the columns of the measurement matrix are sufficiently “incoherent” and when the signal-to-noise ratio is sufficiently high. The condition shows that successful recovery with MBMP is guaranteed for dictionaries which do not satisfy previously known conditions (e.g., coherence, cumulative coherence, or the Hanman relaxed coherence). Finally, by leveraging the MBMP algorithm, a framework for target detection from a set of compressive sensing radar measurements is established. The proposed framework does not require any prior information about the targets’ scene, and it is competitive with respect to state-of-the-art detection compressive sensing algorithms

Orthogonal frequency division multiplexing multiple-input multiple-output automotive radar with novel signal processing algorithms

Advanced driver assistance systems that actively assist the driver based on environment perception achieved significant advances in recent years. Along with this development, autonomous driving became a major research topic that aims ultimately at development of fully automated, driverless vehicles. Since such applications rely on environment perception, their ever increasing sophistication imposes growing demands on environmental sensors. Specifically, the need for reliable environment sensing necessitates the development of more sophisticated, high-performance radar sensors. A further vital challenge in terms of increased radar interference arises with the growing market penetration of the vehicular radar technology. To address these challenges, in many respects novel approaches and radar concepts are required. As the modulation is one of the key factors determining the radar performance, the research of new modulation schemes for automotive radar becomes essential. A topic that emerged in the last years is the radar operating with digitally generated waveforms based on orthogonal frequency division multiplexing (OFDM). Initially, the use of OFDM for radar was motivated by the combination of radar with communication via modulation of the radar waveform with communication data. Some subsequent works studied the use of OFDM as a modulation scheme in many different radar applications - from adaptive radar processing to synthetic aperture radar. This suggests that the flexibility provided by OFDM based digital generation of radar waveforms can potentially enable novel radar concepts that are well suited for future automotive radar systems. This thesis aims to explore the perspectives of OFDM as a modulation scheme for high-performance, robust and adaptive automotive radar. To this end, novel signal processing algorithms and OFDM based radar concepts are introduced in this work. The main focus of the thesis is on high-end automotive radar applications, while the applicability for real time implementation is of primary concern. The first part of this thesis focuses on signal processing algorithms for distance-velocity estimation. As a foundation for the algorithms presented in this thesis, a novel and rigorous signal model for OFDM radar is introduced. Based on this signal model, the limitations of the state-of-the-art OFDM radar signal processing are pointed out. To overcome these limitations, we propose two novel signal processing algorithms that build upon the conventional processing and extend it by more sophisticated modeling of the radar signal. The first method named all-cell Doppler compensation (ACDC) overcomes the Doppler sensitivity problem of OFDM radar. The core idea of this algorithm is the scenario-independent correction of Doppler shifts for the entire measurement signal. Since Doppler effect is a major concern for OFDM radar and influences the radar parametrization, its complete compensation opens new perspectives for OFDM radar. It not only achieves an improved, Doppler-independent performance, it also enables more favorable system parametrization. The second distance-velocity estimation algorithm introduced in this thesis addresses the issue of range and Doppler frequency migration due to the target’s motion during the measurement. For the conventional radar signal processing, these migration effects set an upper limit on the simultaneously achievable distance and velocity resolution. The proposed method named all-cell migration compensation (ACMC) extends the underlying OFDM radar signal model to account for the target motion. As a result, the effect of migration is compensated implicitly for the entire radar measurement, which leads to an improved distance and velocity resolution. Simulations show the effectiveness of the proposed algorithms in overcoming the two major limitations of the conventional OFDM radar signal processing. As multiple-input multiple-output (MIMO) radar is a well-established technology for improving the direction-of-arrival (DOA) estimation, the second part of this work studies the multiplexing methods for OFDM radar that enable simultaneous use of multiple transmit antennas for MIMO radar processing. After discussing the drawbacks of known multiplexing methods, we introduce two advanced multiplexing schemes for OFDM-MIMO radar based on non-equidistant interleaving of OFDM subcarriers. These multiplexing approaches exploit the multicarrier structure of OFDM for generation of orthogonal waveforms that enable a simultaneous operation of multiple MIMO channels occupying the same bandwidth. The primary advantage of these methods is that despite multiplexing they maintain all original radar parameters (resolution and unambiguous range in distance and velocity) for each individual MIMO channel. To obtain favorable interleaving patterns with low sidelobes, we propose an optimization approach based on genetic algorithms. Furthermore, to overcome the drawback of increased sidelobes due to subcarrier interleaving, we study the applicability of sparse processing methods for the distance-velocity estimation from measurements of non-equidistantly interleaved OFDM-MIMO radar. We introduce a novel sparsity based frequency estimation algorithm designed for this purpose. The third topic addressed in this work is the robustness of OFDM radar to interference from other radar sensors. In this part of the work we study the interference robustness of OFDM radar and propose novel interference mitigation techniques. The first interference suppression algorithm we introduce exploits the robustness of OFDM to narrowband interference by dropping subcarriers strongly corrupted by interference from evaluation. To avoid increase of sidelobes due to missing subcarriers, their values are reconstructed from the neighboring ones based on linear prediction methods. As a further measure for increasing the interference robustness in a more universal manner, we propose the extension of OFDM radar with cognitive features. We introduce the general concept of cognitive radar that is capable of adapting to the current spectral situation for avoiding interference. Our work focuses mainly on waveform adaptation techniques; we propose adaptation methods that allow dynamic interference avoidance without affecting adversely the estimation performance. The final part of this work focuses on prototypical implementation of OFDM-MIMO radar. With the constructed prototype, the feasibility of OFDM for high-performance radar applications is demonstrated. Furthermore, based on this radar prototype the algorithms presented in this thesis are validated experimentally. The measurements confirm the applicability of the proposed algorithms and concepts for real world automotive radar implementations

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

Convex Model-Based Synthetic Aperture Radar Processing

The use of radar often conjures up images of small blobs on a screen. But current synthetic aperture radar (SAR) systems are able to generate near-optical quality images with amazing benefits compared to optical sensors. These SAR sensors work in all weather conditions, day or night, and provide many advanced capabilities to detect and identify targets of interest. These amazing abilities have made SAR sensors a work-horse in remote sensing, and military applications. SAR sensors are ranging instruments that operate in a 3D environment, but unfortunately the results and interpretation of SAR images have traditionally been done in 2D. Three-dimensional SAR images could provide improved target detection and identification along with improved scene interpretability. As technology has increased, particularly regarding our ability to solve difficult optimization problems, the 3D SAR reconstruction problem has gathered more interest. This dissertation provides the SAR and mathematical background required to pose a SAR 3D reconstruction problem. The problem is posed in a way that allows prior knowledge about the target of interest to be integrated into the optimization problem when known. The developed model is demonstrated on simulated data initially in order to illustrate critical concepts in the development. Then once comprehension is achieved the processing is applied to actual SAR data. The 3D results are contrasted against the current gold- standard. The results are shown as 3D images demonstrating the improvement regarding scene interpretability that this approach provides