A Vector Channel Based Approach to MIMO Radar Waveform Design for Extended Targets

Radar systems have been used for many years for estimating, detecting, classifying, and imaging objects of interest (targets). Stealthier targets and more cluttered environments have created a need for more sophisticated radar systems to gain more precise information about the radar environment. Because modern radar systems are largely defined in software, adaptive radar systems have emerged that tailor system parameters such as the transmitted waveform and receiver filter to the target and environment in order to address this need. The basic structure of a radar system exhibits many similarities to the structure of a communication system. Recognizing the parallel composition of radar systems and information transmission systems, initial works have begun to explore the application of information theory to radar system design, but a great deal of work still remains to make a full and clear connection between the problems addressed by radar systems and communication systems. Forming a comprehensive definition of this connection between radar systems and information transmission systems and associated problem descriptions could facilitate the cross-discipline transfer of ideas and accelerate the development and improvement of new system design solutions in both fields. In particular, adaptive radar system design is a relatively new field which stands to benefit from the maturity of information theory developed for information transmission if a parallel can be drawn to clearly relate similar radar and communication problems. No known previous work has yet drawn a clear parallel between the general multiple-input multiple-output (MIMO) radar system model considering both the detection and estimation of multiple extended targets and a similar multiuser vector channel information transmission system model. The goal of this dissertation is to develop a novel vector channel framework to describe a MIMO radar system and to study information theoretic adaptive radar waveform design for detection and estimation of multiple radar targets within this framework. Specifically, this dissertation first provides a new compact vector channel model for representing a MIMO radar system which illustrates the parallel composition of radar systems and information transmission systems. Second, using the proposed framework this dissertation contributes a compressed sensing based information theoretic approach to waveform design for the detection of multiple extended targets in noiseless and noisy scenarios. Third, this dissertation defines the multiple extended target estimation problem within the framework and proposes a greedy signal to interference-plus-noise ratio (SINR) maximizing procedure based on a similar approach developed for a collaborative multibase wireless communication system to optimally design wave forms in this scenario

MIMO Radar Waveform Design and Sparse Reconstruction for Extended Target Detection in Clutter

This dissertation explores the detection and false alarm rate performance of a novel transmit-waveform and receiver filter design algorithm as part of a larger Compressed Sensing (CS) based Multiple Input Multiple Output (MIMO) bistatic radar system amidst clutter. Transmit-waveforms and receiver filters were jointly designed using an algorithm that minimizes the mutual coherence of the combined transmit-waveform, target frequency response, and receiver filter matrix product as a design criterion. This work considered the Probability of Detection (P D) and Probability of False Alarm (P FA) curves relative to a detection threshold, τ th, Receiver Operating Characteristic (ROC), reconstruction error and mutual coherence measures for performance characterization of the design algorithm to detect both known and fluctuating targets and amidst realistic clutter and noise. Furthermore, this work paired the joint waveform-receiver filter design algorithm with multiple sparse reconstruction algorithms, including: Regularized Orthogonal Matching Pursuit (ROMP), Compressive Sampling Matching Pursuit (CoSaMP) and Complex Approximate Message Passing (CAMP) algorithms. It was found that the transmit-waveform and receiver filter design algorithm significantly outperforms statically designed, benchmark waveforms for the detection of both known and fluctuating extended targets across all tested sparse reconstruction algorithms. In particular, CoSaMP was specified to minimize the maximum allowable P FA of the CS radar system as compared to the baseline ROMP sparse reconstruction algorithm of previous work. However, while the designed waveforms do provide performance gains and CoSaMP affords a reduced peak false alarm rate as compared to the previous work, fluctuating target impulse responses and clutter severely hampered CS radar performance when either of these sparse reconstruction techniques were implemented. To improve detection rate and, by extension, ROC performance of the CS radar system under non-ideal conditions, this work implemented the CAMP sparse reconstruction algorithm in the CS radar system. It was found that detection rates vastly improve with the implementation of CAMP, especially in the case of fluctuating target impulse responses amidst clutter or at low receive signal to noise ratios (β n). Furthermore, where previous work considered a τ th=0, the implementation of a variable τ th in this work offered novel trade off between P D and P FA in radar design to the CS radar system. In the simulated radar scene it was found that τ th could be moderately increased retaining the same or similar P D while drastically improving P FA. This suggests that the selection and specification of the sparse reconstruction algorithm and corresponding τ th for this radar system is not trivial. Rather, a tradeoff was noted between P D and P FA based on the choice and parameters of the sparse reconstruction technique and detection threshold, highlighting an engineering trade-space in CS radar system design. Thus, in CS radar system design, the radar designer must carefully choose and specify the sparse reconstruction technique and appropriate detection threshold in addition to transmit-waveforms, receiver filters and building the dictionary of target impulse responses for detection in the radar scene

