Shusen Jing

Shusen Jing

Auto-generated profile, based on publicly available information

Shusen Jing

LinkedIn, Mountain View, CA, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
24 May 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SJShusen Jing
Shusen Jing
CXChengshan Xiao
Chengshan Xiao
Federated learning (FL) is a popular distributed learning paradigm, in which a global model at a server learns private data of clients without data shared among clients or the server. In this paper, we consider FL over a noisy fading multiple access channel (MAC) via over-the-air computation (AirComp). Benefiting from waveform-superposition propriety of wireless signals, AirComp is able to achieve fast aggregations in FL and improve spectral efficiency. However, most of the schemes exploiting AirComp require intensive channel estimations as the demands from precoders, which results in considerable communication overheads. For this reason, we propose two novel FL schemes with statistical channel state information (FL-SCSI-A and FL-SCSI-B) to reduce the efforts required by channel estimations. In FL-SCSI-A, precoders adjust phases of transmitted signals with phases of instant channel state information (CSI), and scale transmitted signal powers based on statistical CSI. The precoder design has the following two advantages. First, phases of instant CSI can be easier to estimate than complete instant CSI. Second, since clients only need to estimate phases of their own instant CSI (instead of CSI of all clients), with channel reciprocity, this can be easily achieved by letting the server broadcast pilots to all clients. The server in FL-SCSI-A is also efficient. It only needs to estimate the sum of channel gains of all clients, which can be easily achieved by letting clients transmit pilots simultaneously. To further reduce the communication overhead, FL-SCSI-B is proposed. The precoders in FL-SCSI-B are similar to FL-SCSI-A, while the server does not require any knowledge of instant CSI, which reduces the demands of channel estimations. For both schemes, we prove that the distortion caused by the noisy fading MAC is bounded, and the convergences of the learning processes are guaranteed for strongly smooth losses with heterogeneous data assumptions. Experimental results show that the proposed schemes perform better than benchmark schemes while reducing efforts required by channel estimation.

28 February 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
SJShusen Jing
Shusen Jing
CXChengshan Xiao
Chengshan Xiao
This paper investigates the transmitter and receiver beamforming (TB and RB) for over-the-air computation (AirComp) in massive multiple-inputs and multiple-outputs (MIMO) systems. First, we propose a two-phase hybrid beamforming algorithm to design TB and hybrid RB. In the first phase, we adopt a projected gradient descent with momentum (PGDM) algorithm to search for the optimal fully-digital TB matrices. Compared with the benchmarks on the mean square error (MSE) performances, PGDM can achieve up to 5 dB gain in signal-to-noise ratio (SNR) with less algorithm execution time when fully-digital RB is assumed. In the second phase, we plug the TB matrices obtained in PGDM as well as the optimal baseband RB (BBRB) matrix into the MSE objective, and adopt gradient descent to search for the optimal radio-frequency RB (RFRB) matrix. Compared with the state-of-the-arts, the proposed two-phase algorithm reduces up to 30% of the algorithm execution time and 18% of the MSE. Second, we propose a statistical TB algorithm to reduce the communication overheads, in which TB completely depends on statistical channel state information (CSI) and thus does not rely on the feedback from the base station (BS). We prove that orthonormal matrices are asymptotically optimal for statistical TB when uncorrelated Rayleigh channels are assumed and the number of receiving antennas approaches to infinity. For correlated channels, experimental results show that the proposed statistical TB can achieve about 5 dB gain in SNR compared with orthonormal matrices in terms of the MSE performance. Third, a large scale system analysis is made in this paper. As the number of the receiving antennas approaches to infinity, asymptotically optimal choices for TB and RB are provided, and upper bounds of MSE are derived in terms of the number of clients and receiving antennas. For hybrid RB, an upper bound of the squared distance between the optimal hybrid RB and the optimal fully-digital RB is also derived.

