The Filtered Gaussian Primitive Diamond Channel

We investigate the special case of diamond relay comprising a Gaussian channel with identical frequency response between the user and the relays and fronthaul links with limited rate from the relays to the destination. We use the oblivious compress and forward (CF) with distributed compression and decode and forward (DF) where each relay decodes the whole message and sends half of its bits to the destination. We derive the achievable rate by using optimal time-sharing between DF and CF, which is advantageous over superposition of CF and DF. The optimal time sharing proportion between DF and CF and power and rate allocations are different at each frequency and are fully determined.

[1]  Gerhard Kramer,et al.  Cooperative Communications , 2007, Found. Trends Netw..

[2]  Xavier Gelabert,et al.  Modulation Compression in Next Generation RAN: Air Interface and Fronthaul Trade-offs , 2020, IEEE Communications Magazine.

[3]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[4]  Shlomo Shamai,et al.  On the Information Bottleneck Problems: Models, Connections, Applications and Information Theoretic Views , 2020, Entropy.

[5]  Sae-Young Chung,et al.  Noisy Network Coding , 2010, IEEE Transactions on Information Theory.

[6]  Shlomo Shamai,et al.  Gaussian Diamond Primitive Relay with Oblivious Processing , 2019, 2019 IEEE International Conference on Microwaves, Antennas, Communications and Electronic Systems (COMCAS).

[7]  Inaki Estella Aguerri,et al.  Vector Gaussian CEO Problem Under Logarithmic Loss and Applications , 2018, IEEE Transactions on Information Theory.

[8]  Shlomo Shamai,et al.  On the capacity of cloud radio access networks with oblivious relaying , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[9]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[10]  Shlomo Shamai,et al.  Fronthaul Compression for Cloud Radio Access Networks: Signal processing advances inspired by network information theory , 2014, IEEE Signal Processing Magazine.

[11]  Young-Han Kim,et al.  On the Capacity Regions of Cloud Radio Access Networks With Limited Orthogonal Fronthaul , 2019, IEEE Transactions on Information Theory.

[12]  Inaki Estella Aguerri,et al.  Distributed Information Bottleneck Method for Discrete and Gaussian Sources , 2017, ArXiv.

[13]  H. Vincent Poor,et al.  New Viewpoint and Algorithms for Water-Filling Solutions in Wireless Communications , 2018, IEEE Transactions on Signal Processing.

[14]  Amos Lapidoth.  A Foundation In Digital Communication: Index , 2009 .

[15]  Shlomo Shamai,et al.  Communication Via Decentralized Processing , 2005, IEEE Transactions on Information Theory.

[16]  Amos Lapidoth,et al.  A Foundation In Digital Communication: Index , 2009 .

[17]  Shlomo Shamai,et al.  New Upper Bounds on the Capacity of Primitive Diamond Relay Channels , 2019, 2019 IEEE Information Theory Workshop (ITW).

[18]  Amin Gohari,et al.  Achievable Rates for the Relay Channel with Orthogonal Receiver Components , 2021, 2021 IEEE Information Theory Workshop (ITW).

[19]  Naftali Tishby,et al.  The information bottleneck method , 2000, ArXiv.

[20]  José Alberto Hernández,et al.  An overview of the CPRI specification and its application to C-RAN-based LTE scenarios , 2016, IEEE Communications Magazine.