.png){kind=icon}
Return
CDMA multiuser detection: A nonlinear programming approach
.png){kind=icon}
OA
AI
DOI：10.1109/TCOMM.2002.1010621.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The optimum receiver to detect the bits of multiple code-divison multiple access (CDMA) users has exponential complexity in the number of active users in the system. Consequently, many suboptimum receivers have been developed to achieve good performance with less complexity. In this paper, we take the approach of approximating the solution of the optimum multiuser detection problem (OMUD) using nonlinear programming relaxations. First, we observe that some popular suboptimum receivers indeed correspond to relaxations of the optimal detection problem. In particular, one proposed approximation method yields to iterative solutions which correspond to previously proposed heuristic nonlinear detectors. Using a nonlinear programming approach, we identify the convergence properties of these iterative detectors. Secondly, we propose a relaxation that yields a receiver which we call the generalized minimum mean squared error detector. We give a simple iterative implementation of the detector. Its performance is evaluated and comparisons to other suboptimum detection schemes are given.
Keywords:
approximation algorithms
code division multiple access (CDMA)
interference cancellation
multiuser detection
nonlinear programming
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveShareSaveShareSaveXenointoxication of a Rabbit for the Control of the Common Bed Bug Cimex lectularius L. Using Ivermectin.png)
Scientifica
OAAI
ScientificaIF0
OAAIShareSaveShareSave
View more