Abstract
This letter considers the application of k-opt local search to the detection of data transmitted through the additive white Gaussian noise channel by K asynchronous users using direct-sequence code-division multiple access. The algorithm is based on a general approach to heuristics that is highly efficient in solving large combinatorial optimization problems. It is shown that the algorithm manages to produce optimum solutions with high frequency, in running time that grows about O(n/sup 2/).
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 callSimilar Papers
More From: IEEE Communications Letters
Disclaimer: 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.
