Abstract
The performance of a finite complexity Minimum Mean Squared Error (MMSE) linear detector for demodulating Direct Sequence Spread-Spectrum (DS/SS) Code Division Multiple Access (CDMA) signals is studied. The MMSE detector is near-far resistant, and can be implemented adaptively when no explicit knowledge of the interferers' signature sequences is available. We assume that users are assigned random binary signature sequences and derive upper and lower bounds on the average near-far resistance of the MMSE detector. For synchronous CDMA, the MMSE detector considered has the same near-far resistance as the maximum likelihood and decorrelating detectors, so that the bounds derived apply to these detectors as well. Approximate expressions for average error probability and signal-to-interference ratio are also presented, and are compared with the analogous results for the matched filter receiver with random signature sequences.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of the 1993 IEEE International Symposium on Information Theory |
| Publisher | Publ by IEEE |
| Number of pages | 1 |
| ISBN (Print) | 0780308786 |
| State | Published - Jan 1 1993 |
| Event | Proceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA Duration: Jan 17 1993 → Jan 22 1993 |
Other
| Other | Proceedings of the 1993 IEEE International Symposium on Information Theory |
|---|---|
| City | San Antonio, TX, USA |
| Period | 1/17/93 → 1/22/93 |
ASJC Scopus subject areas
- Engineering(all)