In the conventional single user detector in Direct Sequence-Code Division Multiple Access (DS-CDMA) systems, multiple access interference and near-far effect cause limitation of capacity. On the other hand, the optimal multiuser detector (OMUD) suffers from computational complexity that grows exponentially with the number of active users. During the last two decades, there has been a lot of interest in development of suboptimal multiuser detectors, which are low in complexity but deliver reasonable performance. In this paper, we present a novel multiuser detector based on the heuristic algorithm known as simulating annealing algorithm (SA). We evaluate performances of the proposed algorithm and compare it to the performances of Minimum Mean Square Error (MMSE) multiuser detectors. We show that the new algorithm outperforms the other one
Direct Sequence-Code Division Multiple Access (DS-CDMA) Multiuser Detection (MUD) Simulating Annealing (SA) Minimum Mean Square Error (MMSE) Bit-Error Rate (BER)
Other ID | JA56JC87ME |
---|---|
Journal Section | Articles |
Authors | |
Publication Date | July 23, 2016 |
Published in Issue | Year 2013 Volume: 3 Issue: 4 |