IEEE Transactions on Communications · 2023 · 14 citations · 35 references
ComputingComputational EngineeringMachine LearningOptimizationSchedulingBeamformingDeep LearningOptimization For Machine LearningRepresentation LearningScheduling OptimizationUnsupervised LearningChannel State InformationClusteringDistributed BeamformingJoint SchedulingOptimization AlgorithmsSparsity ProblemTransmit BeamformingWorkload Reduction
In this paper, we investigate joint user (UE) scheduling, base station (BS) clustering and beamforming design in a dense network. To reduce the computation burden, we propose a deep unfolding UE scheduling, BS clustering and beamforming (DU-USBCB) method based on the iterative weighted minimum mean square error (WMMSE) algorithm, where the UE scheduling and BS clustering are represented by the group sparsity of the transmit beamforming vectors. The proposed DU-USBCB neural network layer comprises receive coefficient, weight and transmit beamforming vector modules, the former two of which have closed-form expressions. For the third module, the group sparse transmit beamforming vectors are obtained by multiple steps of projected gradient descent and nonlinear sparsification, where the step-sizes are learned through unsupervised learning. We also propose a distributed UE selection (DUS) algorithm, which helps reduce the computation workload. Simulation results verify the effectiveness of the proposed DU-USBCB and DUS methods. The learned step-sizes are directly applied in the testing scenarios with different numbers of UEs, BSs and antennas as well as incomplete channel state information. Besides, our proposed methods can achieve comparable performance but with about 53% and 89% computation reduction compared to the RSRP-WMMSE and SWMMSE methods respectively.
35