Asymptotic Analysis of the Downlink in Cooperative Massive MIMO Systems
We consider the downlink of a cooperative cellular communications system, where several base-stations around each mobile cooperate and perform zero-forcing to reduce the received interference at the mobile. We derive, for the first time, closed-form expressions for the asymptotic performance of the...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Open Journal of the Communications Society |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10722858/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1846163749506908160 |
|---|---|
| author | Itsik Bergel Siddhartan Govindasamy |
| author_facet | Itsik Bergel Siddhartan Govindasamy |
| author_sort | Itsik Bergel |
| collection | DOAJ |
| description | We consider the downlink of a cooperative cellular communications system, where several base-stations around each mobile cooperate and perform zero-forcing to reduce the received interference at the mobile. We derive, for the first time, closed-form expressions for the asymptotic performance of the network as the number of antennas per base station grows large. These expressions capture the trade-offs between various system parameters, and characterize the joint effect of noise and interference (where either noise or interference is asymptotically dominant and where both are asymptotically relevant). The presented analysis is significantly more challenging than the uplink analysis due to the dependence between beamforming vectors of nearby base stations. This statistical dependence is handled by introducing novel bounds on marked shot-noise point processes with dependent marks, which are also useful in other contexts. The asymptotic results are verified using Monte Carlo simulations, which indicate that they are useful even when the number of antennas per base station is only moderately large. Based on these expressions, we present a novel power allocation algorithm that is asymptotically optimal while significantly reducing the coordination overhead between base stations. |
| format | Article |
| id | doaj-art-33f3aa09daf842e5b46fea553889a67a |
| institution | Kabale University |
| issn | 2644-125X |
| language | English |
| publishDate | 2024-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Open Journal of the Communications Society |
| spelling | doaj-art-33f3aa09daf842e5b46fea553889a67a2024-11-19T00:03:42ZengIEEEIEEE Open Journal of the Communications Society2644-125X2024-01-0156972698610.1109/OJCOMS.2024.348317610722858Asymptotic Analysis of the Downlink in Cooperative Massive MIMO SystemsItsik Bergel0Siddhartan Govindasamy1https://orcid.org/0000-0002-0150-9357Faculty of Engineering, Bar Ilan University, Ramat-Gan, IsraelDepartment of Engineering, Boston College, Chestnut Hill, MA, USAWe consider the downlink of a cooperative cellular communications system, where several base-stations around each mobile cooperate and perform zero-forcing to reduce the received interference at the mobile. We derive, for the first time, closed-form expressions for the asymptotic performance of the network as the number of antennas per base station grows large. These expressions capture the trade-offs between various system parameters, and characterize the joint effect of noise and interference (where either noise or interference is asymptotically dominant and where both are asymptotically relevant). The presented analysis is significantly more challenging than the uplink analysis due to the dependence between beamforming vectors of nearby base stations. This statistical dependence is handled by introducing novel bounds on marked shot-noise point processes with dependent marks, which are also useful in other contexts. The asymptotic results are verified using Monte Carlo simulations, which indicate that they are useful even when the number of antennas per base station is only moderately large. Based on these expressions, we present a novel power allocation algorithm that is asymptotically optimal while significantly reducing the coordination overhead between base stations.https://ieeexplore.ieee.org/document/10722858/Downlinkmassive MIMOstochastic geometrypower allocation |
| spellingShingle | Itsik Bergel Siddhartan Govindasamy Asymptotic Analysis of the Downlink in Cooperative Massive MIMO Systems IEEE Open Journal of the Communications Society Downlink massive MIMO stochastic geometry power allocation |
| title | Asymptotic Analysis of the Downlink in Cooperative Massive MIMO Systems |
| title_full | Asymptotic Analysis of the Downlink in Cooperative Massive MIMO Systems |
| title_fullStr | Asymptotic Analysis of the Downlink in Cooperative Massive MIMO Systems |
| title_full_unstemmed | Asymptotic Analysis of the Downlink in Cooperative Massive MIMO Systems |
| title_short | Asymptotic Analysis of the Downlink in Cooperative Massive MIMO Systems |
| title_sort | asymptotic analysis of the downlink in cooperative massive mimo systems |
| topic | Downlink massive MIMO stochastic geometry power allocation |
| url | https://ieeexplore.ieee.org/document/10722858/ |
| work_keys_str_mv | AT itsikbergel asymptoticanalysisofthedownlinkincooperativemassivemimosystems AT siddhartangovindasamy asymptoticanalysisofthedownlinkincooperativemassivemimosystems |