WMMSE-Based Joint Transceiver Design for Multi-RIS Assisted Cell-free Networks Using Hybrid CSI
Sábháilte in:
| Foilsithe in: | arXiv.org (Dec 4, 2024), p. n/a |
|---|---|
| Príomhchruthaitheoir: | |
| Rannpháirtithe: | , , |
| Foilsithe / Cruthaithe: |
Cornell University Library, arXiv.org
|
| Ábhair: | |
| Rochtain ar líne: | Citation/Abstract Full text outside of ProQuest |
| Clibeanna: |
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3141257979 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 3141257979 | ||
| 045 | 0 | |b d20241204 | |
| 100 | 1 | |a Pan, Xuesong | |
| 245 | 1 | |a WMMSE-Based Joint Transceiver Design for Multi-RIS Assisted Cell-free Networks Using Hybrid CSI | |
| 260 | |b Cornell University Library, arXiv.org |c Dec 4, 2024 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a In this paper, we consider cell-free communication systems with several access points (APs) serving terrestrial users (UEs) simultaneously. To enhance the uplink multi-user multiple-input multiple-output communications, we adopt a hybrid-CSI-based two-layer distributed multi-user detection scheme comprising the local minimum mean-squared error (MMSE) detection at APs and the one-shot weighted combining at the central processing unit (CPU). Furthermore, to improve the propagation environment, we introduce multiple reconfigurable intelligent surfaces (RISs) to assist the transmissions from UEs to APs. Aiming to maximize the weighted sum rate, we formulate the weighted sum-MMSE (WMMSE) problem, where the UEs' beamforming matrices, the CPU's weighted combining matrix, and the RISs' phase-shifting matrices are alternately optimized. Considering the limited fronthaul capacity constraint in cell-free networks, we resort to the operator-valued free probability theory to derive the asymptotic alternating optimization (AO) algorithm to solve the WMMSE problem, which only depends on long-term channel statistics and thus reduces the interaction overhead. Numerical results demonstrate that the asymptotic AO algorithm can achieve a high communication rate as well as reduce the interaction overhead. | |
| 653 | |a Probability theory | ||
| 653 | |a Communications systems | ||
| 653 | |a Central processing units--CPUs | ||
| 653 | |a Algorithms | ||
| 653 | |a Asymptotic properties | ||
| 653 | |a Beamforming | ||
| 653 | |a Operators (mathematics) | ||
| 653 | |a Error detection | ||
| 653 | |a Reconfigurable intelligent surfaces | ||
| 700 | 1 | |a Zheng, Zhong | |
| 700 | 1 | |a Huang, Xueqing | |
| 700 | 1 | |a Zesong Fei | |
| 773 | 0 | |t arXiv.org |g (Dec 4, 2024), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3141257979/abstract/embedded/ZKJTFFSVAI7CB62C?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/2412.03175 |