Title | ||
---|---|---|
Optimum and sub-optimum multiuser detection based on sphere decoding for multi-carrier code division multiple access systems |
Abstract | ||
---|---|---|
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 a prohibitive complexity, growing exponentially with the number of users and the number of bits in each modulation symbol. An ML multiuser detection algorithm has previously been proposed, with a complexity growing polynomially with the number of users, independent of the modulation size. The MC-CDMA system is modelled as a sphere packing lattice and a low-complexity optimum lattice decoder, called the sphere decoder, is applied to jointly detect all users. We propose sub-optimum simplifications, based on orthogonal projection of the received signal on a facet of the lattice constellation, to further decrease the complexity. Simulation results are shown with up to 64 users transmitting 16-QAM symbols. |
Year | DOI | Venue |
---|---|---|
2002 | 10.1109/ICC.2002.997105 | Communications, 2002. ICC 2002. IEEE International Conference |
Keywords | Field | DocType |
code division multiple access,decoding,lattice theory,maximum likelihood detection,multiuser channels,quadrature amplitude modulation,16-QAM symbols,MC-CDMA system,ML multiuser detection algorithm,lattice constellation,low-complexity optimum lattice decoder,maximum likelihood multiuser detection algorithm,multi-carrier code division multiple access systems,optimum multiuser detection,orthogonal projection,sphere decoding,sphere packing lattice,sub-optimum multiuser detection | Quadrature amplitude modulation,Brute-force search,Orthographic projection,Sphere packing,Computer science,Multiuser detection,Algorithm,Real-time computing,Modulation,Theoretical computer science,Decoding methods,Code division multiple access | Conference |
Volume | ISBN | Citations |
3 | 0-7803-7400-2 | 2 |
PageRank | References | Authors |
0.47 | 2 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Loïc Brunel | 1 | 147 | 14.09 |