Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Signal Processi...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Signal Processing Letters
Article . 2016 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
DBLP
Article . 2018
Data sources: DBLP
versions View all 2 versions
addClaim

Joint Design of Fronthaul and Access Links for C-RAN With Wireless Fronthauling

Authors: Seokhwan Park; Kyoung-Jae Lee; Chang-Ick Song; Inkyu Lee;

Joint Design of Fronthaul and Access Links for C-RAN With Wireless Fronthauling

Abstract

This letter studies a joint design of fronthaul and radio access links for a cloud radio access network (C-RAN) with wireless fronthauling, where a baseband unit (BBU) controls a number of remote radio heads (RRHs) via wireless fronthaul links to communicate with user equipments. We first review a basic approach based on a single cell concept, whereby the RRHs operate as decode-and-forward (DF) relays. Then, a cooperative transmission from the RRHs based on decompress-and-forward (DCF) relaying is proposed, which is a standard concept in C-RAN. For both strategies, a problem of jointly optimizing the BBU and RRH operations is tackled with the goal of maximizing the weighted sum-rate subject to the BBU and per-RRH power constraints. For each formulated problem, an iterative algorithm is derived that achieves a sequence of monotonically nondecreasing objective values at each iteration. It is confirmed via numerical results that the DCF-based cooperative scheme significantly outperforms the DF-based single-cell approach.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    42
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
42
Top 10%
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!