Iterative multiuser joint decoding: Unified framework and asymptotic analysis

Joseph Boutros, Giuseppe Caire

Research output: Contribution to journalArticle

257 Citations (Scopus)

Abstract

We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algorithm. In this framework, known parallel and serial, hard and soft interference cancellation algorithms are derived in a unified way. The asymptotic performance of these algorithms in the limit of large code block length can be rigorously analyzed by using density evolution. We show that, for random spreading in the large-system limit, density evolution is considerably simplified. Moreover, by making a Gaussian approximation of the decoder soft output, we show that the behavior of iterative multiuser joint decoding is approximately characterized by the stable fixed points of a simple one-dimensional nonlinear dynamical system.

Original languageEnglish
Pages (from-to)1772-1793
Number of pages22
JournalIEEE Transactions on Information Theory
Volume48
Issue number7
DOIs
Publication statusPublished - 1 Jul 2002
Externally publishedYes

Fingerprint

Asymptotic analysis
Decoding
Nonlinear dynamical systems
Block codes
Code division multiple access
interference
performance

Keywords

  • Density evolution
  • Interference cancellation
  • Iterative decoding
  • Multiuser detection (MUD)

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Iterative multiuser joint decoding : Unified framework and asymptotic analysis. / Boutros, Joseph; Caire, Giuseppe.

In: IEEE Transactions on Information Theory, Vol. 48, No. 7, 01.07.2002, p. 1772-1793.

Research output: Contribution to journalArticle

@article{dbe7234b11e64e33beca68f25c3b846a,
title = "Iterative multiuser joint decoding: Unified framework and asymptotic analysis",
abstract = "We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algorithm. In this framework, known parallel and serial, hard and soft interference cancellation algorithms are derived in a unified way. The asymptotic performance of these algorithms in the limit of large code block length can be rigorously analyzed by using density evolution. We show that, for random spreading in the large-system limit, density evolution is considerably simplified. Moreover, by making a Gaussian approximation of the decoder soft output, we show that the behavior of iterative multiuser joint decoding is approximately characterized by the stable fixed points of a simple one-dimensional nonlinear dynamical system.",
keywords = "Density evolution, Interference cancellation, Iterative decoding, Multiuser detection (MUD)",
author = "Joseph Boutros and Giuseppe Caire",
year = "2002",
month = "7",
day = "1",
doi = "10.1109/TIT.2002.1013125",
language = "English",
volume = "48",
pages = "1772--1793",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Iterative multiuser joint decoding

T2 - Unified framework and asymptotic analysis

AU - Boutros, Joseph

AU - Caire, Giuseppe

PY - 2002/7/1

Y1 - 2002/7/1

N2 - We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algorithm. In this framework, known parallel and serial, hard and soft interference cancellation algorithms are derived in a unified way. The asymptotic performance of these algorithms in the limit of large code block length can be rigorously analyzed by using density evolution. We show that, for random spreading in the large-system limit, density evolution is considerably simplified. Moreover, by making a Gaussian approximation of the decoder soft output, we show that the behavior of iterative multiuser joint decoding is approximately characterized by the stable fixed points of a simple one-dimensional nonlinear dynamical system.

AB - We present a framework for iterative multiuser joint decoding of code-division multiple-access (CDMA) signals, based on the factor-graph representation and on the sum-product algorithm. In this framework, known parallel and serial, hard and soft interference cancellation algorithms are derived in a unified way. The asymptotic performance of these algorithms in the limit of large code block length can be rigorously analyzed by using density evolution. We show that, for random spreading in the large-system limit, density evolution is considerably simplified. Moreover, by making a Gaussian approximation of the decoder soft output, we show that the behavior of iterative multiuser joint decoding is approximately characterized by the stable fixed points of a simple one-dimensional nonlinear dynamical system.

KW - Density evolution

KW - Interference cancellation

KW - Iterative decoding

KW - Multiuser detection (MUD)

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

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

U2 - 10.1109/TIT.2002.1013125

DO - 10.1109/TIT.2002.1013125

M3 - Article

AN - SCOPUS:0036648193

VL - 48

SP - 1772

EP - 1793

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

ER -