Reduced complexity MAP-based iterative multiuser detection for coded multi-carrier CDMA systems

Junqiang Li, Khaled Letaief, Zhigang Cao

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

Abstract

In recent years, combining multiuser detection (MUD) and channel decoding has received considerable attention. The maximum a posteriori (MAP) criterion based iterative multiuser detector greatly improves the system performance and can approach the performance of single user coded systems even for moderate signal-to-noise ratios. However, its complexity increasesex ponentially with the number of users, and can become prohibitive for systems with medium to large number of users. In this paper, a reduced complexity MAP-based iterative MUD based on the use of a soft sensitive bits algorithm is proposed for multi-carrier CDMA systems. It is shown that it can greatly reduce the computational complexity with a minimal penalty in performance compared to the conventional optimal scheme.

Original languageEnglish
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Pages916-920
Number of pages5
Volume1
Publication statusPublished - 2002
Externally publishedYes
EventGLOBECOM'02 - IEEE Global Telecommunications Conference - Taipei, Taiwan, Province of China
Duration: 17 Nov 200221 Nov 2002

Other

OtherGLOBECOM'02 - IEEE Global Telecommunications Conference
CountryTaiwan, Province of China
CityTaipei
Period17/11/0221/11/02

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Li, J., Letaief, K., & Cao, Z. (2002). Reduced complexity MAP-based iterative multiuser detection for coded multi-carrier CDMA systems. In Conference Record / IEEE Global Telecommunications Conference (Vol. 1, pp. 916-920)