Computation-and-Communication Efficient Coordinated Multicast Beamforming in Massive MIMO Networks
Αποθηκεύτηκε σε:
| Εκδόθηκε σε: | arXiv.org (Dec 24, 2024), p. n/a |
|---|---|
| Κύριος συγγραφέας: | |
| Άλλοι συγγραφείς: | |
| Έκδοση: |
Cornell University Library, arXiv.org
|
| Θέματα: | |
| Διαθέσιμο Online: | Citation/Abstract Full text outside of ProQuest |
| Ετικέτες: |
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3149107964 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 3149107964 | ||
| 045 | 0 | |b d20241224 | |
| 100 | 1 | |a Yin, Shiqi | |
| 245 | 1 | |a Computation-and-Communication Efficient Coordinated Multicast Beamforming in Massive MIMO Networks | |
| 260 | |b Cornell University Library, arXiv.org |c Dec 24, 2024 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a The main challenges in designing downlink coordinated multicast beamforming in massive multiple-input multiple output (MIMO) cellular networks are the complex computational solutions and significant fronthaul overhead for centralized coordination. This paper proposes a coordinated multicast beamforming solution that is both computation and communication efficient. For joint BS coordination with individual base station transmit power budgets, we first obtain the optimal structure of coordinated multicast beamforming. It reveals that the beamformer at each BS is naturally distributed and only depends on the local channel state information (CSI) at its serving BS. Moreover, the optimal beamformer is a weighted minimum mean square error (MMSE) beamformer with a low-dimensional structure of unknown weights to be optimized, independent of the number of BS antennas. Utilizing the optimal structural properties, we propose fast algorithms to determine the unknown parameters for the optimal beamformer. The main iterative algorithm decomposes the problem into small subproblems, yielding only closed/semi-closed form updates. Furthermore, we propose a semi-distributed computing approach for the proposed algorithm that allows each BS to compute its beamformer based on the local CSI without the need of global CSI sharing, resulting in the fronthaul overhead independent of the number of BS antennas. We further extend our results to the design under the imperfect CSI and other coordination scenarios. Simulation results demonstrate that our proposed methods can achieve near-optimal performance with significantly lower computational time for massive MIMO systems than the conventional approaches. | |
| 653 | |a MIMO communication | ||
| 653 | |a Iterative algorithms | ||
| 653 | |a Antennas | ||
| 653 | |a Beamforming | ||
| 653 | |a Coordination | ||
| 653 | |a Cellular structure | ||
| 653 | |a Cellular communication | ||
| 653 | |a Computing time | ||
| 653 | |a Distributed processing | ||
| 653 | |a Multicasting | ||
| 700 | 1 | |a Dong, Min | |
| 773 | 0 | |t arXiv.org |g (Dec 24, 2024), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3149107964/abstract/embedded/ZKJTFFSVAI7CB62C?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/2412.18126 |