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

An iterative algorithm for asynchronous coded multiuser detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
25
0

Year Published

2000
2000
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 52 publications
(25 citation statements)
references
References 6 publications
0
25
0
Order By: Relevance
“…In random access block interleaving, interleavers are employed to distinguish different users. The idea was first shown as a possibility in [3]. Also, [4]and [5] showed how performance enhancement is achieved by using different interleaver for different users in conventional CDMA system.…”
Section: Fig 1 Interleaver Mechanism [2]mentioning
confidence: 99%
“…In random access block interleaving, interleavers are employed to distinguish different users. The idea was first shown as a possibility in [3]. Also, [4]and [5] showed how performance enhancement is achieved by using different interleaver for different users in conventional CDMA system.…”
Section: Fig 1 Interleaver Mechanism [2]mentioning
confidence: 99%
“…Theoretically speaking, when the turbo-code works close to the channel capacity and without channel estimation mismatches, the previous algorithm provides the adequate power allocation for a SINR requirement (19). However, (19) does not provide for practical coding scheme (for finite block length coding) the relationship between target rate and target SNR.…”
Section: P Amentioning
confidence: 99%
“…The classical successive interference cancellation algorithm works then with T M,K = HP. Usually, one needs to use different interleavers for the users as shown in [18], [19]. Although the algorithm is appealing, expression (21) is not simple to implement as it requires many matrix inversions.…”
Section: P Amentioning
confidence: 99%
See 2 more Smart Citations