A modified blind MUD algorithm in the cooperation network

Authors:
Xianglun Kong;Shixiang Shao;Longxiang Yang;Hongbo Zhu
Affiliations:
College of Communication & Information Engineering, Nanjing University of Posts & Telecommunications, Nanjing, China;Nanjing University of Posts & Telecommunications, Jiangsu Key Laboratory of Wireless Communication, Nanjing, China;Nanjing University of Posts & Telecommunications, Jiangsu Key Laboratory of Wireless Communication, Nanjing, China;Nanjing University of Posts & Telecommunications, Jiangsu Key Laboratory of Wireless Communication, Nanjing, China
Venue:
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Year:
2009

Citing 3
Cited 0

Multiuser detection for cooperative networks and performance analysis

IEEE Transactions on Signal Processing
Blind multiuser detection: a subspace approach

IEEE Transactions on Information Theory
Multi-user detection for DS-CDMA communications

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

A modified blind MUD algorithm in the cooperation network is presented. By improving the subspace model and subspace tracking algorithm, it resolves the problem of fast matrix decomposition in the blind MUD algorithm. The paper analyzes convergence rate, anti-interference and algorithm complexity, and so on. The simulation results have been presented the modified algorithm can improve the convergence rate, reduce the complexity of receivers, and enhance the performance of cooperation network.