Bowen Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bowen Feng has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Qinyu Zhang
Harbin Institute of Technology (Shenzhen)
12 shared publications - Jian Jiao
Harbin Institute of Technology (Shenzhen)
7 shared publications - Ye Wang
Pengcheng Laboratory, Shenzhen, China
6 shared publications - Shaohua Wu
Harbin Institute of Technology (Shenzhen)
4 shared publications - Aolin Liu
Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology, Harbin Institute of Technology, Shenzhen, Guangdong, China
3 shared publications - Ke Zhang
Pengcheng Laboratory, Shenzhen, China
2 shared publications
Latest Publications
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 552-556
Design of Parity-Check Concatenated Polar Codes From EBCH Codes
Error detection is a critical function of channel coding in practical communication systems. Through a combination of theoretical analysis and experimental validation, it is concluded that the undetected error rate (UER) in the high signal-to-noise ratio (SNR) regime is predominantly determined by the code weight distribution. Existing polar code constructions based on extended BCH (EBCH) codes exhibit outstanding weight distribution properties. Building on this, a conversion strategy is proposed to transform dynamic frozen bits into parity-check (PC) bits, thereby incorporating error detection capability into the designed decoder. Simulation results demonstrate that the proposed schemes outperform cyclic redundancy check (CRC) concatenated polar codes in both block error rate (BLER) and UER under high-SNR conditions.
- 15 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 30 (10897798) , 552-556
Design of Parity-Check Concatenated Polar Codes From EBCH Codes
Error detection is a critical function of channel coding in practical communication systems. Through a combination of theoretical analysis and experimental validation, it is concluded that the undetected error rate (UER) in the high signal-to-noise ratio (SNR) regime is predominantly determined by the code weight distribution. Existing polar code constructions based on extended BCH (EBCH) codes exhibit outstanding weight distribution properties. Building on this, a conversion strategy is proposed to transform dynamic frozen bits into parity-check (PC) bits, thereby incorporating error detection capability into the designed decoder. Simulation results demonstrate that the proposed schemes outperform cyclic redundancy check (CRC) concatenated polar codes in both block error rate (BLER) and UER under high-SNR conditions.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 914-928
A Design Methodology for Optimizing Minimum Weight and Error Coefficient of PAC Codes
A design methodology is proposed to optimize the minimum weight and error coefficient of polarization-adjusted convolutional (PAC) codes, enhancing their maximum likelihood (ML) performance based on a theoretical analysis of code asymptotic behavior. Employing an adapted multilevel list search algorithm to identify minimum-weight codewords, the methodology comprises three deterministic optimization algorithms. First, an iterative rate-profiling optimization algorithm substantially reduces the number of minimum-weight codewords through efficient pairwise exchanges of information and frozen indices. Second, a tree search optimization algorithm progressively extends the convolutional impulse response, exploring superior solutions within a theoretically constrained search space. Third, a joint optimization algorithm synthesizes the two algorithms, alternately refining the rate-profiling and convolutional pre-transform. Complexity analysis underscores the computational efficiency of these algorithms for short PAC codes, while optimization results confirm the strong capability of the proposed methodology in improving the minimum weight and error coefficient. With moderate-to-large list decoding for code lengths of 64 to 256, the proposed PAC codes consistently outperform state-of-the-art polar code variants, attaining or approaching the random coding union (RCU) bound. Additionally, the proposed PAC codes demonstrate the capability to exceed the normal approximation (NA) bound at low-to-moderate code rates.
- 11 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 74 (00906778) , 914-928
A Design Methodology for Optimizing Minimum Weight and Error Coefficient of PAC Codes
A design methodology is proposed to optimize the minimum weight and error coefficient of polarization-adjusted convolutional (PAC) codes, enhancing their maximum likelihood (ML) performance based on a theoretical analysis of code asymptotic behavior. Employing an adapted multilevel list search algorithm to identify minimum-weight codewords, the methodology comprises three deterministic optimization algorithms. First, an iterative rate-profiling optimization algorithm substantially reduces the number of minimum-weight codewords through efficient pairwise exchanges of information and frozen indices. Second, a tree search optimization algorithm progressively extends the convolutional impulse response, exploring superior solutions within a theoretically constrained search space. Third, a joint optimization algorithm synthesizes the two algorithms, alternately refining the rate-profiling and convolutional pre-transform. Complexity analysis underscores the computational efficiency of these algorithms for short PAC codes, while optimization results confirm the strong capability of the proposed methodology in improving the minimum weight and error coefficient. With moderate-to-large list decoding for code lengths of 64 to 256, the proposed PAC codes consistently outperform state-of-the-art polar code variants, attaining or approaching the random coding union (RCU) bound. Additionally, the proposed PAC codes demonstrate the capability to exceed the normal approximation (NA) bound at low-to-moderate code rates.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (8) , 5481-5494
A Path Probability Perspective on Rate-Profiling Design for Polarization-Adjusted Convolutional (PAC) Codes Under List Decoding
A novel rate-profiling design is proposed for polarization-adjusted convolutional (PAC) codes under list decoding, adopting a path probability perspective. Inspired by the concepts of Hamming distance and Hamming weight, the concepts of path probability distance (PPD) and path probability weight (PPW) are innovatively introduced to measure the disparity between the erroneous paths and the correct path for PAC codes under probabilistic decoding. An in-depth analysis of the recursion of node log-likelihood ratios (LLRs) in the factor graph is conducted, elucidating the derivation of a lower bound on the PPW as a consequential outcome. Utilizing the concept of the PPW, a rate-profiling design algorithm is proposed to establish the reliability ranking for the bit-channels of PAC codes. Simulation results demonstrate that PAC codes employing the proposed rate-profiling exhibit advantages over alternative rate-profiling and other state-of-the-art polar coding schemes across various block lengths and code rates under short decoding list sizes.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (8) , 5481-5494
A Path Probability Perspective on Rate-Profiling Design for Polarization-Adjusted Convolutional (PAC) Codes Under List Decoding
A novel rate-profiling design is proposed for polarization-adjusted convolutional (PAC) codes under list decoding, adopting a path probability perspective. Inspired by the concepts of Hamming distance and Hamming weight, the concepts of path probability distance (PPD) and path probability weight (PPW) are innovatively introduced to measure the disparity between the erroneous paths and the correct path for PAC codes under probabilistic decoding. An in-depth analysis of the recursion of node log-likelihood ratios (LLRs) in the factor graph is conducted, elucidating the derivation of a lower bound on the PPW as a consequential outcome. Utilizing the concept of the PPW, a rate-profiling design algorithm is proposed to establish the reliability ranking for the bit-channels of PAC codes. Simulation results demonstrate that PAC codes employing the proposed rate-profiling exhibit advantages over alternative rate-profiling and other state-of-the-art polar coding schemes across various block lengths and code rates under short decoding list sizes.
- Open Access
- 19 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Antennas and Propagation
- Vol. 5 (6) , 1847-1853
Compact Dual-Band Dual-Sense Circularly Polarized Fragmental Patch Antenna Optimized by Improved Simulated-Annealing-Based Algorithm
This study presents a compact dual-band dual-sense circularly polarized (CP) fragmental patch antenna that advanced by an improved simulated-annealing-based optimization algorithm. This design replaces truncated corners of traditional truncated patch antennas with fragmental structures, generating dual-band dual-CP radiation with a small frequency ratio and a high front-to-back ratio. The proposed optimized framework tackles the multi-objective optimization problem through hierarchical optimization to achieve an optimal balance among various performance metrics. Furthermore, the simulated annealing is improved using a matrix-based dynamic step-size perturbation mechanism and a nested cyclic process, averting premature convergence and ensuring multifaceted objective enhancement. The measurement results reveal that the proposed antenna can operate with a small frequency ratio of 1.07, providing left-hand CP radiation from 4.99 to 5.02 GHz and right-hand CP radiation 5.34 to 5.41 GHz, respectively. This compact cost-efficient design demonstrates potential for diverse antenna applications.
- 19 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Antennas and Propagation
- Vol. 5 (6) , 1847-1853
Open AccessCompact Dual-Band Dual-Sense Circularly Polarized Fragmental Patch Antenna Optimized by Improved Simulated-Annealing-Based Algorithm
This study presents a compact dual-band dual-sense circularly polarized (CP) fragmental patch antenna that advanced by an improved simulated-annealing-based optimization algorithm. This design replaces truncated corners of traditional truncated patch antennas with fragmental structures, generating dual-band dual-CP radiation with a small frequency ratio and a high front-to-back ratio. The proposed optimized framework tackles the multi-objective optimization problem through hierarchical optimization to achieve an optimal balance among various performance metrics. Furthermore, the simulated annealing is improved using a matrix-based dynamic step-size perturbation mechanism and a nested cyclic process, averting premature convergence and ensuring multifaceted objective enhancement. The measurement results reveal that the proposed antenna can operate with a small frequency ratio of 1.07, providing left-hand CP radiation from 4.99 to 5.02 GHz and right-hand CP radiation 5.34 to 5.41 GHz, respectively. This compact cost-efficient design demonstrates potential for diverse antenna applications.
- 14 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (10) , 13053-13067
Demand-Driven Task Scheduling and Resource Allocation in Space-Air-Ground Integrated Network: A Deep Reinforcement Learning Approach
Space-air-ground integrated network (SAGIN) can support a wide variety of task scenarios as a next-generation network. In this dynamic network, tasks with different characteristics and demands are usually simultaneously generated, which requires an efficient task scheduling method to meet diverse task demands, reduce system cost, and improve resource utilization. In this paper, we propose a scalable task scheduling and resource allocation solution suitable for various task scenarios in SAGIN. Specifically, we construct a generic task scheduling framework that considers diverse task types and demands in SAGIN. With the objective of minimizing the total system cost, we propose a novel joint task scheduling and resource allocation algorithm based on deep reinforcement learning to obtain the optimal solution. Extensive simulations are conducted in a civil aviation scenario to evaluate the performance of the proposed algorithm. Numerical results demonstrate that our proposed algorithm can efficiently reduce system cost and task drop rate compared with three benchmark schemes, and the improvement of resource allocation to task scheduling is verified through analysis.
- 14 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (10) , 13053-13067
Demand-Driven Task Scheduling and Resource Allocation in Space-Air-Ground Integrated Network: A Deep Reinforcement Learning Approach
Space-air-ground integrated network (SAGIN) can support a wide variety of task scenarios as a next-generation network. In this dynamic network, tasks with different characteristics and demands are usually simultaneously generated, which requires an efficient task scheduling method to meet diverse task demands, reduce system cost, and improve resource utilization. In this paper, we propose a scalable task scheduling and resource allocation solution suitable for various task scenarios in SAGIN. Specifically, we construct a generic task scheduling framework that considers diverse task types and demands in SAGIN. With the objective of minimizing the total system cost, we propose a novel joint task scheduling and resource allocation algorithm based on deep reinforcement learning to obtain the optimal solution. Extensive simulations are conducted in a civil aviation scenario to evaluate the performance of the proposed algorithm. Numerical results demonstrate that our proposed algorithm can efficiently reduce system cost and task drop rate compared with three benchmark schemes, and the improvement of resource allocation to task scheduling is verified through analysis.
- 28 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (2) , 433-437
On Tail-Biting Polarization-Adjusted Convolutional (TB-PAC) Codes and Small-Sizes List Decoding
Polarization-adjusted convolutional (PAC) coding is a good concatenation of convolutional codes and polar codes. For short block-length codes ( N ≤ 128), PAC codes with a sequential decoding or a list decoding with large list-sizes ( L ≥ 128) can achieve better block-error-rate (BLER) performance than polar codes with CRC-aided list decoding. However, the PAC codes have no BLER performance advantage when the list decoding is with small list-sizes ( L ≤ 8). In this letter, tail-biting PAC (TB-PAC) coding is proposed, in which tail-biting convolutional pre-transformation is applied. A multi-round list decoding with small list-sizes is provided for TB-PAC codes, in which an early-stopping method is designed to control the number of rounds. In each round, the tail-biting bits are assigned various initial path-values and also used as a check at the end, which helps the correct path be distinguishable. The proposed small-sizes list decoding can help the TB-PAC codes achieve much better BLER performance than the polar/PAC codes.
- 28 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 27 (2) , 433-437
On Tail-Biting Polarization-Adjusted Convolutional (TB-PAC) Codes and Small-Sizes List Decoding
Polarization-adjusted convolutional (PAC) coding is a good concatenation of convolutional codes and polar codes. For short block-length codes ( N ≤ 128), PAC codes with a sequential decoding or a list decoding with large list-sizes ( L ≥ 128) can achieve better block-error-rate (BLER) performance than polar codes with CRC-aided list decoding. However, the PAC codes have no BLER performance advantage when the list decoding is with small list-sizes ( L ≤ 8). In this letter, tail-biting PAC (TB-PAC) coding is proposed, in which tail-biting convolutional pre-transformation is applied. A multi-round list decoding with small list-sizes is provided for TB-PAC codes, in which an early-stopping method is designed to control the number of rounds. In each round, the tail-biting bits are assigned various initial path-values and also used as a check at the end, which helps the correct path be distinguishable. The proposed small-sizes list decoding can help the TB-PAC codes achieve much better BLER performance than the polar/PAC codes.
- 23 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 9 (3) , 1802-1812
Network Selection Based on Evolutionary Game and Deep Reinforcement Learning in Space-Air-Ground Integrated Network
In next generation communication system, space-air-ground integrated network (SAGIN) would be utilized to provide ubiquitous and unlimited wireless connectivity with large coverage, high throughput, and strong resilience. In this integrated network, there are multiple heterogeneous network options to satisfy service requirements, where an efficient network selection strategy is required to improve resource utilization and achieve load balance. In this paper, we propose a system model of network selection in SAGIN and formulate a corresponding evolutionary game. A network selection algorithm based on evolutionary game is proposed to study the autonomous decision-making process of network selection as a supplement. We also propose a deep deterministic policy gradient (DDPG)-based network selection algorithm to handle continuous and high-dimensional action spaces. A particular case is studied for further simulation and analysis. The evolutionary game obtains the selection strategy with the highest payoff at the evolutionary equilibrium point, and the stability of evolutionary equilibrium is proved by varying relative factors. The DDPG-based network selection algorithm obtains the same strategy with the highest reward at convergence at a slower speed. In comprehensive comparison, our proposed algorithms perform better than the repeated stochastic game approach and proximal policy optimization (PPO) algorithm.
- 23 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 9 (3) , 1802-1812
Network Selection Based on Evolutionary Game and Deep Reinforcement Learning in Space-Air-Ground Integrated Network
In next generation communication system, space-air-ground integrated network (SAGIN) would be utilized to provide ubiquitous and unlimited wireless connectivity with large coverage, high throughput, and strong resilience. In this integrated network, there are multiple heterogeneous network options to satisfy service requirements, where an efficient network selection strategy is required to improve resource utilization and achieve load balance. In this paper, we propose a system model of network selection in SAGIN and formulate a corresponding evolutionary game. A network selection algorithm based on evolutionary game is proposed to study the autonomous decision-making process of network selection as a supplement. We also propose a deep deterministic policy gradient (DDPG)-based network selection algorithm to handle continuous and high-dimensional action spaces. A particular case is studied for further simulation and analysis. The evolutionary game obtains the selection strategy with the highest payoff at the evolutionary equilibrium point, and the stability of evolutionary equilibrium is proved by varying relative factors. The DDPG-based network selection algorithm obtains the same strategy with the highest reward at convergence at a slower speed. In comprehensive comparison, our proposed algorithms perform better than the repeated stochastic game approach and proximal policy optimization (PPO) algorithm.
- 4 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 5559-5572
Iterative and Adjustable Soft List Decoding for Polar Codes
List decoding of polar codes is an outstanding decoding method, in which a fixed-size list is applied to retain the most probable paths. In general, it is preferable to use a large-size list in the decoding to achieve excellent error-control performance, but this can lead to high complexity. Moreover, the list decoding is still a one-time-pass algorithm with hard-decision outputs, which is not well suited for advanced concatenated coding systems. In this paper, a novel adjustable list decoding is proposed, in which the list size can be adjusted appropriately. Based on the reliability analyses of the decoding list, dynamic thresholds are designed to precisely guide the adjustments. The adjustable list decoding can also achieve excellent error-control performance, but the complexity is significantly reduced. Moreover, we propose an iterative adjustable list decoding scheme with soft-decision outputs for concatenated polar-coding systems, in which a log-likelihood-ratio update strategy is elaborately designed. It can achieve much better error-control performance compared with the existing iterative decoding schemes, such as the belief propagation (BP) decoding and soft cancellation (SCAN) decoding. As the number of iterations increases, the decoding performance gradually improves, but the complexity increases little due to efficient complexity control designs.
- 4 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 68 (1053587X) , 5559-5572
Iterative and Adjustable Soft List Decoding for Polar Codes
List decoding of polar codes is an outstanding decoding method, in which a fixed-size list is applied to retain the most probable paths. In general, it is preferable to use a large-size list in the decoding to achieve excellent error-control performance, but this can lead to high complexity. Moreover, the list decoding is still a one-time-pass algorithm with hard-decision outputs, which is not well suited for advanced concatenated coding systems. In this paper, a novel adjustable list decoding is proposed, in which the list size can be adjusted appropriately. Based on the reliability analyses of the decoding list, dynamic thresholds are designed to precisely guide the adjustments. The adjustable list decoding can also achieve excellent error-control performance, but the complexity is significantly reduced. Moreover, we propose an iterative adjustable list decoding scheme with soft-decision outputs for concatenated polar-coding systems, in which a log-likelihood-ratio update strategy is elaborately designed. It can achieve much better error-control performance compared with the existing iterative decoding schemes, such as the belief propagation (BP) decoding and soft cancellation (SCAN) decoding. As the number of iterations increases, the decoding performance gradually improves, but the complexity increases little due to efficient complexity control designs.
- 30 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 7 (1) , 210-221
Joint Channel Estimation and Decoding for Polar Coded SCMA System Over Fading Channels
Sparse code multiple access (SCMA) and polar codes are key techniques for 5G systems. Towards to the realization of massive machine type communications (mMTC) in Internet of Things (IoT), we propose a joint channel estimation and decoding (JCD) scheme to enhance the performance of polar coded SCMA system. There are three parts in our JCD scheme. First, a sparse Bayesian learning (SBL) algorithm is proposed to measure the initial channel state information (CSI) for the JCD scheme. Then, the JCD receiver performs an iterative channel estimation and detection and decoding (ICED) scheme between the SCMA detector and the polar decoder, where the log-likelihood ratio (LLR) from SCMA detector and polar decoder can iteratively update, and the channel gain is also adjusted by the frozen bit error rate (FBER) from the polar decoder in each ICED iteration. In addition, we propose a soft successive cancellation list (soft-SCL) decoding algorithm by calculating the path metric from an LLR based logarithm method, then the soft-SCL decoder outputs the LLR information and the SCMA detector can update the symbol probability in this ICED scheme. Simulation results demonstrate the superior performance of our JCD scheme over fading channels.
- 30 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cognitive Communications and Networking
- Vol. 7 (1) , 210-221
Joint Channel Estimation and Decoding for Polar Coded SCMA System Over Fading Channels
Sparse code multiple access (SCMA) and polar codes are key techniques for 5G systems. Towards to the realization of massive machine type communications (mMTC) in Internet of Things (IoT), we propose a joint channel estimation and decoding (JCD) scheme to enhance the performance of polar coded SCMA system. There are three parts in our JCD scheme. First, a sparse Bayesian learning (SBL) algorithm is proposed to measure the initial channel state information (CSI) for the JCD scheme. Then, the JCD receiver performs an iterative channel estimation and detection and decoding (ICED) scheme between the SCMA detector and the polar decoder, where the log-likelihood ratio (LLR) from SCMA detector and polar decoder can iteratively update, and the channel gain is also adjusted by the frozen bit error rate (FBER) from the polar decoder in each ICED iteration. In addition, we propose a soft successive cancellation list (soft-SCL) decoding algorithm by calculating the path metric from an LLR based logarithm method, then the soft-SCL decoder outputs the LLR information and the SCMA detector can update the symbol probability in this ICED scheme. Simulation results demonstrate the superior performance of our JCD scheme over fading channels.