Limin Zhang

Dr. Limin Zhang


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
20 June 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
Kaiwen TanKaiwen Tan
Kaiwen Tan
WYWenjun Yan
Wenjun Yan
LZLimin Zhang
Limin Zhang
QLQing Ling
Qing Ling
CXCongan Xu
Congan Xu
Specific emitter identification (SEI) refers to the technology that uses the inherent defects of the physical layer of a hardware device to identify and uniquely associate a single emitter. Given its unique capability to automatically extract high-dimensional features, deep learning has recently shown great potential in SEI. However, the training process of supervised neural networks largely depends on the generalization of sample distribution and integrity of data labels. In specific non-cooperative areas such as electronic reconnaissance and spectrum monitoring, the unknown radio frequency devices and the complexity of the electromagnetic environment make it difficult to utilize sufficient labeled samples and capture the potential distribution of the data. Therefore, we introduce semi-supervised learning into SEI and propose a self-classification generative adversarial network (GAN) using bispectrum-based feature extraction. The bispectrum estimation of the signal is used as the feature representation of emitters, and the label information is embedded into the input latent layer to guide the training of the GAN. The shared weight update of the classification network is realized through semi-supervised training, and the optimization function of the generator is redefined to solve the mode collapse caused by the game principle. We innovatively extend SEI to communication scenarios with multiple relays and evaluate the effectiveness of our algorithm in different communication scenarios with contaminated radio-frequency fingerprints. The algorithm is also verified using Universal Software Radio Peripheral based on software-defined radio platforms. The numerical experimental results on six modulation signals demonstrate the excellent semi-supervised classification performance of the proposed SEI scheme in multiple scenarios.

11 August 2022 in IEEE Sensors Journal
Verified
Journal Article
Closed access
XCXie Cunxiang
Xie Cunxiang
LZLimin Zhang
Limin Zhang
ZZZhong Zhaogen
Zhong Zhaogen
Deep-learning methods are becoming increasingly popular for improving the efficiency of specific emitter identification (SEI). However, in noncooperative scenarios, it is difficult to both obtain a large number of signal samples for the training of deep-learning models and assign labels to the acquired samples. To solve these two problems, a few-shot unsupervised SEI method is proposed in this study. First, the original radio-frequency (RF) signal is preprocessed based on the Hilbert–Huang transform (HHT) to obtain the Hilbert time–frequency spectrum, which can highlight RF fingerprints (RFFs) that can be used as signal training samples. Then, the Hilbert time–frequency spectrum is input to an improved autoencoder network for training to obtain the latent vector that can represent hidden features of the received signal. Next, the clustering by fast search and find of a density peaks [i.e., density peak clustering (DPC)] algorithm is used to cluster and label the latent vector, which is later reconstructed by the improved autoencoder network to obtain training samples with labeled information. Finally, the meta-learning algorithm is used to train the few-shot SEI network under the few-shot condition, so that it can distinguish different types of RF signals, corresponding to specific emitters. The experimental results show that the unlabeled signal training samples can be clustered and labeled accurately with the proposed method to perform SEI efficiently in few-shot scenarios. In comparison with state-of-the-art solutions, the proposed method in this study exhibited its superiority with regard to few-shot unsupervised SEI.

29 June 2021 in IEEE Communications Letters
Verified
Journal Article
Closed access
LZLimin Zhang
Limin Zhang
CLChong Lin
Chong Lin
WYWenjun Yan
Wenjun Yan
QLQing Ling
Qing Ling
YWYu Wang
Yu Wang
This letter presents our initial results for real-time orthogonal frequency division multiplexing (OFDM) signal modulation classification based on deep learning and software-defined radio. We generate a modulation classification dataset under a dynamic fading channel, including 6 different OFDM modulation signals, and propose a novel neural network with triple-skip residual stack (TRS) as the basic unit. Each TRS has multiple residual units with gradually increasing convolutional layers. Finally, a near real-time classification system is designed based on the proposed network and GNU Radio. The processing delay incurred by the detection and modulation classification is about 4 ms. It is worth mentioning that the classification accuracy can reach 64% at −10 dB, which is about 7% higher than ResNet and VGG.

13 November 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
ZWZhaojun Wu
Zhaojun Wu
LZLimin Zhang
Limin Zhang
ZZZhong Zhaogen
Zhong Zhaogen
RLRenxin Liu
Renxin Liu
Adaptive modulation and coding (AMC) techniques have attracted more attention recently because of flexible strategies and dynamic channel quality. Blind recognition of encoder is an important technology for AMC systems because it can improve communication efficiency very well. In this letter, we present a new algorithm to tackle blind low-density parity-check (LDPC) encoder identification over a given candidate set. Our proposed scheme establishes a cosine conformity (CC) of syndrome, which is a posterior probability that can measure the probability that all parity check relations of the code are satisfied, and classifies the LDPC encoder leading to maximum average CC over the candidate set. Simulations show that the new method is effective for LDPC encoder identification; the correct ratio of recognition is consistent with the simulation results, and its performance is improved by nearly 1.5 dB when compared with the existing algorithm.

18 March 2020 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
ZWZhaojun Wu
Zhaojun Wu
ZZZhong Zhaogen
Zhong Zhaogen
LZLimin Zhang
Limin Zhang
Channel coding technology is indispensable in digital communication systems. In noncooperative contexts, the blind identification of channel codes is very important. In this paper, a new algorithm that directly uses a soft-decision sequence for blind reconstruction of cyclic codes is proposed. From the algebraic structure of cyclic codes, we deduce that a cyclic code of length n must be able to divide the polynomial $x^n + 1$ , and the dual spaces corresponding to the factors of the generator polynomial can form a parity-check relation with the code words. In order to detect this relation, the concept of the average cosine conformity is defined, which can fully utilize the intercepted soft-decision sequence to measure the reliability of the parity-check relation. Further, the statistical characteristics of the average cosine conformity with respect to a candidate factor of the generator polynomial are analyzed in detail. When the traversal code length n is equal to the actual length, some factors in xn + 1 allow this constraint relation to be detected, and the generator polynomial of the cyclic codes consists of these factors. Hence, the blind reconstruction of the cyclic code is exactly equivalent to the hypothesis testing problem. Simulations show that the derived theoretical distribution of the average cosine conformity is consistent with the simulation results. Moreover, the proposed algorithm has preferable performance at low signal-to-noise ratios compared with existing methods, and its computational complexity is reasonable.

28 December 2018 in IEEE Communications Letters
Verified
Journal Article
Closed access
ZWZhaojun Wu
Zhaojun Wu
LZLimin Zhang
Limin Zhang
ZZZhong Zhaogen
Zhong Zhaogen
A new parameter estimation algorithm is proposed for a recursive systematic convolution, or sub-codes of turbo codes. The method is based on optimized cosinoidal cost function of RSC encoder coefficients. A simple iterative process by gradient ascent is designed for the maximum of the cosinoidal cost function. Simulation results show that the proposed method can improve the performance significantly with lower computational complexity, compared to existing algorithms.