Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2212.02811

Help | Advanced Search

Computer Science > Information Theory

arXiv:2212.02811 (cs)
[Submitted on 6 Dec 2022 ]

Title: Asynchronous Cell-Free Massive MIMO With Rate-Splitting

Title: 异步无基站大规模MIMO与速率分割

Authors:Jiakang Zheng, Jiayi Zhang, Julian Cheng, Victor C. M. Leung, Derrick Wing Kwan Ng, Bo Ai
Abstract: In practical cell-free (CF) massive multiple-input multiple-output (MIMO) networks with distributed and low-cost access points, the asynchronous arrival of signals at the user equipments increases multi-user interference that degrades the system performance. Meanwhile, rate-splitting (RS), exploiting the transmission of both common and private messages, has demonstrated to offer considerable spectral efficiency (SE) improvements and its robustness against channel state information (CSI) imperfection. The signal performance of a CF massive MIMO system is first analyzed for asynchronous reception capturing the joint effects of propagation delays and oscillator phases of transceivers. Taking into account the imperfect CSI caused by asynchronous phases and pilot contamination, we derive novel and closed-form downlink SE expressions for characterizing the performance of both the RS-assisted and conventional non-RS-based systems adopting coherent and non-coherent data transmission schemes, respectively. Moreover, we formulate the design of robust precoding for the common messages as an optimization problem that maximizes the minimum individual SE of the common message. To address the non-convexity of the design problem, a bisection method is proposed to solve the problem optimally. Simulation results show that asynchronous reception indeed destroys both the orthogonality of the pilots and the coherent data transmission resulting in poor system performance. Besides, thanks to the uniform coverage properties of CF massive MIMO systems, RS with a simple low-complexity precoding for the common message obtained by the equal ratio sum of the private precoding is able to achieve substantial downlink sum SE gains, while the application of robust precoding to the common message is shown to be useful in some extreme cases, e.g., serious oscillator mismatch and unknown delay phase.
Abstract: 在具有分布式和低成本接入点的实际无蜂窝(CF)大规模多输入多输出(MIMO)网络中,用户设备处信号的异步到达增加了多用户干扰,从而降低了系统性能。 同时,速率分割(RS)通过传输公共消息和私有消息,已被证明可以显著提高频谱效率(SE),并且对信道状态信息(CSI)不完善具有鲁棒性。 首先分析了CF大规模MIMO系统的信号性能,以捕捉传播延迟和收发器振荡器相位的联合影响。 考虑到由异步相位和导频污染引起的不完善的CSI,我们推导出了新颖且闭合形式的下行链路SE表达式,分别用于表征采用相干和非相干数据传输方案的RS辅助系统和传统非RS系统性能。 此外,我们将公共消息的鲁棒预编码设计 formulated 为一个优化问题,该问题最大化公共消息的最小个体SE。 为了解决设计问题的非凸性,提出了一种二分法来最优地解决该问题。 仿真结果表明,异步接收确实破坏了导频的正交性和相干数据传输,导致系统性能较差。 此外,由于CF大规模MIMO系统的均匀覆盖特性,使用通过私有预编码的等比和获得的简单低复杂度预编码的RS能够实现显著的下行链路总SE增益,而将鲁棒预编码应用于公共消息在某些极端情况下被证明是有用的,例如严重的振荡器失配和未知的延迟相位。
Comments: 34 pages, 11 figures, Accepted in IEEE Journal on Selected Areas in Communications
Subjects: Information Theory (cs.IT)
Cite as: arXiv:2212.02811 [cs.IT]
  (or arXiv:2212.02811v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.2212.02811
arXiv-issued DOI via DataCite

Submission history

From: Jiakang Zheng [view email]
[v1] Tue, 6 Dec 2022 08:01:50 UTC (1,464 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
math
math.IT

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号