Qiuwei Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Qiuwei Xu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Desheng Wang
Huaiyin Institute of Technology, Huai’an, China
1 shared publication - Gang Hua
School of Information and Control Engineering, China University of Mining and Technology, Xuzhou, China
1 shared publication - Jihang Yin
School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing, China
1 shared publication - Xuan Yang
Wuxi University, Wuxi, China
1 shared publication - Yonggang Xu
School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China
1 shared publication
Latest Publications
- Open Access
- 27 October 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (21) , 4462
An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes
Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal. As a mainstream decoding algorithm for polar codes, the successive cancellation list (SCL) decoder usually improves the error correction performance by increasing the list size, but this method suffers from the problems of high decoding complexity. To address this problem, this paper proposes a layered-search bit-flipping (LS-SCLF) decoding algorithm based on SCL decoding. Firstly, a new flip-bit metric is proposed, which derives a formula to approximate the probability of an error occurring in an information bit. This formula introduces a perturbation parameter to improve the calculation accuracy. Secondly, a compromise scheme for determining the perturbation parameter is proposed. The scheme uses Monte Carlo simulation to determine an optimized parameter for the precise positioning of the first erroneous decoded bit under different decoding conditions. Finally, a layered search strategy is adopted to sequentially search the erroneous decoded bits from the low order to high order, which can correct up to multiple bits at the same time. Simulation results show that the proposed algorithm achieves improved error correction performance with a slight increase in decoding complexity compared to the generalized SCL-Flip (GSCLF) decoding algorithm. This algorithm also achieves a good balance between the error correction performance and decoding complexity.
- 27 October 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (21) , 4462
Open AccessAn Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes
Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal. As a mainstream decoding algorithm for polar codes, the successive cancellation list (SCL) decoder usually improves the error correction performance by increasing the list size, but this method suffers from the problems of high decoding complexity. To address this problem, this paper proposes a layered-search bit-flipping (LS-SCLF) decoding algorithm based on SCL decoding. Firstly, a new flip-bit metric is proposed, which derives a formula to approximate the probability of an error occurring in an information bit. This formula introduces a perturbation parameter to improve the calculation accuracy. Secondly, a compromise scheme for determining the perturbation parameter is proposed. The scheme uses Monte Carlo simulation to determine an optimized parameter for the precise positioning of the first erroneous decoded bit under different decoding conditions. Finally, a layered search strategy is adopted to sequentially search the erroneous decoded bits from the low order to high order, which can correct up to multiple bits at the same time. Simulation results show that the proposed algorithm achieves improved error correction performance with a slight increase in decoding complexity compared to the generalized SCL-Flip (GSCLF) decoding algorithm. This algorithm also achieves a good balance between the error correction performance and decoding complexity.