Iterative detection of a CFSK system

Lance C. Pérez, Chen Xia

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

Abstract

The MAP consensus decoder using iterative detection for a collision frequency-shift-keyed (CFSK) system is investigated in this paper. This consensus decoder decodes each user's message in a joint and iterative manner. For a specific user, interference from other users is canceled by the iteration process. The metric of the CFSK channel will introduce high complexity to the MAP algorithm when the system is highly loaded. The K-most probable combinations (KMPC) approach and two-most probable combinations (TMPC) approach are applied to simplify the metric. Analysis shows that the TMPC method keeps fairness for all the users, even though some users put high weights on the probabilities of part of the frequencies.

Original languageEnglish (US)
Title of host publicationProceedings of the 2003 Conference on Diversity in Computing, TAPIA '03
Pages52-54
Number of pages3
DOIs
StatePublished - 2003
Event1st Richard Tapia Celebration of Diversity in Computing Conference 2003, TAPIA '03 - Atlanta, GA, United States
Duration: Oct 15 2003Oct 18 2003

Publication series

NameProceedings of the 2003 Conference on Diversity in Computing, TAPIA '03

Other

Other1st Richard Tapia Celebration of Diversity in Computing Conference 2003, TAPIA '03
CountryUnited States
CityAtlanta, GA
Period10/15/0310/18/03

Keywords

  • Collision frequency shift keying
  • Consensus decoder
  • Iterative detection

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications

Cite this

Pérez, L. C., & Xia, C. (2003). Iterative detection of a CFSK system. In Proceedings of the 2003 Conference on Diversity in Computing, TAPIA '03 (pp. 52-54). (Proceedings of the 2003 Conference on Diversity in Computing, TAPIA '03). https://doi.org/10.1145/948542.948553