A Near Optimum Multicarrier CDMA Detector Using Greedy Algorithm

The multicarrier CDMA (MC-CDMA) is a novel digital modulation and multiplexing technique. Its performance is limited by multi-access interference (MAI). The optimum detector for MC-CDMA is based on the maximum likelihood sequence estimation (MLSE). However its complexity increases exponentially with the number of the users. To reduce its computational complexity, a near optimum MC-CDMA detector based on Greedy Algorithm (GA) is studied. The obtained results show considerable performance improvement compared to the conventional MC-CDMA detector and low computation complexity compared to the optimum detector.