Liqian Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Liqian Wang has a total of 62 co-authors. Here are the top co-authors by number of shared publications:
- Xue Chen
Beijing Univ Posts & Telecommun, State Key Lab Informat Photon & Opt Commun, Beijing 100876, Peoples R China
6 shared publications - Shanyong Cai
School of Electronic Engineering, Beijing University of Posts and Telecommunications (BUPT), Beijing 100876, China
5 shared publications - Tao Yang
Beijing University of Posts and Telecommunications
5 shared publications Xue Chen
State Key Lab of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, 100876, China
5 shared publications- Zhiguo Zhang
Beijing University of Posts and Telecommunications
5 shared publications - Sheping Shi
ZTE Corporation, Shenzhen 518057, China
3 shared publications
Latest Publications
- Open Access
- 28 February 2026
- Published by MDPI AG in Electronics
- Vol. 15 (5) , 1023
A-SNNMS: An Attentive Shared Neural Normalized Min-Sum Decoder for LDPC Codes
To address the limitations of static message aggregation and training instability in the existing Shared Neural Normalized Min-Sum (SNNMS) algorithm, this paper proposes A-SNNMS, an attentive deep LDPC decoding network with adaptive training. First, an attention mechanism is introduced into the variable node update phase to dynamically weight incoming messages based on their reliability, effectively suppressing noise interference. Second, a collaborative training scheme incorporating an exponential decay adaptive learning rate and L2 regularization is designed to mitigate convergence oscillation and overfitting in long-code training. Simulation results for IEEE 802.16e standard codes demonstrate that A-SNNMS achieves a net coding gain of approximately 0.4 dB over the baseline SNNMS at a Bit Error Rate (BER) of 10−3. Furthermore, it achieves comparable performance with only 50% of the iterations required by the baseline. In conclusion, the A-SNNMS decoder significantly improves both decoding efficiency and system robustness, offering a promising solution for high-reliability communications.
- 28 February 2026
- Published by MDPI AG in Electronics
- Vol. 15 (5) , 1023
Open AccessA-SNNMS: An Attentive Shared Neural Normalized Min-Sum Decoder for LDPC Codes
To address the limitations of static message aggregation and training instability in the existing Shared Neural Normalized Min-Sum (SNNMS) algorithm, this paper proposes A-SNNMS, an attentive deep LDPC decoding network with adaptive training. First, an attention mechanism is introduced into the variable node update phase to dynamically weight incoming messages based on their reliability, effectively suppressing noise interference. Second, a collaborative training scheme incorporating an exponential decay adaptive learning rate and L2 regularization is designed to mitigate convergence oscillation and overfitting in long-code training. Simulation results for IEEE 802.16e standard codes demonstrate that A-SNNMS achieves a net coding gain of approximately 0.4 dB over the baseline SNNMS at a Bit Error Rate (BER) of 10−3. Furthermore, it achieves comparable performance with only 50% of the iterations required by the baseline. In conclusion, the A-SNNMS decoder significantly improves both decoding efficiency and system robustness, offering a promising solution for high-reliability communications.
- Open Access
Reinforcement Learning-Based Cloud-Aware HAPS Trajectory Optimization in Soft-Switching Hybrid FSO/RF Cooperative Transmission System
Space–air–ground systems employing free-space optical (FSO) communication leverage high-altitude platform stations (HAPS) to deliver seamless and ubiquitous connectivity. Although FSO links offer high capacity, they are highly susceptible to cloud extinction, which severely degrades link availability. Hybrid FSO/radio-frequency (RF) transmission and cloud-aware HAPS trajectory optimization can enhance resilience. However, the conventional cloud-aware hybrid FSO/RF transmission system based on hard-switching (HS) between the FSO and RF links leads to frequent link transitions and unstable throughput. To address these challenges, we propose a joint optimization framework that integrates soft-switch between FSO and RF links with deep reinforcement learning (DRL) for HAPS trajectory optimization. Soft-switching based on rateless codes (RCs) enables simultaneous transmission over both links, where the receiver accumulates packets until successful decoding with a single feedback. The feedback frequency of RC is sparse, which avoids feedback storms but also poses challenges to HAPS trajectory optimization. The DRL agent proactively optimizes HAPS trajectories to avoid cloud cover and maintain link availability. To address the sparse feedback of RCs for DRL training, a reward-shaped proximal policy optimization (PPO)-based agent is developed to jointly optimize throughput and trajectory smoothness. Simulations using realistic ERA5 data show that RC-PPO achieves higher throughput and smoother trajectories compared to the HS-PPO baseline.
Open AccessReinforcement Learning-Based Cloud-Aware HAPS Trajectory Optimization in Soft-Switching Hybrid FSO/RF Cooperative Transmission System
Space–air–ground systems employing free-space optical (FSO) communication leverage high-altitude platform stations (HAPS) to deliver seamless and ubiquitous connectivity. Although FSO links offer high capacity, they are highly susceptible to cloud extinction, which severely degrades link availability. Hybrid FSO/radio-frequency (RF) transmission and cloud-aware HAPS trajectory optimization can enhance resilience. However, the conventional cloud-aware hybrid FSO/RF transmission system based on hard-switching (HS) between the FSO and RF links leads to frequent link transitions and unstable throughput. To address these challenges, we propose a joint optimization framework that integrates soft-switch between FSO and RF links with deep reinforcement learning (DRL) for HAPS trajectory optimization. Soft-switching based on rateless codes (RCs) enables simultaneous transmission over both links, where the receiver accumulates packets until successful decoding with a single feedback. The feedback frequency of RC is sparse, which avoids feedback storms but also poses challenges to HAPS trajectory optimization. The DRL agent proactively optimizes HAPS trajectories to avoid cloud cover and maintain link availability. To address the sparse feedback of RCs for DRL training, a reward-shaped proximal policy optimization (PPO)-based agent is developed to jointly optimize throughput and trajectory smoothness. Simulations using realistic ERA5 data show that RC-PPO achieves higher throughput and smoother trajectories compared to the HS-PPO baseline.
- Open Access
- 29 December 2025
- Published by MDPI AG in Applied Sciences
- Vol. 16 (1) , 358
An Improved Knowledge-Based Genetic Algorithm for High-Priority Task Scheduling in Relay Satellite Networks
This paper presents an improved knowledge-based genetic algorithm for relay satellite task scheduling. It aims to address the issue of ensuring high-priority tasks under complex constraints and resource competition. The algorithm enhances the high-priority task completion ratio by incorporating multiple knowledge sorting strategies and a dynamic crossover mechanism during population initialization. Simulation results show that the proposed algorithm improves the high-priority task completion ratio by an average of 11.78 percentage points compared to the second-best algorithm. In environments with high load, resource constraints, and capacity shrinkage, the proposed algorithm outperforms in scheduling efficiency, robustness, and adaptability. It demonstrates effectiveness in multi-task and multi-resource competitive environments. IKBGA provides a highly targeted and scalable optimization solution for relay satellite task scheduling, with strong application potential.
- 29 December 2025
- Published by MDPI AG in Applied Sciences
- Vol. 16 (1) , 358
Open AccessAn Improved Knowledge-Based Genetic Algorithm for High-Priority Task Scheduling in Relay Satellite Networks
This paper presents an improved knowledge-based genetic algorithm for relay satellite task scheduling. It aims to address the issue of ensuring high-priority tasks under complex constraints and resource competition. The algorithm enhances the high-priority task completion ratio by incorporating multiple knowledge sorting strategies and a dynamic crossover mechanism during population initialization. Simulation results show that the proposed algorithm improves the high-priority task completion ratio by an average of 11.78 percentage points compared to the second-best algorithm. In environments with high load, resource constraints, and capacity shrinkage, the proposed algorithm outperforms in scheduling efficiency, robustness, and adaptability. It demonstrates effectiveness in multi-task and multi-resource competitive environments. IKBGA provides a highly targeted and scalable optimization solution for relay satellite task scheduling, with strong application potential.
- Open Access
- 17 November 2025
- Published by Optica Publishing Group in Optica Open
Variable Sliding Window Algorithm Based on Scaling Factor
This study focuses on improving the traditional sliding window decoding algorithm. To address the issue of decoding error correction performance degradation caused by truncated parity-check information in the sliding window algorithm, the authors propose dynamic adjustments to the window size at different time instances based on the modified parity-check relationship introduced in their previous work. These adjustments aim to enhance the integrity of the information and parity-check relationships within the window. Additionally, a correction factor is employed to modify the information passed by the window to the marginal processor. These targeted modifications alter the window structure, achieving overall performance improvement at the cost of a slight increase in complexity. Simulation results demonstrate that, for both medium-short and long codewords, a performance gain of 0.2–0.25 dB can be achieved at a BER level of 1E-4.
- 17 November 2025
- Published by Optica Publishing Group in Optica Open
Open AccessVariable Sliding Window Algorithm Based on Scaling Factor
This study focuses on improving the traditional sliding window decoding algorithm. To address the issue of decoding error correction performance degradation caused by truncated parity-check information in the sliding window algorithm, the authors propose dynamic adjustments to the window size at different time instances based on the modified parity-check relationship introduced in their previous work. These adjustments aim to enhance the integrity of the information and parity-check relationships within the window. Additionally, a correction factor is employed to modify the information passed by the window to the marginal processor. These targeted modifications alter the window structure, achieving overall performance improvement at the cost of a slight increase in complexity. Simulation results demonstrate that, for both medium-short and long codewords, a performance gain of 0.2–0.25 dB can be achieved at a BER level of 1E-4.
- Open Access
- 17 November 2025
- Published by Optica Publishing Group in Optica Open
Variable Sliding Window Algorithm Based on Scaling Factor
This study focuses on improving the traditional sliding window decoding algorithm. To address the issue of decoding error correction performance degradation caused by truncated parity-check information in the sliding window algorithm, the authors propose dynamic adjustments to the window size at different time instances based on the modified parity-check relationship introduced in their previous work. These adjustments aim to enhance the integrity of the information and parity-check relationships within the window. Additionally, a correction factor is employed to modify the information passed by the window to the marginal processor. These targeted modifications alter the window structure, achieving overall performance improvement at the cost of a slight increase in complexity. Simulation results demonstrate that, for both medium-short and long codewords, a performance gain of 0.2–0.25 dB can be achieved at a BER level of 1E-4.
- 17 November 2025
- Published by Optica Publishing Group in Optica Open
Open AccessVariable Sliding Window Algorithm Based on Scaling Factor
This study focuses on improving the traditional sliding window decoding algorithm. To address the issue of decoding error correction performance degradation caused by truncated parity-check information in the sliding window algorithm, the authors propose dynamic adjustments to the window size at different time instances based on the modified parity-check relationship introduced in their previous work. These adjustments aim to enhance the integrity of the information and parity-check relationships within the window. Additionally, a correction factor is employed to modify the information passed by the window to the marginal processor. These targeted modifications alter the window structure, achieving overall performance improvement at the cost of a slight increase in complexity. Simulation results demonstrate that, for both medium-short and long codewords, a performance gain of 0.2–0.25 dB can be achieved at a BER level of 1E-4.
- Open Access
- 25 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Photonics Journal
- Vol. 17 (5) , 1-9
Integrated FEC, Interleaving, ARQ, and Adaptive Modulation for Long-Distance Maritime Communication Systems: Design and Analysis
Free-space optical communication (FSO) has been a popular research area due to its high bandwidth and ease of deployment. However, the performance of long-distance FSO system is often compromised by atmospheric turbulence. To address this challenge, this paper proposes a cross-layer design that integrates automatic repeat request (ARQ), forward error correction (FEC), interleaving, and adaptive modulation (AM). To evaluate the performance of this system, we conducted an 11 km long-distance beam propagation experiment to collect data on channel fading. Based on the experimental collected data and Markov chain theory, a finite queuing system model for ARQ is established, and the throughput, frame delay and energy efficiency of the designed communication system are derived. The numerical results indicate that the proposed system can effectively improve the stability of long-distance FSO communication.
- 25 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Photonics Journal
- Vol. 17 (5) , 1-9
Open AccessIntegrated FEC, Interleaving, ARQ, and Adaptive Modulation for Long-Distance Maritime Communication Systems: Design and Analysis
Free-space optical communication (FSO) has been a popular research area due to its high bandwidth and ease of deployment. However, the performance of long-distance FSO system is often compromised by atmospheric turbulence. To address this challenge, this paper proposes a cross-layer design that integrates automatic repeat request (ARQ), forward error correction (FEC), interleaving, and adaptive modulation (AM). To evaluate the performance of this system, we conducted an 11 km long-distance beam propagation experiment to collect data on channel fading. Based on the experimental collected data and Markov chain theory, a finite queuing system model for ARQ is established, and the throughput, frame delay and energy efficiency of the designed communication system are derived. The numerical results indicate that the proposed system can effectively improve the stability of long-distance FSO communication.
- Open Access
- 9 May 2025
- Published by Elsevier in Results in Optics
- Vol. 21
Turbulence-resistant high speed free-space optical communications using MUTC photodiodes
- 9 May 2025
- Published by Elsevier in Results in Optics
- Vol. 21
Open AccessTurbulence-resistant high speed free-space optical communications using MUTC photodiodes
- Open Access
Low Complexity Parallel Carrier Frequency Offset Estimation Based on Time-Tagged QPSK Partitioning for Coherent Free-Space Optical Communication
To effectively mitigate the effects of atmospheric turbulence in free space optical (FSO) communication, we propose a parallel carrier frequency offset estimation (FOE) scheme based on time-tagged QPSK partitioning (TTQP). This scheme can be applied to spatial diversity polarization multiplexing (PM) coherent FSO communication systems. Specifically, the TTQP scheme performs QPSK partitioning by time-tagging signal points, accurately recording the time intervals between signals, and significantly reducing implementation complexity through a modified Mth power algorithm. The simulation results for the PM 16-quadrature amplitude modulation (QAM) validate the effectiveness of the proposed scheme. Compared to traditional QPSK partitioning algorithms, the TTQP algorithm achieves high accuracy, low complexity, and multi-format versatility in high-speed coherent FSO communication.
Open AccessLow Complexity Parallel Carrier Frequency Offset Estimation Based on Time-Tagged QPSK Partitioning for Coherent Free-Space Optical Communication
To effectively mitigate the effects of atmospheric turbulence in free space optical (FSO) communication, we propose a parallel carrier frequency offset estimation (FOE) scheme based on time-tagged QPSK partitioning (TTQP). This scheme can be applied to spatial diversity polarization multiplexing (PM) coherent FSO communication systems. Specifically, the TTQP scheme performs QPSK partitioning by time-tagging signal points, accurately recording the time intervals between signals, and significantly reducing implementation complexity through a modified Mth power algorithm. The simulation results for the PM 16-quadrature amplitude modulation (QAM) validate the effectiveness of the proposed scheme. Compared to traditional QPSK partitioning algorithms, the TTQP algorithm achieves high accuracy, low complexity, and multi-format versatility in high-speed coherent FSO communication.
- Open Access
- 16 July 2024
- Published by Institution of Engineering and Technology (IET) in IET Optoelectronics
- Vol. 18 (4) , 121-129
Experimental analysis of reducing outage probability using deep interleaving for long‐distance free space optical systems
Free space optical communication (FSO) has become a popular research direction due to its high bandwidth, easy deployment, and inherent security. Its channel state is unstable because of atmospheric environment, especially in long‐distance ground transmission system. Interleaving combined with forward error correction coding (FEC) have been utilised to improve the stability of system. However, there is little detailed experimental results of deep interleaving combined with FEC under different atmospheric turbulence intensity over long‐distance FSO system. A deep interleaving with FEC method was designed and implemented on a 7 km long online experiment. The performance of different depth interleaving is analysed under weak and strong atmospheric turbulence state. The experiment results show that deep interleaving performs better under weak turbulence for the larger correlation factor of the channel and the outage probability of the system with deep interleaving can be greatly reduced.
- 16 July 2024
- Published by Institution of Engineering and Technology (IET) in IET Optoelectronics
- Vol. 18 (4) , 121-129
Open AccessExperimental analysis of reducing outage probability using deep interleaving for long‐distance free space optical systems
Free space optical communication (FSO) has become a popular research direction due to its high bandwidth, easy deployment, and inherent security. Its channel state is unstable because of atmospheric environment, especially in long‐distance ground transmission system. Interleaving combined with forward error correction coding (FEC) have been utilised to improve the stability of system. However, there is little detailed experimental results of deep interleaving combined with FEC under different atmospheric turbulence intensity over long‐distance FSO system. A deep interleaving with FEC method was designed and implemented on a 7 km long online experiment. The performance of different depth interleaving is analysed under weak and strong atmospheric turbulence state. The experiment results show that deep interleaving performs better under weak turbulence for the larger correlation factor of the channel and the outage probability of the system with deep interleaving can be greatly reduced.
- Open Access
- 25 June 2024
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 60 (12) , e13225
A new sliding window decoding algorithm based on check relationship improvement
This study focuses on improving the sliding window decoding algorithm by introducing a threshold based on the posterior probability at the end of each decoding window. This threshold serves to evaluate the reliability of the message within the window. For unreliable windows, specific corrective factors were introduced to enhance the overall performance of the algorithm. Furthermore, modifications were implemented to the range within which the check relationship is applicable, aiming to address the issue of incomplete check relationships encountered during the decoding process. These enhancements effectively improved the overall performance of the algorithm. The performance of the improved algorithm can be improved by 0.1 to 0.2 dB according to different code lengths.
- 25 June 2024
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 60 (12) , e13225
Open AccessA new sliding window decoding algorithm based on check relationship improvement
This study focuses on improving the sliding window decoding algorithm by introducing a threshold based on the posterior probability at the end of each decoding window. This threshold serves to evaluate the reliability of the message within the window. For unreliable windows, specific corrective factors were introduced to enhance the overall performance of the algorithm. Furthermore, modifications were implemented to the range within which the check relationship is applicable, aiming to address the issue of incomplete check relationships encountered during the decoding process. These enhancements effectively improved the overall performance of the algorithm. The performance of the improved algorithm can be improved by 0.1 to 0.2 dB according to different code lengths.