Relative threshold tree pruning multi-user detection with user ordering and user partitioning for MC-CDMA

Author

Tsai, Sheng-Fu ; Li, Yi-Lin ; Lee, Yumin

Author_Institution

Graduate Inst. of Commun. Eng., Nat. Taiwan Univ., Taipei, Taiwan

Volume

1

fYear

2004

fDate

21-25 March 2004

Firstpage

48

Abstract

In this paper, we propose a reduced complexity tree-based multi-user detection algorithm called relative threshold tree pruning (RTTP) for MC-CDMA. Two enhancements to RTTP - user ordering and user partitioning - are also investigated. Simulation results show that RTTP outperforms the conventional M-algorithm in both error performance and complexity.

Keywords

code division multiple access; computational complexity; maximum likelihood detection; multiuser detection; spread spectrum communication; trees (mathematics); M-algorithm; MC-CDMA; computational complexity; error performance; relative threshold tree pruning multiuser detection; spread spectrum communication; user ordering algorithm; user partitioning algorithm; Intersymbol interference; Multicarrier code division multiple access; Multiple access interference; Multiuser detection; OFDM; Partitioning algorithms; Performance gain; Sorting; Spread spectrum communication; Symmetric matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Networking Conference, 2004. WCNC. 2004 IEEE

ISSN

1525-3511

Print_ISBN

0-7803-8344-3

Type

conf

DOI

10.1109/WCNC.2004.1311516

Filename

1311516