Papers
Topics
Authors
Recent
2000 character limit reached

The Complexity-Rate Tradeoff of Centralized Radio Access Networks

Published 30 Mar 2015 in cs.IT, cs.NI, and math.IT | (1503.08585v3)

Abstract: In a centralized RAN, the signals from multiple RAPs are processed centrally in a data center. Centralized RAN enables advanced interference coordination strategies while leveraging the elastic provisioning of data processing resources. It is particularly well suited for dense deployments, such as within a large building where the RAPs are connected via fibre and many cells are underutilized. This paper considers the computational requirements of centralized RAN with the goal of illuminating the benefits of pooling computational resources. A new analytical framework is proposed for quantifying the computational load associated with the centralized processing of uplink signals in the presence of block Rayleigh fading, distance-dependent path-loss, and fractional power control. Several new performance metrics are defined, including computational outage probability, outage complexity, computational gain, computational diversity, and the complexity-rate tradeoff. The validity of the analytical framework is confirmed by comparing it numerically with a simulator compliant with the 3GPP LTE standard. Using the developed metrics, it is shown that centralizing the computing resources provides a higher net throughput per computational resource as compared to local processing.

Citations (61)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.