Accurate detection of moving targets via random sensor arrays and Kerdock codes

The detection and parameter estimation of moving targets is one of the most important tasks in radar. Arrays of randomly distributed antennas have been popular for this purpose for about half a century. Yet, surprisingly little rigorous mathematical theory exists for random arrays that addresses fundamental question such as how many targets can be recovered, at what resolution, at which noise level, and with which algorithm. In a different line of research in radar, mathematicians and engineers have invested significant effort into the design of radar transmission waveforms which satisfy various desirable properties. In this paper we bring these two seemingly unrelated areas together. Using tools from compressive sensing we derive a theoretical framework for the recovery of targets in the azimuth-range-Doppler domain via random antennas arrays. In one manifestation of our theory we use Kerdock codes as transmission waveforms and exploit some of their peculiar properties in our analysis. Our paper provides two main contributions: (i) We derive the first rigorous mathematical theory for the detection of moving targets using random sensor arrays. (ii) The transmitted waveforms satisfy a variety of properties that are very desirable and important from a practical viewpoint. Thus our approach does not just lead to useful theoretical insights, but is also of practical importance. Various extensions of our results are derived and numerical simulations confirming our theory are presented

Analysis of Sparse MIMO Radar

We consider a multiple-input-multiple-output radar system and derive a theoretical framework for the recoverability of targets in the azimuth-range domain and the azimuth-range-Doppler domain via sparse approximation algorithms. Using tools developed in the area of compressive sensing, we prove bounds on the number of detectable targets and the achievable resolution in the presence of additive noise. Our theoretical findings are validated by numerical simulations

In pursuit of high resolution radar using pursuit algorithms

Radar receivers typically employ matched filters designed to maximize signal to noise ratio (SNR) in a single target environment. In a multi-target environment, however, matched filter estimates of target environment often consist of spurious targets because of radar signal sidelobes. As a result, matched filters are not suitable for use in high resolution radars operating in multi-target environments. Assuming a point target model, we show that the radar problem can be formulated as a linear under-determined system with a sparse solution. This suggests that radar can be considered as a sparse signal recovery problem. However, it is shown that the sensing matrix obtained using common radar signals does not usually satisfy the mutual coherence condition. This implies that using recovery techniques available in compressed sensing literature may not result in the optimal solution. In this thesis, we focus on the greedy algorithm approach to solve the problem and show that it naturally yields a quantitative measure for radar resolution. In addition, we show that the limitations of the greedy algorithms can be attributed to the close relation between greedy matching pursuit algorithms and the matched filter. This suggests that improvements to the resolution capability of the greedy pursuit algorithms can be made by using a mismatched signal dictionary. In some cases, unlike the mismatched filter, the proposed mismatched pursuit algorithm is shown to offer improved resolution and stability without any noticeable difference in detection performance. Further improvements in resolution are proposed by using greedy algorithms in a radar system using multiple transmit waveforms. It is shown that while using the greedy algorithms together with linear channel combining can yield significant resolution improvement, a greedy approach using nonlinear channel combining also shows some promise. Finally, a forward-backward greedy algorithm is proposed for target environments comprising of point targets as well as extended targets

Sub-Nyquist Sampling: Bridging Theory and Practice

Sampling theory encompasses all aspects related to the conversion of continuous-time signals to discrete streams of numbers. The famous Shannon-Nyquist theorem has become a landmark in the development of digital signal processing. In modern applications, an increasingly number of functions is being pushed forward to sophisticated software algorithms, leaving only those delicate finely-tuned tasks for the circuit level. In this paper, we review sampling strategies which target reduction of the ADC rate below Nyquist. Our survey covers classic works from the early 50's of the previous century through recent publications from the past several years. The prime focus is bridging theory and practice, that is to pinpoint the potential of sub-Nyquist strategies to emerge from the math to the hardware. In that spirit, we integrate contemporary theoretical viewpoints, which study signal modeling in a union of subspaces, together with a taste of practical aspects, namely how the avant-garde modalities boil down to concrete signal processing systems. Our hope is that this presentation style will attract the interest of both researchers and engineers in the hope of promoting the sub-Nyquist premise into practical applications, and encouraging further research into this exciting new frontier.Comment: 48 pages, 18 figures, to appear in IEEE Signal Processing Magazin