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.

Jianxiang Yan

dblp:320/8541 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0002-7401-7679ORCID · corroborated

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

Computer networks · 3 · 3 first-author · 3 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 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.

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

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
multiple access
0.912025
Enhanced ODMA With Pattern Collision Resolution and Parameter Design for Unsourced Multiple Access · IEEE Trans. Commun. 2025
Physical-layer communications › multiple access › random multiple access
unsourced multiple access
0.912025
Enhanced ODMA With Pattern Collision Resolution and Parameter Design for Unsourced Multiple Access · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes › decoding
iterative decoding
0.912025
Enhanced ODMA With Pattern Collision Resolution and Parameter Design for Unsourced Multiple Access · IEEE Trans. Commun. 2025
Information theory › statistical inference › detection and estimation
multiuser detection
0.912025
Enhanced ODMA With Pattern Collision Resolution and Parameter Design for Unsourced Multiple Access · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes › decoding › iterative decoding
factor graphs
0.312025
Enhanced ODMA With Pattern Collision Resolution and Parameter Design for Unsourced Multiple Access · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes › decoding › channel decoding
joint detection and decoding
0.312025
Enhanced ODMA With Pattern Collision Resolution and Parameter Design for Unsourced Multiple Access · IEEE Trans. Commun. 2025

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

pattern collision resolution · 1.7parameter design · 1.7finite-length performance analysis · 1.7
YearPublicationVenuePosition
2026 Signal Scrambling-Aided ODMA for Pilot-Free Unsourced Random Access Over Fading Channel
Jianxiang Yan, Ying Li 0002, Guanghui Song, Ahmed Elzanaty, Pei Xiao 0001
IEEE Trans. Wirel. Commun.1
2025 Enhanced ODMA With Pattern Collision Resolution and Parameter Design for Unsourced Multiple Access
abstract
An enhanced on-off division multiple access (ODMA) transmission scheme is introduced for unsourced multiple access networks. Building upon the foundational ODMA transmission scheme, we have implemented further refinements to the original joint on-off pattern and data detection algorithm. Specifically, we propose a pattern collision resolution technique that can blindly recognize the collision degree of each on-off pattern, and then iteratively recover the data of collided users over a joint factor graph. Furthermore, we introduce a finite-length performance analysis for on-off pattern detection and iterative multi-user decoding. Through this analysis, we derive numerous numerical results, revealing the impact of various parameters on the performance of collision degree detection and multi-user decoding, respectively. By summarizing the rules observed from these numerical results, we formulate design strategies for these parameters, aiming to optimize the overall performance of our scheme. The inherent super sparse property of ODMA ensures that our scheme maintains low decoding complexity. Numerical results demonstrate that, with the implementation of our pattern collision resolution method and meticulous parameter design, the proposed scheme achieves a gap of less than 1.2 dB compared to the random coding bound for up to 300 active users. This performance surpasses state-of-the-art schemes across a broad range of user numbers.
Jianxiang Yan, Ying Li 0002, Guanghui Song, Zhaoji Zhang
IEEE Trans. Commun.1
2024 Enhanced ODMA with Channel Code Design and Pattern Collision Resolution for Unsourced Multiple Access
abstract
An enhanced on-off division multiple access (ODMA) transmission scheme is proposed for unsourced multiple access network. The message of each active user is divided into two parts, where the first part is used to determine an on-off pattern, and the second part is encoded and transmitted in a time-hopping manner according to an on-off pattern. Leveraging the super sparse property of ODMA, the users' on-off pattern and pattern collisions are blindly detected based on the received signal without the help of pilot. Moreover, the on-off pattern detection, data decoding and collision recovery are performed iteratively over one sparse graph to enhance the overall system reliablity. We propose a finite-length performance analysis to the on-off pattern detection and iterative multi-user decoding, based on which both the user access sparsity, and channel code are optimized. Numerical result shows that with a rate 1/ 3 low-density parity-check code over G F (26), the gap between the proposed scheme and the random coding bound is less than 1.2 dB for up to 300 active users.
Jianxiang Yan, Guanghui Song, Ying Li 0002, Zhaoji Zhang, Yuhao Chi
ISIT1
2022 Low-Complexity Symbol-Level Precoding for Dual-Functional Radar-Communication System
abstract
In this paper, dual-functional radar-communication system which can perform both radar and communication functionalities using the same hardware platform and spectrum resource is studied. Concretely, the mean-squared error between the designed and desired beampatterns is minimized subject to the communication quality-of-service requirements and the constant-modulus constraint. To solve this resulted problem efficiently, the alternating minimization framework is presented. Specifically, in the sub-problem of transmit signal design through symbol-level precoding, the low-complexity linearized alternating direction method of multipliers algorithm is presented. Finally, computer simulations are given to demonstrate the effectiveness of the proposed method.
Jianxiang Yan, Jianping Zheng 0001
WCNC1