Andreas Benzin | Searcharxiv

arXiv2026

A Modular O-RAN Testbed Based on SRS Open Source O-CU/O-DU and Massive Beams Modular O-RU

In this paper, we present a modular open radio access network (O-RAN) consisting of the 5G Core, a central (O-CU) and distributed unit (O-DU) by Software Radio Systems (SRS) and an O-RAN radio unit (O-RU), MODRAD-SC, by Massive Beams (MB). OCUDU provides an open source 5G-compliant O-CU and O-DU solution developed by SRS, while MB's radio unit is a fully O-RAN compliant category A O-RU. According to O-RAN split 7.2a, OCUDU performs higher layer functions up to the high physical (PHY) layer, while the O-RU handles low PHY and RF functions. This results in an O-RAN-compliant 5G gNodeB. In an alternative configuration, OCUDU and MODRAD-SC operate in a software-defined radio fashion corresponding to split 8, facilitating non-real-time experiments among others. In both cases, the system provides full control over O-CU, O-DU, and O-RU. In addition, we will discuss the possibility to attach an analog beamformer to the O-RU, enabling hybrid digital-analog beamforming. The flexibility and modularity offered by OCUDU and MODRAD-SC enable the practical realization of a multitude of applications, ranging from 5G demonstrators to pre-6G experiments. The system addresses the requirements of academia and industry and is well-suited as an easy-to-use platform for experimental and practical deployments.

cs.NI↗

arXiv2017

Truncated Polynomial Expansion Downlink Precoders and Uplink Detectors for Massive MIMO

In TDD reciprocity-based massive MIMO it is essential to be able to compute the downlink precoding matrix over all OFDM resource blocks within a small fraction of the uplink-downlink slot duration. Early implementation of massive MIMO are limited to the simple Conjugate Beamforming (ConjBF) precoding method, because of such computation latency limitation. However, it has been widely demonstrated by theoretical analysis and system simulation that Regularized Zero-Forcing (RZF) precoding is generally much more effective than ConjBF for a large but practical number of transmit antennas. In order to recover a significant fraction of the gap between ConjBF and RZF and yet meeting the very strict computation latency constraints, truncated polynomial expansion (TPE) methods have been proposed. In this paper we present a novel TPE method that outperforms all previously proposed methods in the general non-symmetric case of users with arbitrary antenna correlation. In addition, the proposed method is significantly simpler and more flexible than previously proposed methods based on deterministic equivalents and free probability in large random matrix theory. We consider power allocation with our TPE approach, and show that classical system optimization problems such as min-sum power and max-min rate can be easily solved. Furthermore, we provide a detailed computation latency analysis specifically targeted to a highly parallel FPGA hardware architecture.

cs.IT↗