Han Zhang

Han Zhang

Auto-generated profile, based on publicly available information

Han Zhang

Institute for Communication Systems, University of Surrey, Guildford, U.K.

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
2 September 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Shuai MaShuai Ma
Shuai Ma
YZYunqi Zhang
Yunqi Zhang
HLHang Li
Hang Li
JSJunchang Sun
Junchang Sun
JSJia Shi
Jia Shi
SLShiyin Li
Shiyin Li
In this article, we consider covert beamforming design for intelligent reflecting surface (IRS)-assisted Internet-of-Things (IoT) networks, where Alice utilizes IRS to covertly transmit a message to Bob without being recognized by Willie. We investigate the joint beamformer design of Alice and IRS to maximize the covert rate of Bob when the knowledge about Willie’s channel state information (WCSI) is perfect and imperfect at Alice, respectively. For the former case, we develop a covert beamformer under the perfect covert constraint by applying semidefinite relaxation. For the latter case, the optimal decision threshold of Willie is derived, and we analyze the false alarm and the missed detection probabilities. Furthermore, we utilize the property of the Kullback–Leibler divergence to develop the robust beamformer based on a relaxation, $S$ -Lemma, and alternate iteration approach. Finally, the numerical experiments evaluate the performance of the proposed covert beamformer design and robust beamformer design.

31 July 2020 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
HZHan Zhang
Han Zhang
RHRuisi He
Ruisi He
BABo Ai
Bo Ai
SCShuguang Cui
Shuguang Cui
HZHaoxiang Zhang
Haoxiang Zhang
Recently, channel sparsity has been considered as a nature of wireless channels in many researches of intelligent communications, and an increasing number of investigations are conducted by exploiting sparsity of wireless channels, such as deep-learning-based channel estimation and compressive sensing. Growing evidence from channel measurements show that the sparse or approximate sparse distribution assumption of wireless channel is reasonable, however, the observed sparse structure in wireless channels is mostly based on intuitive analysis. Several fundamental aspects of channel sparsity have not been well investigated, and among them, we find that choosing a reasonable measure of channel sparsity has not been fully addressed. To fill the gap, this paper presents several measures for wireless channel sparsity from propagation view and validates them based on realistic channel measurements and data mining methods. Following the spirit that a sparse representation implies a small number of elements contain a large proportion of the energy, the four measures of the number of multipath components (MPCs), channel degrees of freedom (DoF), the Gini index, and the Ricean K factor are selected as the potential measures of channel sparsity and fully compared, and the channel diversity measure is used as an indicator of channel sparsity to show the inter-dependency between different measures and channel sparsity. The measurement-based analysis shows that the channel DoF and Gini index provide the best sensitivity and accuracy for measuring channel sparsity, whereas the number of MPCs has the worst performance. Moreover, the widely used channel parameter of Ricean K factor is found to have fairly good sensitivity to channel sparsity and can be used for channel sparsity evaluation. The results in the paper can be used to accurately measure sparsity of wireless channel for the design of intelligent communications.

11 August 2022 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
ZSZihang Song
Zihang Song
JYJian Yang
Jian Yang
HZHan Zhang
Han Zhang
Yue GaoYue Gao
Yue Gao
Compressed spectrum sensing naturally pursues the use of fewer sampling resources to achieve spectrum support reconstruction and signal recovery. The theoretical lower boundary of averaging sampling rate to recover the multiband signal has been proved to be twice the Landau rate. However, it is still unreachable in practice. Based on the multicoset sampling architecture, this paper analyzes the influencing factors on perfect spectrum reconstruction from three aspects: data model, sampling pattern and greedy reconstruction algorithms, for which practical and feasible optimization schemes are proposed. To reduce redundant reconstruction for the multiple measurement vectors (MMV) signal model, a block MMV model is proposed to improve the accuracy in the spectrum support set reconstruction process. A sampling pattern selection algorithm is proposed to ensure a higher success rate of the spectrum support reconstruction to optimize the sensing matrix. We also deduced the representation of the signal and noise energy in the reconstructed spectrum based on the mathematical model of compressed sensing. We thus proposed a non-orthogonal double-threshold matching pursuit algorithm to avoid a high false-alarm rate due to the manually set converging conditions for matching pursuit algorithms. Numerical experiments on real-world wideband signals are carried out to demonstrate the feasibility and advantages of the proposed approaches. With integrated optimization, the required sampling density to ensure perfect reconstruction is approaching the sub-Nyquist sampling boundary.

