1998
DOI: 10.1109/5.720252
|View full text |Cite
|
Sign up to set email alerts
|

Blind adaptive interference suppression for direct-sequence CDMA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
129
0

Year Published

2001
2001
2018
2018

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 238 publications
(131 citation statements)
references
References 64 publications
2
129
0
Order By: Relevance
“…Adaptive detectors potentially can achieve much better performance than conventional ones at least if the transmission channel is time-invariant, but coping with fast fading and interference changes requires elaborate modifications. A blind adaptive detector [51] is one that does not require training sequences. These detectors are desirable for applications such as system recovery but entail some performance loss and complexity increase relative to other adaptive detectors.…”
Section: Mmse Detectormentioning
confidence: 99%
“…Adaptive detectors potentially can achieve much better performance than conventional ones at least if the transmission channel is time-invariant, but coping with fast fading and interference changes requires elaborate modifications. A blind adaptive detector [51] is one that does not require training sequences. These detectors are desirable for applications such as system recovery but entail some performance loss and complexity increase relative to other adaptive detectors.…”
Section: Mmse Detectormentioning
confidence: 99%
“…It is well-known that CDMA can be demodulated without knowledge of the spreading sequences by means of blind algorithms, see e.g. [8]. Those algorithms can also be applied in massive MIMO systems as proposed in [9].…”
Section: Introductionmentioning
confidence: 99%
“…Numerical inaccuracies in a practical implementation of the MOE detector can cause 1 [ ] i x and 1 s to lose orthogonality. The third term in Equation (7) is included in the update to maintain orthogonality between 1 …”
Section: Moe Detectormentioning
confidence: 99%
“…For illustration purpose, we assume a spreading sequence of length seven. We note that the incoming chip data [ 1] i + y (during the th ( 1) i + iteration), arrives in bursts of seven chips each. This is done in order to prevent a potential conflict when there is more outstanding data in the buffer than the rate at which the adaptation takes place.…”
Section: Moe Detector Architecturementioning
confidence: 99%
See 1 more Smart Citation