Eigenvalue-based Cyclostationary Spectrum Sensing Using Multiple Antennas

In this paper, we propose a signal-selective spectrum sensing method for cognitive radio networks and specifically targeted for receivers with multiple-antenna capability. This method is used for detecting the presence or absence of primary users based on the eigenvalues of the cyclic covariance matrix of received signals. In particular, the cyclic correlation significance test is used to detect a specific signal-of-interest by exploiting knowledge of its cyclic frequencies. The analytical threshold for achieving constant false alarm rate using this detection method is presented, verified through simulations, and shown to be independent of both the number of samples used and the noise variance, effectively eliminating the dependence on accurate noise estimation. The proposed method is also shown, through numerical simulations, to outperform existing multiple-antenna cyclostationary-based spectrum sensing algorithms under a quasi-static Rayleigh fading channel, in both spatially correlated and uncorrelated noise environments. The algorithm also has significantly lower computational complexity than these other approaches.Comment: 6 pages, 6 figures, accepted to IEEE GLOBECOM 201

Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14)

The implicit objective of the biennial "international - Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST) is to foster collaboration between international scientific teams by disseminating ideas through both specific oral/poster presentations and free discussions. For its second edition, the iTWIST workshop took place in the medieval and picturesque town of Namur in Belgium, from Wednesday August 27th till Friday August 29th, 2014. The workshop was conveniently located in "The Arsenal" building within walking distance of both hotels and town center. iTWIST'14 has gathered about 70 international participants and has featured 9 invited talks, 10 oral presentations, and 14 posters on the following themes, all related to the theory, application and generalization of the "sparsity paradigm": Sparsity-driven data sensing and processing; Union of low dimensional subspaces; Beyond linear and convex inverse problem; Matrix/manifold/graph sensing/processing; Blind inverse problems and dictionary learning; Sparsity and computational neuroscience; Information theory, geometry and randomness; Complexity/accuracy tradeoffs in numerical methods; Sparsity? What's next?; Sparse machine learning and inference.Comment: 69 pages, 24 extended abstracts, iTWIST'14 website: http://sites.google.com/site/itwist1

An OFDM Signal Identification Method for Wireless Communications Systems

Distinction of OFDM signals from single carrier signals is highly important for adaptive receiver algorithms and signal identification applications. OFDM signals exhibit Gaussian characteristics in time domain and fourth order cumulants of Gaussian distributed signals vanish in contrary to the cumulants of other signals. Thus fourth order cumulants can be utilized for OFDM signal identification. In this paper, first, formulations of the estimates of the fourth order cumulants for OFDM signals are provided. Then it is shown these estimates are affected significantly from the wireless channel impairments, frequency offset, phase offset and sampling mismatch. To overcome these problems, a general chi-square constant false alarm rate Gaussianity test which employs estimates of cumulants and their covariances is adapted to the specific case of wireless OFDM signals. Estimation of the covariance matrix of the fourth order cumulants are greatly simplified peculiar to the OFDM signals. A measurement setup is developed to analyze the performance of the identification method and for comparison purposes. A parametric measurement analysis is provided depending on modulation order, signal to noise ratio, number of symbols, and degree of freedom of the underlying test. The proposed method outperforms statistical tests which are based on fixed thresholds or empirical values, while a priori information requirement and complexity of the proposed method are lower than the coherent identification techniques

Automatic modulation classification of communication signals

The automatic modulation recognition (AMR) plays an important role in various civilian and military applications. Most of the existing AMR algorithms assume that the input signal is only of analog modulation or is only of digital modulation. In blind environments, however, it is impossible to know in advance if the received communication signal is analogue modulated or digitally modulated. Furthermore, it is noted that the applications of the currently existing AMR algorithms designed for handling both analog and digital communication signals are rather restricted in practice. Motivated by this, an AMR algorithm that is able to discriminate between analog communication signals and digital communication signals is developed in this dissertation. The proposed algorithm is able to recognize the concrete modulation type if the input is an analog communication signal and to estimate the number of modulation levels and the frequency deviation if the input is an exponentially modulated digital communication signal. For linearly modulated digital communication signals, the proposed classifier will classify them into one of several nonoverlapping sets of modulation types. In addition, in M-ary FSK (MFSK) signal classification, two classifiers have also been developed. These two classifiers are also capable of providing good estimate of the frequency deviation of a received MFSK signal. For further classification of linearly modulated digital communication signals, it is often necessary to blindly equalize the received signal before performing modulation recognition. This doing generally requires knowing the carrier frequency and symbol rate of the input signal. For this purpose, a blind carrier frequency estimation algorithm and a blind symbol rate estimation algorithm have been developed. The carrier frequency estimator is based on the phases of the autocorrelation functions of the received signal. Unlike the cyclic correlation based estimators, it does not require the transmitted symbols being non-circularly distributed. The symbol rate estimator is based on digital communication signals\u27 cyclostationarity related to the symbol rate. In order to adapt to the unknown symbol rate as well as the unknown excess bandwidth, the received signal is first filtered by using a bank of filters. Symbol rate candidates and their associated confident measurements are extracted from the fourth order cyclic moments of the filtered outputs, and the final estimate of symbol rate is made based on weighted majority voting. A thorough evaluation of some well-known feature based AMR algorithms is also presented in this dissertation