31 March 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SJShusen Jing
Shusen Jing
JHJoseph Hall
Joseph Hall
YZYahong Rosa Zheng
Yahong Rosa Zheng
CXChengshan Xiao
Chengshan Xiao
Underwater acoustic communication often suffers from extended channel impulse response and large Doppler spread, such that signals become difficult to detect and decode. For underwater internet of things (IoT) applications, the challenges are even bigger, because IoT devices usually transmit very short messages due to severe power constraints, and the length of pilots are often shorter than that of channel impulse response. Therefore, conventional pilot-assisted channel estimation and equalization approaches are incapable of detecting information data. Moreover, existing blind channel equalization algorithms, which do not require pilots, are not able to detect information data either, because the number of transmitted symbols is too small to approximate the expected loss with empirical loss, where the loss refers to as the error of estimated signal envelopes. In this paper, a new equalization and decoding algorithm is proposed for underwater IoT devices under harsh communication environments. Inspired by recent blind deconvolution and compressive sensing techniques, we construct an optimization problem with objective function rewarding sparsity of the estimated channel impulse response using l4-norm, and convexify the feasible set of the problem while guarantee the same solution. Then we develop a pruned tree search initialization method, and use gradient descent to find an optimal solution efficiently. The new algorithm is first verified by simulations, which show that the proposed algorithm outperforms conventional methods such as linear minimum mean square error (LMMSE) equalizer and constant modulus algorithm (CMA). The proposed algorithm, along with a practical procedure for compensating large Doppler spread and carrier frequency offset, is further employed to process real-world underwater IoT data collected in a fish-tag project. It shows that the proposed algorithm can equalize and detect IoT data which was corrupted by channels whose length are longer than that of pilots, but existing algorithms such as LMMSE equalizer and CMA-based blind equalizer are not able to accomplish. It also shows that the proposed algorithm can provide a very impressive improvement compared to raw detection (no equalization or decoding) and decoding-only approaches.

14 July 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
SJShusen Jing
Shusen Jing
CXChengshan Xiao
Chengshan Xiao
In this paper, we investigate designs of linear precoders for vector Gaussian channels via stochastic optimizations and deep neural networks (DNNs). We assume that the channel inputs are drawn from practical finite alphabets, and we search for precoders maximizing the mutual information between channel inputs and outputs. Though the problem is generally non-convex, we prove that when the right singular matrix of precoder is fixed, any local optima of this problem is a global optima. Based on this fact, an efficient projected stochastic gradient descent (PSGD) algorithm is designed to search the optimal precoders. Moreover, to reduce the complexity of calculating a posterior means involved in gradients calculation, K-best algorithm is adopted to make approximations of a posterior means with negligible loss of accuracy. Furthermore, to avoid explicit calculation of mutual information and its gradients, DNN-based autoencoders (AEs) are constructed for this precoding task, and an efficient training algorithm is proposed. We also prove that the AEs, with `softmax' activation function and `categorical cross entropy' loss, maximize the mutual information under reasonable assumptions. Then, in order to extend the AE methods to large scale systems, `sigmoid' activation function and `binary cross entropy' loss are used such that the size of AEs will not grow prohibitively large. We prove that this maximizes a lower bound of the mutual information under reasonable assumptions. Finally, to make the precoders practical for high speed wireless scenarios, we propose an offline training paradigm which trains DNNs to infer optimal precoders given channel state information instead of training online for every different channel. Simulation results show that all the proposed methods work well in maximizing mutual information and improving bit error rate (BER) performance.

4 June 2024 in IEEE Transactions on Machine Learning in Communications and Networking
Verified
Journal Article
Open access
SJShusen Jing
Shusen Jing
Songyang ZhangSongyang Zhang
Songyang Zhang
ZDZhi Ding
Zhi Ding
Robust header compression (ROHC), critically positioned between network and MAC layers, plays an important role in modern wireless communication networks for improving data efficiency. This work investigates bi-directional ROHC (BD-ROHC) integrated with a novel architecture of reinforcement learning (RL). We formulate a partially observable Markov decision process (POMDP), where the compressor is the POMDP agent, and the environment consists of the decompressor, channel, and header source. Our work adopts the well-known deep Q-network (DQN), which takes the history of actions and observations as inputs, and outputs the Q-values of corresponding actions. Compared with the ideal dynamic programming (DP) proposed in existing works, the newly proposed method is scalable to the state, action, and observation spaces. In contrast, DP often incurs formidable computation costs when the number of states becomes large due to long decompressor feedback delays and complex channel models. In addition, the new method does not require prior knowledge of the transition dynamics and accurate observation dependency of the model, which are often unavailable in practical applications.

6 November 2026
Verified
Conference Paper
Open access
FBFedor Borisyuk
Fedor Borisyuk
SVSriram Vasudevan
Sriram Vasudevan
MWMuchen Wu
Muchen Wu
GLGuoyao Li
Guoyao Li
BLBenjamin Le
Benjamin Le
WZWenjing Zhang
Wenjing Zhang