Abstract
In this paper we propose application of heuristic algorithms in multiuser detection (MUD). The proposed algorithm combines a tabu search heuristic algorithm with a local search heuristic algorithm. The new proposed structure brings several improvements when compared to both the conventional (matched filter) detector and the decorrelating detector. Additionally, the algorithm proposed here fairly approximates the performance of the optimal MUD detector with much reduced computational complexity.
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.
