跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 10:34 — 2026-11-16 10:34(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2611.15199

Hybrid Precoding and Combining for O-RAN Massive MIMO Systems

Seraphin F. Kimaryo, Jung-Mo Moon, Kyungchun Lee

原文摘要

Recently, the radio access network (RAN) has been reimagined through open RAN (O-RAN) architecture to overcome the limitations of the traditional monolithic, black-box design philosophy and to leverage emerging technologies such as cloud computing, machine learning, and artificial intelligence. Although O-RAN disaggregates the base station (BS) into independent components to enable modular deployment, this paradigm introduces new challenges in signal processing and beamforming. In particular, beamforming in O-RAN must account for fronthaul link (FHL) capacity constraints, coordinated operation of multiple radio units (possibly from different vendors), and resource management, including transmit power allocation. To address these challenges, this work proposes novel beamforming techniques for a downlink multiuser hybrid massive multiple-input multiple-output system, in which hybrid architectures are deployed at both the users and at each BS radio unit. We formulate a sum-rate maximization problem incorporating transmit-power, unit-modulus, and FHL capacity constraints. The proposed algorithm integrates gradient descent and the Lagrange multiplier method to design analog beamformers and digital precoders, respectively, whereas digital combiners are designed to render the received streams parallel to each other. By avoiding computationally intensive operations such as eigenvalue and singular value decompositions, the proposed approach, as evidenced by simulation results, achieves superior performance with moderate computational complexity compared to existing benchmark schemes.

cs.IT