On the Capacity of Cloud Radio Access Networks with Oblivious Relaying - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

On the Capacity of Cloud Radio Access Networks with Oblivious Relaying

Résumé

We study the transmission over a network in which users send information to a remote destination through relay nodes that are connected to the destination via finite-capacity error-free links, i.e., a cloud radio access network. The relays are constrained to operate without knowledge of the users' codebooks, i.e., they perform oblivious processing - The destination, or central processor, however, is informed about the users' codebooks. We establish a single-letter characterization of the capacity region of this model for a class of discrete memoryless channels in which the outputs at the relay nodes are independent given the users' inputs. We show that both relaying \`a-la Cover-El Gamal, i.e., compress-and-forward with joint decompression and decoding, and "noisy network coding", are optimal. The proof of the converse part establishes, and utilizes, connections with the Chief Executive Officer (CEO) source coding problem under logarithmic loss distortion measure. Extensions to general discrete memoryless channels are also investigated. In this case, we establish inner and outer bounds on the capacity region. For memoryless Gaussian channels within the studied class of channels, we characterize the capacity under Gaussian channel inputs.

Dates et versions

hal-01806547 , version 1 (03-06-2018)

Identifiants

Citer

Inaki Estella Aguerri, Abdellatif Zaidi, Giuseppe Caire, Shlomo Shamai. On the Capacity of Cloud Radio Access Networks with Oblivious Relaying. IEEE Internation Conference on Information Theory, ISIT, Jun 2017, Aachen, Germany. ⟨hal-01806547⟩
46 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More