A Modified Blind MUD Algorithm in the Cooperation Network

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.