Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11851/10998
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, S. | - |
dc.contributor.author | Zhang, J. | - |
dc.contributor.author | Bjornson, E. | - |
dc.contributor.author | Demir, O.T. | - |
dc.contributor.author | Ai, B. | - |
dc.date.accessioned | 2024-01-21T09:24:31Z | - |
dc.date.available | 2024-01-21T09:24:31Z | - |
dc.date.issued | 2023 | - |
dc.identifier.issn | 1536-1276 | - |
dc.identifier.uri | https://doi.org/10.1109/TWC.2023.3270299 | - |
dc.identifier.uri | https://hdl.handle.net/20.500.11851/10998 | - |
dc.description.abstract | Cell-free massive multiple-input multiple-output (CF mMIMO) systems serve the user equipments (UEs) by geographically distributed access points (APs) by means of joint transmission and reception. To limit the power consumption due to fronthaul signaling and processing, each UE should only be served by a subset of the APs, but it is hard to identify that subset. Previous works have tackled this combinatorial problem heuristically. In this paper, we propose a sparse distributed processing design for CF mMIMO, where the AP-UE association and long-Term signal processing coefficients are jointly optimized. We formulate two sparsity-inducing mean-squared error (MSE) minimization problems and solve them by using efficient proximal approaches with block-coordinate descent. For the downlink, more specifically, we develop a virtually optimized large-scale fading precoding (V-LSFP) scheme using uplink-downlink duality. The numerical results show that the proposed sparse processing schemes work well in both uplink and downlink. In particular, they achieve almost the same spectral efficiency as if all APs would serve all UEs, while the energy efficiency is 2-4 times higher thanks to the reduced processing and signaling. © 2002-2012 IEEE. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | en_US |
dc.relation.ispartof | IEEE Transactions on Wireless Communications | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Cell-free massive MIMO; distributed processing; energy efficiency; large-scale fading; sparse optimization | en_US |
dc.subject | Electric power utilization; Energy efficiency; Mean square error; Optimization; Signal processing; Spectrum efficiency; Cell-free; Cell-free massive MIMO; Distributed database; Distributed processing; Downlink; Large-scale fading; Large-scales; Power demands; Signal-processing; Sparse optimizations; Task analysis; Uplink; Wireless communications; MIMO systems | en_US |
dc.title | Energy-Efficient Cell-Free Massive Mimo Through Sparse Large-Scale Fading Processing | en_US |
dc.type | Article | en_US |
dc.department | TOBB ETÜ | en_US |
dc.identifier.volume | 22 | en_US |
dc.identifier.issue | 12 | en_US |
dc.identifier.startpage | 9374 | en_US |
dc.identifier.endpage | 9389 | en_US |
dc.identifier.wos | WOS:001128031700038 | en_US |
dc.identifier.scopus | 2-s2.0-85159797448 | en_US |
dc.institutionauthor | … | - |
dc.identifier.doi | 10.1109/TWC.2023.3270299 | - |
dc.authorscopusid | 57202302382 | - |
dc.authorscopusid | 57202148166 | - |
dc.authorscopusid | 24478602800 | - |
dc.authorscopusid | 55807906700 | - |
dc.authorscopusid | 7005327119 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
item.openairetype | Article | - |
item.languageiso639-1 | en | - |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
WEB OF SCIENCETM
Citations
3
checked on Aug 31, 2024
Page view(s)
30
checked on Dec 23, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.