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

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

Low complexity DOA estimation for wideband off-grid sources based on re-focused compressive sensing with dynamic dictionary

Under the compressive sensing (CS) framework, a novel focusing based direction of arrival (DOA) estimation method is first proposed for wideband off-grid sources, and by avoiding the application of group sparsity (GS) across frequencies of interest, significant complexity reduction is achieved with its computational complexity close to that of solving a single frequency based direction finding problem. To further improve the performance by alleviating both the off-grid approximation errors and the focusing errors which are even worse for the off-grid case, a dynamic dictionary based re-focused off-grid DOA estimation method is developed with the number of extremely sparse grids involved in estimation refined to the number of detected sources, and thus the complexity is still very low due to the limited increased complexity introduced by iterations, while improved performance can be achieved compared with those fixed dictionary based off-grid methods

Group sparsity based target localization for distributed sensor array networks

The target localization problem for distributed sensor array networks where a sub-array is placed at each receiver is studied, and under the compressive sensing (CS) framework, a group sparsity based two-dimensional localization method is proposed. Instead of fusing the separately estimated angles of arrival (AOAs), it processes the information collected by all the receivers simultaneously to form the final target locations. Simulation results show that the proposed localization method provides a significant performance improvement compared with the commonly used maximum likelihood estimator (MLE)

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