Abstract
A multiuser detector for direct-sequence code-division multiple-access (DS-CDMA) systems based on a recursive convex programming (RCP) approach is proposed. In this detector, maximum likelihood (ML) detection is carried out in two steps: first, the combinatorial problem associated with the ML detection is relaxed to a convex programming problem and then a recursive approach is applied to approximate the solution of the ML detection. Computer simulations are presented which demonstrate that the RCP detector outperforms many other suboptimal detectors hi terms of bit-error rate (BER) performance. Specifically, it offers comparable BER performance relative to the ML detector yet it requires considerably less computation.
Sign-in/Register to access full text options 
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.
