DocumentCode :
2421088
Title :
Reduced-dimension multiuser detection
Author :
Xie, Yao ; Eldar, Yonina C. ; Goldsmith, Andrea
Author_Institution :
Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
fYear :
2010
fDate :
Sept. 29 2010-Oct. 1 2010
Firstpage :
584
Lastpage :
590
Abstract :
We present a new framework for reduced-dimension multiuser detection (RD-MUD) that trades off complexity for bit-error-rate (BER) performance. This approach can significantly reduce the number of matched filter branches required by classic multiuser detection designs. We show that the RD-MUD can perform similarly to the linear MUD detector when M is sufficiently large relative to N and K, where N and K are the number of total and active users, respectively. We also study the inherent RD-MUD tradeoff between complexity (the number of correlating signals) and BER performance. This leads to a new notion of approximate sufficient statistics, whereby sufficient statistics are approximated to reduce complexity at the expense of some BER performance loss.
Keywords :
error statistics; matched filters; multiuser detection; bit-error-rate; matched filter; reduced-dimension multiuser detection; Bit error rate; Correlation; Demodulation; Detectors; Multiuser detection; Noise; Transforms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on
Conference_Location :
Allerton, IL
Print_ISBN :
978-1-4244-8215-3
Type :
conf
DOI :
10.1109/ALLERTON.2010.5706960
Filename :
5706960
Link To Document :
بازگشت