Lattice decoding for joint detection in direct-sequence CDMA systems
- 15 April 2003
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 49 (4) , 1030-1037
- https://doi.org/10.1109/tit.2003.809506
Abstract
A new joint detection method based on sphere packing lattice decoding is presented in this paper. The algorithm is suitable for both synchronous and asynchronous multiple access direct-sequence code-division multiple-access (DS-CDMA) systems, and it may jointly detect up to 64 users with a reasonable complexity. The detection complexity is independent of the modulation size and large M-PAM or M-QAM constellations can be used. Furthermore, a theoretical gain analysis is performed in which the multiple-access system performance is derived from the lattice parameters.Keywords
This publication has 13 references indexed in Scilit:
- A universal lattice code decoder for fading channelsIEEE Transactions on Information Theory, 1999
- Good lattice constellations for both Rayleigh fading and Gaussian channelsIEEE Transactions on Information Theory, 1996
- A Course in Computational Algebraic Number TheoryPublished by Springer Nature ,1993
- Near-optimum detection in synchronous code-division multiple-access systemsIEEE Transactions on Communications, 1991
- Multistage detection in asynchronous code-division multiple-access communicationsIEEE Transactions on Communications, 1990
- Algorithmic Algebraic Number TheoryPublished by Cambridge University Press (CUP) ,1989
- Coset codes. I. Introduction and geometrical classificationIEEE Transactions on Information Theory, 1988
- Optimum Multiuser Asymptotic EfficiencyIEEE Transactions on Communications, 1986
- Minimum probability of error for asynchronous Gaussian multiple-access channelsIEEE Transactions on Information Theory, 1986
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applicationsACM SIGSAM Bulletin, 1981