Blind Demixing for Low-Latency Communication

In the next generation wireless networks, lowlatency communication is critical to support emerging diversified applications, e.g., Tactile Internet and Virtual Reality. In this paper, a novel blind demixing approach is developed to reduce the channel signaling overhead, thereby supporting low-latency communication. Specifically, we develop a low-rank approach to recover the original information only based on a single observed vector without any channel estimation. Unfortunately, this problem turns out to be a highly intractable non-convex optimization problem due to the multiple non-convex rankone constraints. To address the unique challenges, the quotient manifold geometry of product of complex asymmetric rankone matrices is exploited by equivalently reformulating original complex asymmetric matrices to the Hermitian positive semidefinite matrices. We further generalize the geometric concepts of the complex product manifolds via element-wise extension of the geometric concepts of the individual manifolds. A scalable Riemannian trust-region algorithm is then developed to solve the blind demixing problem efficiently with fast convergence rates and low iteration cost. Numerical results will demonstrate the algorithmic advantages and admirable performance of the proposed algorithm compared with the state-of-art methods.Comment: 14 pages, accepted by IEEE Transaction on Wireless Communicatio

Blind Signal Detection in Massive MIMO: Exploiting the Channel Sparsity

In practical massive MIMO systems, a substantial portion of system resources are consumed to acquire channel state information (CSI), leading to a drastically lower system capacity compared with the ideal case where perfect CSI is available. In this paper, we show that the overhead for CSI acquisition can be largely compensated by the potential gain due to the sparsity of the massive MIMO channel in a certain transformed domain. To this end, we propose a novel blind detection scheme that simultaneously estimates the channel and data by factorizing the received signal matrix. We show that by exploiting the channel sparsity, our proposed scheme can achieve a DoF very close to the ideal case, provided that the channel is sufficiently sparse. Specifically, the achievable degree of freedom (DoF) has a fractional gap of only $1/T$ from the ideal DoF, where $T$ is the channel coherence time. This is a remarkable advance for understanding the performance limit of the massive MIMO system. We further show that the performance advantage of our proposed scheme in the asymptotic SNR regime carries over to the practical SNR regime. Numerical results demonstrate that our proposed scheme significantly outperforms its counterpart schemes in the practical SNR regime under various system configurations.Comment: 32 pages, 9 figures, submitted to IEEE Trans. Commu

Convexity in source separation: Models, geometry, and algorithms

Source separation or demixing is the process of extracting multiple components entangled within a signal. Contemporary signal processing presents a host of difficult source separation problems, from interference cancellation to background subtraction, blind deconvolution, and even dictionary learning. Despite the recent progress in each of these applications, advances in high-throughput sensor technology place demixing algorithms under pressure to accommodate extremely high-dimensional signals, separate an ever larger number of sources, and cope with more sophisticated signal and mixing models. These difficulties are exacerbated by the need for real-time action in automated decision-making systems. Recent advances in convex optimization provide a simple framework for efficiently solving numerous difficult demixing problems. This article provides an overview of the emerging field, explains the theory that governs the underlying procedures, and surveys algorithms that solve them efficiently. We aim to equip practitioners with a toolkit for constructing their own demixing algorithms that work, as well as concrete intuition for why they work

On Amplify-and-Forward Relaying Over Hyper-Rayleigh Fading Channels

Relayed transmission holds promise for the next generation of wireless communication systems due to the performance gains it can provide over non-cooperative systems. Recently hyper-Rayleigh fading, which represents fading conditions more severe than Rayleigh fading, has received attention in the context of many practical communication scenarios. Though power allocation for Amplify-and-Forward (AF) relaying networks has been studied in the literature, a theoretical analysis of the power allocation problem for hyper-Rayleigh fading channels is a novel contribution of this work. We develop an optimal power allocation (OPA) strategy for a dual-hop AF relaying network in which the relay-destination link experiences hyper-Rayleigh fading. A new closed-form expression for the average signal-to-noise ratio (SNR) at destination is derived and it is shown to provide a new upper-bound on the average SNR at destination, which outperforms a previously proposed upper-bound based on the well-known harmonic-geometric mean inequality. An OPA across the source and relay nodes, subject to a sum-power constraint, is proposed and it is shown to provide measurable performance gains in average SNR and SNR outage at the destination relative to the case of equal power allocation

Two-Way Training for Discriminatory Channel Estimation in Wireless MIMO Systems

This work examines the use of two-way training to efficiently discriminate the channel estimation performances at a legitimate receiver (LR) and an unauthorized receiver (UR) in a multiple-input multiple-output (MIMO) wireless system. This work improves upon the original discriminatory channel estimation (DCE) scheme proposed by Chang et al where multiple stages of feedback and retraining were used. While most studies on physical layer secrecy are under the information-theoretic framework and focus directly on the data transmission phase, studies on DCE focus on the training phase and aim to provide a practical signal processing technique to discriminate between the channel estimation performances at LR and UR. A key feature of DCE designs is the insertion of artificial noise (AN) in the training signal to degrade the channel estimation performance at UR. To do so, AN must be placed in a carefully chosen subspace based on the transmitter's knowledge of LR's channel in order to minimize its effect on LR. In this paper, we adopt the idea of two-way training that allows both the transmitter and LR to send training signals to facilitate channel estimation at both ends. Both reciprocal and non-reciprocal channels are considered and a two-way DCE scheme is proposed for each scenario. {For mathematical tractability, we assume that all terminals employ the linear minimum mean square error criterion for channel estimation. Based on the mean square error (MSE) of the channel estimates at all terminals,} we formulate and solve an optimization problem where the optimal power allocation between the training signal and AN is found by minimizing the MSE of LR's channel estimate subject to a constraint on the MSE achievable at UR. Numerical results show that the proposed DCE schemes can effectively discriminate between the channel estimation and hence the data detection performances at LR and UR.Comment: 1