A CFSK system with iterative detection

Chen Xia, Lance C Perez

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

1 Scopus citations

Abstract

A multiple access/multiple user system called collision frequency shift-keying (CFSK) is investigated. Maximum-likelihood sequence detection (MLSD) provides optimal multiuser detection for the CFSK system but is too complex for practical applications so iterative detection is investigated as a suboptimal approach. The MAP-consensus decoder is given as an example of iterative detection and studied for both the synchronous and asynchronous system. A channel interleaver is introduced so that the performance of the MAP-consensus decoder is asymptotically optimal. The metric of the CFSK system has nonpolynomial complexity so suboptimal metrics with linear complexity are considered. Simulation results show that iterative detection with reduced complexity metrics achieve good performance for moderate spreading factors.

Original languageEnglish (US)
Title of host publicationGLOBECOM'04 - IEEE Global Telecommunications Conference
Pages336-340
Number of pages5
Volume1
Publication statusPublished - 2004
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: Nov 29 2004Dec 3 2004

Other

OtherGLOBECOM'04 - IEEE Global Telecommunications Conference
CountryUnited States
CityDallas, TX
Period11/29/0412/3/04

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Xia, C., & Perez, L. C. (2004). A CFSK system with iterative detection. In GLOBECOM'04 - IEEE Global Telecommunications Conference (Vol. 1, pp. 336-340)