Abstract
Massive Multiple-Input Multiple-Output (MIMO) systems are a cornerstone of 5G technology, yet their efficiency is often limited by rigid uplink training protocols. Current systems typically employ a uniform training frequency based on the highest mobility users, leading to resource waste for stationary users and performance degradation for fast-moving ones. This paper proposes an adaptive uplink training scheme that leverages the diversity in user coherence times. By clustering users based on mobility and optimizing training schedules, the proposed method significantly enhances spectral efficiency and network capacity.
Introduction
Massive MIMO utilizes large antenna arrays at base stations to serve multiple users simultaneously, relying on accurate Channel State Information (CSI). In Time Division Duplexing (TDD) systems, CSI is obtained through periodic uplink training. Traditional approaches assume a fixed coherence time—the interval during which the channel remains stable—for all users. This "one-size-fits-all" strategy is inherently inefficient in heterogeneous environments where users move at varying speeds. Slow-moving users are over-sampled, while fast-moving users suffer from "channel aging," where CSI becomes outdated before the next training phase.
Proposed Methodology: Adaptive Coherence-Time-Based Scheduling
To address these inefficiencies, the authors introduce a multi-step adaptive scheduling procedure:
- User Clustering: At the beginning of a large-scale coherence block, the base station estimates the Doppler spread for all users. A K-means algorithm clusters users with similar channel autocorrelation coefficients, effectively grouping them by mobility.
- Copilot Grouping: Users across different cells sharing the same pilot sequences are organized into "copilot groups" based on their assigned clusters.
- Adaptive Scheduling: Instead of a blanket training approach, the network selects a subset of copilot groups to refresh their CSI in each slot. Groups not selected reuse CSI from previous slots, balancing the trade-off between CSI accuracy and pilot overhead.
- Optimization via Submodularity: The scheduling problem is formulated to maximize the weighted sum rate. The authors demonstrate that this objective function is submodular, allowing for the use of a low-complexity greedy approximation algorithm to achieve near-optimal results efficiently.
Simulation and Performance Analysis
The proposed scheme was evaluated using numerical simulations in a hexagonal 7-cell network. Users were assigned random speeds between 20 km/h and 80 km/h to simulate a realistic heterogeneous environment. The channel model followed a Gauss-Markov block fading process to capture the effects of channel aging.
Key Findings
- Throughput Gains: With 50 antennas, the adaptive scheme achieved a 5 bit/s/Hz improvement over standard TDD, equating to an additional 1 Gbps in a 200 MHz system. This gain increased to 1.4 Gbps with 120 antennas.
- Training Density Optimization: Results indicated a "sweet spot" for training. In the tested scenario, the weighted sum rate peaked when only 40% (8 out of 20) of copilot groups were scheduled for training, highlighting the diminishing returns of excessive pilot signaling.
- Diversity as an Asset: By treating varying user speeds as a source of diversity rather than a constraint, the network can reallocate resources from stable channels to those requiring more frequent updates.
Conclusion and Future Outlook
This research demonstrates that tailoring uplink training to individual user mobility patterns can unlock significant capacity in Massive MIMO networks. While the proposed greedy algorithm offers a computationally feasible path forward, real-time implementation at the millisecond scale remains a challenge. Future work may explore machine learning techniques for more precise mobility prediction and further optimization of the CSI acquisition process in noisy environments.
Summary updated