A Sub-Optimal Multiuser Detector Based on Parallel Genetic Algorithm for CDMA Communications

Multi-user detection(MUD) is a key technique in the 3rd mobile communication systems(CDMA).It is shown that the problem of minimizing the objective function of the optimal multi-user detector can be translated into finding the individual,which has the high fitness in genetic algorithms(GA). A multi-user detector in CDMA based on parallel genetic algorithms is proposed. Comparison with the optimal multi-user detector and the conventional detector shows that the performance of the proposed method is close to that of optimal multi-user detector.The proposed multi-user detector can be easily implemented,which benefits from the parallel genetic algorithms.