Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/70841
DC FieldValue
dc.titleLow-complexity iterative MUD algorithm for asynchronous UWB systems
dc.contributor.authorWang, X.
dc.contributor.authorHuang, L.
dc.contributor.authorKo, C.C.
dc.date.accessioned2014-06-19T03:16:52Z
dc.date.available2014-06-19T03:16:52Z
dc.date.issued2004
dc.identifier.citationWang, 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.
dc.identifier.isbn0780385497
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/70841
dc.description.abstractIn 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.
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.sourcetitle2004 9th IEEE Singapore International Conference on Communication Systems, ICCS
dc.description.page16-19
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

26
checked on Aug 18, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.