Abstract
In this paper, two near-optimal detectors based on the convex optimization algorithm are proposed for multiuser detection (MUD) in the ultra-wide bandwidth (UWB) systems. The first detector performs semidefinite relaxation (SDR) to approximate the optimum multiuser detection (OMD) which is a nondeterministic polynomial time hard (NP-hard) problem. When the cutting planes generation algorithm is employed to strengthen the relaxation of the SDR, a tight MUD detector for combinatorial optimization is obtained by adding triangle inequalities to the well-known SDR in strict feasible region. Simulations demonstrate that the semidefinite programming (SDP) approaches can provide bit error rate (BER) performance close to the OMD efficiently using the interior point method, and the tight detector provides a better BER performance than the previous detector with a slightly higher complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
