22 research outputs found
Wideband Spectrum Acquisition for UAV Swarm Using the Sparse Coding Fourier Transform
As the trend towards small, safe, smart, speedy and swarm development grows,
unmanned aerial vehicles (UAVs) are becoming increasingly popular for a wide
range of applications. In this letter, the challenge of wideband spectrum
acquisition for the UAV swarms is studied by proposing a processing method that
features lower power consumption, higher compression rates, and a lower
signal-to-noise ratio. Our system is equipped with multiple UAVs, each with a
different sub-sampling rate. That allows for frequency backetization and
estimation based on sparse Fourier transform theory. Unlike other techniques,
the collisions and iterations caused by non-sparsity environ-ments are
considered. We introduce sparse coding Fourier transform to address these
issues. The key is to code the entire spectrum and decode it through spectrum
correlation in the code. Simulation results show that our proposed method
performs well in acquiring both narrowband and wideband signals simultaneously,
compared to the other methods
Recommended from our members
Structured Sub-Nyquist Sampling with Applications in Compressive Toeplitz Covariance Estimation, Super-Resolution and Phase Retrieval
Sub-Nyquist sampling has received a huge amount of interest in the past decade. In classical compressed sensing theory, if the measurement procedure satisfies a particular condition known as Restricted Isometry Property (RIP), we can achieve stable recovery of signals of low-dimensional intrinsic structures with an order-wise optimal sample size. Such low-dimensional structures include sparse and low rank for both vector and matrix cases. The main drawback of conventional compressed sensing theory is that random measurements are required to ensure the RIP property. However, in many applications such as imaging and array signal processing, applying independent random measurements may not be practical as the systems are deterministic. Moreover, random measurements based compressed sensing always exploits convex programs for signal recovery even in the noiseless case, and solving those programs is computationally intensive if the ambient dimension is large, especially in the matrix case. The main contribution of this dissertation is that we propose a deterministic sub-Nyquist sampling framework for compressing the structured signal and come up with computationally efficient algorithms. Besides widely studied sparse and low-rank structures, we particularly focus on the cases that the signals of interest are stationary or the measurements are of Fourier type. The key difference between our work from classical compressed sensing theory is that we explicitly exploit the second-order statistics of the signals, and study the equivalent quadratic measurement model in the correlation domain. The essential observation made in this dissertation is that a difference/sum coarray structure will arise from the quadratic model if the measurements are of Fourier type. With these observations, we are able to achieve a better compression rate for covariance estimation, identify more sources in array signal processing or recover the signals of larger sparsity. In this dissertation, we will first study the problem of Toeplitz covariance estimation. In particular, we will show how to achieve an order-wise optimal compression rate using the idea of sparse arrays in both general and low-rank cases. Then, an analysis framework of super-resolution with positivity constraint is established. We will present fundamental robustness guarantees, efficient algorithms and applications in practices. Next, we will study the problem of phase-retrieval for which we successfully apply the sparse array ideas by fully exploiting the quadratic measurement model. We achieve near-optimal sample complexity for both sparse and general cases with practical Fourier measurements and provide efficient and deterministic recovery algorithms. In the end, we will further elaborate on the essential role of non-negative constraint in underdetermined inverse problems. In particular, we will analyze the nonlinear co-array interpolation problem and develop a universal upper bound of the interpolation error. Bilinear problem with non-negative constraint will be considered next and the exact characterization of the ambiguous solutions will be established for the first time in literature. At last, we will show how to apply the nested array idea to solve real problems such as Kriging. Using spatial correlation information, we are able to have a stable estimate of the field of interest with fewer sensors than classic methodologies. Extensive numerical experiments are implemented to demonstrate our theoretical claims
Array Signal Processing Based on Traditional and Sparse Arrays
Array signal processing is based on using an array of sensors to receive the impinging signals. The received data is either spatially filtered to focus the signals from a desired direction or it may be used for estimating a parameter of source signal like direction of arrival (DOA), polarization and source power. Spatial filtering also known as beamforming and DOA estimation are integral parts of array signal processing and this thesis is aimed at solving some key probems related to these two areas. Wideband beamforming holds numerous applications in the bandwidth hungry data traffic of present day world. Several techniques exist to design fixed wideband beamformers based on traditional arrays like uniform linear array (ULA). Among these techniques, least squares based eigenfilter method is a key technique which has been used extensively in filter and wideband beamformer design. The first contribution of this thesis comes in the form of critically analyzing the standard eigenfilter method where a serious flaw in the design formulation is highlighted which generates inconsistent design performance, and an additional constraint is added to stabilize the achieved design. Simulation results show the validity and significance of the proposed method.
Traditional arrays based on ULAs have limited applications in array signal processing due to the large number of sensors required and this problem has been addressed by the application of sparse arrays. Sparse arrays have been exploited from the perspective of their difference co-array structures which provide significantly higher number of degrees of freedoms (DOFs) compared to ULAs for the same number of sensors. These DOFs (consecutive and unique lags) are utilized in the application of DOA estimation with the help of difference co-array based DOA estimators. Several types of sparse arrays include minimum redundancy array (MRA), minimum hole array (MHA), nested array, prototype coprime array, conventional coprime array, coprime array with compressed interelement spacing (CACIS), coprime array with displaced subarrays (CADiS) and super nested array. As a second contribution of this thesis, a new sparse array termed thinned coprime array (TCA) is proposed which holds all the properties of a conventional coprime array but with \ceil*{\frac{M}{2}} fewer sensors where is the number of sensors of a subarray in the conventional structure. TCA possesses improved level of sparsity and is robust against mutual coupling compared to other sparse arrays. In addition, TCA holds higher number of DOFs utilizable for DOA estimation using variety of methods. TCA also shows lower estimation error compared to super nested arrays and MRA with increasing array size.
Although TCA holds numerous desirable features, the number of unique lags offered by TCA are close to the sparsest CADiS and nested array and significantly lower than MRA which limits the estimation error performance offered by TCA through (compressive sensing) CS-based methods. In this direction, the structure of TCA is studied to explore the possibility of an array which can provide significantly higher number of unique lags with improved sparsity for a given number of sensors. The result of this investigation is the third contribution of this thesis in the form of a new sparse array, displaced thinned coprime array with additional sensor (DiTCAAS), which is based on a displaced version of TCA. The displacement of the subarrays generates an increase in the unique lags but the minimum spacing between the sensors becomes an integer multiple of half wavelength. To avoid spatial aliasing, an additional sensor is added at half wavelength from one of the sensors of the displaced subarray. The proposed placement of the additional sensor generates significantly higher number of unique lags for DiTCAAS, even more than the DOFs provided by MRA. Due to its improved sparsity and higher number of unique lags, DiTCAAS generates the lowest estimation error and robustness against heavy mutual coupling compared to super nested arrays, MRA, TCA and sparse CADiS with CS-based DOA estimation
Sub-Nyquist Wideband Spectrum Sensing and Sharing
PhDThe rising popularity of wireless services resulting in spectrum shortage has motivated
dynamic spectrum sharing to facilitate e cient usage of the underutilized spectrum.
Wideband spectrum sensing is a critical functionality to enable dynamic spectrum access
by enhancing the opportunities of exploring spectral holes, but entails a major implemen-
tation challenge in compact commodity radios that have limited energy and computation
capabilities. The sampling rates speci ed by the Shannon-Nyquist theorem impose great
challenges both on the acquisition hardware and the subsequent storage and digital sig-
nal processors. Sub-Nyquist sampling was thus motivated to sample wideband signals
at rates far lower than the Nyquist rate, while still retaining the essential information in
the underlying signals.
This thesis proposes several algorithms for invoking sub-Nyquist sampling in wideband
spectrum sensing. Speci cally, a sub-Nyquist wideband spectrum sensing algorithm is
proposed that achieves wideband sensing independent of signal sparsity without sampling
at full bandwidth by using the low-speed analog-to-digital converters based on sparse
Fast Fourier Transform. To lower signal spectrum sparsity while maintaining the channel
state information, the received signal is pre-processed through a proposed permutation
and ltering algorithm. Additionally, a low-complexity sub-Nyquist wideband spectrum
sensing scheme is proposed that locates occupied channels blindly by recovering the sig-
nal support, based on the jointly sparse nature of multiband signals. Exploiting the
common signal support shared among multiple secondary users, an e cient coopera-
tive spectrum sensing scheme is developed, in which the energy consumption on signal
acquisition, processing, and transmission is reduced with the detection performance guar-
antee. To further reduce the computation complexity of wideband spectrum sensing, a
hybrid framework of sub-Nyquist wideband spectrum sensing with geolocation database
is explored. Prior channel information from geolocation database is utilized in the sens-
ing process to reduce the processing requirements on the sensor nodes. The models of
the proposed algorithms are derived and veri ed by numerical analyses and tested on
both real-world and simulated TV white space signals
Sparse Array Signal Processing: New Array Geometries, Parameter Estimation, and Theoretical Analysis
Array signal processing focuses on an array of sensors receiving the incoming waveforms in the environment, from which source information, such as directions of arrival (DOA), signal power, amplitude, polarization, and velocity, can be estimated. This topic finds ubiquitous applications in radar, astronomy, tomography, imaging, and communications. In these applications, sparse arrays have recently attracted considerable attention, since they are capable of resolving O(N2) uncorrelated source directions with N physical sensors. This is unlike the uniform linear arrays (ULA), which identify at most N-1 uncorrelated sources with N sensors. These sparse arrays include minimum redundancy arrays (MRA), nested arrays, and coprime arrays. All these arrays have an O(N2)-long central ULA segment in the difference coarray, which is defined as the set of differences between sensor locations. This O(N2) property makes it possible to resolve O(N2) uncorrelated sources, using only N physical sensors.
The main contribution of this thesis is to provide a new direction for array geometry and performance analysis of sparse arrays in the presence of nonidealities. The first part of this thesis focuses on designing novel array geometries that are robust to effects of mutual coupling. It is known that, mutual coupling between sensors has an adverse effect on the estimation of DOA. While there are methods to counteract this through appropriate modeling and calibration, they are usually computationally expensive, and sensitive to model mismatch. On the other hand, sparse arrays, such as MRA, nested arrays, and coprime arrays, have reduced mutual coupling compared to ULA, but all of these have their own disadvantages. This thesis introduces a new array called the super nested array, which has many of the good properties of the nested array, and at the same time achieves reduced mutual coupling. Many theoretical properties are proved and simulations are included to demonstrate the superior performance of super nested arrays in the presence of mutual coupling.
Two-dimensional planar sparse arrays with large difference coarrays have also been known for a long time. These include billboard arrays, open box arrays (OBA), and 2D nested arrays. However, all of them have considerable mutual coupling. This thesis proposes new planar sparse arrays with the same large difference coarrays as the OBA, but with reduced mutual coupling. The new arrays include half open box arrays (HOBA), half open box arrays with two layers (HOBA-2), and hourglass arrays. Among these, simulations show that hourglass arrays have the best estimation performance in presence of mutual coupling.
The second part of this thesis analyzes the performance of sparse arrays from a theoretical perspective. We first study the Cramér-Rao bound (CRB) for sparse arrays, which poses a lower bound on the variances of unbiased DOA estimators. While there exist landmark papers on the study of the CRB in the context of array processing, the closed-form expressions available in the literature are not applicable in the context of sparse arrays for which the number of identifiable sources exceeds the number of sensors. This thesis derives a new expression for the CRB to fill this gap. Based on the proposed CRB expression, it is possible to prove the previously known experimental observation that, when there are more sources than sensors, the CRB stagnates to a constant value as the SNR tends to infinity. It is also possible to precisely specify the relation between the number of sensors and the number of uncorrelated sources such that these sources could be resolved.
Recently, it has been shown that correlation subspaces, which reveal the structure of the covariance matrix, help to improve some existing DOA estimators. However, the bases, the dimension, and other theoretical properties of correlation subspaces remain to be investigated. This thesis proposes generalized correlation subspaces in one and multiple dimensions. This leads to new insights into correlation subspaces and DOA estimation with prior knowledge. First, it is shown that the bases and the dimension of correlation subspaces are fundamentally related to difference coarrays, which were previously found to be important in the study of sparse arrays. Furthermore, generalized correlation subspaces can handle certain forms of prior knowledge about source directions. These results allow one to derive a broad class of DOA estimators with improved performance.
It is empirically known that the coarray structure is susceptible to sensor failures, and the reliability of sparse arrays remains a significant but challenging topic for investigation. This thesis advances a general theory for quantifying such robustness, by studying the effect of sensor failure on the difference coarray. We first present the (k-)essentialness property, which characterizes the combinations of the faulty sensors that shrink the difference coarray. Based on this, the notion of (k-)fragility is proposed to quantify the reliability of sparse arrays with faulty sensors, along with comprehensive studies of their properties. These novel concepts provide quite a few insights into the interplay between the array geometry and its robustness. For instance, for the same number of sensors, it can be proved that ULA is more robust than the coprime array, and the coprime array is more robust than the nested array. Rigorous development of these ideas leads to expressions for the probability of coarray failure, as a function of the probability of sensor failure.
The thesis concludes with some remarks on future directions and open problems.</p