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

Raafat E. Kamel

dblp:41/2279 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

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

Computer networks · 2 · 1 first-author

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
2 papers
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › signal detection › multiuser detection
adaptive multiuser detection
0.012000
Adaptive multiuser CDMA detector for asynchronous AWGN channels-steady state and transient analysis · IEEE Trans. Commun. 2000
Physical-layer communications
interference cancellation
0.012000
Adaptive multiuser CDMA detector for asynchronous AWGN channels-steady state and transient analysis · IEEE Trans. Commun. 2000
Physical-layer communications › signal detection
multiuser detection
0.012000
Adaptive multiuser CDMA detector for asynchronous AWGN channels-steady state and transient analysis · IEEE Trans. Commun. 2000
Physical-layer communications
spread spectrum and CDMA
0.012000
Adaptive multiuser CDMA detector for asynchronous AWGN channels-steady state and transient analysis · IEEE Trans. Commun. 2000
Physical-layer communications › signal detection › sequence estimation
reduced-state sequence estimation
0.011996
Reduced-complexity sequence estimation using state partitioning · IEEE Trans. Commun. 1996
Physical-layer communications › signal detection
sequence estimation
0.011996
Reduced-complexity sequence estimation using state partitioning · IEEE Trans. Commun. 1996
Physical-layer communications › channel modeling › gaussian channel
AWGN channel
0.012000
Adaptive multiuser CDMA detector for asynchronous AWGN channels-steady state and transient analysis · IEEE Trans. Commun. 2000
Physical-layer communications
channel modeling
0.012000
Adaptive multiuser CDMA detector for asynchronous AWGN channels-steady state and transient analysis · IEEE Trans. Commun. 2000
Physical-layer communications
equalization
0.011996
Reduced-complexity sequence estimation using state partitioning · IEEE Trans. Commun. 1996
Physical-layer communications › fading channels
fading dispersive channels
0.011996
Reduced-complexity sequence estimation using state partitioning · IEEE Trans. Commun. 1996

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

steepest descent · 0.0recursive least squares · 0.0decorrelator · 0.0trellis-based detection · 0.0state partitioning · 0.0
YearPublicationVenuePosition
2000 Adaptive multiuser CDMA detector for asynchronous AWGN channels-steady state and transient analysis
abstract
A two-stage adaptive multiuser detector in an additive white Gaussian noise code-division multiple-access channel is proposed and analyzed. Its first stage is an asynchronous one-shot decorrelator which in terms of computational complexity only requires inversion of K symmetric K/spl times/K matrices for all K users. In addition, the K inversions can be done in parallel, and the computed results for one user can be reused by all other users as well, resulting in a latency of only one bit, same as its synchronous counterpart. The decorrelated tentative decisions are utilized to estimate and subtract multiple-access interference in the second stage. Another novel feature of the detector is the adaptive manner in which the multiple-access interference estimates are formed, which renders prior estimation of the received signal amplitudes and the use of training sequences unnecessary. Adaptation algorithms considered include steepest descent (as well as its stochastic version), and a recursive least squares-type algorithm that offers a faster transient response and better error performance. Sufficient conditions for the receiver to achieve convergence are derived. The detector is near-far resistant, and is shown to provide substantial steady-state error performance improvement over the conventional and decorrelating detector, particularly in the presence of strong interfering signals.
Lizhi C. Zhong, Zoran Siveski, Raafat E. Kamel, Nirwan Ansari
IEEE Trans. Commun.3
1996 Reduced-complexity sequence estimation using state partitioning
abstract
A reduced-state sequence estimator (RSSE) for linear dispersive channels is described. The technique is based on partitioning the set of all channel states in a way that defines a trellis with fewer states. The new technique generalizes trellises that were previously obtained by Duel-Hallen and Heegard (1989) and Eyouboglu and Qureshi (1988). While the approach followed by Duel-Hallen results in powers of two-state trellises, the new technique generates trellises with an arbitrary number of states. Using the state partitioning approach one could also generalize the trellises obtained by Eyouboglu. Therefore, the approach described in this paper provides a better performance/complexity tradeoff.
Raafat E. Kamel, Yeheskel Bar-Ness
IEEE Trans. Commun.1