## Abstract

In this paper we mathematically describe the linear parallel interference canceller (PIC) using matrix algebra. It is shown that the linear PIC, whether conventional or weighted, can be seen as a linear matrix filter applied directly to the received chip-matched filtered signal vector. It is then possible to get an analytical expression for the exact bit error rate and to derive necessary conditions on the eigenvalues of the code correlation matrix and the weighting factors to ensure convergence. The close relationship between the steepest descent method for minimizing the mean squared error (MSE) and linear PIC is demonstrated and a modified PIC structure is suggested which converges to the MMSE detector rather than the decorrelator. Following the principles of the steepest descent method techniques are devised for optimizing the choice of weighting factors with respect to the mean squared error. It is shown that only K (the number of users) PIC stages are required for the equivalent matrix filter to be identical to the MMSE filter. For fewer stages, m<K, one unique optimal choice of weighting factors exists which will lead to the minimum achievable MSE at the last stage.

Original language | English (US) |
---|---|

Title of host publication | IEEE International Symposium on Spread Spectrum Techniques & Applications |

Publisher | IEEE |

Pages | 917-921 |

Number of pages | 5 |

Volume | 3 |

State | Published - Jan 1 1998 |

Event | Proceedings of the 1998 IEEE 5th International Symposium on Spread Spectrum Techniques & Applications, IEEE ISSSTA. Part 3 (of 3) - Sun City, S Afr Duration: Sep 2 1998 → Sep 4 1998 |

### Other

Other | Proceedings of the 1998 IEEE 5th International Symposium on Spread Spectrum Techniques & Applications, IEEE ISSSTA. Part 3 (of 3) |
---|---|

City | Sun City, S Afr |

Period | 9/2/98 → 9/4/98 |

## ASJC Scopus subject areas

- Engineering(all)