Analysis of multistage linear parallel interference cancellation in CDMA systems using graphical representation

Chien H. Hwang, Chang-Su Kim, C. C J Kuo

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

6 Citations (Scopus)

Abstract

The bit error probability of the multistage linear parallel interference canceller in a long-code code division multiple access (CDMA) system is analyzed with a graphic approach in this research. The decision statistic is modelled as a Gaussian random variable, whose mean and variance can be expressed as functions of moments of (R - I), where R is the correlation matrix of signature sequences. Since the complexity of calculating these moments increases rapidly with the growth of the stage index, a graphical representation of moments is developed to facilitate the computation. Propositions are presented to relate the moment calculation problem to several well known problems in graph theory, i.e., the coloring, the graph decomposition, the biconnected component, and the Euler tour problems. It is shown that the analytic results of the bit error probability match well with simulation results.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages288-292
Number of pages5
Volume1
Publication statusPublished - 2002
Externally publishedYes
Event2002 International Conference on Communications (ICC 2002) - New York, NY, United States
Duration: 2002 Apr 282002 May 2

Other

Other2002 International Conference on Communications (ICC 2002)
CountryUnited States
CityNew York, NY
Period02/4/2802/5/2

Fingerprint

Code division multiple access
Graph theory
Coloring
Random variables
Statistics
Decomposition
Error probability

ASJC Scopus subject areas

  • Media Technology

Cite this

Hwang, C. H., Kim, C-S., & Kuo, C. C. J. (2002). Analysis of multistage linear parallel interference cancellation in CDMA systems using graphical representation. In IEEE International Conference on Communications (Vol. 1, pp. 288-292)

Analysis of multistage linear parallel interference cancellation in CDMA systems using graphical representation. / Hwang, Chien H.; Kim, Chang-Su; Kuo, C. C J.

IEEE International Conference on Communications. Vol. 1 2002. p. 288-292.

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

Hwang, CH, Kim, C-S & Kuo, CCJ 2002, Analysis of multistage linear parallel interference cancellation in CDMA systems using graphical representation. in IEEE International Conference on Communications. vol. 1, pp. 288-292, 2002 International Conference on Communications (ICC 2002), New York, NY, United States, 02/4/28.
Hwang CH, Kim C-S, Kuo CCJ. Analysis of multistage linear parallel interference cancellation in CDMA systems using graphical representation. In IEEE International Conference on Communications. Vol. 1. 2002. p. 288-292
Hwang, Chien H. ; Kim, Chang-Su ; Kuo, C. C J. / Analysis of multistage linear parallel interference cancellation in CDMA systems using graphical representation. IEEE International Conference on Communications. Vol. 1 2002. pp. 288-292
@inproceedings{2728b388161743d6af3ed4b141e853bb,
title = "Analysis of multistage linear parallel interference cancellation in CDMA systems using graphical representation",
abstract = "The bit error probability of the multistage linear parallel interference canceller in a long-code code division multiple access (CDMA) system is analyzed with a graphic approach in this research. The decision statistic is modelled as a Gaussian random variable, whose mean and variance can be expressed as functions of moments of (R - I), where R is the correlation matrix of signature sequences. Since the complexity of calculating these moments increases rapidly with the growth of the stage index, a graphical representation of moments is developed to facilitate the computation. Propositions are presented to relate the moment calculation problem to several well known problems in graph theory, i.e., the coloring, the graph decomposition, the biconnected component, and the Euler tour problems. It is shown that the analytic results of the bit error probability match well with simulation results.",
author = "Hwang, {Chien H.} and Chang-Su Kim and Kuo, {C. C J}",
year = "2002",
language = "English",
volume = "1",
pages = "288--292",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Analysis of multistage linear parallel interference cancellation in CDMA systems using graphical representation

AU - Hwang, Chien H.

AU - Kim, Chang-Su

AU - Kuo, C. C J

PY - 2002

Y1 - 2002

N2 - The bit error probability of the multistage linear parallel interference canceller in a long-code code division multiple access (CDMA) system is analyzed with a graphic approach in this research. The decision statistic is modelled as a Gaussian random variable, whose mean and variance can be expressed as functions of moments of (R - I), where R is the correlation matrix of signature sequences. Since the complexity of calculating these moments increases rapidly with the growth of the stage index, a graphical representation of moments is developed to facilitate the computation. Propositions are presented to relate the moment calculation problem to several well known problems in graph theory, i.e., the coloring, the graph decomposition, the biconnected component, and the Euler tour problems. It is shown that the analytic results of the bit error probability match well with simulation results.

AB - The bit error probability of the multistage linear parallel interference canceller in a long-code code division multiple access (CDMA) system is analyzed with a graphic approach in this research. The decision statistic is modelled as a Gaussian random variable, whose mean and variance can be expressed as functions of moments of (R - I), where R is the correlation matrix of signature sequences. Since the complexity of calculating these moments increases rapidly with the growth of the stage index, a graphical representation of moments is developed to facilitate the computation. Propositions are presented to relate the moment calculation problem to several well known problems in graph theory, i.e., the coloring, the graph decomposition, the biconnected component, and the Euler tour problems. It is shown that the analytic results of the bit error probability match well with simulation results.

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

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

M3 - Conference contribution

AN - SCOPUS:0036279170

VL - 1

SP - 288

EP - 292

BT - IEEE International Conference on Communications

ER -