### 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 language | English |
---|---|

Title of host publication | IEEE International Conference on Communications |

Pages | 288-292 |

Number of pages | 5 |

Volume | 1 |

Publication status | Published - 2002 |

Externally published | Yes |

Event | 2002 International Conference on Communications (ICC 2002) - New York, NY, United States Duration: 2002 Apr 28 → 2002 May 2 |

### Other

Other | 2002 International Conference on Communications (ICC 2002) |
---|---|

Country | United States |

City | New York, NY |

Period | 02/4/28 → 02/5/2 |

### Fingerprint

### ASJC Scopus subject areas

- Media Technology

### Cite this

*IEEE International Conference on Communications*(Vol. 1, pp. 288-292)