Xing Liu

Dr. Xing Liu

Sichuan University
orcid

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

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

Representative Publications

View All Publications
4 April 2013 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
Xing LiuXing Liu
Xing Liu
DPDaiyuan Peng
Daiyuan Peng
HHHongyu Han
Hongyu Han

9 May 2019 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
QZQi Zeng
Qi Zeng
ZZZhengchun Zhou
Zhengchun Zhou
Xing LiuXing Liu
Xing Liu
Zilong LIUZilong LIU
Zilong LIU
This paper is focused on the optimal design and performance analysis of a novel class of no-hit-zone frequency-hopping sequences (NHZ-FHSs) in quasi-synchronous FH multiple-access (QS-FHMA) systems. Although traditional NHZ-FHSs can offer interference-free FHMA performance when the signal arrival delay (τ) does not exceed the width of NHZ (Znh), i.e., |τ|≤Znh, the same performance cannot be guaranteed for |τ|>Znh in which traditional NHZ-FHZs may have large Hamming correlation (which denotes the total number of frequency hits of sequences) and consequently poor error probability performance. Since the strict quasi-synchronization (i.e., |τ|≤Znh) may be hard to maintain at all times in practical FHMA networks (e.g., infrastructureless Ad hoc networks), it is also important to minimize the Hamming correlation for time-shifts outside of the NHZ. Such FHSs are called strong NHZ-FHSs (SNHZ-FHSs) in this paper. We derive a lower bound on the maximum Hamming correlation outside of the NHZ and then present a design algorithm for the optimal SNHZ-FHS set meeting our proposed lower bound with equality. We analyze the bit-error-rate (BER) performance of the FHMA system employing the proposed SNHZ-FHS sets using the average Hamming correlation function. Theoretical analysis and simulation results show that the proposed optimal SNHZ-FHS sets are feasible for practical FHMA networks with relaxed timing requirement and enhanced BER performance.

25 February 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
LZLimengnan Zhou
Limengnan Zhou
CZChongfu Zhang
Chongfu Zhang
QZQi Zeng
Qi Zeng
Xing LiuXing Liu
Xing Liu
HWHanzhou Wu
Hanzhou Wu
This letter is concerned with tackling both of the multi-access interference (MAI) and the follower jamming (FJ) in frequency-hopping multiple-access (FHMA) systems via novel FH sequence (FHS) design. We consider low-hit-zone (LHZ) FHS which provides lower MAIs in quasi-synchronous FHMA systems but suffers from FJ attack. We introduce an improved LHZ-FHS with wide-gap (i.e., WG-LHZ-FHS) for the neighboring carrier frequencies so as to combat the MAI and the FJ. We first present a general method to generate new WG-FHS sets and then construct the first known WG-LHZ-FHS sets with optimal periodic Hamming correlation (PHC) properties. Besides, the error-rate performance of the constructed WG-LHZ-FHS set imposed in an FHMA system under FJ is investigated. The numerical analysis and the system simulation results indicate that the proposed WG-LHZ-FHS set provides the better error-rate performance to combat the FJ as well as satisfactory capability of MAI suppression due to its combined merits of WG and LHZ.

1 June 2013
Verified
Conference Paper
Closed access
Xing LiuXing Liu
Xing Liu
LSLin Shang
Lin Shang
Although many particle swarm optimization (PSO) based feature subset selection methods have been proposed, most of them seem to ignore the difference of feature subset selection problems and other optimization problems. We analyze the search process of a PSO based wrapper feature subset selection algorithm and find that characteristics of feature subset selection can be used to optimize this process. We compare wrapper and filter ways of evaluating features and define the domain knowledge of feature subset selection problems and we propose a fast wrapper feature subset selection algorithm based on PSO employed the domain knowledge of feature subset selection problems. Experimental results show that our method can work well, and the new algorithm can improve both the running time and the classification accuracy.

2 February 2021 in Sensors
Verified
Journal Article
Open access
PDF file
JZJun Zhong
Jun Zhong
XGXin Gou
Xin Gou
QSQin Shu
Qin Shu
Xing LiuXing Liu
Xing Liu
QZQi Zeng
Qi Zeng
Foreign object debris (FOD) on airport runways can cause serious accidents and huge economic losses. FOD detection systems based on millimeter-wave (MMW) radar sensors have the advantages of higher range resolution and lower power consumption. However, it is difficult for traditional FOD detection methods to detect and distinguish weak signals of targets from strong ground clutter. To solve this problem, this paper proposes a new FOD detection approach based on optimized variational mode decomposition (VMD) and support vector data description (SVDD). This approach utilizes SVDD as a classifier to distinguish FOD signals from clutter signals. More importantly, the VMD optimized by whale optimization algorithm (WOA) is used to improve the accuracy and stability of the classifier. The results from both the simulation and field case show the excellent FOD detection performance of the proposed VMD-SVDD method.

7 August 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Xing LiuXing Liu
Xing Liu
LZLiang Zhou
Liang Zhou
SLShengqiang Li
Shengqiang Li
In order to evaluate the goodness of frequency hopping (FH) sequence design, the periodic Hamming correlation function is used as an important measure. Usually, the length of correlation window is shorter than the period of the chosen FH sequence, so the study of the partial Hamming correlation of FH sequence is particularly important. If an FH sequence or an FH sequence set has optimal partial Hamming correlation with respect to the partial Hamming correlation bound for all length of correlation window, then the FH sequence or FH sequence set is said to be strictly optimal. In this paper, we first prove that there is no strictly optimal FH sequence set of family size M and sequence length N over a frequency slot set of size q with respect to the partial Hamming correlation bound derived by Niu et al. when N > q2/M and q ≥ 2, and that by Cai et al. when N > q2/M and q ≥ 2N/N–2. Further, we define a special partition-type difference packing (DP) called [N,∇,Hla] PDP and give several classes of [N,∇,Hla] PDPs. Then we present a new construction of strictly optimal FH sequences. By choosing different PDPs, the FH sequences constructed can give new and flexible parameters. By utilizing this construction method recursively, we can obtain new [N,∇,Hl a] PDPs which lead to infinitely many classes of strictly optimal FH sequences with new parameters. Moreover, based upon an [N,∇,Hla] PDP we present a construction of strictly optimal FH sequence sets. By preceding construction method and recursive construction, we can also obtain infinite classes of strictly optimal FH sequence sets which can give new and flexible parameters.