Abstract
Artificial Bee Colony (ABC) algorithm is an optimization algorithm based on the intelligent behavior of honey bee swarm. The ABC algorithm was developed to solve optimizing numerical problems and revealed premising results in processing time and solution quality. In ABC, a colony of artificial bees search for rich artificial food sources; the optimizing numerical problems are converted to the problem of finding the best parameter which minimizes an objective function. Then, the artificial bees randomly discover a population of initial solutions and then iteratively improve them by employing the behavior: moving towards better solutions by means of a neighbor search mechanism while abandoning poor solutions. In this paper, an efficient multiuser detector based on a suboptimal code mapping multiuser detector and artificial bee colony algorithm (SCM-ABC-MUD) is proposed and implemented in direct-sequence ultra-wideband (DS-UWB) systems under the additive white Gaussian noise (AWGN) channel. The simulation results demonstrate that the BER and the near-far effect resistance performances of this proposed algorithm are quite close to those of the optimum multiuser detector (OMD) while its computational complexity is much lower than that of OMD. Furthermore, the BER performance of SCM-ABC-MUD is not sensitive to the number of active users and can obtain a large system capacity.
Highlights
Since the concept of ultra-wideband (UWB) technology was put forward by FCC in the 1990s, UWB technique has drawn a lot of attention in the theoretic research, industrial application, and many other areas because of its attractive features such as high data transmission rate, low power density, high interference resistance, and strong multipath resolution [1,2,3].Multiuser detection (MUD) is a method to eliminate the effect of multiple access interference (MAI)
In order to possess a good BER performance and a low time complexity, we investigate an efficient multiuser detector by selection of initial states based on code mapping for the Artificial Bee Colony algorithm (SCM-ABC-multiuser detection (MUD)) in direct-sequence ultra-wideband (DS-UWB) systems
The bits set output from the matched filters is mapped into a one-dimensional feature space to obtain a suboptimal solution; the initial solution space is constructed based on the suboptimal solution; the optimal solution is found by operating the different behaviors of artificial bees in solution space
Summary
Since the concept of ultra-wideband (UWB) technology was put forward by FCC in the 1990s, UWB technique has drawn a lot of attention in the theoretic research, industrial application, and many other areas because of its attractive features such as high data transmission rate, low power density, high interference resistance, and strong multipath resolution [1,2,3]. Optimum multiuser detection (OMD) was provided by Verdu in 1986 [5]; OMD makes the BER performance of multiple access system approximate to single-user system It has a high computational complexity, so it has poor real-time characteristic confines in engineering. In order to possess a good BER performance and a low time complexity, we investigate an efficient multiuser detector by selection of initial states based on code mapping for the Artificial Bee Colony algorithm (SCM-ABC-MUD) in DS-UWB systems. Its basic motivation is to find the global optimum by simulating the bees’ behaviors [21] This proposed algorithm makes use of the thought of ABC’s iterative optimization and the result of the suboptimal detectors based on code mapping. K=1 where Ak is the amplitude of the kth received signal and n(t) is zero-mean additive white Gaussian noise with the unilateral power spectral density of N0
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
