Please use this identifier to cite or link to this item:
|Title:||Low-complexity iterative MUD algorithm for asynchronous UWB systems|
|Citation:||Wang, X.,Huang, L.,Ko, C.C. (2004). Low-complexity iterative MUD algorithm for asynchronous UWB systems. 2004 9th IEEE Singapore International Conference on Communication Systems, ICCS : 16-19. ScholarBank@NUS Repository.|
|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.|
|Source Title:||2004 9th IEEE Singapore International Conference on Communication Systems, ICCS|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.