Xiaojun Zhang

Prof. Xiaojun Zhang

Shandong University of Science and Technology,

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
7 January 2022 in IEEE Sensors Journal
Verified
Journal Article
Closed access
HWHongfei Wang
Hongfei Wang
JWJingjing Wang
Jingjing Wang
DCDa Chen
Da Chen
GSGe Song
Ge Song
YLYijian Liu
Yijian Liu
JYJun Yang
Jun Yang
Long-term and stable monitoring of bioelectrical signals represented by electrocardiogram (ECG) has a great application value for wearable electronics. The ECG monitoring require low-cost, flexible and robust electrical system that can work throughout daily activities. In this article, we propose a paper-assisted strategy to fabricate a tattoo ECG electrode based on the low-cost water transfer printing technology. Similar to the tattoo attached on the skin, the fabricated electrode allows complying with the skin deformation comfortably and accommodating the local strains. The ECG signals collected by the tattoo electrode have a high signal to noise ratio, robustness, mechanical stability and strong immunity to motion artifact even under the severe deformation of skin. The tattoo electrode enables convenient and long-period ECG monitoring during various activities, including exercising, sweating, rubbing, and flushing. As a proof-of-concept, a soft wireless ECG system is developed by integrating with the tattoo electrode, commercialized IC chips, and a low-energy Bluetooth module to achieve the functions of signal acquisition, data processing and communication. The measured results show that the proposed strategy has a promising application for wearable health monitoring system.

27 January 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
CCChengguan Chen
Chengguan Chen
XZXiaojun Zhang
Xiaojun Zhang
YLYimeng Liu
Yimeng Liu
WWWeike Wang
Weike Wang
QZQingtian Zeng
Qingtian Zeng
In order to reduce the decoding latency, a new early stopping criterion is proposed for belief propagation (BP) decoding. A kind of special processing elements (PEs) of BP decoder called frozen and information PE (FIPE) is selected to predict whether decoding is successful or not. Statistics indicate that FIPE can be considered reliable when the frozen bit is decoded successfully. The proposed criterion is based on the fact that the number of reliable FIPE increase along with iterations and the variation trend is approximate to the ratio of correct information bits. In the term of hardware complexity, the proposed method has a linear correlation with the number of FIPE. This criterion consumes only ‘xor’ and ‘or’ gates to check stopping condition. Simulation results show that the proposed criterion achieves lower latency than Worst Information Bits (WIB) and Frozen Bit Error Rate (FBER) without BLER degradation compared with fixed and G-matrix. Compared with WIB, FBER, Best Frozen Bits (BFB) criterion, the proposed criterion has the lowest hardware complexity.


1 January 2018 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
XZXiaojun Zhang
Xiaojun Zhang
XYXiaofeng Yan
Xiaofeng Yan
QZQingtian Zeng
Qingtian Zeng
JCJianming Cui
Jianming Cui
NCNing Cao
Ning Cao
RHRussell Higgs
Russell Higgs
Polar code has been proven to achieve the symmetric capacity of memoryless channels. However, the successive cancellation decoding algorithm is inherent serial in nature, which will lead to high latency and low throughput. In order to obtain high throughput, we design a deeply pipelined polar decoder and optimize the processing elements and storage structure. We also propose an improved fixed‐point nonuniform quantization scheme, and it is close to the floating‐point performance. Two‐level control strategy is presented to simplify the controller. In addition, we adopt FIFO structure to implement theα_memory andβ_memory and propose the 348‐stage pipeline decoder.

27 March 2024 in Remote Sensing
Verified
Journal Article
Open access
PDF file
BCBinge Cui
Binge Cui
MLMengting Liu
Mengting Liu
RCRuipeng Chen
Ruipeng Chen
ZHZhang Haoqing
Zhang Haoqing
XZXiaojun Zhang
Xiaojun Zhang
Green tides are marine disasters caused by the explosive proliferation or high concentration of certain large algae in seawater, which causes discoloration of the water body. Accurate monitoring of its distribution area is highly important for early warning and the protection of marine ecology. However, existing deep learning methods have difficulty in effectively identifying green tides with anisotropic characteristics due to the complex and variable shapes of the patches and the wide range of scales. To address this issue, this paper presents an anisotropic green tide patch extraction network (AGE-Net) based on deformable convolution. The main structure of AGE-Net consists of stacked anisotropic feature extraction (AFEB) modules. Each AFEB module contains two branches for extracting green tide patches. The first branch consists of multiple connected dense blocks. The second branch introduces a deformable convolution module and a depth residual module based on a multiresolution feature extraction network for extracting anisotropic features of green tide patches. Finally, an irregular green tide patch feature enhancement module is used to fuse the high-level semantic features extracted from the two branches. To verify the effectiveness of the AGE-Net model, experiments were conducted on the MODIS Green Tide dataset. The results show that AGE-Net has better recognition performance, with F1-scores and IoUs reaching 0.8317 and 71.19% on multi-view test images, outperforming other comparison methods.

12 October 2018 in IEEE Access
Verified
Journal Article
Open access
XZXiaojun Zhang
Xiaojun Zhang
RSRongquan Sui
Rongquan Sui
JCJianming Cui
Jianming Cui
DZDexue Zhang
Dexue Zhang
QZQingtian Zeng
Qingtian Zeng
Polar codes have been proven to achieve the symmetric capacity of memoryless channel. Compared with a successive cancellation list decoder, list-Fast simplified-successive cancellation generates more candidate paths, which leads to more resource costs and higher decoding latency. To remedy this drawback, we present a simplified sorting architecture. An M*L ordered candidate path matrix is constructed by preliminary sorter, where M and L denote the number of candidate path expanded by one constituent code and the list size of the decoder, respectively. Then, we eliminate the candidate paths that are definitely not in the L best paths by the proposed lossless pruning algorithm. Finally, a compatible sorting network combining the advantages of bitonic sorter and odd-even sorter is proposed. Numerical results show that for L = 32 and M = 8, the proposed architecture can reduce 66.7% of candidate paths and save 52.3% of compare and swap units (CASUs) and 25% of CASU stages compared with the odd-even sorter.