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

Qiushi Xu

dblp:151/9123 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0000-1862-0599ORCID · corroborated

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

Computer networks · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 since 2021Systems, architecture and hardware · 1Human-computer interaction and ubiquitous computing · 1

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
2 papers
Coding theory · 96% Mathematical optimization · 4%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
LDPC codes
2.022026
GenAlg-Based Multi-Objective Optimization of LDPC Codes for Multi-Level Coded Modulation · IEEE Trans. Commun. 2026
MrcPunc: Modulation and Rate Compatible Puncturing for Few-Iteration 5G LDPC Decoding · IEEE Trans. Commun. 2026
Coding theory
channel coding
1.012026
MrcPunc: Modulation and Rate Compatible Puncturing for Few-Iteration 5G LDPC Decoding · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes
coded modulation
1.012026
GenAlg-Based Multi-Objective Optimization of LDPC Codes for Multi-Level Coded Modulation · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes › code construction
LDPC code design
1.012026
GenAlg-Based Multi-Objective Optimization of LDPC Codes for Multi-Level Coded Modulation · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes › coded modulation
multilevel coding
1.012026
GenAlg-Based Multi-Objective Optimization of LDPC Codes for Multi-Level Coded Modulation · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes › code construction › code modification
puncturing
1.012026
MrcPunc: Modulation and Rate Compatible Puncturing for Few-Iteration 5G LDPC Decoding · IEEE Trans. Commun. 2026
Physical-layer communications
modulation
0.312026
MrcPunc: Modulation and Rate Compatible Puncturing for Few-Iteration 5G LDPC Decoding · IEEE Trans. Commun. 2026
Mathematical optimization
multi-objective optimization
0.312026
GenAlg-Based Multi-Objective Optimization of LDPC Codes for Multi-Level Coded Modulation · IEEE Trans. Commun. 2026

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

protograph-based extrinsic information transfer · 2.0progressive multi-path search · 2.0genetic algorithm · 1.0
YearPublicationVenuePosition
2026 MrcPunc: Modulation and Rate Compatible Puncturing for Few-Iteration 5G LDPC Decoding
abstract
To meet the stringent high-throughput demands of enhanced mobile broadband (eMBB), low-density parity-check (LDPC) decoding is limited to few iterations. This constraint usually degrades error-correcting performance, rousing a critical need for puncturing towards algorithmic enhancements. However, existing puncturing methods lack modulation and rate compatibility, converging to local optima due to greedy search strategies. To this end, this paper proposes a modulation and rate compatible puncturing (MrcPunc) for 5G LDPC codes. It incorporates three key techniques: 1)a revised protograph-based extrinsic information transfer (PEXIT) analysisfor accurate performance prediction, 2)a progressive multi-path search (PMPS) algorithmto avoid local optima, and 3)a compatibility optimizationsupporting various modulations and code rates. The MrcPunc yields up to 0.6 dB gain over the 5G standard puncturing under few-iteration condition without extra decoding complexity. It is noted that MrcPunc guarantees robustness against both larger iteration counts and mismatched modulations, alongside reducing the average number of decoding iterations.
Qiushi Xu, Huayi Zhou 0002, Mingyang Zhu, Ming Jiang 0012, Chuan Zhang 0001
IEEE Trans. Commun.1
2026 GenAlg-Based Multi-Objective Optimization of LDPC Codes for Multi-Level Coded Modulation
Zhongguo Li, Ming Jiang 0012, Qiushi Xu, Hongmei Kang
IEEE Trans. Commun.4
2022 Optimal Dynamic Supply of Parking Permits Under Uncertainties: A Stochastic Control Approach
abstract
This paper proposes an optimal dynamic supply of parking permits under uncertainties in the mixed traffic environment of regular vehicles (RVs) and autonomous vehicles (AVs). The uncertainties from queuing delay and cruising-for-parking time, respectively, are derived from parking permit holders’ unascertainable early arrival/late departure and the randomness of vehicle speed for cruising-for-parking users. We formulate the dynamic system optimum as a stochastic optimal control problem, aiming to minimize the total time lost for all parking users. On this basis, we express the optimality condition as Hamilton-Jacobi-Bellman equation and propose an optimal control strategy for dynamic supply of parking permits (called optimal parking supply scheme). The proposed scheme is determined by two observable and measurable variables, i.e., queuing time and cruising-for-parking time. We find that the scheme can significantly reduce the total system time lost, especially when the uncertainty from parking permit holders is at a high level or the percentage of AVs is small. Finally, a case study of a selected sample area in Beijing is conducted, which verifies the efficiency of the proposed scheme numerically.
Jing-Peng Wang, Qiong Tian, Ange Wang, Qiushi Xu
IEEE Trans. Intell. Transp. Syst.8
2019 Bayesian Diagnosis Tracing: Application of Procedural Misconceptions in Knowledge Tracing
Junchen Feng, Qiushi Xu
AIED (2)4
2017 A step-by-step parameter design method for discrete state space control scheme of dynamic voltage restorer
abstract
Dynamic Voltage Restorer (DVR), as a device of voltage sag compensation, demands fast transient response, and the disturbance of source voltage is a main impact on control performance. The DVR control strategy based on discrete state space will enhance control bandwidth and stability. However, for the discrete space control system, the number of parameters is relatively more which will lead to a complicated design process. To solve this problem, this paper proposed a control parameter design method based on the idea of virtual resistor. Firstly, by means of state feedback control, an adjustable virtual resistor can be series in filter inductor. According to the requirements of steady-state error, phase margin and Routh's criterion in w domain, the variation regions of PI parameters and virtual resistance can be solved by a step-by-step method, and then the appropriate control parameters can be selected. Experimental results from a digital signal processor-based system are included to support theoretical analysis.
He Lei, Rengcun Fang, Dongjun Yang, Jingyou Xu, Qiushi Xu, Zixia Sang, Bofeng Gao, Yong Kang
IECON5