DocumentCode
1956823
Title
Low-complexity iterative MUD algorithm for asynchronous UWB systems
Author
Wang, Xialoli ; Huang, Lei ; Ko, Chichug
Author_Institution
Dept. of Electr. & Comput. Eng., Singapore Univ.
fYear
2004
fDate
7-7 Sept. 2004
Firstpage
16
Lastpage
19
Abstract
In this paper, a low-complexity iterative multiuser detection (MUD) algorithm specifically designed for asynchronous multiple access ultra-wideband (UWB) systems is proposed. The maximum a posteriori criterion is applied in the detection process by subtracting the multiple access interference precisely, and the computational complexity is reduced in an iterative manner. Considering the asynchronous scenario, a truncated detection window is introduced and studied. The simulation results demonstrate that the proposed iterative MUD algorithm can achieve a satisfactory bit-error-rate performance while maintain a considerably low complexity
Keywords
computational complexity; error statistics; interference suppression; iterative methods; maximum likelihood estimation; multi-access systems; multiuser detection; radiofrequency interference; ultra wideband communication; asynchronous UWB system; bit-error-rate performance; computational complexity; low-complexity iterative MUD algorithm; maximum a posteriori criterion; multiple access interference; multiple access ultrawideband system; multiuser detection; truncated detection window; Algorithm design and analysis; Computational modeling; Delay; Iterative algorithms; Multiuser detection; Pulse modulation; Pulse shaping methods; Signal resolution; Ultra wideband communication; Ultra wideband technology;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications Systems, 2004. ICCS 2004. The Ninth International Conference on
Conference_Location
Singapore, China
Print_ISBN
0-7803-8549-7
Type
conf
DOI
10.1109/ICCS.2004.1359330
Filename
1359330
Link To Document