Robust multi-user detection based on quantum bee colony optimisation
by Hongyuan Gao, Yuqi Liu, Ming Diao
International Journal of Innovative Computing and Applications (IJICA), Vol. 3, No. 3, 2011

Abstract: To resolve local convergent difficulty of combinatorial optimisation algorithm, a quantum bee colony optimisation (QBCO) that employs novel evolutionary quantum equations is proposed. The proposed QBCO algorithm applies quantum coding and quantum rotation mechanism to evolutionary process of bee colony, which is a simple and effective discrete optimisation algorithm. Then, the proposed quantum bee colony optimisation algorithm is used to solve robust multi-user detection problem of code division multiple access (CDMA) system in the presence of impulsive noise. Furthermore, by hybridising the stochastic Hopfield neural network and quantum bee colony optimisation, the quantum state and measure state of the quantum bee are co-evolutionary in design of robust multi-user detection. The new multi-user detection algorithm can search global optimal solution in faster convergence rate. Simulation results for CDMA system are provided to show that the designed robust detectors are superior to some previous detectors in bit error rate (BER), multiple access interference and near-far resistance.

Online publication date: Sat, 21-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com