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. However, its complexity increases exponentially with the number of users and can become prohibitive for systems with a 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 coded multicarrier code-division multiple-access 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 language | English |
|---|---|
| Pages (from-to) | 1909-1915 |
| Number of pages | 7 |
| Journal | IEEE Transactions on Communications |
| Volume | 52 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - Nov 2004 |
| Externally published | Yes |
Fingerprint
Keywords
- Coded multicarrier code-division multiple access (MC-CDMA)
- Iterative multiuser detection (MUD)
- Maximum a posteriori (MAP) detection
- Turbo processing
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
Reduced-complexity MAP-based iterative multiuser detection for coded multicarrier CDMA systems. / Li, Junqiang; Letaief, Khaled; Cao, Zhigang.
In: IEEE Transactions on Communications, Vol. 52, No. 11, 11.2004, p. 1909-1915.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Reduced-complexity MAP-based iterative multiuser detection for coded multicarrier CDMA systems
AU - Li, Junqiang
AU - Letaief, Khaled
AU - Cao, Zhigang
PY - 2004/11
Y1 - 2004/11
N2 - 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. However, its complexity increases exponentially with the number of users and can become prohibitive for systems with a 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 coded multicarrier code-division multiple-access systems. It is shown that it can greatly reduce the computational complexity with a minimal penalty in performance compared to the conventional optimal scheme.
AB - 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. However, its complexity increases exponentially with the number of users and can become prohibitive for systems with a 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 coded multicarrier code-division multiple-access systems. It is shown that it can greatly reduce the computational complexity with a minimal penalty in performance compared to the conventional optimal scheme.
KW - Coded multicarrier code-division multiple access (MC-CDMA)
KW - Iterative multiuser detection (MUD)
KW - Maximum a posteriori (MAP) detection
KW - Turbo processing
UR - http://www.scopus.com/inward/record.url?scp=9444237975&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=9444237975&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2004.836565
DO - 10.1109/TCOMM.2004.836565
M3 - Article
AN - SCOPUS:9444237975
VL - 52
SP - 1909
EP - 1915
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
SN - 0096-1965
IS - 11
ER -