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

Roberto B. Di Renna

dblp:238/0460 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
1since 2021 · last 2022
0000-0002-9577-8389ORCID · verified

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

Computer networks · 2 · 2 first-author · 1 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 · 62% Cellular and mobile networks · 38%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › machine-type communication
massive machine-type communication
1.022022
Joint Channel Estimation, Activity Detection and Data Decoding Based on Dynamic Message-Scheduling Strategies for mMTC · IEEE Trans. Commun. 2022
Iterative List Detection and Decoding for Massive Machine-Type Communications · IEEE Trans. Commun. 2020
Physical-layer communications › channel estimation › multiuser channel estimation
joint activity detection and channel estimation
0.612022
Joint Channel Estimation, Activity Detection and Data Decoding Based on Dynamic Message-Scheduling Strategies for mMTC · IEEE Trans. Commun. 2022
Physical-layer communications › signal detection
activity detection
0.412020
Iterative List Detection and Decoding for Massive Machine-Type Communications · IEEE Trans. Commun. 2020
Physical-layer communications › signal detection
iterative detection and decoding
0.412020
Iterative List Detection and Decoding for Massive Machine-Type Communications · IEEE Trans. Commun. 2020
Physical-layer communications › channel coding › error control coding
decoding
0.212022
Joint Channel Estimation, Activity Detection and Data Decoding Based on Dynamic Message-Scheduling Strategies for mMTC · IEEE Trans. Commun. 2022
Coding theory › error-correcting codes
LDPC codes
0.112020
Iterative List Detection and Decoding for Massive Machine-Type Communications · IEEE Trans. Commun. 2020

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

list detection · 0.9l0-norm regularized recursive least squares · 0.9iterative detection and decoding · 0.9residual belief propagation · 0.6factor graph · 0.6bilinear message-scheduling GAMP · 0.6
YearPublicationVenuePosition
2022 Joint Channel Estimation, Activity Detection and Data Decoding Based on Dynamic Message-Scheduling Strategies for mMTC
abstract
In this work, we present a joint channel estimation, activity detection and data decoding scheme for massive machine-type communications. By including the channel and thea prioriactivity factor in the factor graph, we present the bilinear message-scheduling GAMP (BiMSGAMP), a message-passing solution that uses the channel decoder beliefs to refine the activity detection and data decoding. We include two message-scheduling strategies based on the residual belief propagation (RBP) and the activity user detection (AUD) in which messages are evaluated and scheduled in every new iteration. An analysis of the convergence of BiMSGAMP along with a study of its computational complexity is carried out. Numerical results show that BiMSGAMP outperforms state-of-the-art algorithms, highlighting the gains achieved by using the dynamic scheduling strategies and the effects of the channel decoding part in the system.
Roberto B. Di Renna, Rodrigo C. de Lamare
IEEE Trans. Commun.1
2020 Iterative List Detection and Decoding for Massive Machine-Type Communications
abstract
The main challenge of massive machine-type communications (mMTC) is the joint activity and signal detection of devices. The mMTC scenario with many devices transmitting data intermittently at low data rates and via very short packets enables its modelling as a sparse signal processing problem. In this work, we consider a grant-free system and propose a detection and decoding scheme that jointly detects activity and signals of devices. The proposed scheme consists of a list detection technique, an l0-norm regularized activity-aware recursive least-squares algorithm, and an iterative detection and decoding (IDD) approach that exploits the device activity probability. In particular, the proposed list detection technique uses two candidate-list schemes to enhance the detection performance. We also incorporate the proposed list detection technique into an IDD scheme based on low-density parity-check codes. We derive uplink sum-rate expressions that take into account metadata collisions, interference and a variable activity probability for each user. A computational complexity analysis shows that the proposed list detector does not require a significant additional complexity over existing detectors, whereas a diversity analysis discusses its diversity order. Simulations show that the proposed scheme obtains a performance superior to existing suboptimal detectors and close to the oracle LMMSE detector.
Roberto B. Di Renna, Rodrigo C. de Lamare
IEEE Trans. Commun.1