arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.02158cs.ITmath.IT
收藏

低延迟通信中的盲解混算法

Blind Demixing for Low-Latency Communication

Jialin Dong, Kai Yang, Yuanming Shi

摘要:

在下一代无线网络中,低延迟通信对于支持新兴的多样化应用是至关重要的,触觉互联网与虚拟现实。在本文中,一种新的盲解混方法,以减少信道信令开销,从而支持低延迟通信。具体来说,我们开发了一种低秩的方法来恢复原始信息,只基于一个单一的观察向量,没有任何信道估计。不幸的是,这个问题原来是一个非常棘手的非凸优化问题,由于多个非凸的rankone约束。为了解决这一独特的挑战,利用复非对称秩酮矩阵乘积的商流形几何,将原复非对称矩阵等价地转化为Hermitian半正定矩阵.我们进一步推广的几何概念的复积流形通过元素的个别流形的几何概念。一个可扩展的黎曼信赖域算法,然后开发解决盲解混问题有效地与快速收敛速度和低迭代成本。数值结果表明,该算法的算法优势和令人钦佩的性能相比,最先进的方法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