Robust Layered Transmission and Compression for Distributed Uplink Reception in Cloud Radio Access Networks

In the uplink of cloud radio access networks, each base station (BS) compresses the received signal before transmission to the cloud decoder via capacity-limited backhaul links. A major issue in designing the transmission strategy at the mobile stations (MSs) and the compression strategies is the lack of channel state information (CSI) relative to the signal received by BSs in other cells. To tackle this problem, this paper proposes layered transmission and compression strategies that aim at opportunistically leveraging more advantageous channel conditions to neighboring BSs. A competitive robustness criterion is adopted, which enforces the constraint that a fraction of the rate that is achievable when the CSI is perfectly known to the MSs and the BS in the cell under study should be attained also in the absence of CSI. Under competitive robustness and backhaul capacity constraints, the problem is formulated as the minimization of the transmit power. Extensive numerical results confirm the effectiveness of the proposed approaches.

[1]  Wei Yu,et al.  Uplink multicell processing with limited backhaul via successive interference cancellation , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[2]  Shlomo Shamai,et al.  Uplink Macro Diversity of Limited Backhaul Cellular Network , 2008, IEEE Transactions on Information Theory.

[3]  Shlomo Shamai,et al.  Distributed MIMO Receiver—Achievable Rates and Upper Bounds , 2007, IEEE Transactions on Information Theory.

[4]  Shlomo Shamai,et al.  Variable-Rate Channel Capacity , 2010, IEEE Transactions on Information Theory.

[5]  C-ran the Road towards Green Ran , 2022 .

[6]  Gal Chechik,et al.  Information Bottleneck for Gaussian Variables , 2003, J. Mach. Learn. Res..

[7]  Aitor del Coso,et al.  Distributed compression for MIMO coordinated networks with a backhaul constraint , 2009, IEEE Transactions on Wireless Communications.

[8]  Shlomo Shamai,et al.  Structured superposition for backhaul constrained cellular uplink , 2009, 2009 IEEE International Symposium on Information Theory.

[9]  Thomas M. Cover,et al.  Comments on Broadcast Channels , 1998, IEEE Trans. Inf. Theory.

[10]  Shlomo Shamai,et al.  The broadcast approach under mixed delay constraints , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[11]  Shlomo Shamai,et al.  Minimum Expected Distortion in Gaussian Source Coding With Fading Side Information , 2008, IEEE Transactions on Information Theory.

[12]  Youjian Liu,et al.  Optimal rate allocation for superposition coding in quasi-static fading channels , 2002, Proceedings IEEE International Symposium on Information Theory,.

[13]  Shlomo Shamai,et al.  Robust and Efficient Distributed Compression for Cloud Radio Access Networks , 2012, IEEE Transactions on Vehicular Technology.

[14]  Hao Guan,et al.  Future Mobile Communication Networks: Challenges in the Design and Operation , 2012, IEEE Vehicular Technology Magazine.

[15]  Shlomo Shamai,et al.  Delay-tolerant robust communication on an out-of-band relay channel with fading side information , 2013, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

[16]  Sergio Barbarossa,et al.  Competitive Design of Multiuser MIMO Systems Based on Game Theory: A Unified View , 2008, IEEE Journal on Selected Areas in Communications.

[17]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[18]  Giuseppe Caire,et al.  Quantized compute and forward: A low-complexity architecture for distributed antenna systems , 2011, 2011 IEEE Information Theory Workshop.

[19]  Shlomo Shamai,et al.  Single-User Broadcasting Protocols Over a Two-Hop Relay Fading Channel , 2006, IEEE Transactions on Information Theory.

[20]  Shlomo Shamai,et al.  Robust Communication via Decentralized Processing With Unreliable Backhaul Links , 2011, IEEE Transactions on Information Theory.

[21]  Toby Berger,et al.  Rate distortion when side information may be absent , 1985, IEEE Trans. Inf. Theory.

[22]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[23]  Toby Berger,et al.  Robust Distributed Source Coding , 2006, IEEE Transactions on Information Theory.

[24]  Neri Merhav,et al.  Universal composite hypothesis testing: A competitive minimax approach , 2002, IEEE Trans. Inf. Theory.

[25]  Gerhard Fettweis,et al.  Uplink CoMP under a Constrained Backhaul and Imperfect Channel Knowledge , 2010, IEEE Transactions on Wireless Communications.

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

[27]  Shlomo Shamai,et al.  A broadcast approach for a single-user slowly fading MIMO channel , 2003, IEEE Trans. Inf. Theory.

[28]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[29]  Shlomo Shamai,et al.  Worst-case expected-rate loss of slow-fading channels , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[30]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[31]  K. Mani Chandy,et al.  Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow , 2012, IEEE Transactions on Control of Network Systems.

[32]  Yonina C. Eldar.  Robust Competitive Estimation With Signal and Noise Covariance Uncertainties , 2006, IEEE Transactions on Information Theory.

[33]  Sheng Liu,et al.  A 25 Gb/s(/km2) urban wireless network beyond IMT-advanced , 2011, IEEE Communications Magazine.

[34]  M. Yuksel,et al.  Broadcast strategies for the fading relay channel , 2004, IEEE MILCOM 2004. Military Communications Conference, 2004..

[35]  Anant Sahai,et al.  Comments on unknown channels , 2012, 2012 IEEE Information Theory Workshop.

[36]  Shlomo Shamai,et al.  Robust distributed compression for cloud radio access networks , 2012, 2012 IEEE Information Theory Workshop.