SYSTEMS AND METHODS FOR REDUCING COMPLEXITY IN MODULATION CODING SCHEME (MCS) ADAPTATION

摘要

The computational complexity of MCS adaptation for linear and non-linear MU-MIMO can be reduced by avoiding QR decomposition during subsequent stages of MCS adaptation. For instance, QR decomposition can be avoided in later stages of MCS adaptation by computing an instant upper right triangular matrix (R1) directly from an earlier upper right triangular matrix (R) and an earlier unitary matrix (U), which were obtained during a previous stage of MCS adaptation. As such, the instant upper right triangular matrix (R1) is obtained without performing QR decomposition on an instant Hermitian matrix (H1H), thereby allowing MCS adaptation to be performed for the new user group with less complexity. Additionally, computational complexity of MCS adaptation for linear MU-MIMO can be further reduced by avoiding matrix inversion during subsequent stages of MCS adaptation.

主权项

1. A method of user selection in a communications network, the method comprising:
selecting users for an initial user group; computing initial modulation coding schemes (MCSs) for users in the initial user group, wherein computing the initial MCSs for the users in the initial user group includes performing an initial QR decomposition operation for the initial user group; adding a new user to the initial user group to obtain a new user group; and computing a new MCS for the new user in the new user group, wherein computing the new MCS for the new user includes calculating the new MCS directly using information obtained from the initial QR decomposition operation and without performing a QR decomposition operation for the new user group.