Underdetermined DOA Estimation Under the Compressive Sensing Framework: A Review

Direction of arrival (DOA) estimation from the perspective of sparse signal representation has attracted tremendous attention in past years, where the underlying spatial sparsity reconstruction problem is linked to the compressive sensing (CS) framework. Although this is an area with ongoing intensive research and new methods and results are reported regularly, it is time to have a review about the basic approaches and methods for CS-based DOA estimation, in particular for the underdetermined case. We start from the basic time-domain CSbased formulation for narrowband arrays and then move to the case for recently developed methods for sparse arrays based on the co-array concept. After introducing two specifically designed structures (the two-level nested array and the co-prime array) for optimizing the virtual sensors corresponding to the difference coarray, this CS-based DOA estimation approach is extended to the wideband case by employing the group sparsity concept, where a much larger physical aperture can be achieved by allowing a larger unit inter-element spacing and therefore leading to further improved performance. Finally, a specifically designed ULA structure with associated CS-based underdetermined DOA estimation is presented to exploit the difference co-array concept in the spatio-spectral domain, leading to a significant increase in DOFs. Representative simulation results for typical narrowband and wideband scenarios are provided to demonstrate their performance

Study of Enhanced MISC-Based Sparse Arrays with High uDOFs and Low Mutual Coupling

In this letter, inspired by the maximum inter-element spacing (IES) constraint (MISC) criterion, an enhanced MISC-based (EMISC) sparse array (SA) with high uniform degrees-of-freedom (uDOFs) and low mutual-coupling (MC) is proposed, analyzed and discussed in detail. For the EMISC SA, an IES set is first determined by the maximum IES and number of elements. Then, the EMISC SA is composed of seven uniform linear sub-arrays (ULSAs) derived from an IES set. An analysis of the uDOFs and weight function shows that, the proposed EMISC SA outperforms the IMISC SA in terms of uDOF and MC. Simulation results show a significant advantage of the EMISC SA over other existing SAs.Comment: 6 pages 4 figure

Discrete and Continuous Sparse Recovery Methods and Their Applications

Low dimensional signal processing has drawn an increasingly broad amount of attention in the past decade, because prior information about a low-dimensional space can be exploited to aid in the recovery of the signal of interest. Among all the different forms of low di- mensionality, in this dissertation we focus on the synthesis and analysis models of sparse recovery. This dissertation comprises two major topics. For the first topic, we discuss the synthesis model of sparse recovery and consider the dictionary mismatches in the model. We further introduce a continuous sparse recovery to eliminate the existing off-grid mismatches for DOA estimation. In the second topic, we focus on the analysis model, with an emphasis on efficient algorithms and performance analysis. In considering the sparse recovery method with structured dictionary mismatches for the synthesis model, we exploit the joint sparsity between the mismatch parameters and original sparse signal. We demonstrate that by exploiting this information, we can obtain a robust reconstruction under mild conditions on the sensing matrix. This model is very useful for radar and passive array applications. We propose several efficient algorithms to solve the joint sparse recovery problem. Using numerical examples, we demonstrate that our proposed algorithms outperform several methods in the literature. We further extend the mismatch model to a continuous sparse model, using the mathematical theory of super resolution. Statistical analysis shows the robustness of the proposed algorithm. A number-detection algorithm is also proposed for the co-prime arrays. By using numerical examples, we show that continuous sparse recovery further improves the DOA estimation accuracy, over both the joint sparse method and also MUSIC with spatial smoothing. In the second topic, we visit the corresponding analysis model of sparse recovery. Instead of assuming a sparse decomposition of the original signal, the analysis model focuses on the existence of a linear transformation which can make the original signal sparse. In this work we use a monotone version of the fast iterative shrinkage- thresholding algorithm (MFISTA) to yield efficient algorithms to solve the sparse recovery. We examine two widely used relaxation techniques, namely smoothing and decomposition, to relax the optimization. We show that although these two techniques are equivalent in their objective functions, the smoothing technique converges faster than the decomposition technique. We also compute the performance guarantee for the analysis model when a LASSO type of reconstruction is performed. By using numerical examples, we are able to show that the proposed algorithm is more efficient than other state of the art algorithms

Statistical Nested Sensor Array Signal Processing

