arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2609.09777eess.SP

多流时空信道编码用于MIMO系统:传输方案设计与可达速率优化

Multi-Stream Spatiotemporal Channel Coding for MIMO Systems: Transmission Scheme Design and Achievable Rate Optimization

Liang Jin, Xiaodong Xu, Shujun Han, Xiaoyu Chi, Ping Zhang, Chau Yuen

首次发表
浏览论文内容

中文总结 AI 辅助

本文提出多流多子信道时空信道编码(STCC-MSC)方案,通过联合优化子信道分配与功率分配,并设计PACA算法求解,在MIMO系统中显著提升可达速率,较TCC方案提升28.68%。

中文摘要 AI 辅助

时空信道编码(STCC)通过利用空间自由度来扩展码字长度,相较于传统时间信道编码(TCC)能够提升可达速率。尽管关于STCC的信息论基础已有若干建立,但从通信理论视角对传输方案的研究仍处于早期阶段。本文在完全信道状态信息假设下提出了一种多流多子信道STCC(STCC-MSC)方案,并在有限块长机制下优化其可达速率。我们首先在点对点MIMO系统中构建STCC-MSC的传输架构,该架构引入了流-子信道匹配机制。随后,通过联合优化子信道分配和功率分配策略来最大化STCC-MSC的可达速率,该问题被建模为混合整数非线性规划问题。接着,提出了一种惩罚交替凸近似(PACA)算法来求解该问题。之后,我们将点对点STCC-MSC设计扩展到更一般的多用户MIMO系统,包括上行和下行场景。最后,仿真结果表明,在STCC-MSC方案内,PACA算法相较于基准算法实现了9.85%的速率提升。此外,联合STCC-MSC-PACA方案相较于TCC方案将可达速率提升了28.68%。

英文摘要

Spatiotemporal channel coding (STCC) can improve the achievable rate over traditional temporal channel coding (TCC) by leveraging spatial degrees of freedom to extend the codeword length. Although several information-theoretic foundations on STCC have been established, the investigation of transmission schemes from a communication-theoretic perspective remains in its early stages. This paper proposes a multi-stream over multi-subchannel STCC (STCC-MSC) under full channel state information assumption and optimizes its achievable rate in the finite blocklength regime. We first formulate the transmission architecture of STCC-MSC in a point-to-point MIMO system, which introduces a stream-subchannel matching mechanism. We then maximize the achievable rate of STCC-MSC by jointly optimizing the subchannel assignment and power allocation strategies, which is formulated as a mixed-integer-nonlinear-programming problem. Next, a penalized alternating convex approximation (PACA) algorithm is proposed to solve this problem. Subsequently, we extend the point-to-point STCC-MSC designs to the more general multi-user MIMO systems, including both uplink and downlink scenarios. Finally, simulation results indicate that the PACA algorithm achieves a 9.85% rate improvement over the benchmark algorithm within the STCC-MSC scheme. Furthermore, the joint STCC-MSC-PACA scheme improves the achievable rate by 28.68% over TCC scheme.

发表机构

  • Beijing University of Posts and Telecommunications(北京邮电大学)
  • Peng Cheng Laboratory(鹏城实验室)
  • Nanyang Technological University(南洋理工大学)

机构由 AI 辅助整理,请以论文原文为准。

补充信息

↑