Detection of complex point targets with distributed assets in a MIMO radar system

The report explores the problem of detecting complex point target models in a MIMO radar system. A complex point target is a mathematical and statistical model for a radar target that is not resolved in space, but exhibits varying complex reflectivity across the different bistatic view angles. The complex reflectivity can be modeled as a complex stochastic process whose index set is the set of all the bistatic view angles, and the parameters of the stochastic process follow from an analysis of a target model comprising a number of ideal point scatterers randomly located within some radius of the targets center of mass. The proposed complex point targets may be applicable to statistical inference in multistatic or MIMO radar system. Six different target models are summarized here – three 2-dimensional (Gaussian, Uniform Square, and Uniform Circle) and three 3-dimensional (Gaussian, Uniform Cube, and Uniform Sphere). They are assumed to have different distributions on the location of the point scatterers within the target. We develop data models for the received signals from such targets in the MIMO radar system with distributed assets and partially correlated signals, and consider the resulting detection problem which reduces to the familiar Gauss-Gauss detection problem. We illustrate that the target parameter and transmit signal have an influence on the detector performance through target extent and the SNR respectively. A series of the receiver operator characteristic (ROC) curves are generated to notice the impact on the detector for varying SNR. Kullback–Leibler (KL) divergence is applied to obtain the approximate mean difference between density functions the scatterers assume inside the target models to show the change in the performance of the detector with target extent of the point scatterers.

MIMO waveform design using continuous phase modulation

Hybrid MIMO Phased-Array Radar (HMPAR) is an emerging technology that combines MIMO (multiple-in, multiple-out) radar technology with phased-array radar technology. The new technology is in its infancy, but much of the theoretical work for this specific project has already been completed and is explored in great depth in [1]. A brief overview of phased-array radar systems, MIMO radar systems, and the HMPAR paradigm are explored in this paper. This report is the culmination of an effort to support research in MIMO and HMPAR utilizing a concept called intrapulse beamscan. Using intrapulse beamscan, arbitrary spatial coverage can be achieved within one MIMO beam pulse. Therefore, this report focuses on designing waveforms for MIMO radar systems with arbitrary spatial coverage using that phenomenon. With intrapulse beamscan, scanning is done through phase-modulated signal design within one pulse rather than phase-shifters in the phased array over multiple pulses. In addition to using this idea, continuous phase modulation (CPM) signals are considered for their desirable peak-to-average ratio property as well as their low spectral leakage. These MIMO waveforms are designed with three goals in mind. The first goal is to achieve flexible spatial coverage while utilizing intrapulse beamscan. As with almost any radar system, we wish to have flexibility in where we send our signal energy. The second goal is to maintain a peak-to-average ratio close to 1 on the envelope of these waveforms, ensuring a signal that is close to constant modulus. It is desired to have a radar system transmit at the highest available power; not doing so would further diminish the already very small return signals. The third goal is to ensure low spectral leakage using various techniques to limit the bandwidth of the designed signals. Spectral containment is important to avoid interference with systems that utilize nearby frequencies in the electromagnetic spectrum. These three goals are realized allowing for limitations of real radar systems. In addition to flexible spatial coverage, the report examines the spectral properties of utilizing various space-filling techniques for desired spatial areas. The space-filling techniques examined include Hilbert/Peano curves and standard raster scans.

WEAK ISOMETRIES OF HAMMING SPACES

In this thesis we study weak isometries of Hamming spaces. These are permutations of a Hamming space that preserve some but not necessarily all distances. We wish to find conditions under which a weak isometry is in fact an isometry. This type of problem was first posed by Beckman and Quarles for Rn. In chapter 2 we give definitions pertinent to our research. The 3rd chapter focuses on some known results in this area with special emphasis on papers by V. Krasin as well as S. De Winter and M. Korb who solved this problem for the Boolean cube, that is, the binary Hamming space. We attempted to generalize some of their methods to the non-boolean case. The 4th chapter has our new results and is split into two major contributions. Our first contribution shows if n=p or p < n2, then every weak isometry of Hnq that preserves distance p is an isometry. Our second contribution gives a possible method to check if a weak isometry is an isometry using linear algebra and graph theory.