In multiuser detection for a direct-sequence code division multiple access system, the genetic algorithm based multiuser detector (GA-MUD) is regarded as a feasible scheme that exhibits the near optimum performance yet requires less computational complexity than the optimum multiuser detector does. Through a new measurement called the computational efficiency, this paper indicates that the improper configuration of the fixed generation number makes most computations in the GA-MUD redundant. To overcome this problem, we propose a novel redundancy-saving genetic algorithm (RSGA) in this paper. The simulation result shows that the RSGA can effectively remove the unnecessary iterations with slight performance degradation and exploit the real potential of the GA-MUD. Hence, the computational complexity of the GA-MUD can be significantly reduced by eliminating the redundancy. Due to its simplicity, the proposed scheme can be applied to all varieties of GA-MUD and does not cause additional computation burden.
['Fei-Tsung Liu', 'Tan-Hsu Tan', 'Yung-Fa Huang']
A redundancy-saving genetic algorithm for multiuser detection in DS-CDMA systems