Yao Yao

Yao Yao

Auto-generated profile, based on publicly available information

Yao Yao

Department of Electronic Engineering, Shanghai Jiao Tong University (SJTU), Shanghai, China

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
8 March 2018 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
BXBin Xia
Bin Xia
JWJinglun Wang
Jinglun Wang
KXKexin Xiao
Kexin Xiao
YGYichen Gao
Yichen Gao
YYYao Yao
Yao Yao
SMShaodan Ma
Shaodan Ma
In this paper, an uplink nonorthogonal multiple access (NOMA) system where the base station (BS) trends to decode the independent information of users occupying the same radio resource simultaneously is considered. Different from the traditional successive interference cancellation (SIC) decoding scheme where the later decoding can only be processed after the successful decoding of the previous users, an advanced SIC decoding strategy is proposed to achieve outage balancing for the later decoded users. Under the proposed SIC decoding mechanism, the BS regards the unsuccessfully decoded users' information as the interference on the following users, i.e. even the outage occurs for any of the previous decoded users, the BS will still try to decode the following users' information. The outage performance with the new decoding strategy is theoretically analyzed. The closed-form expressions of the outage probability for each user are derived for an uplink 2-user NOMA system. Finally, the accuracy of the theoretical results is verified by the simulations.

25 January 2018 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YGYichen Gao
Yichen Gao
BXBin Xia
Bin Xia
YLYingbin Liu
Yingbin Liu
YYYao Yao
Yao Yao
KXKexin Xiao
Kexin Xiao
GLGuanping Lu
Guanping Lu
Instead of successive interference cancellation (SIC) with fixed decoding order, we investigate the dynamic-ordered decoding scheme based on the estimated instantaneous received signal power in case of imperfect channel state information (CSI) for uplink nonorthogonal multiple access systems. The impacts of channel estimation error on both decoding process and order determination are theoretically analyzed in terms of the outage probability for each user. From our analysis, imperfect CSI introduces not only extra interference on the desired signal but also the incorrect decoding order. As shown in the simulations, the dynamic-ordered SIC receiver outperforms the traditional fixed one in case of good quality of estimated CSI. However, the advantage decreases with poor channel estimation quality.

14 August 2017 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Open access
CYChenchen Yang
Chenchen Yang
BXBin Xia
Bin Xia
WXWeiliang Xie
Weiliang Xie
KHKaibin Huang
Kaibin Huang
YYYao Yao
Yao Yao
YZYong Zhao
Yong Zhao
In this paper, we propose to exploit the limited cache packets as side information to cancel incoming interference at the receiver side. We consider a stochastic network where the random locations of base stations and users are modeled using Poisson point processes. Caching schemes to reap both the local caching gain and the interference cancellation gain for the users are developed based on two factors: the densities of different user subsets and the packets cached in the corresponding subsets. The packet loss rate (PLR) is analyzed, which depends on both the cached packets and the channel state information (CSI) available at the receiver. Theoretical results reveal the tradeoff between caching resource and wireless resource. The performance for different caching schemes are analyzed and the lowest achievable PLR for the distributed caching is investigated.

24 March 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YGYixiao Gu
Yixiao Gu
YYYao Yao
Yao Yao
CLCheng Li
Cheng Li
BXBin Xia
Bin Xia
DXDingjie Xu
Dingjie Xu
CZChaoxian Zhang
Chaoxian Zhang
To realize the vision of the Internet of Things (IoT), mobile-edge computing (MEC) has recently emerged as a promising paradigm to meet the computation demand from mobile users (MUs). In this article, we study the network performance in large-scale stochastic MEC wireless networks, where the tasks can be computed locally by the local computation capabilities (LCCs) or be offloaded to MEC servers for edge computing. To this end, a MEC network is modeled featuring random node distribution, dynamic task requests, orthogonal frequency-division multiple access, task retransmission, and parallel computing in MEC servers. Given the model, a 2-D discrete-time Markov chain is first adopted to characterize the task execution process, including local computing and task offloading. Based on the coupling between communication and computing, the average outage probability of the task transmission and the average MEC computation load are derived by integrating the stochastic geometry and queuing theory. Furthermore, by jointly analyzing the local computation latency, transmission latency, and edge computation latency, we derive the average end-to-end latency of the task execution. Our results show that the LCCs in MUs can improve the network performance, including communication and computation performance, in stochastic MEC networks. In addition, useful guidelines for MEC network provisioning and planning are provided to avoid either the local computing or the task offloading being the latency performance bottleneck.

4 February 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
YYYao Yao
Yao Yao
KXKexin Xiao
Kexin Xiao
BXBin Xia
Bin Xia
QGQingjian Gu
Qingjian Gu
Probabilistic shaping (PS) combined with bipolar amplitude shift keying modulation is a promising transmission scheme. However, such 1-dimensional PS scheme inevitably suffers shaping loss in Rayleigh fading channels due to the lack of signal diversity. In this paper, we design a rotated quadrature amplitude modulation based PS strategy. With the discrete inputs, the ergodic constellation constrained (CC) capacity is derived based on the mutual information conditioned on full channel state information available at the receiver, which is found to be mutually influenced by both the probability mass function (PMF) and the rotation angle (RA) of the input signals. Furthermore, the closed-form cutoff rate is also derived to simplify the analysis, which is the lower bound of the mutual information with finite decoding complexity. Correspondingly, the optimizations of RA and PMF are both considered for maximizing the ergodic CC capacity and the cutoff rate, respectively, where the single parameter RA is firstly obtained by the exhaustive search. And then, the optimal PMFs of the subproblem for the fixed RAs and the fixed constellation scaling factor are obtained. Furthermore, with this non-equiprobable transmission scheme, the closed-form pairwise error probability is derived for the first time, which also validates the superiority of the proposed PS scheme in comparison with the uniform schemes with elaborate rotations.

13 September 2023 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
MWManlin Wang
Manlin Wang
BXBin Xia
Bin Xia
YYYao Yao
Yao Yao
ZCZhiyong Chen
Zhiyong Chen
JWJiangzhou Wang
Jiangzhou Wang
Short-packet communications are applied to various scenarios where transmission covertness and reliability are crucial due to the open wireless medium and finite blocklength. Nonetheless, transmission covertness and reliability present a dilemma and significantly limit the throughput for short-packet communications. Intelligent reflection surface (IRS) is utilized in this paper to address this issue by enabling channel reconstruction, thereby releasing the fundamental limit between transmission covertness, reliability, latency (blocklength), and throughput. Specifically, to reveal the benefits brought by IRS, the achievable throughput without IRS is derived first in terms of the transmission covertness requirement, reliability requirement, and blocklength. Subsequently, the achievable throughput with IRS is derived, which releases the fundamental limit among the above-mentioned performance metrics. Besides, considering the phase uncertainty at IRS and limited channel estimation overhead, the cases where the warder/IRS knows instantaneous/statistical channel state information (CSI) of warder-related/legitimate links are all discussed, elucidating the impacts of CSI availability on the throughput. Furthermore, numerical results verify the accuracy of analytical results and demonstrate the benefits provided by IRS. Especially, the achievable covertness and reliability performance can be enhanced while the minimum required blocklength can be reduced by introducing IRS, which is crucial for short-packet communications.