Loading...
Please wait, while we are loading the content...
Similar Documents
Low Complexity Asynchronous DS-CDMA Detectors (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Ottersten, Björn Östman, Thomas Ottersten, Ostman Bjorn |
| Abstract | In this paper near-far resistant multiuser-detectors for an asynchronous directsequence code-division multiple access (DS-CDMA) system, which do not need the code-matched filter outputs from all users are presented. Two complexvalued, discrete-time vector models for the system are formulated. Detectors for both models, that work on blocks of data of M symbols are considered. The problem of estimation of the bits is posed in a least squares sense and as a minimum mean squared error problem. The performance of the detection algorithms is investigated by computing the BER (Bit Error Rate) on simulated data. Comparisons with traditional detectors is also carried out. It is shown that detectors based on the compact vector model performs slightly worse than detectors based on the more complex vector model. I. Introduction A major issue with DS-CDMA (Direct Sequence-Code Division Multiple Access) systems is the near-far problem. In general, when solutions are proposed to this problem, the a... |
| File Format | |
| Journal | Proceedings IEEE Vehicular Technology Conference |
| Publisher Date | 1996-01-01 |
| Access Restriction | Open |
| Subject Keyword | Major Issue Traditional Detector Near-far Problem Error Problem Discrete-time Vector Model Least Square Sense Minimum Mean Code-matched Filter Output Asynchronous Directsequence Code-division Multiple Access Direct Sequence-code Division Multiple Access Compact Vector Model Performs Low Complexity Asynchronous Ds-cdma Detector Bit Error Rate Detection Algorithm Complex Vector Model Paper Near-far Resistant Multiuser-detectors |
| Content Type | Text |
| Resource Type | Proceeding Conference Proceedings Article |
