The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Robust and Efficient Distributed Compression for Cloud Radio Access Networks
Open accessAbstract
This paper studies distributed compression for the uplink of a cloud radio access network where multiple multiantenna base stations (BSs) are connected to a central unit, which is also referred to as a cloud decoder, via capacity-constrained backhaul links. Since the signals received at different BSs are correlated, distributed source coding strategies are potentially beneficial. However, they require each BS to have information about the joint statistics of the received signals across the BSs, and they are generally sensitive to uncertainties regarding such information. Motivated by this observation, a robust compression method is proposed to cope with uncertainties on the correlation of the received signals. The problem is formulated using a deterministic worst case approach, and an algorithm is proposed that achieves a stationary point for the problem. Then, BS selection is addressed with the aim of reducing the number of active BSs, thus enhancing the energy efficiency of the network. An optimization problem is formulated in which compression and BS selection are performed jointly by introducing a sparsity-inducing term into the objective function. An iterative algorithm is proposed that is shown to converge to a locally optimal point. From numerical results, it is observed that the proposed robust compression scheme compensates for a large fraction of the performance loss induced by the imperfect statistical information. Moreover, the proposed BS selection algorithm is seen to perform close to the more complex exhaustive search solution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
The information bottleneck method
Tishby, N., Pereira, F. C., & Bialek, W. (2000) · arXiv · doi:10.48550/arxiv.physics/0004057 · Cited by 2,626
Cited by
Cloud RAN for Mobile Networks—A Technology Overview
Checko, A., Christiansen, H. L., Yan, Y., Scolari, L., Kardaras, G., Berger, M. S., & Dittmann, L. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2355255 · Cited by 1,559
Making Cell-Free Massive MIMO Competitive With MMSE Processing and Centralized Implementation
Bjornson, E., & Sanguinetti, L. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2941478 · Cited by 974
Wireless Network Virtualization: A Survey, Some Research Issues and Challenges
Liang, C., & Yu, F. R. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2352118 · Cited by 708
Foundations of User-Centric Cell-Free Massive MIMO
Demir, Ȕ. T., BjɆrnson, E., & Sanguinetti, L. (2021) · Foundations and Trends® in Signal Processing · doi:10.1561/2000000109 · Cited by 704
Group Sparse Beamforming for Green Cloud-RAN
(2014) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2014.040214.131770 · Cited by 468
Metadata
- Authors
- Park, S.-H., Simeone, O., Sahin, O., & Shamai, S.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2013-02
- Volume
- 62
- Issue
- 2
- Pages
- 692-703
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W1998478896
- Cited by
- 187
- References
- 2
- FWCI
- 13.02
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.