Name
Abstract | ||
|---|---|---|
Abstract—The maximum-likelihood,multiuser detection problem in code-division multiple-access is known to be an optimization problem with an objective function that is required to be optimized over a combinatorial decision region. Conventional suboptimal detectors relax the combinatorial decision region by a convex region, without altering the objective function to be optimized. We take an approach wherein the objective function is reduced to a form appropriate for the application of a polynomial complexity algorithm in computational geometry, while keeping the decision region combinatorial. The resulting detector allows a tradeoff between performance and computational complexity. The bit-error rate performance of the detector has been found to be better than the decorrelator and the linear minimum mean-square error detectors, for the same level of complexity. Index Terms—Complexity, computational geometry (CG), mul- |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/TCOMM.2005.863793 | IEEE Transactions on Communications |
Keywords | Field | DocType |
code division multiple access,computational complexity,computational geometry,error statistics,maximum likelihood detection,multiuser detection,optimisation,CDMA,bit error rate,code division multiple access,combinatorial decision region,computational complexity,computational geometry,decorrelator,linear minimum mean square error detectors,maximum-likelihood detection,multiuser detection,objective function,optimization problem,polynomial complexity algorithm,Complexity,computational geometry (CG),multiuser detection (MUD),optimization methods | Mathematical optimization,Decorrelation,Detection theory,Computer science,Computational geometry,Mean squared error,Multiuser detection,Detector,Optimization problem,Computational complexity theory | Journal |
Volume | Issue | ISSN |
54 | 2 | 0090-6778 |
Citations | PageRank | References |
6 | 0.50 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Girish Manglani | 1 | 7 | 0.84 |
| Ajit Kumar Chaturvedi | 2 | 63 | 11.37 |