On Achievability for Downlink Cloud Radio Access Networks With Base Station Cooperation

This paper investigates the downlink of a cloud radio access network (C-RAN) in which a central processor communicates with two mobile users through two base stations (BSs). The BSs act as relay nodes and cooperate with each other through error-free rate-limited links. We develop and analyze two cod...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2018-08, Vol.64 (8), p.5726-5742
Main Authors: Wang, Chien-Yi, Wigger, Michele, Zaidi, Abdellatif
Format: Article
Language:English
Subjects:
Base stations
Broadcast relay networks
cloud radio access networks
Codes
Coding
compression
Computer Science
conferencing relays
Cooperation
data sharing
distributed decode–forward
Downlink
Encoding
Gaussian networks
Indexes
Information Theory
Interference
Microprocessors
Mobile communication systems
Radio access networks
Radio equipment
Random variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper investigates the downlink of a cloud radio access network (C-RAN) in which a central processor communicates with two mobile users through two base stations (BSs). The BSs act as relay nodes and cooperate with each other through error-free rate-limited links. We develop and analyze two coding schemes for this scenario. The first coding scheme modifies the Liu-Kang scheme (to make it amenable to a rigorous analysis) and extends it to introduce common codewords and to apply for downlink C-RAN with BS-to-BS cooperation. This first coding scheme enables arbitrary correlation among the auxiliary codewords that are recovered by the BSs. We show that this scheme improves over previous schemes for various instances of Gaussian C-RAN channels. In particular, in many scenarios, the scheme can better exploit the possibility of BS-to-BS cooperation than other schemes. The second coding scheme extends the distributed decode and forward (DDF) scheme by means of Gray-Wyner compression and by exploiting the cooperation links between BSs. In addition and as a separate extension, we provide an improved capacity approximation for the DDF strategy for the capacity of a general N -BS L -user C-RAN model in the memoryless Gaussian case.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2018.2836675