低复杂度的QR解相关多用户检测算法

Low Complexity QR Decorrelating Multiuser Detection Algorithms

针对常规解相关多用户检测算法因对相关矩阵求逆的运算量随用户数增加呈指数增加而失去了实用价值,提出了不需对相关阵求逆的计算复杂度低的快速QR解相关多用户检测算法。该快速算法运算量与常规解相关算法相比,运算量减少了70%,而检测性能丝毫没有降低。显然,该算法优于常规算法,具有实用意义。

The conventional decorrelating multiuser detection（MUD） algorithm is nearly not used in practice for the reason that the computation complexity of the inverse matrix of the correlation matrix is in exponential proportion to the user numbers. A lower complexity and fast decorrelating MUD algorithm without any computation of inverse matrix is proposed. The complexity of the proposed algorithm is 70% lower than that of the conventional algorithm. Furthermore, the performance is in no way affected by the lower com- plexity. Obviously, the proposed algorithm is much better than the conventional algorithm.