Minimum probability of error for asynchronous Gaussian multiple-access channels
IEEE Transactions on Information Theory
Spread spectrum communications handbook (revised ed.)
Spread spectrum communications handbook (revised ed.)
CDMA: principles of spread spectrum communication
CDMA: principles of spread spectrum communication
Mobile Radio Communications
Multiuser Detection
Wireless Communications: TDMA Versus CDMA
Wireless Communications: TDMA Versus CDMA
Multicarrier Techniques for 4G Mobile Communications
Multicarrier Techniques for 4G Mobile Communications
Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization
Evolutionary Computation
Differential Evolution: A Survey of the State-of-the-Art
IEEE Transactions on Evolutionary Computation
Multi-user detection for DS-CDMA communications
IEEE Communications Magazine
An asynchronous multiuser CDMA detector based on the Kalman filter
IEEE Journal on Selected Areas in Communications
MMSE detection of multicarrier CDMA
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Multi-Carrier Code Division Multiple Access (MC-CDMA) is an emerging wireless communication technology that incorporates the advantages of Orthogonal Frequency Division Multiplexing (OFDM) into the original Code Division Multiple Access (CDMA) technique. But it suffers from the inherent defect called Multiple Access Interference (MAI) due to inappropriate cross-correlation possessed by the different user codes. To reduce MAI, the multi-user detection (MUD) technique has already been proposed in which MAI is treated as noise. Due to high computational cost incorporated by the optimal MUD detector with increasing number of users, researchers are looking for sub-optimal MUD solutions. This paper proposes a binary adaptive Differential Evolution algorithm with a novel crossover strategy (MBDE_pBX) for multi-user detection in a synchronous MC-CDMA system. Since MUD detection in MC-CDMA systems is a problem in binary domain, a binary encoding rule is introduced which converts a binary domain problem of any number of dimensions into a 4-dimensional continuous domain problem. The simulation results show that this new binary Differential Evolution variant can achieve superior bit error rate (BER) performance within much lower optimum solution detection time outperforming its competitors as well as achieving 99.62% reduction in computational complexity as compared to the MUD scheme using exhaustive search.