Xuechun Bian

Xuechun Bian

Auto-generated profile, based on publicly available information

Xuechun Bian

Key Laboratory of Universal Wireless Communication, Beijing University of Posts and Telecommunications, Beijing, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 December 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
XBXuechun Bian
Xuechun Bian
WXWenbo Xu
Wenbo Xu
YWYue Wang
Yue Wang
ZCZhipeng Cai
Zhipeng Cai
Chau YuenChau Yuen
Chau Yuen
Compressive sensing (CS) technology, which handles large amounts of data in its low-dimensional form, has been shown to enjoy excellent transmission and storage efficiency. To further improve the stability and robustness of CS-based wireless communication system, reconfigurable intelligent surface (RIS) technology has been introduced to enhance the transmission link connectivity. Current researches generally assume perfect RIS; however, some of its elements may be damaged and fail to work, which degrades the sparse signal recovery. Therefore, this article establishes a double-sparsity optimization model to jointly recover the sparse signal and diagnose the RIS element failure. For the scenarios with and without channel state information (CSI) at the receiver, double-sparsity-based algorithm (DS), and atomic norm and double-sparsity-based algorithm (ADS) exploiting alternating direction method of multipliers (ADMM) framework are proposed, respectively. Additionally, a novel $\ell _{B,B}$ norm is incorporated to further constrain the block and binary characteristics of RIS failures, and the resulting improved versions of DS and ADS are termed as binary and block-sparsity-based algorithm (BBS) and atomic norm and binary and block-sparsity-based algorithm (ABBS). Simulations verify the effectiveness and robustness of the proposed algorithms and show the improved performance of the BBS and ABBS algorithms compared with the DS and ADS algorithms.

17 May 2021 in IEEE Sensors Journal
Verified
Journal Article
Closed access
XBXuechun Bian
Xuechun Bian
WXWenbo Xu
Wenbo Xu
YWYue Wang
Yue Wang
LLLiyang Lu
Liyang Lu
SWSiye Wang
Siye Wang
Recently, Internet of Things (IoT) is becoming an important enabler to achieve smart health care for patients, where electrocardiograph (ECG) analyzing has been widely studied. In order to realize long-term detection of ECG under the limited hardware and network resources especially in the power/computing constrained IoT scenarios, compressive sensing (CS) has attracted tremendous research efforts thanks to its high efficiency in sample collection and information retrieval. Most existing researches focus on reconstructing the original ECG signal from the received compressive samples, which however not only leads to high energy consumption but also suffers from unnecessarily huge computational complexity for full-dimensional recovery. To solve such problems, this paper aims at a task-cognizant sparse signal processing technique for retrieving the necessary information only. Specifically, a correlation-assist compression with adaptive length (CCAL) algorithm is developed, where ECG signal is compressed individually within each pseudo-period to retain the information of each separate heartbeat. In doing so, the compression length is dynamically varying, which is determined by calculating the correlation coefficients between adjacent fragments. In addition, a preprocessing filter is adopted to offset the performance loss resulted from compression. With the compressed heartbeat acquired through CCAL, we extract autoregressive (AR) coefficients directly in the compressed domain. Afterwards, an SVM classifier is used to identify the conditions of the ECG signal. Finally, real data from MIT-BIH arrhythmia database is used for validating the proposed techniques that work efficiently in moderate compression ratios, while achieving desired classification accuracy as the non-compression benchmark at much reduced computational complexity.

1 January 2026 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
XBXuechun Bian
Xuechun Bian
WXWenbo Xu
Wenbo Xu
YWYue Wang
Yue Wang
Chau YuenChau Yuen
Chau Yuen
ZCZhipeng Cai
Zhipeng Cai

3 July 2023 in Digital Signal Processing
Verified
Journal Article
Closed access
XBXuechun Bian
Xuechun Bian
XCXiaofang Chen
Xiaofang Chen
WXWenbo Xu
Wenbo Xu
YWYue Wang
Yue Wang