HZHongfei Zhu

Hongfei Zhu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hongfei Zhu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Quantized decoders that maximize mutual information for polar codes

    by Zhu Hongfei, Cao Zhiwei, Zhao Yuping, Li Dou

    In this paper, we innovatively associate the mutual information with the frame error rate (FER) performance and propose novel quantized decoders for polar codes. Based on the optimal quantizer of binary-input discrete memoryless channels (B-DMCs), the proposed decoders quantize the virtual subchannels of polar codes to maximize mutual information (MMI) between source bits and quantized symbols. The nested structure of polar codes ensures that the MMI quantization can be implemented stage by stage. Simulation results show that the proposed MMI decoders with 4 quantization bits outperform the existing nonuniform quantized decoders that minimize mean-squared error (MMSE) with 4 quantization bits, and yield even better performance than uniform MMI quantized decoders with 5 quantization bits. Furthermore, the proposed 5-bit quantized MMI decoders approach the floating-point decoders with negligible performance loss.


  • Open Access

    Fast list decoders for polarization‐adjusted convolutional (PAC) codes

    by Hongfei Zhu, Zhiwei Cao, Yuping Zhao, Dou Li, Yanjun Yang

    A latest coding scheme named polarization‐adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding. However, to achieve the near‐bound performance, the list size of list decoding needs to be excessively large, which leads to insufferable time complexity. In this paper, to improve the speed of list decoding, fast list decoders for PAC codes are proposed. Four types of constituent nodes are defined and fast list decoding algorithms are provided for each of them. Simulation results present that fast list decoding with three types of constituent nodes can yield exactly the same error‐correction performance as list decoding, and reduce more than 50% time steps for the code (128,64). Moreover, fast list decoding with four types of constituent nodes can further reduce decoding complexity with negligible performance degradation.


  • Open Access

    Rate‐compatible systematic polar codes

    by Hongfei Zhu, Pengxin Guan, Zhiwei Cao, Yuping Zhao

    Puncturing and shortening are two common ways to achieve rate‐compatible non‐systematic polar codes (NSPCs). Systematic polar codes (SPCs) have been shown to outperform NSPCs with the same encoding and decoding complexity. However, rate‐compatible SPCs have never been comprehensively studied in previous work. In this paper, two rate‐compatible algorithms for SPCs are first proposed: uniform puncturing (UP) algorithm and uniform shortening (US) algorithm, which are referred to as SPC‐UP and SPC‐US, respectively. In order to effectively estimate the maximum likelihood decoding performance of punctured and shortened polar codes, subsequently, a distance spectrum calculation algorithm based on successive cancellation list (SCL) decoder for rate‐compatible polar codes is proposed. Simulation results show that rate‐compatible SPCs yield better bit error rate performance than rate‐compatible NSPCs while they have the same frame error rate performance under different code rates and decoding algorithms. Eventually, union bounds that are obtained by the distance spectrum to provide the theoretical explanation for the superiority of rate‐compatible SPCs are utilised.


  • Open Access

    Fast List Decoders for Polarization-Adjusted Convolutional (PAC) Codes

    by Hongfei Zhu, Zhiwei Cao, Yuping Zhao, Dou Li, Yanjun Yang

    A latest coding scheme named polarization-adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding. However, to achieve the near-bound performance, the list size of list decoding needs to be excessively large, which leads to insufferable latency. In this paper, to improve the speed of list decoding, fast list decoders for PAC codes are proposed. We define four types of constituent nodes and provide fast list decoding algorithms for each of them. Simulation results present that fast list decoding with three types of constituent nodes can yield exactly the same error-correction performance as list decoding, and reduce more than 50% time steps for the code (128,64). Moreover, fast list decoding with four types of constituent nodes can further reduce decoding latency with negligible performance degradation.

  • Nonuniform Quantized Decoder for Polar Codes With Minimum Distortion Quantizer

    by Zhiwei Cao, Hongfei Zhu, Yuping Zhao, Dou Li

    We propose a nonuniform quantized decoder for polar codes. The design metric of the quantizers is to minimize the distortion incurred by quantization. The quantizers are obtained via dynamic programming and the optimality of the quantizer is proved as well. Simulation results show that the error correction performance degradation of the proposed nonuniform quantized decoder is less than 0.1 dB compared to conventional float-point decoders under 5-bit nonuniform quantization, outperforming previous uniform quantized decoders for polar codes significantly.


  • Open Access

    Nonuniform Quantized Decoder for Polar Codes with Minimum Distortion Quantizer

    by Zhiwei Cao, Hongfei Zhu, Yuping Zhao, Dou Li

    We propose a nonuniform quantized decoder for polar codes. The design metric of the quantizers is to minimize the distortion incurred by quantization. The quantizers are obtained via dynamic programming and the optimality of the quantizer is proved as well. Simulation results show that the error correction performance degradation of the proposed nonuniform quantized decoder is less than 0.1 dB compared to conventional float-point decoders under 5-bit nonuniform quantization, outperforming previous uniform quantized decoders for polar codes significantly.

  • Open Access

    A Mapping Shortening Algorithm for Polar Codes

    by Hongfei Zhu, Yuping Zhao

    Shortening is a common way to achieve rate-compatible polar codes. The existing shortening algorithms select shortened bits merely according to the structure of the generator matrix in order to make them known by the receiver. In this paper, we take into account the effect that the shortening has on the capacity of split channels and propose a shortening capacity mapping criterion. Based on the proposed mapping criterion, a mapping shortening (MS) algorithm is proposed. We theoretically prove that the MS algorithm can ensure that the proposed mapping criterion can be adopted reasonably and the shortened bits can be known by the receiver. In addition, the MS algorithm is proved to have the same order of complexity as existing shortening algorithms. What's more, we demonstrate the superiority of the MS algorithm over existing shortened algorithms from the perspective of channel capacity. Finally, the simulation results show that the MS algorithm has a significant advantage over existing shortening algorithms for the bit error rate (BER) and frame error rate (FER) performance under high code rates.