Please use this identifier to cite or link to this item: https://doi.org/10.1049/el:20030789
Title: Polynomial complexity optimal multiuser detection for wider class of problems
Authors: Motani, M. 
Issue Date: 7-Aug-2003
Source: 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
URI: http://scholarbank.nus.edu.sg/handle/10635/57090
ISSN: 00135194
DOI: 10.1049/el:20030789
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

2
checked on Dec 11, 2017

WEB OF SCIENCETM
Citations

1
checked on Dec 11, 2017

Page view(s)

17
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


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