2014 Information Theory and Applications Workshop (ITA) 2014
DOI: 10.1109/ita.2014.6804240
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid compression and message-sharing strategy for the downlink cloud radio-access network

Abstract: Abstract-Cloud radio-access network (CRAN) is a wireless cellular network architecture in which the base-stations are connected to a cloud-computing based central processor with digital backhaul links. In this setting, the base-stations can be thought of as relays between the central processor and the user terminals. This paper considers the downlink of a cloud radioaccess network with finite-capacity backhaul links. We model the overall network as a relay broadcast channel, and propose a hybrid compression an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
42
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 42 publications
(42 citation statements)
references
References 11 publications
0
42
0
Order By: Relevance
“…This improvement comes from the correlation between RRHs to which distributed source coding can be applied [12]. A hybrid compression and message-sharing is proposed in [13] that allows the BSs to alternatively chose to perform a mix of compression and data-sharing on downlinks. We would emphasize that these joint compression techniques are investigated under information theoretic aspect.…”
Section: Introductionmentioning
confidence: 99%
“…This improvement comes from the correlation between RRHs to which distributed source coding can be applied [12]. A hybrid compression and message-sharing is proposed in [13] that allows the BSs to alternatively chose to perform a mix of compression and data-sharing on downlinks. We would emphasize that these joint compression techniques are investigated under information theoretic aspect.…”
Section: Introductionmentioning
confidence: 99%
“…We specialize Theorem 1 to the symmetric Gaussian C-RAN defined in (6) and (7) where P m = P for all m = 1, . .…”
Section: The Symmetric Gaussian C-ranmentioning
confidence: 99%
“…We refer to [1][2][3] and the references therein for an overview of the challenges and coding techniques for C-RANs. Several coding schemes have been proposed in recent years for the downlink of C-RANs including message sharing [4], backhaul compression [5], hybrid schemes [6] and generalized data sharing using Marton's coding [7,8]. The paper [9] gives an upper bound on the sum-rate of two-relay C-RANs with two users and numerically compares the performance of the aforementioned schemes with the upper bound.…”
Section: Introductionmentioning
confidence: 99%
“…Numerous research efforts have recently investigated the compression of C-RAN, from both information-theoretic perspective [5][6][7][8], which designs and optimizes the quantization noise to maximize the achievable sum rate, and practical system point of view [11], [12], which minimizes redundancy of control information in common public radio interface package. It is shown, in general, that the joint design of the precoding and quantization noise matrix can significantly improve the system sum rate over separate designs [5].…”
Section: Introductionmentioning
confidence: 99%
“…It is shown, in general, that the joint design of the precoding and quantization noise matrix can significantly improve the system sum rate over separate designs [5]. Additional performance gain can be achieved by optimizing the test channel [9] or performing hybrid compression and message-sharing strategy [6]. From the practical system perspective, efficient compression can be performed in both time-and frequencydomains (sub-carrier compression) [1].…”
Section: Introductionmentioning
confidence: 99%