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 language | English (US) |
|---|---|
| Title of host publication | GLOBECOM'04 - IEEE Global Telecommunications Conference |
| Pages | 336-340 |
| Number of pages | 5 |
| Volume | 1 |
| State | Published - 2004 |
| Event | GLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States Duration: Nov 29 2004 → Dec 3 2004 |
Other
| Other | GLOBECOM'04 - IEEE Global Telecommunications Conference |
|---|---|
| Country/Territory | United States |
| City | Dallas, TX |
| Period | 11/29/04 → 12/3/04 |
ASJC Scopus subject areas
- Engineering(all)