Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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.  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 beten 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.
['Girish Manglani', 'Ajit Kumar Chaturvedi']
I am writing a research paper on a idea Application of computational geometry to multiuser detection in CDMA
[{"from": "human", "value": "I am writing a research paper on a idea Application of computational geometry to multiuser detection in CDMA"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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.  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 beten 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."}]