Demo Data from EDBT 2026 / reviewers in the wild / expert
Lei Yuan 0004
dblp:23/6750-4
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0003-3488-2278ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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
1 paper |
Physical-layer communications · 77% Cellular and mobile networks · 23% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications
channel estimation |
0.9 | 1 | 2025 | Model-Driven Deep Learning for Massive Access in Internet of Things Networks · IEEE Trans. Commun. 2025 |
Physical-layer communications › channel estimation › multiuser channel estimation
joint activity detection and channel estimation |
0.9 | 1 | 2025 | Model-Driven Deep Learning for Massive Access in Internet of Things Networks · IEEE Trans. Commun. 2025 |
Physical-layer communications › multiple access
massive access |
0.9 | 1 | 2025 | Model-Driven Deep Learning for Massive Access in Internet of Things Networks · IEEE Trans. Commun. 2025 |
Cellular and mobile networks › machine-type communication
massive machine-type communication |
0.9 | 1 | 2025 | Model-Driven Deep Learning for Massive Access in Internet of Things Networks · IEEE Trans. Commun. 2025 |
Physical-layer communications › signal processing for communications
compressive sensing |
0.3 | 1 | 2025 | Model-Driven Deep Learning for Massive Access in Internet of Things Networks · IEEE Trans. Commun. 2025 |
Methods — techniques the papers use, named apart from their topics
deep learning · 0.9channel attention · 0.9LASSO · 0.9ADMM · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Model-Driven Deep Learning for Massive Access in Internet of Things NetworksabstractIn the context of massive machine-type communications (mMTC) within the Internet of Things (IoT), joint activity detection and channel estimation (JADCE) is a key challenge in enabling massive access due to sporadic device access patterns. In this work, we consider both single-antenna and multiple-antenna base station scenarios and formulate the JADCE problem using the least absolute shrinkage and selection operator (LASSO) framework. To address this problem, we propose a model-driven network that utilizes compressive sensing (CS) and deep learning techniques. Specifically, we first design a prediction-correction alternating direction method of multipliers (PC-ADMM) as the underlying algorithm of the model-driven network. Then, the network is developed based on the PC-ADMM and is designed to be complex-valued. Furthermore, we also model the proximal operator, typically used to generate sparse solutions in LASSO, as a channel attention module within the model-driven network to enhance robustness. Numerical results show that the proposed PC-ADMM framework outperforms existing LASSO-based methods in terms of channel estimation and device activity detection. Xiaobing Dang, Wei Xiang 0001, Lei Yuan 0004, Yuan Yang 0006, Peng Cheng 0002, Álvaro Hernández |
IEEE Trans. Commun. | 3 |
| 2023 | Deep Unfolding Scheme for Grant-Free Massive-Access Vehicular NetworksabstractGrant-free random access is an effective solution to enable massive access for future Internet of Vehicles (IoV) scenarios based on massive machine-type communication (mMTC). Considering the uplink transmission of grant-free based vehicular networks, vehicular devices sporadically access the base station, the joint active device detection (ADD) and channel estimation (CE) problem can be addressed by compressive sensing (CS) recovery algorithms due to the sparsity of transmitted signals. However, traditional CS-based algorithms present high complexity and low recovery accuracy. In this manuscript, we propose a novel alternating direction method of multipliers (ADMM) algorithm with low complexity to solve this problem by minimizing the$\ell _{2,1}$norm. Furthermore, we design a deep unfolded network with learnable parameters based on the proposed ADMM, which can simultaneously improve convergence rate and recovery accuracy. The experimental results demonstrate that the proposed unfolded network performs better performance than other traditional algorithms in terms of ADD and CE. Xiaobing Dang, Wei Xiang 0001, Lei Yuan 0004, Yuan Yang 0006, Eric Wang 0001, Tao Huang 0008 |
IEEE Trans. Intell. Transp. Syst. | 3 |