A CFSK system with iterative detection

Chen Xia, Lance C Perez

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

1 Citation (Scopus)

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
StatePublished - 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

Frequency shift keying
Multiuser detection
Maximum likelihood

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)

A CFSK system with iterative detection. / Xia, Chen; Perez, Lance C.

GLOBECOM'04 - IEEE Global Telecommunications Conference. Vol. 1 2004. p. 336-340.

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

Xia, C & Perez, LC 2004, A CFSK system with iterative detection. in GLOBECOM'04 - IEEE Global Telecommunications Conference. vol. 1, pp. 336-340, GLOBECOM'04 - IEEE Global Telecommunications Conference, Dallas, TX, United States, 11/29/04.
Xia C, Perez LC. A CFSK system with iterative detection. In GLOBECOM'04 - IEEE Global Telecommunications Conference. Vol. 1. 2004. p. 336-340
Xia, Chen ; Perez, Lance C. / A CFSK system with iterative detection. GLOBECOM'04 - IEEE Global Telecommunications Conference. Vol. 1 2004. pp. 336-340
@inproceedings{e21d95cce6de4328af706150d634c295,
title = "A CFSK system with iterative detection",
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.",
author = "Chen Xia and Perez, {Lance C}",
year = "2004",
language = "English (US)",
volume = "1",
pages = "336--340",
booktitle = "GLOBECOM'04 - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - A CFSK system with iterative detection

AU - Xia, Chen

AU - Perez, Lance C

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

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

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

M3 - Conference contribution

VL - 1

SP - 336

EP - 340

BT - GLOBECOM'04 - IEEE Global Telecommunications Conference

ER -