Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181
DOI: 10.1109/icassp.1998.679550
|View full text |Cite
|
Sign up to set email alerts
|

Efficient implementation of linear multiuser detectors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…Consequently, recursive relations similar to those in (10a)-(c) hold for , , and the corresponding blocks in . Using these recursive formulas, efficient algorithms for updating the Cholesky factors and user detection can be found [10].…”
Section: A Owd Detectormentioning
confidence: 99%
“…Consequently, recursive relations similar to those in (10a)-(c) hold for , , and the corresponding blocks in . Using these recursive formulas, efficient algorithms for updating the Cholesky factors and user detection can be found [10].…”
Section: A Owd Detectormentioning
confidence: 99%
“…For asynchronous systems, a window approach is usually adopted that results in a symbol-by-symbol detection [8], [9]. As an alternative, each symbol within the observation window, which usually spans an odd number of symbol intervals [8], can be deemed to originate from a different synchronous user. By doing this, an asynchronous system can be interpreted as an equivalent synchronous system [2].…”
Section: Preliminariesmentioning
confidence: 99%