Xiangyun Zhou

IT
8papers
614citations
Novelty46%
AI Score45

8 Papers

LGAug 7, 2022
An Unsupervised Learning Approach for Spectrum Allocation in Terahertz Communication Systems

Akram Shafie, Chunhui Li, Nan Yang et al.

We propose a new spectrum allocation strategy, aided by unsupervised learning, for multiuser terahertz communication systems. In this strategy, adaptive sub-band bandwidth is considered such that the spectrum of interest can be divided into sub-bands with unequal bandwidths. This strategy reduces the variation in molecular absorption loss among the users, leading to the improved data rate performance. We first formulate an optimization problem to determine the optimal sub-band bandwidth and transmit power, and then propose the unsupervised learning-based approach to obtaining the near-optimal solution to this problem. In the proposed approach, we first train a deep neural network (DNN) while utilizing a loss function that is inspired by the Lagrangian of the formulated problem. Then using the trained DNN, we approximate the near-optimal solutions. Numerical results demonstrate that comparing to existing approaches, our proposed unsupervised learning-based approach achieves a higher data rate, especially when the molecular absorption coefficient within the spectrum of interest varies in a highly non-linear manner.

ITMay 1
Artificial-Noise Aided Design for Movable-Antenna Enabled Physical-Layer Service Integration

Zhifeng Tang, Guangchen Wang, Nan Yang et al.

This paper pioneers a novel scheme for artificial-noise (AN)-aided movable-antenna (MA)-enabled physical-layer service integration (PLSI) to harmonize the simultaneous delivery of multicast and confidential messages. By jointly exploiting the spatial reconfiguration capability of MAs and the interference shaping capability of AN, we aim to enhance secrecy performance while guaranteeing multicast reliability. The joint design of MA positions and transmit variables results in a highly coupled and non-convex optimization problem. To address this, we first provide key insights into the role of spatial degrees of freedom in AN design. We then characterize the AN direction under a structured transmission design and derive a closed-form expression for the AN-to-confidential power allocation ratio, which significantly simplifies the overall design. To solve the resulting problem, we further develop a low-complexity block coordinate ascent (BCA)-based scheme that alternates between transmit design and MA position optimization. Numerical results demonstrate that the proposed scheme achieves significant secrecy performance gains with low computational complexity and fast convergence, highlighting its effectiveness for MA-enabled PLSI systems.

CVApr 8
IQ-LUT: interpolated and quantized LUT for efficient image super-resolution

Yuxuan Zhang, Zhikai Dong, Xinning Chai et al.

Lookup table (LUT) methods demonstrate considerable potential in accelerating image super-resolution inference. However, pursuing higher image quality through larger receptive fields and bit-depth triggers exponential growth in the LUT's index space, creating a storage bottleneck that limits deployment on resource-constrained devices. We introduce IQ-LUT, which achieves a reduction in LUT size while simultaneously enhancing super-resolution quality. First, we integrate interpolation and quantization into the single-input, multiple-output ECNN, which dramatically reduces the index space and thereby the overall LUT size. Second, the integration of residual learning mitigates the dependence on LUT bit-depth, which facilitates training stability and prioritizes the reconstruction of fine-grained details for superior visual quality. Finally, guided by knowledge distillation, our non-uniform quantization process optimizes the quantization levels, thereby reducing storage while also compensating for quantization loss. Extensive benchmarking demonstrates our approach substantially reduces storage costs (by up to 50x compared to ECNN) while achieving superior super-resolution quality.

ITJun 19, 2019
Low Probability of Detection Communication: Opportunities and Challenges

Shihao Yan, Xiangyun Zhou, Jinsong Hu et al.

Low probability of detection (LPD) communication has recently emerged as a new transmission technology to address privacy and security in wireless networks. Recent studies have established the fundamental limits of LPD communication in terms of the amount of information bits that can be conveyed from a transmitter to a receiver subject to a constraint on a warden's detection error probability. The established information-theoretic metric enables analytical studies on the design and performance of LPD communication under various channel conditions. In this article, we present the key features of LPD communication and discuss various important design considerations. Firstly, we clarify the differences between LPD communication and the well-known physical-layer security. Then, from an information-theoretic point of view, we discuss the optimal signalling strategies for transmitting the message-carrying signal and artificial-noise signal for LPD communication. Finally, we identify the key challenges in the design of practical LPD communication systems and point out future research directions in this context. This article provides guidelines for designing practical LPD communication strategies in wireless systems and networks.

ITJul 2, 2018
Gaussian Signalling for Covert Communications

Shihao Yan, Yirui Cong, Stephen Hanly et al.

