Abstract
In this paper, we develop a new multistage detector to approach the optimal solution of the detection problem in a synchronous code division multiple access (CDMA) system. The transformation modifies the diagonal elements of the Hessian matrix of the quadratic likelihood function and brings the continuous minimum of the transformed function as close to the optimal solution as possible. The computational complexity is essentially linear with the number of users, except that a few computations of a quadratic function are needed.
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.
