Pengyu Gao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Pengyu Gao has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Pei Xiao
University of Surrey
6 shared publications - Gaojie Chen
Sun Yat-sen University
5 shared publications - Jing Zhu
School of Flexible Electronics (SoFE) and the State Key Laboratory of Optoelectronic Materials and Technologies, Sun Yat-sen University, Guangzhou, Guangdong, China
5 shared publications - Chuan Heng Foh
University of Surrey
3 shared publications - Ye Wang
Pengcheng Laboratory, Shenzhen, China
3 shared publications Jing Zhang
Institute of space-based information systems, China Academy of Electronic and Information Technology (CAEIT), Beijing, China
2 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 23312-23327
Permutation-Driven AFDM DFE: From Sparse Detection Ordering to Kendall–Tau Structural Diversity
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 23312-23327
Permutation-Driven AFDM DFE: From Sparse Detection Ordering to Kendall–Tau Structural Diversity
- 12 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 10602-10613
Multi-Domain Generalized Index Modulation Aided MIMO-AFDM for Future High-Mobility Communications
In this paper, we propose a novel multi-domain generalized index modulation (GIM) scheme aided multiple-input multiple-output affine frequency division multiplexing (MIMO AFDM) systems, referred to as the MIMO-AFDM-GIM system, to enhance spectral efficiency (SE). Specifically, in the proposed scheme, information bits are conveyed not only by conventional constellation symbols but also through index activation across both the spatial domain (via antenna index selection) and the DAFT domain (via chirp subcarrier index selection). To efficiently detect the transmitted information, we develop a weighted coordinate descent (WCD)-based detector that fully exploits the inherent two-layer sparse structure of the MIMO-AFDM-GIM system. This approach achieves reliable signal detection while maintaining relatively low computational complexity, owing to the dedicated pruning mechanism. Furthermore, we derive the upper bound of the average bit error probability (ABEP) by analyzing the system performance under the maximum-likelihood (ML) detector. Finally, simulation results validate the effectiveness of the proposed MIMO-AFDM-GIM scheme, demonstrating significant improvements in SE and detection performance compared to conventional benchmark schemes.
- 12 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (6) , 10602-10613
Multi-Domain Generalized Index Modulation Aided MIMO-AFDM for Future High-Mobility Communications
In this paper, we propose a novel multi-domain generalized index modulation (GIM) scheme aided multiple-input multiple-output affine frequency division multiplexing (MIMO AFDM) systems, referred to as the MIMO-AFDM-GIM system, to enhance spectral efficiency (SE). Specifically, in the proposed scheme, information bits are conveyed not only by conventional constellation symbols but also through index activation across both the spatial domain (via antenna index selection) and the DAFT domain (via chirp subcarrier index selection). To efficiently detect the transmitted information, we develop a weighted coordinate descent (WCD)-based detector that fully exploits the inherent two-layer sparse structure of the MIMO-AFDM-GIM system. This approach achieves reliable signal detection while maintaining relatively low computational complexity, owing to the dedicated pruning mechanism. Furthermore, we derive the upper bound of the average bit error probability (ABEP) by analyzing the system performance under the maximum-likelihood (ML) detector. Finally, simulation results validate the effectiveness of the proposed MIMO-AFDM-GIM scheme, demonstrating significant improvements in SE and detection performance compared to conventional benchmark schemes.
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (5) , 8368-8381
Uplink SCMA-Empowered Uncoordinated Random Access for Future mMTC
In this paper, a novel uncoordinated random access (URA) protocol is presented to address the pressing demand for massive connectivity with low access latency in future massive machine type communication (mMTC) scenarios. The proposed URA scheme integrates the classical slotted ALOHA (S-ALOHA) protocol with sparse code multiple access (SCMA) technique, referred to as SCMA-empowered URA. Specifically, active users randomly choose an SCMA codebook to access the communication network in an arbitrary time slot whenever they want without scheduling. However, due to the lack of central coordination in the proposed URA scheme, SCMA codebook collisions become inevitable, making decoding challenging and leading to increased access failures. To cope with the decoding issue, an interference-canceling (IC) first decoding strategy is proposed at the access point (AP), which can partially tackles collision problems, contributing to a higher system throughput. Taking the proposed IC-first decoding strategy into account, a closed-form theoretical expression of the throughput is derived. Moreover, to alleviate the throughput degradation under the congested user traffic, a user barring mechanism is introduced to manage the traffic load. Firstly, a closed-form expression of idle codebook probability is developed to help indicate the system state, i.e., congested or not. Then, in addition to the estimated real-time load, the AP adaptively adjusts the access probability and redistributes the actual access load. Finally, simulation results demonstrate that the proposed SCMA-empowered URA scheme enjoys higher maximum throughput, compared to the conventional orthogonal multiple access (OMA) based URA scheme. Moreover, the accuracy of the presented theoretical analysis and the effectiveness of the user barring mechanism are verified.
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (5) , 8368-8381
Uplink SCMA-Empowered Uncoordinated Random Access for Future mMTC
In this paper, a novel uncoordinated random access (URA) protocol is presented to address the pressing demand for massive connectivity with low access latency in future massive machine type communication (mMTC) scenarios. The proposed URA scheme integrates the classical slotted ALOHA (S-ALOHA) protocol with sparse code multiple access (SCMA) technique, referred to as SCMA-empowered URA. Specifically, active users randomly choose an SCMA codebook to access the communication network in an arbitrary time slot whenever they want without scheduling. However, due to the lack of central coordination in the proposed URA scheme, SCMA codebook collisions become inevitable, making decoding challenging and leading to increased access failures. To cope with the decoding issue, an interference-canceling (IC) first decoding strategy is proposed at the access point (AP), which can partially tackles collision problems, contributing to a higher system throughput. Taking the proposed IC-first decoding strategy into account, a closed-form theoretical expression of the throughput is derived. Moreover, to alleviate the throughput degradation under the congested user traffic, a user barring mechanism is introduced to manage the traffic load. Firstly, a closed-form expression of idle codebook probability is developed to help indicate the system state, i.e., congested or not. Then, in addition to the estimated real-time load, the AP adaptively adjusts the access probability and redistributes the actual access load. Finally, simulation results demonstrate that the proposed SCMA-empowered URA scheme enjoys higher maximum throughput, compared to the conventional orthogonal multiple access (OMA) based URA scheme. Moreover, the accuracy of the presented theoretical analysis and the effectiveness of the user barring mechanism are verified.
- Open Access
- 23 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 264-268
Satellite Network Attack and Defense Simulation and Visualization Platform
- 23 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 264-268
Open AccessSatellite Network Attack and Defense Simulation and Visualization Platform
- 14 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 728-742
Interference-Suppressed Joint Channel and Power Allocation for Downlinks in Large-Scale Satellite Networks: A Dynamic Hypergraph Neural Network Approach
In the Large-scale Satellite Network (LSN), inter-beam interference significantly hinders the transmission performance of Low Earth Orbit (LEO) satellite downlinks. This interference exhibits notable time-varying characteristics due to the relatively rapid movements between LEO satellites and ground users, posing a substantial challenge to existing transmission resource allocation techniques. To tackle this issue, we introduce the Hypergraph Neural Network (HGNN)-enabled Resource Allocation (HGNNRA) algorithm for the downlinks of LSN. This algorithm aims to solve a transmission-rate maximization problem, effectively handling the time-varying interference among multiple beams in the downlink through a well-tailored Dynamic Hypergraph Neural Network (DynHGNN). Specifically, considering the coupling complexity of satellite beam coverage and user participation, we have developed a Dynamic Hypergraph-based interference model, along with a customized construction algorithm, to describe their time-varying relationships precisely. Simulation results indicate that our proposed HGNNRA outperforms both Graph Convolutional Network (GCN) [14], HGNN [15], GNN-DDQN [48], and GCNRA in terms of transmission rate and the satisfaction degree of user transmission requirement metrics.
- 14 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 728-742
Interference-Suppressed Joint Channel and Power Allocation for Downlinks in Large-Scale Satellite Networks: A Dynamic Hypergraph Neural Network Approach
In the Large-scale Satellite Network (LSN), inter-beam interference significantly hinders the transmission performance of Low Earth Orbit (LEO) satellite downlinks. This interference exhibits notable time-varying characteristics due to the relatively rapid movements between LEO satellites and ground users, posing a substantial challenge to existing transmission resource allocation techniques. To tackle this issue, we introduce the Hypergraph Neural Network (HGNN)-enabled Resource Allocation (HGNNRA) algorithm for the downlinks of LSN. This algorithm aims to solve a transmission-rate maximization problem, effectively handling the time-varying interference among multiple beams in the downlink through a well-tailored Dynamic Hypergraph Neural Network (DynHGNN). Specifically, considering the coupling complexity of satellite beam coverage and user participation, we have developed a Dynamic Hypergraph-based interference model, along with a customized construction algorithm, to describe their time-varying relationships precisely. Simulation results indicate that our proposed HGNNRA outperforms both Graph Convolutional Network (GCN) [14], HGNN [15], GNN-DDQN [48], and GCNRA in terms of transmission rate and the satisfaction degree of user transmission requirement metrics.
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (5) , 3639-3652
Composition Aided Generalized Quadrature Spatial Modulation: Transceiver Design and Performance Analysis
In this paper, we propose a novel composition aided generalized quadrature spatial modulation (C-GQSM) scheme to improve the spectral efficiency (SE) of the GQSM systems by exploiting the power domain degree of freedom. The C-GQSM scheme constitutes a hybridization of GQSM and composition modulation (CM) principles, allowing the information bits to encompass not only the antenna activation patterns (AAPs) and amplitude/phase modulated (APM) constellation symbols, but also the energy allocation patterns (EAPs). In addition, we present two low-complexity detection techniques for the proposed C-GQSM system. The first one is based on the ordered successive interference cancellation (OSIC) technique, while the other based on the weighted coordinate descent (WCD) algorithm. Moreover, the upper bound of the average bit error probability (ABEP) of the proposed C-GQSM scheme is derived under both uncorrelated and correlated channel conditions. Simulation results show that the proposed C-GQSM outperforms both the conventional CM and GQSM systems in terms of SE without sacrificing the bit error rate (BER) performance.
- 20 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 24 (5) , 3639-3652
Composition Aided Generalized Quadrature Spatial Modulation: Transceiver Design and Performance Analysis
In this paper, we propose a novel composition aided generalized quadrature spatial modulation (C-GQSM) scheme to improve the spectral efficiency (SE) of the GQSM systems by exploiting the power domain degree of freedom. The C-GQSM scheme constitutes a hybridization of GQSM and composition modulation (CM) principles, allowing the information bits to encompass not only the antenna activation patterns (AAPs) and amplitude/phase modulated (APM) constellation symbols, but also the energy allocation patterns (EAPs). In addition, we present two low-complexity detection techniques for the proposed C-GQSM system. The first one is based on the ordered successive interference cancellation (OSIC) technique, while the other based on the weighted coordinate descent (WCD) algorithm. Moreover, the upper bound of the average bit error probability (ABEP) of the proposed C-GQSM scheme is derived under both uncorrelated and correlated channel conditions. Simulation results show that the proposed C-GQSM outperforms both the conventional CM and GQSM systems in terms of SE without sacrificing the bit error rate (BER) performance.
- 19 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (8) , 9701-9713
Index Modulation for Fluid Antenna-Assisted MIMO Communications: System Design and Performance Analysis
In this paper, we propose a transmission mechanism for fluid antennas (FAs) enabled multiple-input multiple-output (MIMO) communication systems based on index modulation (IM), named FA-IM, which incorporates the principle of IM into FAs-assisted MIMO system to improve the spectral efficiency (SE) without increasing the hardware complexity. In FA-IM, the information bits are mapped not only to the modulation symbols, but also the index of FA position patterns. Additionally, the FA position pattern codebook is carefully designed to further enhance the system performance by maximizing the effective channel gains. Then, a low-complexity detector, referred to efficient sparse Bayesian detector, is proposed by exploiting the inherent sparsity of the transmitted FA-IM signal vectors. Finally, a closed-form expression for the upper bound on the average bit error probability (ABEP) is derived under the finite-path and infinite-path channel condition. Simulation results show that the proposed scheme is capable of improving the SE performance compared to the existing FAs-assisted MIMO and the fixed position antennas (FPAs)-assisted MIMO systems while obviating any additional hardware costs. It has also been shown that the proposed scheme outperforms the conventional FA-assisted MIMO scheme in terms of error performance under the same transmission rate.
- 19 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (8) , 9701-9713
Index Modulation for Fluid Antenna-Assisted MIMO Communications: System Design and Performance Analysis
In this paper, we propose a transmission mechanism for fluid antennas (FAs) enabled multiple-input multiple-output (MIMO) communication systems based on index modulation (IM), named FA-IM, which incorporates the principle of IM into FAs-assisted MIMO system to improve the spectral efficiency (SE) without increasing the hardware complexity. In FA-IM, the information bits are mapped not only to the modulation symbols, but also the index of FA position patterns. Additionally, the FA position pattern codebook is carefully designed to further enhance the system performance by maximizing the effective channel gains. Then, a low-complexity detector, referred to efficient sparse Bayesian detector, is proposed by exploiting the inherent sparsity of the transmitted FA-IM signal vectors. Finally, a closed-form expression for the upper bound on the average bit error probability (ABEP) is derived under the finite-path and infinite-path channel condition. Simulation results show that the proposed scheme is capable of improving the SE performance compared to the existing FAs-assisted MIMO and the fixed position antennas (FPAs)-assisted MIMO systems while obviating any additional hardware costs. It has also been shown that the proposed scheme outperforms the conventional FA-assisted MIMO scheme in terms of error performance under the same transmission rate.
- 21 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (2) , 716-720
Index Modulation for STAR-RIS Assisted NOMA System
In this letter, we first incorporate the concept of index modulation (IM) into simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided non-orthogonal multiple access (NOMA) system to improve the spectral efficiency. Specifically, the proposed IM aided STAR-RIS-NOMA system enables extra information bits to be transmitted by allocating subsurfaces to different users in a pre-defined subsurface allocation pattern. Furthermore, an approximate closed form expression on bit error rate (BER) is derived. Simulation results demonstrate that the proposed IM aided STAR-RIS-NOMA system is able to acquire transmission rate improvement compared to the conventional STAR-RIS NOMA.
- 21 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (2) , 716-720
Index Modulation for STAR-RIS Assisted NOMA System
In this letter, we first incorporate the concept of index modulation (IM) into simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) aided non-orthogonal multiple access (NOMA) system to improve the spectral efficiency. Specifically, the proposed IM aided STAR-RIS-NOMA system enables extra information bits to be transmitted by allocating subsurfaces to different users in a pre-defined subsurface allocation pattern. Furthermore, an approximate closed form expression on bit error rate (BER) is derived. Simulation results demonstrate that the proposed IM aided STAR-RIS-NOMA system is able to acquire transmission rate improvement compared to the conventional STAR-RIS NOMA.
- 26 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (9) , 9532-9543
Low-Complexity Block Coordinate Descend Based Multiuser Detection for Uplink Grant-Free NOMA
Grant-free non-orthogonal multiple access (NOMA) scheme is considered as a promising candidate for the enabling of massive connectivity and reduced signalling overhead for Internet of Things (IoT) applications in massive machine-type communication (mMTC) networks. Exploiting the inherent nature of sporadic transmissions in the grant-free NOMA systems, compressed sensing based multiuser detection (CS-MUD) has been deemed as a powerful solution to user activity detection (UAD) and data detection (DD). In this paper, block coordinate descend (BCD) method is employed in CS-MUD to reduce the computational complexity. We propose two modified BCD based algorithms, called enhanced BCD (EBCD) and complexity reduction enhanced BCD (CR-EBCD), respectively. To be specific, by incorporating a novel candidate set pruning mechanism into the original BCD framework, our proposed EBCD algorithm achieves remarkable CS-MUD performance improvement. In addition, the proposed CR-EBCD algorithm further ameliorates the proposed EBCD by eliminating the redundant matrix multiplications during the iteration process. As a consequence, compared with the proposed EBCD algorithm, our proposed CR-EBCD algorithm enjoys two orders of magnitude complexity saving without any CS-MUD performance degradation, rendering it a viable solution for future mMTC scenarios. Extensive simulation results demonstrate the bound-approaching performance as well as ultra-low computational complexity.
- 26 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (9) , 9532-9543
Low-Complexity Block Coordinate Descend Based Multiuser Detection for Uplink Grant-Free NOMA
Grant-free non-orthogonal multiple access (NOMA) scheme is considered as a promising candidate for the enabling of massive connectivity and reduced signalling overhead for Internet of Things (IoT) applications in massive machine-type communication (mMTC) networks. Exploiting the inherent nature of sporadic transmissions in the grant-free NOMA systems, compressed sensing based multiuser detection (CS-MUD) has been deemed as a powerful solution to user activity detection (UAD) and data detection (DD). In this paper, block coordinate descend (BCD) method is employed in CS-MUD to reduce the computational complexity. We propose two modified BCD based algorithms, called enhanced BCD (EBCD) and complexity reduction enhanced BCD (CR-EBCD), respectively. To be specific, by incorporating a novel candidate set pruning mechanism into the original BCD framework, our proposed EBCD algorithm achieves remarkable CS-MUD performance improvement. In addition, the proposed CR-EBCD algorithm further ameliorates the proposed EBCD by eliminating the redundant matrix multiplications during the iteration process. As a consequence, compared with the proposed EBCD algorithm, our proposed CR-EBCD algorithm enjoys two orders of magnitude complexity saving without any CS-MUD performance degradation, rendering it a viable solution for future mMTC scenarios. Extensive simulation results demonstrate the bound-approaching performance as well as ultra-low computational complexity.