Abstract
In this contribution, we consider iterative multiuser detection over coded code-division multiple-access (CDMA) channels from a combinatorial optimization viewpoint and propose a low-complexity soft-input/soft-output (SISO) multiuser detector based on the k-opt local search (LS) algorithm, which was previously used for solving the traveling salesperson problem (TSP). Simulation results and complexity analysis show that the proposed detector can approach closely the performance of the full-complexity a posteriori probability (APP) multiuser detector over highly correlated convolutionally coded channels.
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.
