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

Shengkai Xu

dblp:163/2317 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · conflict

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

Computer networks · 3 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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.

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

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

TopicWeightPapersLastEvidence papers
Coding theory › code ensembles
degree distribution optimization
0.212016
Optimization Design and Asymptotic Analysis of Systematic Luby Transform Codes Over BIAWGN Channels · IEEE Trans. Commun. 2016
Coding theory › error-correcting codes › rateless codes › fountain codes
LT codes
0.212016
Optimization Design and Asymptotic Analysis of Systematic Luby Transform Codes Over BIAWGN Channels · IEEE Trans. Commun. 2016

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

linear programming · 0.5gaussian approximation · 0.5density evolution · 0.5
YearPublicationVenuePosition
2024 Towards Robust mmWave-based Human Activity Recognition using Large Simulated Dataset for Model Pretraining
abstract
Human activity recognition (HAR) is crucial for real-world applications such as healthcare, surveillance, and smart homes. Among sensing technologies, millimeter wave (mmWave) sensors stand out due to their contactless nature, high sensitivity, and ability to operate in low-light environments while preserving privacy. However, the scarcity of mmWave sensing data limits the generalizability of mmWave-based HAR systems. To address this, we propose mmAP, a data augmentation and pretraining framework that synthesizes a large mmWave dataset using human mesh data, followed by pretraining a robust and general mmWave heatmap encoder using a multi-modal masked autoencoder framework using the synthesized data. We enhance the model’s robustness with heatmap-specific data perturbations and perform task-specific fine-tuning on a small real-world dataset. The experiment results over the baseline demonstrate the effectiveness of the proposed mmAP framework.
Vinay Joshi, Shengkai Xu, Qiming Cao, Yi Zhu 0012, Pu Wang 0001, Hongfei Xue
IEEE Big Data2
2019 Spatial information theory of sensor array and its application in performance evaluation
abstract
The direction of arrival (DOA) and amplitude‐phase (AP) of source signal can be estimated through array signal processing, while the process of information acquisition has not been described by information theory yet. In this study, the authors propose a novel spatial information theory framework to describe the DOA and AP estimation process. Firstly, they give a sensor array system model, where the spatial information is defined mathematically. Furthermore, in a single source scenario, the derivations of theoretical expression and an asymptotic upper bound for DOA information are presented. It also proves that the AP information accords with Shannon channel capacity when the source follows complex‐Gaussian distribution. In addition, when in an uncorrelated multi‐sources scenario, the AP information is the sum of that of each source for Gaussian distributed sources. Finally, they propose a definition of entropy error to evaluate the information acquisition capability of a sensor array. Numerical results verify that the entropy error is consistent with mean square error and approaches Cramér–Rao bound in high signal‐to‐noise ratio. It also verifies the correctness of theoretical derivation and shows that the spatial information can be employed as an evaluation index to quantitatively analyse the system performance which has significant guidance.
Shengkai Xu, Hao Luo 0005
IET Commun.3
2018 Optimisation design of systematic LT codes over AWGN multiple access channel
abstract
Systematic Luby transform (SLT) codes over the additive white Gaussian noise (AWGN) multiple access channels (MACs) are analysed in this study. The authors introduce a novel optimisation model extending from the point‐to‐point AWGN channels to design the degree distributions over the AWGN MACs, which dramatically improve the bit‐error‐rate (BER) performance of SLT codes. First, they extend the Gaussian approximation analysis of SLT codes to the AWGN MACs to analyse the asymptotic BER performance where the symmetric condition of log‐likelihood ratio message can no longer be assumed. Second, based on the asymptotic BER analysis over the AWGN MACs, they extend the existing optimisation model from the point‐to‐point AWGN channels to the AWGN MACs. Simulation results show that the degree distributions obtained in this study outperform other common degree distributions (optimised for single‐user AWGN channels) over the two‐user AWGN MACs.
Dachun Deng, Shengkai Xu
IET Commun.3
2016 Optimization Design and Asymptotic Analysis of Systematic Luby Transform Codes Over BIAWGN Channels
abstract
In this paper, we study systematic Luby transform (SLT) codes over binary input additive white Gaussian noise (BIAWGN) channels. To improve the bit-error-rate (BER) performance of SLT codes on the BIAWGN channel, this paper presents a novel optimization design of degree distributions. First, we apply the Gaussian approximation (GA) to analyze the asymptotic BER performance of SLT codes and calculate overhead thresholds for successful decoding. Second, we derive an approximate closed-form expression for lower bound on BER by applying the GA and further simplify the expression in low and high signal-to-noise ratio regimes, respectively. Third, we adopt the conventional linear programming (CLP) constrained by the GA to optimize the degree distribution of SLT codes. The objective of CLP is to minimize the average degree of the degree distribution that may result in bad error floor. To improve the error floor caused by CLP, we put forth a novel optimization model constrained by the lower bound on BER, and using the model we can design the degree distribution more flexibly with any desired BER. Simulation results show that the proposed degree distribution can provide better BER performance of SLT codes over the BIAWGN channel.
Shengkai Xu
IEEE Trans. Commun.1