Alert button
Picture for Qingjiang Shi

Qingjiang Shi

Alert button

Towards Structural Sparse Precoding: Dynamic Time, Frequency, Space, and Power Multistage Resource Programming

Oct 15, 2023
Zhongxiang Wei, Ping Wang, Qingjiang Shi, Xu Zhu, Christos Masouros

In last decades, dynamic resource programming in partial resource domains has been extensively investigated for single time slot optimizations. However, with the emerging real-time media applications in fifth-generation communications, their new quality of service requirements are often measured in temporal dimension. This requires multistage optimization for full resource domain dynamic programming. Taking experience rate as a typical temporal multistage metric, we jointly optimize time, frequency, space and power domains resource for multistage optimization. To strike a good tradeoff between system performance and computational complexity, we first transform the formulated mixed integer non-linear constraints into equivalent convex second order cone constraints, by exploiting the coupling effect among the resources. Leveraging the concept of structural sparsity, the objective of max-min experience rate is given as a weighted 1-norm term associated with the precoding matrix. Finally, a low-complexity iterative algorithm is proposed for full resource domain programming, aided by another simple conic optimization for obtaining its feasible initial result. Simulation verifies that our design significantly outperform the benchmarks while maintaining a fast convergence rate, shedding light on full domain dynamic resource programming of multistage optimizations.

Viaarxiv icon

Joint Beamforming for RIS Aided Full-Duplex Integrated Sensing and Uplink Communication

Sep 21, 2023
Yuan Guo, Yang Liu, Qingqing Wu, Xin Zeng, Qingjiang Shi

Figure 1 for Joint Beamforming for RIS Aided Full-Duplex Integrated Sensing and Uplink Communication
Figure 2 for Joint Beamforming for RIS Aided Full-Duplex Integrated Sensing and Uplink Communication
Figure 3 for Joint Beamforming for RIS Aided Full-Duplex Integrated Sensing and Uplink Communication
Figure 4 for Joint Beamforming for RIS Aided Full-Duplex Integrated Sensing and Uplink Communication

This paper studies integrated sensing and communication (ISAC) technology in a full-duplex (FD) uplink communication system. As opposed to the half-duplex system, where sensing is conducted in a first-emit-then-listen manner, FD ISAC system emits and listens simultaneously and hence conducts uninterrupted target sensing. Besides, impressed by the recently emerging reconfigurable intelligent surface (RIS) technology, we also employ RIS to improve the self-interference (SI) suppression and signal processing gain. As will be seen, the joint beamforming, RIS configuration and mobile users' power allocation is a difficult optimization problem. To resolve this challenge, via leveraging the cutting-the-edge majorization-minimization (MM) and penalty-dual-decomposition (PDD) methods, we develop an iterative solution that optimizes all variables via using convex optimization techniques. Numerical results demonstrate the effectiveness of our proposed solution and the great benefit of employing RIS in the FD ISAC system.

* arXiv admin note: substantial text overlap with arXiv:2309.02648 
Viaarxiv icon

Joint Beamforming and Power Allocation for RIS Aided Full-Duplex Integrated Sensing and Uplink Communication System

Sep 07, 2023
Yuan Guo, Yang Liu, Qingqing Wu, Xiaoyang Li, Qingjiang Shi

Integrated sensing and communication (ISAC) capability is envisioned as one key feature for future cellular networks. Classical half-duplex (HD) radar sensing is conducted in a "first-emit-then-listen" manner. One challenge to realize HD ISAC lies in the discrepancy of the two systems' time scheduling for transmitting and receiving. This difficulty can be overcome by full-duplex (FD) transceivers. Besides, ISAC generally has to comprise its communication rate due to realizing sensing functionality. This loss can be compensated by the emerging reconfigurable intelligent surface (RIS) technology. This paper considers the joint design of beamforming, power allocation and signal processing in a FD uplink communication system aided by RIS, which is a highly nonconvex problem. To resolve this challenge, via leveraging the cutting-the-edge majorization-minimization (MM) and penalty-dual-decomposition (PDD) methods, we develop an iterative solution that optimizes all variables via using convex optimization techniques. Besides, by wisely exploiting alternative direction method of multipliers (ADMM) and optimality analysis, we further develop a low complexity solution that updates all variables analytically and runs highly efficiently. Numerical results are provided to verify the effectiveness and efficiency of our proposed algorithms and demonstrate the significant performance boosting by employing RIS in the FD ISAC system.

