摘要
We propose two rate control schemes for multi-antenna multicast in OFDM systems, which aim to maximize the minimum average rate over all users in a multicast group. In our system, we do not require all multicast users to successfully recover the signals received on each subcarrier. In contrast, we allow certain loss for multicast users, such that the multicast transmission rate can be increased. We assume that the loss-repairing can be completed at upper protocol layers via advanced fountain codes. Following this principle, we formulate the rate control problem via beamforming in multi-antenna multicast to optimize the minimum achievable rate for all multicast users. While the computation complexity to solve for the optimal beamformer is prohibitively high, we propose a suboptimal iterative rate control scheme. Moreover, we modify the above optimization problem by selecting a ?xed proportion of users on each subcarrier. The beamformer searching process will then be performed only based on the selected users on each subcarrier, such that the complexity can be further reduced. We also solve this new problem with a low complexity approach. Theoretical analyses and simulation results show that our proposed two rate control schemes can have higher minimum average rate than the baseline scheme without rate control, while achieving low complexity.
We propose two rate control schemes for multi-antenna multicast in OFDM systems, which aim to maximize the minimum average rate over all users in a multicast group. In our system, we do not require all multicast users to successfully recover the signals received on each subcarrier. In contrast, we allow certain loss for multicast users, such that the multicast transmission rate can be increased. We assume that the loss-repairing can be completed at upper protocol layers via advanced fountain codes. Following this principle, we formulate the rate control problem via beamforming in multi-antenna multicast to optimize the minimum achievable rate for all multicast users. While the computation complexity to solve for the optimal beamformer is prohibitively high, we propose a suboptimal iterative rate control scheme. Moreover, we modify the above optimization problem by selecting a ?xed proportion of users on each subcarrier. The beamformer searching process will then be performed only based on the selected users on each subcarrier, such that the complexity can be further reduced. We also solve this new problem with a low complexity approach. Theoretical analyses and simulation results show that our proposed two rate control schemes can have higher minimum average rate than the baseline scheme without rate control, while achieving low complexity.
