Sufang Yang

dblp:56/10821 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
6since 2021 · last 2026
—ORCID · conflict

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

Theory of computation · 4 · 2 first-author · 2 since 2021Computer networks · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1 · 1 since 2021
YearPublicationVenuePosition
2026 BeamCKM: A Framework of Channel Knowledge Map Construction for Multi-Antenna Systems
Haohan Wang, Xu Shi 0002, Hengyu Zhang 0003, Yashuai Cao, Sufang Yang, Jintao Wang 0001, Kaibin Huang
IEEE Trans. Wirel. Commun.5
2025 A Novel Feature Selection Method Base on Enhanced-CDRIME and Multi-Classifiers for Pain Assessment
abstract
Multi-source physiological signals are valuable for quantitative pain assessment, but their high dimensionality, nonlinearity, and strong inter-variable correlations present challenges for clinical decision-making. To improve diagnostic accuracy and efficiency, we propose a novel feature selection framework based on an enhanced Rime optimization algorithm (b-CDRIME), which incorporates a co-adaptive hunting strategy and a dispersed foraging strategy. The framework discretizes the original continuous CDRIME algorithm by introducing a V-shaped binary coding strategy, and constructs a multi-objective weighted fitness function that integrates classification accuracy, feature dimension and AUC, which is combined with the dynamic feedback mechanism of the classifier to achieve efficient feature screening and classification performance optimization. On a multi-source physiological signal public pain dataset, this paper utilizes 10 classical classifiers to test our methods on feature selection and performance improvement. The comparative experiments results show that the pain assessment model constructed based on CDRIME with XGBoost has an average classification accuracy of 81.6% while significantly reducing feature dimensionality. These findings validate the good performance and application potential of this study in the task of processing high-dimensional multi-source pain physiological signals.
Guodao Zhang, Leqi Li, Xiaotian Pan, Sufang Yang, JianWei Zhou, Chuanguang Wang
SMC5
2024 Physical-Layer Security for MIMO Visible Light Communication Wiretap Channel
abstract
This paper studies the secrecy capacity of the visible light communication (VLC) wiretap channel under a per-antenna peak-intensity constraint and a per-antenna average-intensity constraint. The focus is on the scenario with one transmitter, one legitimate user, and one eavesdropper, all equipped with multiple antennas. Considering various quantity configurations of the number of transmitting and receiving antennas, we first derive a closed-form secrecy rate exploiting the truncated exponential distribution. Based on this, full-connected and sub-connected precoding architectures are proposed to enhance the confidentiality of this multiple-input multiple-output (MIMO) VLC wiretap channel. Simulation results demonstrate that the proposed precoding schemes significantly improve the secrecy performance of the MIMO-VLC wiretap channel.
Sufang Yang, Longguang Li, Jintao Wang 0001
ITW1
2024 On the Capacity Region of Optical Intensity Broadcast Channels
abstract
This paper investigates the capacity region of the optical intensity broadcast channels (OI-BCs), where the input is subject to a peak-intensity constraint, an average-intensity constraint, or both. By leveraging the decomposition results of several random variables, i.e., uniform, exponential, and truncated exponential random variables, and adopting a superposition coding (SC) scheme, the inner bound on the capacity region is derived. Then, the outer bound is derived by applying the conditional entropy power inequality (EPI). In the high signal-to-noise ratio (SNR) regime, the inner bound asymptotically matches the outer bound, thus characterizing the high-SNR asymptotic capacity region. The bounds are also extended to the general$K$-user BCs without loss of high-SNR asymptotic optimality.
Sufang Yang, Longguang Li, Jintao Wang 0001
IEEE Trans. Commun.1
2023 Tradeoff Between Diversity and Multiplexing Gains in Block Fading Optical Wireless Channels
abstract
The diversity-multiplexing tradeoff (DMT) provides a fundamental performance metric for different multiple-input multiple-output (MIMO) schemes in wireless communications. In this paper, we explore the block fading optical wireless communication (OWC) channels and characterize the DMT in the presence of both optical peak- and average-power constraints. Three different fading distributions are considered, which reflect different channel conditions. In each channel condition, we obtain the optimal DMT when the block length is sufficiently large, and we also derive the lower and upper bounds of the DMT curve when the block length is small. These results are dramatically different from the existing DMT results in radio-frequency (RF) channels. These differences may be due to the fact that the optical input signal is real and bounded, while its RF counterpart is usually complex and unbounded.
Sufang Yang, Longguang Li, Haoyue Tang, Jintao Wang 0001
IEEE Trans. Inf. Theory1
2022 Diversity-Multiplexing Tradeoff Analysis on Block Fading Optical Wireless Channels
abstract
This paper studies the diversity-multiplexing tradeoff (DMT) for the block fading optical wireless communication (OWC) channel when the number of transmit antennas is not less than that of receive antennas. Inputs in this channel represent optical intensities, and hence are real-valued and non-negative. Moreover, inputs are subject to a per-antenna peak-power and a total average-power constraint. Considering these input constraints and assuming the channel fading follows the negative exponential distribution, we establish the outage diversity and average error probability bounds by using a random truncated exponential coding argument. By these derived bounds, we characterize the optimal DMT curve. Interestingly, the DMT result is fundamentally different from its counterpart in traditional radio frequency (RF) channels. This is due to the fact that inputs in this channel are real-valued and bounded, while in RF channels inputs are usually complex-valued and unbounded.
Sufang Yang, Longguang Li, Jintao Wang 0001
ISIT1
2014 Online scheduling of incompatible unit-length job families with lookahead
Jinjiang Yuan, Sufang Yang
Theor. Comput. Sci.3
2012 Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
Zhenkun Zhang, Sufang Yang
Inf. Process. Lett.3