作者: L. Brunel
关键词:
摘要: When performed using an exhaustive search, the maximum likelihood (ML) joint detection of all users in a multi-carrier code division multiple access (MC-CDMA) system has prohibitive complexity, growing exponentially with number and bits each modulation symbol. An ML multiuser algorithm previously been proposed, complexity polynomially users, independent size. The MC-CDMA is modelled as sphere packing lattice low-complexity optimum decoder, called applied to jointly detect users. We propose sub-optimum simplifications, based on orthogonal projection received signal facet constellation, further decrease complexity. Simulation results are shown up 64 transmitting 16-QAM symbols.