In this work, we examine the optimality of Gaussian signalling for covert communications with an upper bound on $\mathcal{D}(p_{_1}||p_{_0})$ or $\mathcal{D}(p_{_0}||p_{_1})$ as the covertness constraint, where $\mathcal{D}(p_{_1}||p_{_0})$ and $\mathcal{D}(p_{_0}||p_{_1})$ are different due to the asymmetry of Kullback-Leibler divergence, $p_{_0}(y)$ and $p_{_1}(y)$ are the likelihood functions of the observation ${y}$ at the warden under the null hypothesis (no covert transmission) and alternative hypothesis (a covert transmission occurs), respectively. Considering additive white Gaussian noise at both the receiver and the warden, we prove that Gaussian signalling is optimal in terms of maximizing the mutual information of transmitted and received signals for covert communications with an upper bound on $\mathcal{D}(p_{_1}||p_{_0})$ as the constraint. More interestingly, we also prove that Gaussian signalling is not optimal for covert communications with an upper bound on $\mathcal{D}(p_{_0}||p_{_1})$ as the constraint, for which as we explicitly show skew-normal signalling can outperform Gaussian signalling in terms of achieving higher mutual information. Finally, we prove that, for Gaussian signalling, an upper bound on $\mathcal{D}(p_{_1}||p_{_0})$ is a tighter covertness constraint in terms of leading to lower mutual information than the same upper bound on $\mathcal{D}(p_{_0}||p_{_1})$, by proving $\mathcal{D}(p_{_0}||p_{_1}) \leq \mathcal{D}(p_{_1}||p_{_0})$.

ITJan 31, 2017
Covert Communication with Finite Blocklength in AWGN Channels

Shihao Yan, Biao He, Yirui Cong et al.

Covert communication is to achieve a reliable transmission from a transmitter to a receiver while guaranteeing an arbitrarily small probability of this transmission being detected by a warden. In this work, we study the covert communication in AWGN channels with finite blocklength, in which the number of channel uses is finite. Specifically, we analytically prove that the entire block (all available channel uses) should be utilized to maximize the effective throughput of the transmission subject to a predetermined covert requirement. This is a nontrivial result because more channel uses results in more observations at the warden for detecting the transmission. We also determine the maximum allowable transmit power per channel use, which is shown to decrease as the blocklength increases. Despite the decrease in the maximum allowable transmit power per channel use, the maximum allowable total power over the entire block is proved to increase with the blocklength, which leads to the fact that the effective throughput increases with the blocklength.

ITMay 19, 2014
A Semiblind Two-Way Training Method for Discriminatory Channel Estimation in MIMO Systems

Junjie Yang, Shengli Xie, Xiangyun Zhou et al.

Discriminatory channel estimation (DCE) is a recently developed strategy to enlarge the performance difference between a legitimate receiver (LR) and an unauthorized receiver (UR) in a multiple-input multiple-output (MIMO) wireless system. Specifically, it makes use of properly designed training signals to degrade channel estimation at the UR which in turn limits the UR's eavesdropping capability during data transmission. In this paper, we propose a new two-way training scheme for DCE through exploiting a whitening-rotation (WR) based semiblind method. To characterize the performance of DCE, a closed-form expression of the normalized mean squared error (NMSE) of the channel estimation is derived for both the LR and the UR. Furthermore, the developed analytical results on NMSE are utilized to perform optimal power allocation between the training signal and artificial noise (AN). The advantages of our proposed DCE scheme are two folds: 1) compared to the existing DCE scheme based on the linear minimum mean square error (LMMSE) channel estimator, the proposed scheme adopts a semiblind approach and achieves better DCE performance; 2) the proposed scheme is robust against active eavesdropping with the pilot contamination attack, whereas the existing scheme fails under such an attack.

ITJan 6, 2014
When Does Relay Transmission Give a More Secure Connection in Wireless Ad Hoc Networks?

Chunxiao Cai, Yueming Cai, Xiangyun Zhou et al.

Relay transmission can enhance coverage and throughput, while it can be vulnerable to eavesdropping attacks due to the additional transmission of the source message at the relay. Thus, whether or not one should use relay transmission for secure communication is an interesting and important problem. In this paper, we consider the transmission of a confidential message from a source to a destination in a decentralized wireless network in the presence of randomly distributed eavesdroppers. The source-destination pair can be potentially assisted by randomly distributed relays. For an arbitrary relay, we derive exact expressions of secure connection probability for both colluding and non-colluding eavesdroppers. We further obtain lower bound expressions on the secure connection probability, which are accurate when the eavesdropper density is small. By utilizing these lower bound expressions, we propose a relay selection strategy to improve the secure connection probability. By analytically comparing the secure connection probability for direct transmission and relay transmission, we address the important problem of whether or not to relay and discuss the condition for relay transmission in terms of the relay density and source-destination distance. These analytical results are accurate in the small eavesdropper density regime.