12 April 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
HZHan Zhang
Han Zhang
JYJian Yang
Jian Yang
Yue GaoYue Gao
Yue Gao
Compressive sensing (CS) is a technique frequently adopted in wireless communications. By utilizing CS, a receiver could sense the state of channels with sub-Nyquist analog to digital converters when signals are sparse. Traditional CS methods struggle with non-sparse signals due to their intrinsic sparsity assumption. Therefore, we propose using deep learning (DL) to solve the vector support recovery problem with channels’ high occupancy. The simulation results show that the proposed CS framework powered by DL can perform better than a traditional CS analytical benchmark, both in high and low channel occupation regions. We also observe that the ML can work under a lower sampling rate than traditional CS methods. To process data sampled with high channel numbers, a divide and conquer tactic is implemented.

2 February 2023 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
HZHan Zhang
Han Zhang
ZSZihang Song
Zihang Song
JYJian Yang
Jian Yang
Yue GaoYue Gao
Yue Gao
Anomaly detection is an essential part of spectrum monitoring applications. Malicious users and malfunctioning nodes could be identified via anomaly detection methods. Meanwhile, the spectrum bands that would be utilized in future 6G or satellite communication system settings are going to be wider than ever. Acquiring Nyquist sampled data from such a spectrum would require components with a very high sampling rate. To monitor a wide spectrum, a compressive sensing recovery algorithm combined with a sub-sampling approach could accomplish the task with a lower hardware cost. To solve the anomaly detection problem using a sub-sampled data stream, a joint signal recovery and anomaly detection solution utilizing an adversarial autoencoder (AAE) structure are proposed in this article. An AAE is constructed via an autoencoder and a discriminator weaved together. The discriminator would guide the autoencoder to drive its extracted feature onto a designed feature space, while the autoencoder would provide a reconstruction of the original Nyquist sampled signal. The proposed AAE structure could learn the distribution of the signal from either labelled or unlabelled training data, enabling it to work on both supervised and unsupervised data sets. The proposed AAE has shown superior reconstruction and detection performance on very sparse sampling scenarios.

14 January 2022 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
JHJianhao Huang
Jianhao Huang
HZHan Zhang
Han Zhang
CHChuan Huang
Chuan Huang
LYLian Yang
Lian Yang
WZWei Zhang
Wei Zhang
Massive machine-type communications (mMTC) are expected to support a large amount of randomly deployed users for short package transmissions. Noncoherent random access provides an efficient and practical multi-access protocol for mMTC, and also poses new challenges for the receiver design. In this paper, we leverage two well-known methods, i.e., message passing and deep learning, to jointly detect the user activity and the desired data for the noncoherent mMTC. First, by exploiting the exact distribution information of the received signal, a generalized approximate message passing (GAMP)-based algorithm is proposed, which is shown to jointly detect the user activity and the desired data by two modules: inter-user interference elimination and data detection for each user. Inspired by the two-module GAMP-based algorithm, we then propose a model-driven deep learning method, which utilizes the deep neural networks (DNNs) to approximate both the two modules. The loss function for training the DNNs is derived by formulating the two-module detection as an unconstrained optimization problem. Simulation results reveal that the proposed GAMP-based algorithm outperforms the proposed deep learning method when the channel distribution is perfectly known, while it suffers from a significant performance degradation for the case with imperfect channel distribution information.