Blind Demixing for Low-Latency Communication

• Published in: IEEE transactions on wireless communications Vol. 18; no. 2; pp. 897 - 911
• Main Authors: Dong, Jialin, Yang, Kai, Shi, Yuanming
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.02.2019; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Blind demixing; Channel estimation; Communication; Complexity; Complexity theory; Convergence; Cost analysis; Demixing; Ground truth; Interference; Iterative methods; low-latency communication; low-rank optimization; Manifolds; Manifolds (mathematics); Mathematical analysis; Matrix methods; OFDM; Optimization; Optimization algorithms; product manifold; Riemannian optimization; Statistical analysis; Symmetric matrices; Virtual reality; Wireless communications; Wireless networks
• ISSN: 1536-1276; 1558-2248
• DOI: 10.1109/TWC.2018.2886191

In next-generation wireless networks, low-latency 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 the single observed vector without any channel estimation. To address the unique challenges of multiple non-convex rank-one constraints, the quotient manifold geometry of the product of complex symmetric rank-one matrices is exploited. This is achieved by equivalently reformulating the original problem that uses complex asymmetric matrices to the one that uses Hermitian positive semidefinite matrices. We further generalize the geometric concepts of the complex product manifold via element-wise extension of the geometric concepts of the individual manifolds. The scalable Riemannian optimization algorithms, i.e., the Riemannian gradient descent algorithm and the Riemannian trust-region algorithm, are then developed to solve the blind demixing problem efficiently with low iteration complexity and low iteration cost. The statistical analysis shows that the Riemannian gradient descent with spectral initialization is guaranteed to linearly converge to the ground truth signals provided sufficient measurements. In addition, the Riemannian trust-region algorithm is provable to converge to an approximate local minimum from the arbitrary initialization point. Numerical experiments have been carried out in settings with different types of encoding matrices to demonstrate the algorithmic advantages, performance gains, and sample efficiency of the Riemannian optimization algorithms.