摘要
对用户归一化的互相关矩阵进行求逆运算是解相关算法和最小均方误差算法的基础。针对实际信道的动态性,即用户的随机接入或离开信道,研究矩阵求逆的更新算法以避免对相关矩阵的实时求逆运算。对更新算法的复杂度进行分析,结果表明,在动态信道中,更新算法可以有效地降低多用户检测算法的复杂度。
Matrix inversion is the basis of Decorrelating and Minimum Mean Square Error(MMSE) multiuser detection (MUD) algorithm. Due to the fact that the actual communication channel is dynamic and the user may enter or leave the channel randomly, the large-dimension matrix inversion should be carried from time to time.In this paper, an updating algorithm is proposed for matrix inversion in decorrelating and MMSE algorithm with randomly-accessing users in DS/CDMA system. The proposed method,which employs the block matrix inversion, greatly decreases the computation complexity.
出处
《重庆邮电学院学报（自然科学版）》
2004年第4期110-112,共3页
Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)
基金
国家自然科学基金资助项目(60372036)
陕西省自然科学基金资助项目(2002F24)
总装部空间技术国家重点实验室开放研究课题资助项目(51473020203QT6702)
关键词
解相关算法
最小均方误差
多用户检测算法
更新算法
decorrelating algorithm
minimum mean square error(MMSE), multiuser detection algorithm(MUD)
updating algorithm
