Kegang Pan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kegang Pan has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Aijun Liu
College of Communications Engineering, Army Engineering University of PLA, Nanjing, China
2 shared publications - Xinting Wang
College of Communication Engineering, Army Engineering University of PLA
2 shared publications Bangning Zhang
College of Communications Engineering, Army Engineering University of PLA, Nanjing, China
1 shared publication- Chen Han
National University of Defense Technology
1 shared publication - Daoxing Guo
College of Communications Engineering, Army Engineering University of PLA, Nanjing, China
1 shared publication Jingming Hu
College of Communications Engineering, Army Engineering University of PLA, Nanjing, China
1 shared publication
Latest Publications
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 5060-5072
Semantic-Empowered Simultaneous Wireless Power Transfer and Anti-Jamming Communication in UAV Relay Networks
Benefiting from the flexible deployment capability and favorable propagation condition, the unmanned aerial vehicle (UAV) relay networks are crucial for rapid coverage extension and resilient connectivity in adversarial communication environments. However, the transmission effectiveness is constrained by scarce energy resource and severe hostile jamming attacks. Motivated by this need, this paper investigates the semantic communication (SemCom) empowered UAV relay networks that integrates SemCom with simultaneous wireless information and power transfer (SWIPT). For the first time, the semantic encoding/ decoding is embedded into the two-hop communication while the power-splitting (PS) jointly coordinates information transmission and energy harvesting. With the imperfect channel state information (CSI), we formulate the worst-case sum SemCom rate maximization problem subject to the constraints of semantic decoding feasibility, energy harvesting and transmit power. To address the intractable problem, we develop a robust three-step monotonic-optimization (MO) framework with low-complexity feasibility checking algorithm (LFCA). Firstly, a robust generalized discretization approach is used to convert the imperfect CSI. Then, the MO framework with LFCA is presented to obtain optimal solution of transmit beamformer, receive decoder and PS ratio with dimension reduction method. Simulations results show that proposed MO-LFCA scheme outperforms conventional bit-level SWIPT scheme and the other benchmark schemes versus different jamming power levels and antenna configurations, demonstrating that the integration of SemCom and SWIPT mechanism can enhance anti-jamming and efficiency performance in UAV relay networks.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 44 (07338716) , 5060-5072
Semantic-Empowered Simultaneous Wireless Power Transfer and Anti-Jamming Communication in UAV Relay Networks
Benefiting from the flexible deployment capability and favorable propagation condition, the unmanned aerial vehicle (UAV) relay networks are crucial for rapid coverage extension and resilient connectivity in adversarial communication environments. However, the transmission effectiveness is constrained by scarce energy resource and severe hostile jamming attacks. Motivated by this need, this paper investigates the semantic communication (SemCom) empowered UAV relay networks that integrates SemCom with simultaneous wireless information and power transfer (SWIPT). For the first time, the semantic encoding/ decoding is embedded into the two-hop communication while the power-splitting (PS) jointly coordinates information transmission and energy harvesting. With the imperfect channel state information (CSI), we formulate the worst-case sum SemCom rate maximization problem subject to the constraints of semantic decoding feasibility, energy harvesting and transmit power. To address the intractable problem, we develop a robust three-step monotonic-optimization (MO) framework with low-complexity feasibility checking algorithm (LFCA). Firstly, a robust generalized discretization approach is used to convert the imperfect CSI. Then, the MO framework with LFCA is presented to obtain optimal solution of transmit beamformer, receive decoder and PS ratio with dimension reduction method. Simulations results show that proposed MO-LFCA scheme outperforms conventional bit-level SWIPT scheme and the other benchmark schemes versus different jamming power levels and antenna configurations, demonstrating that the integration of SemCom and SWIPT mechanism can enhance anti-jamming and efficiency performance in UAV relay networks.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-14
A Combined K-Nearest Neighbors and Gaussian Process Algorithm for Radio Map Construction and Sensor Deployment
Radio maps are crucial for visualizing the distribution of electromagnetic signals, aiding in network planning and spectrum management. However, their long-term monitoring requires costly dedicated sensors. This paper proposes a novel joint optimization algorithm, KNNGP, which simultaneously constructs accurate radio maps and derives optimal sensor deployment schemes from crowdsourced data. Specifically, we model shadow fading as a Gaussian Process (GP) and leverage Variational Inference (VI) for efficient posterior approximation. A key innovation is the integration of K-Nearest Neighbors (KNN) to impose a sparse prior that captures local spatial correlations, significantly reducing computational complexity. Furthermore, unlike prior works that treat mapping and de ployment separately, KNNGP co-optimizes both tasks within a unified variational framework. Simulations show that KNNGP outperforms baseline methods in reconstruction accuracy and efficiency, providing a cost-effective solution for continuous spectrum monitoring in underserved areas like urban fringes or jungles.
- 18 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. PP (00189545) , 1-14
A Combined K-Nearest Neighbors and Gaussian Process Algorithm for Radio Map Construction and Sensor Deployment
Radio maps are crucial for visualizing the distribution of electromagnetic signals, aiding in network planning and spectrum management. However, their long-term monitoring requires costly dedicated sensors. This paper proposes a novel joint optimization algorithm, KNNGP, which simultaneously constructs accurate radio maps and derives optimal sensor deployment schemes from crowdsourced data. Specifically, we model shadow fading as a Gaussian Process (GP) and leverage Variational Inference (VI) for efficient posterior approximation. A key innovation is the integration of K-Nearest Neighbors (KNN) to impose a sparse prior that captures local spatial correlations, significantly reducing computational complexity. Furthermore, unlike prior works that treat mapping and de ployment separately, KNNGP co-optimizes both tasks within a unified variational framework. Simulations show that KNNGP outperforms baseline methods in reconstruction accuracy and efficiency, providing a cost-effective solution for continuous spectrum monitoring in underserved areas like urban fringes or jungles.
- 28 February 2021
- Published by Springer Nature
- p. 379-390
A New Method to Construct Non-binary QC-LDPC Codes Based on ACE Value
- 28 February 2021
- Published by Springer Nature
- p. 379-390
A New Method to Construct Non-binary QC-LDPC Codes Based on ACE Value
- 28 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 253-258
LLR Distribution Characteristics Based Hybrid Decoding Algorithm for LDPC Codes
To improve the decoding speed and reduce the complexity of low-density parity-check (LDPC) codes, this paper proposes a hybrid LDPC decoding algorithm that combined with the distribution characteristics of log-likelihood ratio (LLR) of all variable node information before each iteration. During the process of decoding, there is a judgment based on an interval value and a threshold value to select the Belief Propagation (BP) algorithm or the Minimal Sum (MS) algorithm to decode, so the proposed hybrid algorithm effectively combines the excellent performance of BP algorithm and the simple operation of MS algorithm. The simulation results show that the algorithm can greatly reduce the computational complexity and achieve similar decoding performance compared with the BP algorithm.
- 28 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 253-258
LLR Distribution Characteristics Based Hybrid Decoding Algorithm for LDPC Codes
To improve the decoding speed and reduce the complexity of low-density parity-check (LDPC) codes, this paper proposes a hybrid LDPC decoding algorithm that combined with the distribution characteristics of log-likelihood ratio (LLR) of all variable node information before each iteration. During the process of decoding, there is a judgment based on an interval value and a threshold value to select the Belief Propagation (BP) algorithm or the Minimal Sum (MS) algorithm to decode, so the proposed hybrid algorithm effectively combines the excellent performance of BP algorithm and the simple operation of MS algorithm. The simulation results show that the algorithm can greatly reduce the computational complexity and achieve similar decoding performance compared with the BP algorithm.
- Top Cited Papers
- 22 February 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 21 (6) , 1229-1232
CRC Code Design for List Decoding of Polar Codes
Cyclic redundancy check (CRC) assisted list successive cancellation decoding (SCLD) makes polar codes competitive with the state-of-art codes. In this letter, we try to find the optimal CRC for polar codes to further improve its performance. We first analyze the undetected error probability of CRC-aided SCLD as well as the characteristics of Hamming weight distribution of polar codes. Based on these characteristics, a multilevel SCLD-based searching strategy with moderate list size is proposed to compute the minimum Hamming weight distribution (MHWD) of different CRC-concatenated polar codes. Using the searched MHWD, the optimal CRC for polar codes are presented in this letter. Simulation results show that the performance of optimal CRC-aided SCLD significantly outperforms the standard one, especially at high code rate.
- 22 February 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 21 (6) , 1229-1232
Top Cited PapersCRC Code Design for List Decoding of Polar Codes
Cyclic redundancy check (CRC) assisted list successive cancellation decoding (SCLD) makes polar codes competitive with the state-of-art codes. In this letter, we try to find the optimal CRC for polar codes to further improve its performance. We first analyze the undetected error probability of CRC-aided SCLD as well as the characteristics of Hamming weight distribution of polar codes. Based on these characteristics, a multilevel SCLD-based searching strategy with moderate list size is proposed to compute the minimum Hamming weight distribution (MHWD) of different CRC-concatenated polar codes. Using the searched MHWD, the optimal CRC for polar codes are presented in this letter. Simulation results show that the performance of optimal CRC-aided SCLD significantly outperforms the standard one, especially at high code rate.