Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/14432
DC Field | Value | |
---|---|---|
dc.title | Iterative multiuser detection for ultra-wideband systems | |
dc.contributor.author | WANG XIAOLI | |
dc.date.accessioned | 2010-04-08T10:43:07Z | |
dc.date.available | 2010-04-08T10:43:07Z | |
dc.date.issued | 2005-01-05 | |
dc.identifier.citation | WANG XIAOLI (2005-01-05). Iterative multiuser detection for ultra-wideband systems. ScholarBank@NUS Repository. | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/14432 | |
dc.description.abstract | This thesis proposes a low-complexity iterative multiuser detection (MUD) algorithm for Time-Hopping (TH) Ultra-Wideband (UWB) communication systems. We implement the maximum a posteriori (MAP) criterion in the detection process by subtracting the multiple access interference (MAI) iteratively. Another contribution is the extension of this algorithm to Space-Time (ST) coded multi-antenna UWB systems. After using the analog ST coding scheme, we can further improve the system performance and deduce the complexity. Computer based simulation results demonstrate that our iterative MUD has a satisfactory BER performance while maintains a considerable low-complexity. | |
dc.language.iso | en | |
dc.subject | Ultra-wideband, iterative multiuser detection, multiple access interference, asynchronous transmission, analog space-time coding, diversity | |
dc.type | Thesis | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.contributor.supervisor | KO CHI CHUNG | |
dc.description.degree | Master's | |
dc.description.degreeconferred | MASTER OF ENGINEERING | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Master's Theses (Open) |
Show simple item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
Thesis(Xiaoli).pdf | 894.05 kB | Adobe PDF | OPEN | None | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.