One of the key ideas for reducing downlink channel acquisition overhead for FDD massive MIMO systems is to exploit a combination of two assumptions: (i) the dimension of channel models in propagation domain may be much smaller than the next-generation base-station array sizes (e.g., 64 or more antennas), and (ii) uplink and downlink channels may share the same low-dimensional propagation domain. Our channel measurements demonstrate that the two assumptions may not always hold, thereby impacting the predicted performance of methods that rely on the above assumptions. In this paper, we analyze the error in modeling the downlink channel using uplink measurements, caused by the mismatch from the above two assumptions. We investigate how modeling error varies with base-station array size and provide both numerical and experimental results. We observe that modeling error increases with the number of base-station antennas, and channels with larger angular spreads have larger modeling error. Utilizing our modeling error analysis, we then investigate the resulting beamforming performance rate loss. Accordingly, we observe that the rate loss increases with the number of base-station antennas, and channels with larger angular spreads suffer from higher rate loss.
Scalable user selection in FDD massive MIMO
User subset selection requires full downlink channel state information to realize effective multi-user beamforming in frequency-division duplexing (FDD) massive multi-input multi-output (MIMO) systems. However, the channel estimation overhead scales with the number of users in FDD systems. In this paper, we propose a novel propagation domain-based user selection scheme, labeled as
- PAR ID:
- 10360498
- Publisher / Repository:
- Springer Science + Business Media
- Date Published:
- Journal Name:
- EURASIP Journal on Wireless Communications and Networking
- Volume:
- 2021
- Issue:
- 1
- ISSN:
- 1687-1499
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Abstract -
Channel estimation for the downlink of frequency division duplex (FDD) massive MIMO systems is well known to generate a large overhead as the amount of training generally scales with the number of transmit antennas in a MIMO system. In this paper, we consider the solution of extrapolating the channel frequency response from uplink pilot estimates to the downlink frequency band, which completely removes the training overhead. We first show that conventional estimators fail to achieve reasonable accuracy. We propose instead to use high-resolution channel estimation. We derive theoretical lower bounds (LB) for the mean squared error (MSE) of the extrapolated channel. Assuming that the paths are well separated, the LB is simplified in an expression that gives considerable physical insight. It is then shown that the MSE is inversely proportional to the number of receive antennas while the extrapolation performance penalty scales with the square of the ratio of the frequency offset and the training bandwidth. The channel extrapolation performance is validated through numeric simulations and experimental measurements taken in an anechoic chamber. Our main conclusion is that channel extrapolation is a viable solution for FDD massive MIMO systems if accurate system calibration is performed and favorable propagation conditions are present.more » « less
-
The large number of antennas in massive MIMO systems allows the base station to communicate with multiple users at the same time and frequency resource with multi-user beamforming. However, highly correlated user channels could drastically impede the spectral efficiency that multi-user beamforming can achieve. As such, it is critical for the base station to schedule a suitable group of users in each time and frequency resource block to achieve maximum spectral efficiency while adhering to fairness constraints among the users. In this paper, we consider the resource scheduling problem for massive MIMO systems with its optimal solution known to be NP-hard. Inspired by recent achievements in deep reinforcement learning (DRL) to solve problems with large action sets, we propose SMART, a dynamic scheduler for massive MIMO based on the state-of-the-art Soft Actor-Critic (SAC) DRL model and the K-Nearest Neighbors (KNN) algorithm. Through comprehensive simulations using realistic massive MIMO channel models as well as real-world datasets from channel measurement experiments, we demonstrate the effectiveness of our proposed model in various channel conditions. Our results show that our proposed model performs very close to the optimal proportionally fair (Opt-PF) scheduler in terms of spectral efficiency and fairness with more than one order of magnitude lower computational complexity in medium network sizes where Opt-PF is computationally feasible. Our results also show the feasibility and high performance of our proposed scheduler in networks with a large number of users and resource blocks.more » « less
-
The large number of antennas in massive MIMO systems allows the base station to communicate with multiple users at the same time and frequency resource with multi-user beamforming. However, highly correlated user channels could drastically impede the spectral efficiency that multi-user beamforming can achieve. As such, it is critical for the base station to schedule a suitable group of users in each time and frequency resource block to achieve maximum spectral efficiency while adhering to fairness constraints among the users. In this paper, we consider the resource scheduling problem for massive MIMO systems with its optimal solution known to be NP-hard. Inspired by recent achievements in deep reinforcement learning (DRL) to solve problems with large action sets, we propose \name{}, a dynamic scheduler for massive MIMO based on the state-of-the-art Soft Actor-Critic (SAC) DRL model and the K-Nearest Neighbors (KNN) algorithm. Through comprehensive simulations using realistic massive MIMO channel models as well as real-world datasets from channel measurement experiments, we demonstrate the effectiveness of our proposed model in various channel conditions. Our results show that our proposed model performs very close to the optimal proportionally fair (Opt-PF) scheduler in terms of spectral efficiency and fairness with more than one order of magnitude lower computational complexity in medium network sizes where Opt-PF is computationally feasible. Our results also show the feasibility and high performance of our proposed scheduler in networks with a large number of users and resource blocks.more » « less
-
Channel feedback is essential in frequency division duplexing (FDD) massive multiple-input multiple-output (MIMO) systems. Unfortunately, prior work on multiuser MIMO has shown that the feedback overhead scales linearly with the number of base station (BS) antennas, which is large in massive MIMO systems. To reduce the feedback overhead, we propose an angle-of-departure (AoD) adaptive subspace codebook for channel feedback in FDD massive MIMO systems. Our key insight is to leverage the observation that path AoDs vary more slowly than the path gains. Within the angle coherence time, by utilizing the constant AoD information, the proposed AoDadaptive subspace codebook is able to quantize the channel vector in a more accurate way. From the performance analysis, we show that the feedback overhead of the proposed codebook only scales linearly with a small number of dominant (path) AoDs instead of the large number of BS antennas. Moreover, we compare the proposed quantized feedback technique using the AoD-adaptive subspace codebook with a comparable analog feedback method. Extensive simulations show that the proposed AoD-adaptive subspace codebook achieves good channel feedback quality, while requiring low overhead.more » « less