Viaarxiv icon

Joint Activity Detection and Channel Estimation in Massive Machine-Type Communications with Low-Resolution ADC

Jun 04, 2023
Ye Xue, An Liu, Yang Li, Qingjiang Shi, Vincent Lau

Figure 1 for Joint Activity Detection and Channel Estimation in Massive Machine-Type Communications with Low-Resolution ADC
Figure 2 for Joint Activity Detection and Channel Estimation in Massive Machine-Type Communications with Low-Resolution ADC
Figure 3 for Joint Activity Detection and Channel Estimation in Massive Machine-Type Communications with Low-Resolution ADC
Figure 4 for Joint Activity Detection and Channel Estimation in Massive Machine-Type Communications with Low-Resolution ADC

In massive machine-type communications, data transmission is usually considered sporadic, and thus inherently has a sparse structure. This paper focuses on the joint activity detection (AD) and channel estimation (CE) problems in massive-connected communication systems with low-resolution analog-to-digital converters. To further exploit the sparse structure in transmission, we propose a maximum posterior probability (MAP) estimation problem based on both sporadic activity and sparse channels for joint AD and CE. Moreover, a majorization-minimization-based method is proposed for solving the MAP problem. Finally, various numerical experiments verify that the proposed scheme outperforms state-of-the-art methods.

* This paper has been accepted by ICC 2023 as a regular paper 
Viaarxiv icon

Decentralized Equalization for Massive MIMO Systems With Colored Noise Samples

May 22, 2023
Xiaotong Zhao, Mian Li, Bo Wang, Enbin Song, Tsung-Hui Chang, Qingjiang Shi

Figure 1 for Decentralized Equalization for Massive MIMO Systems With Colored Noise Samples
Figure 2 for Decentralized Equalization for Massive MIMO Systems With Colored Noise Samples
Figure 3 for Decentralized Equalization for Massive MIMO Systems With Colored Noise Samples
Figure 4 for Decentralized Equalization for Massive MIMO Systems With Colored Noise Samples

Recently, the decentralized baseband processing (DBP) paradigm and relevant detection methods have been proposed to enable extremely large-scale massive multiple-input multiple-output technology. Under the DBP architecture, base station antennas are divided into several independent clusters, each connected to a local computing fabric. However, current detection methods tailored to DBP only consider ideal white Gaussian noise scenarios, while in practice, the noise is often colored due to interference from neighboring cells. Moreover, in the DBP architecture, linear minimum mean-square error (LMMSE) detection methods rely on the estimation of the noise covariance matrix through averaging distributedly stored noise samples. This presents a significant challenge for decentralized LMMSE-based equalizer design. To address this issue, this paper proposes decentralized LMMSE equalization methods under colored noise scenarios for both star and daisy chain DBP architectures. Specifically, we first propose two decentralized equalizers for the star DBP architecture based on dimensionality reduction techniques. Then, we derive an optimal decentralized equalizer using the block coordinate descent (BCD) method for the daisy chain DBP architecture with a bandwidth reduction enhancement scheme based on decentralized low-rank decomposition. Finally, simulation results demonstrate that our proposed methods can achieve excellent detection performance while requiring much less communication bandwidth.

Viaarxiv icon

Once and for All: Scheduling Multiple Users Using Statistical CSI under Fixed Wireless Access

Apr 27, 2023
Xin Guan, Zhixing Chen, Yibin Kang, Qingjiang Shi

Figure 1 for Once and for All: Scheduling Multiple Users Using Statistical CSI under Fixed Wireless Access
Figure 2 for Once and for All: Scheduling Multiple Users Using Statistical CSI under Fixed Wireless Access
Figure 3 for Once and for All: Scheduling Multiple Users Using Statistical CSI under Fixed Wireless Access
Figure 4 for Once and for All: Scheduling Multiple Users Using Statistical CSI under Fixed Wireless Access

