Joint Design of Fronthauling and Hybrid Beamforming for Downlink C-RAN Systems

February 28, 2019 Β· Declared Dead Β· πŸ› IEEE Transactions on Communications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Jaein Kim, Seok-Hwan Park, Osvaldo Simeone, Inkyu Lee, Shlomo Shamai arXiv ID 1902.10873 Category cs.IT: Information Theory Citations 36 Venue IEEE Transactions on Communications Last Checked 6 months ago
Abstract
Hybrid beamforming is known to be a cost-effective and wide-spread solution for a system with large-scale antenna arrays. This work studies the optimization of the analog and digital components of the hybrid beamforming solution for remote radio heads (RRHs) in a downlink cloud radio access network (C-RAN) architecture. Digital processing is carried out at a baseband processing unit (BBU) in the "cloud" and the precoded baseband signals are quantized prior to transmission to the RRHs via finite-capacity fronthaul links. In this system, we consider two different channel state information (CSI) scenarios: 1) ideal CSI at the BBU 2) imperfect effective CSI. Optimization of digital beamforming and fronthaul quantization strategies at the BBU as well as analog radio frequency (RF) beamforming at the RRHs is a coupled problem, since the effect of the quantization noise at the receiver depends on the precoding matrices. The resulting joint optimization problem is examined with the goal of maximizing the weighted downlink sum-rate and the network energy efficiency. Fronthaul capacity and per-RRH power constraints are enforced along with constant modulus constraint on the RF beamforming matrices. For the case of perfect CSI, a block coordinate descent scheme is proposed based on the weighted minimum-mean-square-error approach by relaxing the constant modulus constraint of the analog beamformer. Also, we present the impact of imperfect CSI on the weighted sum-rate and network energy efficiency performance, and the algorithm is extended by applying the sample average approximation. Numerical results confirm the effectiveness of the proposed scheme and show that the proposed algorithm is robust to estimation errors.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted