Abstract: To solve the problem that the dirtypaper coding based iterative waterfilling algorithm to maximize weighted sumrate has high complexity in multiuser multiinput multioutput (MIMO) system, a low complexity zeroforcing dirtypaper coding based multiuser resource scheduling algorithm was proposed. Under the transmit power constraint, the proposed algorithm combines power allocation and user scheduling. Users are selected in sequence based on the userselection parameters which are constructed using the channel state information. The proposed algorithm only needs finite repetitions, and can drop off those users with poor channel quality through the userrejection criteria. Therefore the complexity is reduced. The simulation results show that, compared to the iterative waterfilling algorithm, the proposed algorithm achieves more than 90% weighted sumrate of the iterative waterfilling algorithm under similar simulation conditions. With the increasing user number the weighted sumrate of the proposed algorithm approximates to that of the iterative waterfilling algorithm. And the complexity is reduced from the one in proportion to the square of number of users to the one in proportion to the number of users.