Abstract
A family of multiuser detectors is analyzed which require neither matrix inversions nor other operations with significant complexity. The time complexity per bit of most of them is independent of the number of users. Nevertheless, their spectral efficiency for random spreading sequences is shown to be not far behind that of linear MMSE detection.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 439 |
| Number of pages | 1 |
| Journal | IEEE International Symposium on Information Theory - Proceedings |
| DOIs | |
| State | Published - 2000 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics