EDBT 2026 Demo / reviewers in the wild / expert
Murwan Bashir
dblp:176/8132
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-6607-2061ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 1 first-author · 2 since 2021
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 · 47% Wireless networking · 42% Cellular and mobile networks · 11% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications
channel estimation |
1.2 | 2 | 2023 | Unsourced Random Access With Threshold-Based Feedback · IEEE Trans. Commun. 2023 Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling · IEEE Trans. Commun. 2022 |
Wireless networking
random access |
1.2 | 2 | 2023 | Unsourced Random Access With Threshold-Based Feedback · IEEE Trans. Commun. 2023 Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling · IEEE Trans. Commun. 2022 |
Wireless networking › random access
unsourced random access |
1.2 | 2 | 2023 | Unsourced Random Access With Threshold-Based Feedback · IEEE Trans. Commun. 2023 Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling · IEEE Trans. Commun. 2022 |
Physical-layer communications
fading channels |
0.6 | 1 | 2022 | Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling · IEEE Trans. Commun. 2022 |
Physical-layer communications › channel estimation › training-based estimation
preamble-based estimation |
0.6 | 1 | 2022 | Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling · IEEE Trans. Commun. 2022 |
Physical-layer communications
interference cancellation |
0.2 | 1 | 2022 | Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling · IEEE Trans. Commun. 2022 |
Physical-layer communications › interference cancellation
parallel interference cancellation |
0.2 | 1 | 2022 | Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling · IEEE Trans. Commun. 2022 |
Methods — techniques the papers use, named apart from their topics
thresholding algorithm · 0.7theoretical analysis framework · 0.7scrambling · 0.6error-correction decoding · 0.6approximate message passing · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Unsourced Random Access With Threshold-Based FeedbackabstractIn this paper we study feedback mechanisms for unsourced random access (URA) communications. We propose an algorithm to construct feedback packets broadcasted to the users by the base station (BS) and a feedback packet format that allows the users to estimate their channels and infer positive or negative feedback based on the presented thresholding algorithms. We show that the proposed feedback technique leads to a substantial reduction in the packet error rates and signal-to-noise ratios (SNRs) required to support various numbers of active users. We also demonstrate that the proposed feedback imposes a much smaller complexity burden on the users compared to the feedback that acknowledges only successful or only all undecoded users. Finally, we present a theoretical analysis framework that closely matches the experimental results. Murwan Bashir, Ehsan Nassaji, Dmitri V. Truhachev, Alireza Bayesteh, Monirosharieh Vameghestahbanati |
IEEE Trans. Commun. | 1 |
| 2022 | Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and ScramblingabstractWe focus on an unsourced random access (URA) system for communication over fading channels where the payload of each packet is encoded for error-correction, repeated, permuted, and scrambled. Each packet is also equipped with a preamble that is used for channel estimation and detection of permutation and scrambling sequences utilized for payload encoding. We propose an algorithm to resolve multiple-access preamble transmission, based on the approximate message-passing (AMP), that is capable to support high numbers of active users and achieve low probabilities of miss-detection. We also develop a parallel interference cancellation technique for payload reception that iteratively refines the channel estimates and attempts to minimize the mean squared error (MSE) of the users’ data via selective error-correction decoding. Finally, we derive a detailed system performance analysis that closely matches the obtained numerical results. We demonstrate that the presented system can more than double the number of active users, supported by the state-of-the-art systems. Large gains in terms of the minimal required signal-to-noise ratios (SNR)s are also demonstrated for a wide range of active user numbers. Ehsan Nassaji, Murwan Bashir, Dmitri V. Truhachev |
IEEE Trans. Commun. | 2 |