Please use this identifier to cite or link to this item:
|Title:||Polynomial complexity optimal multiuser detection for wider class of problems|
|Citation:||Motani, M. (2003-08-07). Polynomial complexity optimal multiuser detection for wider class of problems. Electronics Letters 39 (16) : 1214-1215. ScholarBank@NUS Repository. https://doi.org/10.1049/el:20030789|
|Abstract:||Optimal multiuser detection for code division multiple access has complexity which grows exponentially with the number of users. Recently proposed algorithms enable polynomial complexity optimal detection for certain special spreading sequences. It is shown that these algorithms are applicable to a wider class of spreading sequences than initially proposed.|
|Source Title:||Electronics Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 18, 2018
WEB OF SCIENCETM
checked on Oct 10, 2018
checked on Oct 6, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.