A Modified Blind MUD Algorithm in the Cooperation Network

Author

Kong, Xianglun ; Shao, Shixiang ; Yang, Longxiang ; Zhu, Hongbo

Author_Institution

Coll. of Commun. & Inf. Eng., Nanjing Univ. of Posts & Telecommun., Nanjing, China

fYear

2009

fDate

24-26 Sept. 2009

Firstpage

1

Lastpage

4

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.

Keywords

convergence; diversity reception; matrix decomposition; multiuser detection; algorithm complexity; antiinterference; blind MUD algorithm; convergence rate; cooperation network; matrix decomposition; subspace tracking algorithm; Algorithm design and analysis; Convergence; Educational institutions; Fading; Laboratories; Matrix decomposition; Multiple access interference; Multiuser detection; Relays; Spread spectrum communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-3692-7

Electronic_ISBN

978-1-4244-3693-4

Type

conf

DOI

10.1109/WICOM.2009.5302143

Filename

5302143