Conventional multi-user scheduling schemes are designed based on instantaneous channel state information (CSI), indicating that decisions must be made every transmission time interval (TTI) which lasts at most several milliseconds. Only quite simple approaches can be exploited under this stringent time constraint, resulting in less than satisfactory scheduling performance. In this paper, we investigate the scheduling problem of a fixed wireless access (FWA) network using only statistical CSI. Thanks to their fixed positions, user terminals in FWA can easily provide reliable large-scale CSI lasting tens or even hundreds of TTIs. Inspired by this appealing fact, we propose an \emph{`once-and-for-all'} scheduling approach, i.e. given multiple TTIs sharing identical statistical CSI, only a single high-quality scheduling decision lasting across all TTIs shall be taken rather than repeatedly making low-quality decisions every TTI. The proposed scheduling design is essentially a mixed-integer non-smooth non-convex stochastic problem with the objective of maximizing the weighted sum rate as well as the number of active users. We firstly replace the indicator functions in the considered problem by well-chosen sigmoid functions to tackle the non-smoothness. Via leveraging deterministic equivalent technique, we then convert the original stochastic problem into an approximated deterministic one, followed by linear relaxation of the integer constraints. However, the converted problem is still highly non-convex due to implicit equation constraints introduced by deterministic equivalent. To address this issue, we employ implicit optimization technique so that the gradient can be derived explicitly, with which we propose an algorithm design based on accelerated Frank-Wolfe method. Numerical results verify the effectiveness of our proposed scheduling scheme over state-of-the-art.

* 12 pages,6 figures 
Viaarxiv icon

Over-the-Air Federated Edge Learning with Error-Feedback One-Bit Quantization and Power Control

Mar 20, 2023
Yuding Liu, Dongzhu Liu, Guangxu Zhu, Qingjiang Shi, Caijun Zhong

Figure 1 for Over-the-Air Federated Edge Learning with Error-Feedback One-Bit Quantization and Power Control
Figure 2 for Over-the-Air Federated Edge Learning with Error-Feedback One-Bit Quantization and Power Control
Figure 3 for Over-the-Air Federated Edge Learning with Error-Feedback One-Bit Quantization and Power Control
Figure 4 for Over-the-Air Federated Edge Learning with Error-Feedback One-Bit Quantization and Power Control

Over-the-air federated edge learning (Air-FEEL) is a communication-efficient framework for distributed machine learning using training data distributed at edge devices. This framework enables all edge devices to transmit model updates simultaneously over the entire available bandwidth, allowing for over-the-air aggregation. A one-bit digital over-the-air aggregation (OBDA) scheme has been recently proposed, featuring one-bit gradient quantization at edge devices and majority-voting based decoding at the edge server. However, the low-resolution one-bit gradient quantization slows down the model convergence and leads to performance degradation. On the other hand, the aggregation errors caused by fading channels in Air-FEEL is still remained to be solved. To address these issues, we propose the error-feedback one-bit broadband digital aggregation (EFOBDA) and an optimized power control policy. To this end, we first provide a theoretical analysis to evaluate the impact of error feedback on the convergence of FL with EFOBDA. The analytical results show that, by setting an appropriate feedback strength, EFOBDA is comparable to the Air-FEEL without quantization, thus enhancing the performance of OBDA. Then, we further introduce a power control policy by maximizing the convergence rate under instantaneous power constraints. The convergence analysis and optimized power control policy are verified by the experiments, which show that the proposed scheme achieves significantly faster convergence and higher test accuracy in image classification tasks compared with the one-bit quantization scheme without error feedback or optimized power control policy.

Viaarxiv icon

A Physics-based and Data-driven Approach for Localized Statistical Channel Modeling

Mar 04, 2023
Shutao Zhang, Xinzhi Ning, Xi Zheng, Qingjiang Shi, Tsung-Hui Chang, Zhi-Quan Luo

Figure 1 for A Physics-based and Data-driven Approach for Localized Statistical Channel Modeling
Figure 2 for A Physics-based and Data-driven Approach for Localized Statistical Channel Modeling
Figure 3 for A Physics-based and Data-driven Approach for Localized Statistical Channel Modeling
Figure 4 for A Physics-based and Data-driven Approach for Localized Statistical Channel Modeling

Localized channel modeling is crucial for offline performance optimization of 5G cellular networks, but the existing channel models are for general scenarios and do not capture local geographical structures. In this paper, we propose a novel physics-based and data-driven localized statistical channel modeling (LSCM), which is capable of sensing the physical geographical structures of the targeted cellular environment. The proposed channel modeling solely relies on the reference signal receiving power (RSRP) of the user equipment, unlike the traditional methods which use full channel impulse response matrices. The key is to build the relationship between the RSRP and the channel's angular power spectrum. Based on it, we formulate the task of channel modeling as a sparse recovery problem where the non-zero entries of the sparse vector indicate the channel paths' powers and angles of departure. A computationally efficient weighted non-negative orthogonal matching pursuit (WNOMP) algorithm is devised for solving the formulated problem. Finally, experiments based on synthetic and real RSRP measurements are presented to examine the performance of the proposed method.

* the 34th International Teletraffic Congress (ITC), Shenzhen, China, 2022 
Viaarxiv icon

Why Batch Normalization Damage Federated Learning on Non-IID Data?

Jan 08, 2023
Yanmeng Wang, Qingjiang Shi, Tsung-Hui Chang

Figure 1 for Why Batch Normalization Damage Federated Learning on Non-IID Data?
Figure 2 for Why Batch Normalization Damage Federated Learning on Non-IID Data?
Figure 3 for Why Batch Normalization Damage Federated Learning on Non-IID Data?
Figure 4 for Why Batch Normalization Damage Federated Learning on Non-IID Data?

As a promising distributed learning paradigm, federated learning (FL) involves training deep neural network (DNN) models at the network edge while protecting the privacy of the edge clients. To train a large-scale DNN model, batch normalization (BN) has been regarded as a simple and effective means to accelerate the training and improve the generalization capability. However, recent findings indicate that BN can significantly impair the performance of FL in the presence of non-i.i.d. data. While several FL algorithms have been proposed to address this issue, their performance still falls significantly when compared to the centralized scheme. Furthermore, none of them have provided a theoretical explanation of how the BN damages the FL convergence. In this paper, we present the first convergence analysis to show that under the non-i.i.d. data, the mismatch between the local and global statistical parameters in BN causes the gradient deviation between the local and global models, which, as a result, slows down and biases the FL convergence. In view of this, we develop a new FL algorithm that is tailored to BN, called FedTAN, which is capable of achieving robust FL performance under a variety of data distributions via iterative layer-wise parameter aggregation. Comprehensive experimental results demonstrate the superiority of the proposed FedTAN over existing baselines for training BN-based DNN models.

Viaarxiv icon

ENGNN: A General Edge-Update Empowered GNN Architecture for Radio Resource Management in Wireless Networks

Dec 14, 2022
Yunqi Wang, Yang Li, Qingjiang Shi, Yik-Chung Wu

Figure 1 for ENGNN: A General Edge-Update Empowered GNN Architecture for Radio Resource Management in Wireless Networks
Figure 2 for ENGNN: A General Edge-Update Empowered GNN Architecture for Radio Resource Management in Wireless Networks
Figure 3 for ENGNN: A General Edge-Update Empowered GNN Architecture for Radio Resource Management in Wireless Networks
Figure 4 for ENGNN: A General Edge-Update Empowered GNN Architecture for Radio Resource Management in Wireless Networks

In order to achieve high data rate and ubiquitous connectivity in future wireless networks, a key task is to efficiently manage the radio resource by judicious beamforming and power allocation. Unfortunately, the iterative nature of the commonly applied optimization-based algorithms cannot meet the low latency requirements due to the high computational complexity. For real-time implementations, deep learning-based approaches, especially the graph neural networks (GNNs), have been demonstrated with good scalability and generalization performance due to the permutation equivariance (PE) property. However, the current architectures are only equipped with the node-update mechanism, which prohibits the applications to a more general setup, where the unknown variables are also defined on the graph edges. To fill this gap, we propose an edge-update mechanism, which enables GNNs to handle both node and edge variables and prove its PE property with respect to both transmitters and receivers. Simulation results on typical radio resource management problems demonstrate that the proposed method achieves higher sum rate but with much shorter computation time than state-of-the-art methods and generalizes well on different numbers of base stations and users, different noise variances, interference levels, and transmit power budgets.

* arXiv admin note: text overlap with arXiv:2212.08020 
Viaarxiv icon