Graph-based Framework for Flexible Baseband Function Splitting and Placement in C-RAN
Jingchu Liu, Sheng Zhou, Jie Gong, Zhisheng Niu, Shugong Xu

TL;DR
This paper introduces a graph-based framework for optimizing the splitting and placement of baseband functions in C-RAN to reduce fronthaul costs, using a genetic algorithm for solution optimization.
Contribution
It presents a novel graph-based approach to model and solve the baseband function placement problem in C-RAN, improving fronthaul efficiency.
Findings
Proper splitting reduces fronthaul costs significantly.
Cooperative processing increases likelihood of centralized placement.
Trade-off observed between fronthaul cost reduction and computational complexity.
Abstract
The baseband-up centralization architecture of radio access networks (C-RAN) has recently been proposed to support efficient cooperative communications and reduce deployment and operational costs. However, the massive fronthaul bandwidth required to aggregate baseband samples from remote radio heads (RRHs) to the central office incurs huge fronthauling cost, and existing baseband compression algorithms can hardly solve this issue. In this paper, we propose a graphbased framework to effectively reduce fronthauling cost through properly splitting and placing baseband processing functions in the network. Baseband transceiver structures are represented with directed graphs, in which nodes correspond to baseband functions, and edges to the information flows between functions. By mapping graph weighs to computational and fronthauling costs, we transform the problem of finding the optimum…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