Source number detection and direction-of-arrival (DOA) estimation are two major applications of sensor arrays. Both applications are often confined to the use of uniform linear arrays (ULAs), which is expensive and difficult to yield wide aperture. Besides, a ULA with N scalar sensors can resolve at most N − 1 sources. On the other hand, a systematic approach was recently proposed to achieve O(N 2 ) degrees of freedom (DOFs) using O(N) sensors based on a nested array, which is obtained by combining two or more ULAs with successively increased spacing. This dissertation will focus on a fundamental study of statistical signal processing of nested arrays. Five important topics are discussed, extending the existing nested-array strategies to more practical scenarios. Novel signal models and algorithms are proposed. First, based on the linear nested array, we consider the problem for wideband Gaussian sources. To employ the nested array to the wideband case, we propose effective strategies to apply nested-array processing to each frequency component, and combine all the spectral information of various frequencies to conduct the detection and estimation. We then consider the practical scenario with distributed sources, which considers the spreading phenomenon of sources. Next, we investigate the self-calibration problem for perturbed nested arrays, for which existing works require certain modeling assumptions, for example, an exactly known array geometry, including the sensor gain and phase. We propose corresponding robust algorithms to estimate both the model errors and the DOAs. The partial Toeplitz structure of the covariance matrix is employed to estimate the gain errors, and the sparse total least squares is used to deal with the phase error issue. We further propose a new class of nested vector-sensor arrays which is capable of significantly increasing the DOFs. This is not a simple extension of the nested scalar-sensor array. Both the signal model and the signal processing strategies are developed in the multidimensional sense. Based on the analytical results, we consider two main applications: electromagnetic (EM) vector sensors and acoustic vector sensors. Last but not least, in order to make full use of the available limited valuable data, we propose a novel strategy, which is inspired by the jackknifing resampling method. Exploiting numerous iterations of subsets of the whole data set, this strategy greatly improves the results of the existing source number detection and DOA estimation methods

Sparse Array Architectures for Wireless Communication and Radar Applications

This thesis focuses on sparse array architectures for the next generation of wireless communication, known as fifth-generation (5G), and automotive radar direction-of-arrival (DOA) estimation. For both applications, array spatial resolution plays a critical role to better distinguish multiple users/sources. Two novel base station antenna (BSA) configurations and a new sparse MIMO radar, which both outperform their conventional counterparts, are proposed.\ua0We first develop a multi-user (MU) multiple-input multiple-output (MIMO) simulation platform which incorporates both antenna and channel effects based on standard network theory. The combined transmitter-channel-receiver is modeled by cascading Z-matrices to interrelate the port voltages/currents to one another in the linear network model. The herein formulated channel matrix includes physical antenna and channel effects and thus enables us to compute the actual port powers. This is in contrast with the assumptions of isotropic radiators without mutual coupling effects which are commonly being used in the Wireless Community.\ua0Since it is observed in our model that the sum-rate of a MU-MIMO system can be adversely affected by antenna gain pattern variations, a novel BSA configuration is proposed by combining field-of-view (FOV) sectorization, array panelization and array sparsification. A multi-panel BSA, equipped with sparse arrays in each panel, is presented with the aim of reducing the implementation complexities and maintaining or even improving the sum-rate.\ua0We also propose a capacity-driven array synthesis in the presence of mutual coupling for a MU-MIMO system. We show that the appearance of\ua0grating lobes is degrading the system capacity and cannot be disregarded in a MU communication, where space division\ua0multiple access (SDMA) is applied. With the aid of sparsity and aperiodicity, the adverse effects of grating lobes and mutual coupling\ua0are suppressed and capacity is enhanced. This is performed by proposing a two-phase optimization. In Phase I, the problem\ua0is relaxed to a convex optimization by ignoring the mutual coupling and weakening the constraints. The solution of Phase I\ua0is used as the initial guess for the genetic algorithm (GA) in phase II, where the mutual coupling is taken into account. The\ua0proposed hybrid algorithm outperforms the conventional GA with random initialization.\ua0A novel sparse MIMO radar is presented for high-resolution single snapshot DOA estimation. Both transmit and receive arrays are divided into two uniform arrays with increased inter-element spacings to generate two uniform sparse virtual arrays. Since virtual arrays are uniform, conventional spatial smoothing can be applied for temporal correlation suppression among sources. Afterwards, the spatially smoothed virtual arrays satisfy the co-primality concept to avoid DOA ambiguities. Physical antenna effects are incorporated in the received signal model and their effects on the DOA estimation performance are investigated

Time Reversal Compressive Sensing MIMO Radar Systems

Active radar systems transmit a probing signal and use the return backscatters received from the channel to determine properties of the channel. After detecting the presence of targets, the localization of targets is achieved by estimating relevant target parameters, including the range, Doppler's frequency, and azimuth associated with the targets. A major source of error in parameter estimation is the presence of clutter (undesired targets) that also reflects the probing signal back to the radar. To eliminate the fading effect introduced by backscatters originating from the clutter, the multiple input multiple output (MIMO) radar transmits a set of simultaneous uncorrelated probing signals from the transmit elements comprising the transmit array. A major problem with MIMO radars is the large amount of data generated when the recorded backscatters are discretized at the Nyquist sampling rate. This in turn necessitates the need of expensive, high speed analog-to-digital converter circuits. Compressive sensing (CS) has emerged as a new sampling paradigm for reconstructing sparse signals with relatively few observations and at a lower computational cost compared to other sparsity promoting approaching. Although compressive beamforming has the potential of high resolution estimates, the approach has several limitations arising mainly due to the difficulty in achieving complete incoherency and sparsity in the CS dictionary. This PhD thesis will apply the principle of time reversal (TR) to MIMO radars to improve the incoherency and sparsity of the compressive beamforming dictionary. The resulting CS TR MIMO radar is analytically studied and assessed for performance gains as compared to the conventional MIMO systems