This paper investigates the joint resource block group (RBG) scheduling and beamforming optimization problem for weighted sum-rate (WSR) maximization in multi-cell multiuser multiple-input multiple-output (MU-MIMO) downlink networks. While the Fast Fractional Programming (FastFP) framework provides a reliable model-driven solution, it suffers from conservative continuous beamforming updates and prohibitive computational overhead during the discrete RBG matching phase. To address these bottlenecks, we propose a joint deep unfolding framework comprising two core modules: P-Net and K-Net. Specifically, P-Net learns an adaptive relaxation factor along the FastFP direction, strictly bounded within an ascent-preserving interval to accelerate convergence while retaining stationary-point guarantees. Meanwhile, K-Net learns a long-horizon priority policy to guide a low-complexity greedy assignment, maintaining high assignment quality while bypassing the computationally expensive Hungarian matching. Both networks leverage analytical algorithmic priors and utilize recurrent parameter sharing, enabling flexible inference beyond the training horizon. Extensive simulations demonstrate that the proposed joint framework achieves higher WSR and faster execution times than conventional model-driven baselines, while generalizing robustly across unseen network scales and channel conditions without retraining.

翻译：暂无翻译