Tao Yang

Tao Yang

Auto-generated profile, based on publicly available information

Tao Yang

Beihang University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
10 January 2017 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
TYTao Yang
Tao Yang
LYLei Yang
Lei Yang
YGY. Jay Guo
Y. Jay Guo
JYJinhong Yuan
Jinhong Yuan
This paper studies non-orthogonal transmission over a K-user fading multiple access channel. We propose a new reliable physical-layer network coding and cascade-computation decoding scheme. In the proposed scheme, K single-antenna users encode their messages by the same practical channel code and QAM modulation, and transmit simultaneously. The receiver chooses K linear coefficient vectors and computes the associated K layers of finite-field linear message combinations in a cascade manner. Finally, the K users' messages are recovered by solving the K linear equations. The proposed can be regarded as a generalized onion peeling. We study the optimal network coding coefficient vectors used in the cascade computation. Numerical results show the performance of the proposed approaches that of the iterative maximum a posteriori probability detection and decoding scheme, but without using receiver iteration. This results in considerable complexity reduction, processing delay, and easier implementation. Our proposed scheme significantly outperforms the iterative detection and decoding scheme with a single iteration, for example, by 1.7 dB for the two user case. The proposed scheme provides a competitive solution for non-orthogonal multiple access.

20 March 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
Long ShiLong Shi
Long Shi
TYTao Yang
Tao Yang
KCKui Cai
Kui Cai
PCPingping Chen
Pingping Chen
TGTao Guo
Tao Guo
This paper considers a multiuser communication network where a receiver is set to compute functions of the messages from K users. All user nodes and the receiver are equipped with multi-antenna. We propose a space-time (ST) coded multiple-input multiple-output (MIMO) linear physical-layer network coding (LPNC) scheme that promises full-rate and full-diversity, while achieving the maximum coding gain of LPNC. In the proposed framework, the users’ messages are encoded by the same linear dispersion ST code and transmitted simultaneously. The receiver exploits the MIMO LPNC mapping in reconstructing an arbitrary number of linearly network-coded (NC) messages. We derive the NC generator matrix that leads to the greatest coding gain and minimized error probability at the receiver. On top of that, we analytically show that the proposed ST coded LPNC scheme guarantees the full-diversity and full-rate transmission. The proposed method applies to a wide range of network configurations. Two case studies on a) MIMO two-way relay network and b) MIMO multiple-access relay network are presented in this paper. For both case studies, numerical results are shown to demonstrate the performance improvement of the proposed scheme over conventional schemes by more than 4dB, while the full-rate and full-diversity behaviors are in line with our analysis.

3 August 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ZHZhihao Han
Zhihao Han
TYTao Yang
Tao Yang
RLRongke Liu
Rongke Liu
This correspondence studies the design of beam hopping (BH) pattern for satellite communication systems with hybrid analog-digital precoding. We investigate the transmit power minimization problem under rate constraints. The BH pattern is characterized by a matrix with binary entries with regular or irregular weights. Then, we propose Viterbi and greedy algorithm based methods to identify the optimized BH matrix, for regular and irregular BH patterns, respectively. Numerical results show that the proposed algorithm with regular BH pattern outperforms the existing baseline method by 2.8 dB. Further, it is demonstrated that the proposed irregular BH pattern yields about 2 dB improvement over the regular pattern.

9 May 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
LYLei Yang
Lei Yang
TYTao Yang
Tao Yang
YXYixuan Xie
Yixuan Xie
JYJinhong Yuan
Jinhong Yuan
JAJianping An
Jianping An
We propose a new linear physical-layer network coding (LPNC) and information combining scheme for the K-user fading multiple-access relay network (MARN), which consists of K users, one relay, and one destination. The relay and the destination are connected by a rate-constraint wired or wireless backhaul. In the proposed scheme, the K users transmit signals simultaneously. The relay and the destination receive the superimposed signals distorted by fading and noise. The relay reconstructs L linear combinations of the K users' messages, referred to as L network-coded (NC) messages, and forwards them to the destination. The destination then attempts to recover all K users' messages by combining its received signals and the NC messages obtained from the relay. We develop an explicit expression on the selection of the coefficients of the NC messages at the relay that minimizes the end-to-end error probability at a high signal-to-noise ratio. We develop a channel-coded LPNC scheme by using an irregular repeat-accumulate modulation code over GF(q). An iterative belief-propagation algorithm is employed to compute the NC messages at the relay, while a new algorithm is proposed for the information combining decoding at the destination. We demonstrate that our proposed scheme outperforms benchmark schemes significantly in both un-channel-coded and channel-coded MARNs.

8 November 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
TYTao Yang
Tao Yang
We study a downlink distributed MIMO system where a central unit (CU) broadcasts messages to K' users through K distributed BSs. The CU is connected to the BSs via K independent rate-constrained fronthaul (FH) links. The distributed BSs collectively serve the users through the air. We propose a new network coding based distributed MIMO broadcasting scheme, using reverse compute-and-forward and signal-space alignment. At the CU, a network coding generator matrix is employed for pre network coding of the users' messages. The network coded messages are forwarded to the BSs, where the FH rate-constraint determines the actual number of network-coded messages forwarded to the BSs. At the BSs, linear precoding matrices are designed to create a number of bins, each containing a bunch of spatial streams with aligned signal-spaces. At each user, post physical-layer network coding is employed to compute linear combinations over the NC messages with respect to the bins, which reverses the prenetwork coding and recovers the desired messages. We derive an achievable rate of the proposed scheme based on the existence of NC generator matrix, signal-space alignment precoding matrices, and nested lattice codes. Improved rate and degrees of freedom over existing interference alignment and compress-and-forward schemes are shown. Numerical results demonstrate the performance improvement, e.g., by as much as 70% increase in throughput over benchmark schemes.

26 October 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
QCQiuzhuo Chen
Qiuzhuo Chen
FYFangtao Yu
Fangtao Yu
TYTao Yang
Tao Yang
RLRongke Liu
Rongke Liu
This paper concerns with efficient communication over Gaussian and fading multiple-access channels (MACs). Existing orthogonal multiple-access (OMA) and power-domain nonorthogonal-OMA (NOMA) cannot achieve all rate-tuples in the MAC capacity region. Meanwhile, code-domain NOMA schemes usually require big-loop receiver-iterations for multi-user decoding, which is subject to high implementation cost and latency. This paper studies a linear physical-layer network coding multiple access (LPNC-MA) scheme that is capable of achieving any rate-tuples in the MAC capacity region without receiver iterations. For deterministic Gaussian MACs with M users, we propose to utilize q -ary irregular repeat accumulate (IRA) codes over finite integer fields/rings and q -ary pulse amplitude modulation ( q -PAM) as the underlying coded-modulation. The receiver sequentially computes M network coded (NC) messages of the M users. All users’ messages are then recovered by solving the computed M NC messages via the inverse of the NC coefficient matrix. A joint nested code construction and extrinsic information transfer (EXIT) chart based code optimization method is developed, yielding near-capacity performance (within 0.7 and 1.1 dB the capacity limits for two and three users respectively). For fading MAC, we study the symmetric rate of LPNC-MA, and propose a pragmatic method for identifying the mutual information (MI) maximizing network coding coefficient matrix. Numerical results demonstrate that the frame error rate (FER) of the optimized LPNC-MA is within a fraction of dB the outage probability of fading MAC capacity. LPNC-MA remarkably outperforms NOMA-SIC and IDMA while avoiding the big-loop receiver iteration.