Zhichao Shao

Zhichao Shao

Auto-generated profile, based on publicly available information

Zhichao Shao

Yangtze Delta Region Institute (Quzhou), University of Electronic Science and Technology of China, Quzhou, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
27 December 2017 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
ZSZhichao Shao
Zhichao Shao
RLRodrigo de Lamare
Rodrigo de Lamare
LLLukas T. N. Landau
Lukas T. N. Landau
We present a novel iterative detection and decoding scheme for uplink large-scale multiuser multiple-antenna systems. In order to reduce the receiver's energy consumption and computational complexity, 1-bit analog-to-digital converters are used in the front-end. The performance loss due to the 1-bit quantization can be mitigated by using large-scale antenna arrays. We propose a linear low-resolution-aware minimum mean square error detector for soft multiuser interference mitigation. Moreover, short block length low-density parity-check codes are considered for avoiding high latency. In the channel decoder, a quasi-uniform quantizer with scaling factors is devised to lower the error floor of low-density parity-check codes. Simulations show good performance of the system in terms of bit error rate as compared to prior work.

12 February 2021 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
ZSZhichao Shao
Zhichao Shao
LLLukas T. N. Landau
Lukas T. N. Landau
RLRodrigo de Lamare
Rodrigo de Lamare
In this work, large-scale multiple-antenna systems are investigated, where the base station employs a large antenna array with low-cost and low-power 1-bit analog-to-digital converters. To compensate for the performance loss caused by the coarse quantization, oversampling is applied at the receiver. Unlike existing works that use uniform oversampling, which samples the signal at a constant rate, a novel dynamic oversampling scheme is proposed. The basic idea is to perform time-varying nonuniform oversampling, which selects samples with nonuniform patterns that vary over time. We consider two system design criteria: a design that maximizes the achievable sum rate and another design that minimizes the mean square error of detected symbols. Dynamic oversampling is carried out using a dimension reduction matrix Δ, which can be computed by the generalized eigenvalue decomposition or by novel submatrix-level feature selection algorithms. Moreover, the proposed scheme is analyzed in terms of convergence, computational complexity and power consumption at the receiver. Simulations show that systems with the proposed dynamic oversampling outperform those with uniform oversampling in terms of computational cost, achievable sum rate and symbol error rate performance.

4 May 2020 in IEEE Access
Verified
Journal Article
Open access
ZSZhichao Shao
Zhichao Shao
LLLukas T. N. Landau
Lukas T. N. Landau
RLRodrigo C. De Lamare
Rodrigo C. De Lamare
Large-scale multiple-antenna systems with large bandwidth are fundamental for future wireless communications, where the base station employs a large antenna array. In this scenario, one problem faced is the large energy consumption as the number of receive antennas scales up. Recently, low-resolution analog-to-digital converters (ADCs) have attracted much attention. Specifically, 1-bit ADCs are suitable for such systems due to their low cost and low energy consumption. This paper considers uplink large-scale multiple-antenna systems with 1-bit ADCs on each receive antenna. We investigate the benefits of using oversampling for channel estimation in terms of the mean square error and symbol error rate performance. In particular, low-resolution aware channel estimators are developed based on the Bussgang decomposition for 1-bit oversampled systems and analytical bounds on the mean square error are also investigated. Numerical results are provided to illustrate the performance of the proposed channel estimation algorithms and the derived theoretical bounds.

14 December 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
AFAna Beatriz L. B. Fernandes
Ana Beatriz L. B. Fernandes
ZSZhichao Shao
Zhichao Shao
LLLukas T. N. Landau
Lukas T. N. Landau
RLRodrigo de Lamare
Rodrigo de Lamare
Low-resolution analog-to-digital converters (ADCs) are promising for reducing energy consumption and costs of multiuser multiple-input multiple-output (MIMO) systems with many antennas. We propose low-resolution multiuser MIMO receivers where the signals are simultaneously processed by 1-bit ADCs and a comparator network, which can be interpreted as additional virtual channels with binary outputs. We distinguish the proposed comparator networks in fully and partially connected. For such receivers, we develop the low-resolution aware linear minimum mean-squared error (LRA-LMMSE) channel estimator and detector according to the Bussgang theorem. We also develop a robust detector which takes into account the channel state information (CSI) mismatch statistics. By exploiting knowledge of the channel coefficients we devise a mean-square error (MSE) greedy search and a sequential signal-to-interference-plus-noise ratio (SINR) search for optimization of partially connected networks. Numerical results show that a system with extra virtual channels can outperform a system with additional receive antennas, in terms of bit error rate (BER). Furthermore, by employing the proposed channel estimation with its error statistics, we construct a lower bound on the ergodic sum rate for a linear receiver. Simulation results confirm that the proposed approach outperforms the conventional 1-bit MIMO system in terms of BER, MSE and sum rate.

4 May 2018 in IET Communications
Verified
Journal Article
Open access
PDF file
CHCornelius Healy
Cornelius Healy
ZSZhichao Shao
Zhichao Shao
RORobert M. Oliveira
Robert M. Oliveira
RLRodrigo de Lamare
Rodrigo de Lamare
Luciano MendesLuciano Mendes
Luciano Mendes
Low‐density parity‐check (LDPC) codes have excellent performance for a wide range of applications at reasonable complexity. LDPC codes with short blocks avoid the high latency of codes with large block lengths, making them potential candidates for ultra reliable low‐latency applications of future wireless standards. In this work, a novel informed dynamic scheduling (IDS) strategy for decoding LDPC codes, denoted reliability‐based residual belief propagation (Rel‐RBP), is developed by exploiting the reliability of the message and the residuals of the possible updates to choose the messages to be used by the decoding algorithm. A different measure for each iteration of the IDS schemes is also presented, which underlies the high cost of those algorithms in terms of computational complexity and motivates the development of the proposed strategy. Simulations show that Rel‐RBP speeds up the decoding at reduced complexity and results in error rate performance gains over prior work.

12 December 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ZSZhichao Shao
Zhichao Shao
XYXiaojun Yuan
Xiaojun Yuan
WZWei Zhang
Wei Zhang
MRMarco Di Renzo
Marco Di Renzo
In this work, we investigate a reconfigurable intelligent surface (RIS) aided integrated sensing and communication scenario, where a base station (BS) communicates with multiple devices in a full-duplex mode, and senses the positions of these devices simultaneously. An RIS is assumed to be mounted on each device to enhance the reflected echoes. Meanwhile, the information of each device is passively transferred to the BS via reflection modulation. We aim to tackle the problem of joint localization and information retrieval at the BS. A grid based parametric model is constructed and the joint estimation problem is formulated as a compressive sensing problem. We propose a novel message-passing algorithm to solve the considered problem, and a progressive approximation method to reduce the computational complexity involved in the message passing. Moreover, an expectation-maximization (EM) algorithm is applied for tuning the grid parameters to mitigate the model mismatch problem. Finally, we analyze the efficacy of the proposed algorithm through the Bayesian Cramér-Rao bound. Numerical results demonstrate the feasibility of the proposed scheme and the superior performance of the proposed EM-based message-passing algorithm.