This paper presents a product coding scheme based on binary images of Reed-Solomon (RS) codes and single-parity-check (SPC) codes for high-speed communications. Utilizing the special selection of components, we propose hybrid soft-and hard-decision iterative decoding (ID) algorithms for these codes, during which many RS component decoders can be early terminated. The proposed hybrid ID only exchanges ternary messages between component decoders and early stops the RS component decoders satisfying a proposed stopping criterion, thus low hardware and computational complexities are guaranteed. The hybrid ID of RS-SPC product codes not only performs comparable to the soft-decision decoding of low-density parity-check (LDPC) codes and block turbo codes (BTCs), but also takes much lower computational complexity and smaller decoder data flow. We also propose semi-analytical methods to estimate the waterfall and error-floor performances of the proposed scheme, which yield relatively accurate estimated results. The simulation results and error-floor estimations indicate that some good RS-SPC product codes have very low error floors that satisfy the requirements of optical systems.
20 June 2022 in IEEE Transactions on Communications
In this paper, we propose a modified adaptive belief propagation (ABP) algorithm, which is referred to as the random ABP (R-ABP) algorithm, for decoding short channel codes adopted in the fifth generation (5G) New Radio (NR) wireless systems. Based on the cyclic redundancy check (CRC) concatenation structure of 5G channel codes, we can take partial or even all CRC bits into iterative R-ABP decoding to improve the error correction performance, while the error detection capability can still be guaranteed by the remaining CRC bits and a proposed threshold-based acceptance criterion. We call this improved R-ABP decoding the threshold-and-CRC-aided R-ABP (TCA-R-ABP) decoding. The simulation results show that our proposed TCA-R-ABP algorithm outperforms the state-of-the-art decoding algorithms for many 5G low-density parity-check (LDPC) and polar codes. Moreover, the proposed TCA-R-ABP algorithm leads to a unified decoder for LDPC and polar codes, which has the potential to be a lower-complexity decoder over the combination of the belief propagation (BP) and CRC-aided successive cancellation list (CA-SCL) decoders.
In this letter, we focus on the finite-length batched sparse (BATS) codes with low-density parity-check (LDPC) precoding and the design method of degree distributions, which can significantly improve the error-correcting performance of belief propagation (BP) decoding. In this coding scheme, the received batches and parity-check equations of LDPC precoding are decoded by a joint BP decoder. We propose a design approach for the degree distributions of precoded BATS codes, which is based on the finite-length analysis of BATS codes and the threshold computation of LDPC codes. Although the proposed coding scheme is theoretically suboptimal for a joint BP decoder, simulation results verified that a significantly large gain can be achieved by our design method.
This letter presents a low-complexity error floors estimation method for bit-interleaved coded modulation with quasi-cyclic low-density parity-check (LDPC) codes. Using surrogate bit-channels (SBCs) as hypothetic equivalent channels, the importance sampling method based on the stable trapping sets is applied to evaluate the error floors. It is shown that the error floors of bit-interleaved coded modulation systems can be effectively estimated, and the presented method is appropriate for various types of modulators and interleavers.
Although long polar codes with successive cancellation decoding can asymptotically achieve channel capacity, the performance of short blocklength polar codes is far from optimal. Recently, Arıkan proposed employing a convolutional pre-transformation before the polarization network, called polarization-adjusted convolutional (PAC) codes. In this paper, we focus on improving the performance of short PAC codes concatenated with a cyclic redundancy check (CRC) outer code, CRC-PAC codes, since error detection capability is essential in practical applications, such as the polar coding scheme for the control channel. We propose an enhanced adaptive belief propagation (ABP) decoding algorithm with the assistance of CRC bits for PAC codes. We also derive joint parity-check matrices of CRC-PAC codes suitable for iterative BP decoding. The proposed CRC-aided ABP (CA-ABP) decoding can effectively improve error performance when partial CRC bits are used in the decoding. Meanwhile, the error detection ability can still be guaranteed by the remaining CRC bits and adaptive decoding parameters. Moreover, compared with the conventional CRC-aided list (CA-List) decoding, our proposed scheme can significantly reduce computational complexity, to achieve a better trade-off between the performance and complexity for short PAC codes.
13 December 2023 in IEEE Transactions on Communications
In this paper, we study a class of staircase codes (SCCs), which is constructed by algebraic and single-parity-check component codes. These codes are referred to as mixed-component SCCs (MC-SCCs). We propose a low-complexity ternary message passing decoding algorithm for MC-SCCs, where error-and-erasure decoding plays a core role and soft reliability is reconstructed by hard decisions and channel log-likelihood ratios. We develop the density evolution analysis that is applicable to both binary and non-binary algebraic codes to optimize the decoder. By properly selecting mixed components, we can construct low-error-floor MC-SCCs with a smaller size of decoding window (proportional to component lengths) and a faster speed of convergence compared with the conventional SCCs. Moreover, we verify that for various requirements of overhead and decoding window size, MC-SCCs can outperform the conventional SCCs with both BCH components in terms of both error-rate performance and decoding complexity.