Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Marten J. Klok

dblp:36/3900 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%
Theoretical computer science
1 paper
Coding theory · 67% Information theory · 33%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
code-division multiple access
0.012003
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation · IEEE Trans. Inf. Theory 2003
Physical-layer communications › signal detection
multiuser detection
0.012003
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation · IEEE Trans. Inf. Theory 2003
Physical-layer communications › interference cancellation
parallel interference cancellation
0.012003
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes › error probability analysis
bit-error probability
0.012003
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation · IEEE Trans. Inf. Theory 2003
Coding theory
exponential growth rate
0.012003
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation · IEEE Trans. Inf. Theory 2003
Information theory › probability theory
large deviations
0.012003
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation · IEEE Trans. Inf. Theory 2003
Physical-layer communications › code-division multiple access
DS-CDMA
0.012003
Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation · IEEE Trans. Inf. Theory 2003

Methods — techniques the papers use, named apart from their topics

large deviation theory · 0.1chernoff bound · 0.1
YearPublicationVenuePosition
2003 Performance of DS-CDMA systems with optimal hard-decision parallel interference cancellation
abstract
We study a multiuser detection system for code-division multiple access (CDMA). We show that applying multistage hard-decision parallel interference cancellation (HD-PIC) significantly improves performance compared to the matched filter system. In (multistage) HD-PIC, estimates of the interfering signals are used iteratively to improve knowledge of the desired signal. We use large deviation theory to show that the bit-error probability (BEP) is exponentially small when the number of users is fixed and the processing gain increases. We investigate the exponential rate of the BEP after several stages of HD-PIC. We propose to use the exponential rate of the BEP as a measure of performance, rather than the signal-to-noise ratio (SNR), which is often not reliable in multiuser detection models when the system is lightly loaded. We show that the exponential rate of the BEP remains fixed after a finite number of stages, resulting in an optimal hard-decision system. When the number of users becomes large, the exponential rate of the BEP converges to (log 2)/2 $1/4. We provide guidelines for the number of stages necessary to obtain this asymptotic exponential rate. We also give Chernoff bounds on the BEPs. These estimates show that the BEPs are quite small as long as k = o(n/log n) when the number of stages of HD-PIC is fixed, and even exponentially small when k = O(n) for the optimal HD-PIC system, and where k is the number of users in the system and n is the processing gain. Finally, we extend the results to the case where the number of stages depends on k in a certain manner. The above results are proved for a noiseless channel, and we argue that we expect similar results in a noisy channel as long as the two-sided spectrum of the noise decreases proportionally to n.
Remco van der Hofstad, Marten J. Klok
IEEE Trans. Inf. Theory2