By Topic

Low-complexity iterative MUD algorithm for asynchronous UWB systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaoli Wang ; Dept. of Electr. & Comput. Eng., Singapore Univ. ; Lei Huang ; Chi Chung Ko

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

Published in:

Communications Systems, 2004. ICCS 2004. The Ninth International Conference on

Date of Conference:

7-7 Sept. 2004