### Abstract

In this paper, we analyze the bit error probability of the multistage linear parallel interference canceller in a long-code code division multiple access (CDMA) system. To obtain the bit error probability, we approximate the decision statistic as a Gaussian random variable, and compute its mean and variance. The mean and variance of the decision statistic can be expressed as functions of the moments of (R - I), where R is the correlation matrix of the signature sequences. Since the complexity of calculating the moments increases rapidly with the growth of the stage index, a graphical representation for the moments is developed to alleviate the complexity. Propositions are presented to interpret the calculation of moments as several graph problems that are well known in the literature, i.e., the coloring, graph decomposition and Euler tour problems. It is shown that the graphical representation facilitates the analytic evaluation of the bit error probability, and the analytic results match well with the simulation results.

Original language | English |
---|---|

Title of host publication | Proceedings of SPIE - The International Society for Optical Engineering |

Editors | V K Garg, C R Nassar, S J Shattil |

Pages | 69-80 |

Number of pages | 12 |

Volume | 4529 |

DOIs | |

Publication status | Published - 2001 |

Externally published | Yes |

Event | Enabling Technologies for 3G and Beyond - Denver, CO, United States Duration: 2001 Aug 22 → 2001 Aug 23 |

### Other

Other | Enabling Technologies for 3G and Beyond |
---|---|

Country | United States |

City | Denver, CO |

Period | 01/8/22 → 01/8/23 |

### Fingerprint

### Keywords

- Code division multiple access (CDMA)
- Linear parallel interference cancellation (LPIC)
- Multiuser detection

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Condensed Matter Physics

### Cite this

*Proceedings of SPIE - The International Society for Optical Engineering*(Vol. 4529, pp. 69-80) https://doi.org/10.1117/12.447385

**Performance analysis of multistage linear parallel interference canceller in long-code CDMA systems.** / Hwang, Chien H.; Kim, Chang-Su; Jay Kuo, C. C.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of SPIE - The International Society for Optical Engineering.*vol. 4529, pp. 69-80, Enabling Technologies for 3G and Beyond, Denver, CO, United States, 01/8/22. https://doi.org/10.1117/12.447385

}

TY - GEN

T1 - Performance analysis of multistage linear parallel interference canceller in long-code CDMA systems

AU - Hwang, Chien H.

AU - Kim, Chang-Su

AU - Jay Kuo, C. C.

PY - 2001

Y1 - 2001

N2 - In this paper, we analyze the bit error probability of the multistage linear parallel interference canceller in a long-code code division multiple access (CDMA) system. To obtain the bit error probability, we approximate the decision statistic as a Gaussian random variable, and compute its mean and variance. The mean and variance of the decision statistic can be expressed as functions of the moments of (R - I), where R is the correlation matrix of the signature sequences. Since the complexity of calculating the moments increases rapidly with the growth of the stage index, a graphical representation for the moments is developed to alleviate the complexity. Propositions are presented to interpret the calculation of moments as several graph problems that are well known in the literature, i.e., the coloring, graph decomposition and Euler tour problems. It is shown that the graphical representation facilitates the analytic evaluation of the bit error probability, and the analytic results match well with the simulation results.

AB - In this paper, we analyze the bit error probability of the multistage linear parallel interference canceller in a long-code code division multiple access (CDMA) system. To obtain the bit error probability, we approximate the decision statistic as a Gaussian random variable, and compute its mean and variance. The mean and variance of the decision statistic can be expressed as functions of the moments of (R - I), where R is the correlation matrix of the signature sequences. Since the complexity of calculating the moments increases rapidly with the growth of the stage index, a graphical representation for the moments is developed to alleviate the complexity. Propositions are presented to interpret the calculation of moments as several graph problems that are well known in the literature, i.e., the coloring, graph decomposition and Euler tour problems. It is shown that the graphical representation facilitates the analytic evaluation of the bit error probability, and the analytic results match well with the simulation results.

KW - Code division multiple access (CDMA)

KW - Linear parallel interference cancellation (LPIC)

KW - Multiuser detection

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

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

U2 - 10.1117/12.447385

DO - 10.1117/12.447385

M3 - Conference contribution

AN - SCOPUS:0035765060

VL - 4529

SP - 69

EP - 80

BT - Proceedings of SPIE - The International Society for Optical Engineering

A2 - Garg, V K

A2 - Nassar, C R

A2 - Shattil, S J

ER -