Computing one-bit compressive sensing via double-sparsity constrained optimization

One-bit compressive sensing is popular in signal processing and communications due to the advantage of its low storage costs and hardware complexity. However, it has been a challenging task all along since only the one-bit (the sign) information is available to recover the signal. In this paper, we appropriately formulate the one-bit compressed sensing by a double-sparsity constrained optimization problem. The first-order optimality conditions via the newly introduced τ-stationarity for this nonconvex and discontinuous problem are established, based on which, a gradient projection subspace pursuit (GPSP) approach with global convergence and fast convergence rate is proposed. Numerical experiments against other leading solvers illustrate the high efficiency of our proposed algorithm in terms of the computation time and the quality of the signal recovery as well

Some MIMO applications in cognitive radio networks

In the last decade, the wireless communication technology has witnessed a rapid development, which led to a rapid growth in wireless applications and services. However, the radio spectrum resources scarcity resulting from using the traditional methods of fixed spectrum resources allocation has potential constraints on this wireless services rapid growth. Consequently, cognitive radio has been emerged as a possible solution for alleviating this spectrum scarcity problem by employing dynamic resource allocation strategies in order to utilize the available spectrum in a more efficient way so that finding opportunities for new wireless application services could be achieved. In cognitive radio networks, the radio spectrum resources utilization is improved by allowing unlicensed users, known as secondary users, to share the spectrum with licensed users, known as primary users, as long as this sharing do not induce harmful interference on the primary users, which completely entitled to utilize the spectrum. Motivated by MIMO techniques that have been used in practical systems as a means for high data rate transmission and a source for spatial diversity, and by its ease implementation with OFDM, different issues in multi-user MIMO (MU-MIMO) in both the uplink and downlink in the context of cognitive radio are studied in this thesis. More specifically, in the first thrust of this thesis, the spectrum spatial holes which could exist in an uplink MU-MIMO cell as a result of the possible free spatial dimensions resulted from the sparse activity of the primary users is studied; a modified sensing algorithm for these spectrum spatial holes that exploit both the block structure of the OFDM signals and the correlation of their activity states along time are proposed. The second thrust is concerned with cognitive radio relaying in the physical layer where the cognitive radio base station (CBS) relays the PU signal while transmitting its own signals to its SUs. We define secondary users with different priorities (different quality of service requirements); the different levels of priority for SUs are achieved by a newly proposed simple linear scheme based on zero forcing called Hierarchal Priority Zero Forcing scheme HPZF

Compressive sampling based differential detection for UWB impulse radio signals

Noncoherent detectors significantly contribute to the practical realization of the ultra-wideband (UWB) impulse-radio (IR) concept, in that they allow avoiding channel estimation and provide highly efficient reception capabilities. Complexity can be reduced even further by resorting to an all-digital implementation, but Nyquist-rate sampling of the received signal is still required. The current paper addresses this issue by proposing a novel differential detection (DD) scheme, which exploits the compressive sampling (CS) framework to reduce the sampling rate much below the Nyquist-rate. The optimization problem is formulated to jointly recover the sparse received signal as well as the differentially encoded data symbols, and is compared with both the separate approach and the scheme using the compressed received signal directly, i.e., without reconstruction. Finally, a maximum a posteriori based detector using the compressed symbols is developed for a Laplacian distributed channel, as a reference to compare the performance of the proposed approaches. Simulation results show that the proposed joint CS-based DD brings the considerable advantage of reducing the sampling rate without degrading the performance, compared with the optimal MAP detector