Euclidean space lattice decoding for joint detection in CDMA systems

Löic Brunel, Joseph Boutros

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

Abstract

A new joint detection method based on sphere packing lattice decoding is presented. The algorithm is suitable for both synchronous and asynchronous CDMA-DSSS systems, and it may detect up to 32 users with a reasonable complexity. The complexity is independent of the modulation size.

Original languageEnglish
Title of host publicationProceedings of the 1999 IEEE Information Theory and Communications Workshop
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)0780352688, 9780780352681
DOIs
Publication statusPublished - 1 Jan 1999
Externally publishedYes
Event1999 IEEE Information Theory and Communications Workshop - Kruger National Park, South Africa
Duration: 25 Jun 1999 → …

Other

Other1999 IEEE Information Theory and Communications Workshop
CountrySouth Africa
CityKruger National Park
Period25/6/99 → …

Fingerprint

Code division multiple access
Decoding
Modulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Computational Theory and Mathematics
  • Software

Cite this

Brunel, L., & Boutros, J. (1999). Euclidean space lattice decoding for joint detection in CDMA systems. In Proceedings of the 1999 IEEE Information Theory and Communications Workshop [781460] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ITCOM.1999.781460

Euclidean space lattice decoding for joint detection in CDMA systems. / Brunel, Löic; Boutros, Joseph.

Proceedings of the 1999 IEEE Information Theory and Communications Workshop. Institute of Electrical and Electronics Engineers Inc., 1999. 781460.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Brunel, L & Boutros, J 1999, Euclidean space lattice decoding for joint detection in CDMA systems. in Proceedings of the 1999 IEEE Information Theory and Communications Workshop., 781460, Institute of Electrical and Electronics Engineers Inc., 1999 IEEE Information Theory and Communications Workshop, Kruger National Park, South Africa, 25/6/99. https://doi.org/10.1109/ITCOM.1999.781460
Brunel L, Boutros J. Euclidean space lattice decoding for joint detection in CDMA systems. In Proceedings of the 1999 IEEE Information Theory and Communications Workshop. Institute of Electrical and Electronics Engineers Inc. 1999. 781460 https://doi.org/10.1109/ITCOM.1999.781460
Brunel, Löic ; Boutros, Joseph. / Euclidean space lattice decoding for joint detection in CDMA systems. Proceedings of the 1999 IEEE Information Theory and Communications Workshop. Institute of Electrical and Electronics Engineers Inc., 1999.
@inproceedings{77f6512688504f3caf5b1269e3e24e17,
title = "Euclidean space lattice decoding for joint detection in CDMA systems",
abstract = "A new joint detection method based on sphere packing lattice decoding is presented. The algorithm is suitable for both synchronous and asynchronous CDMA-DSSS systems, and it may detect up to 32 users with a reasonable complexity. The complexity is independent of the modulation size.",
author = "L{\"o}ic Brunel and Joseph Boutros",
year = "1999",
month = "1",
day = "1",
doi = "10.1109/ITCOM.1999.781460",
language = "English",
booktitle = "Proceedings of the 1999 IEEE Information Theory and Communications Workshop",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Euclidean space lattice decoding for joint detection in CDMA systems

AU - Brunel, Löic

AU - Boutros, Joseph

PY - 1999/1/1

Y1 - 1999/1/1

N2 - A new joint detection method based on sphere packing lattice decoding is presented. The algorithm is suitable for both synchronous and asynchronous CDMA-DSSS systems, and it may detect up to 32 users with a reasonable complexity. The complexity is independent of the modulation size.

AB - A new joint detection method based on sphere packing lattice decoding is presented. The algorithm is suitable for both synchronous and asynchronous CDMA-DSSS systems, and it may detect up to 32 users with a reasonable complexity. The complexity is independent of the modulation size.

UR - http://www.scopus.com/inward/record.url?scp=0242323300&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242323300&partnerID=8YFLogxK

U2 - 10.1109/ITCOM.1999.781460

DO - 10.1109/ITCOM.1999.781460

M3 - Conference contribution

AN - SCOPUS:0242323300

BT - Proceedings of the 1999 IEEE Information Theory and Communications Workshop

PB - Institute of Electrical and Electronics Engineers Inc.

ER -