In this paper, a low-complexity decoder based on a neural network is proposed to decode binary quadratic residue (QR) codes. The proposed decoder is based on the neural min-sum algorithm and the modified random redundant decoder (mRRD) algorithm. This new method has the same asymptotic time complexity as the min-sum algorithm, which is much lower than the difference on syndromes (DS) algorithm. Simulation results show that the proposed algorithm achieves a gain of more than 0.4 dB when compared to the DS algorithm. Furthermore, a simplified approach based on trapping sets is applied to reduce the complexity of the mRRD. This simplification leads to a slight loss in error performance and a reduction in implementation complexity.
In this paper, a low-complexity decoder based on a neural network is proposed to decode binary quadratic residue (QR) codes. The proposed decoder is based on the neural min-sum algorithm and the modified random redundant decoder (mRRD) algorithm. This new method has the same asymptotic time complexity as the min-sum algorithm, which is much lower than the difference on syndromes (DS) algorithm. Simulation results show that the proposed algorithm achieves a gain of more than 0.4 dB when compared to the DS algorithm. Furthermore, a simplified approach based on trapping sets is applied to reduce the complexity of the mRRD. This simplification leads to a slight loss in error performance and a reduction in implementation complexity.
In this paper, Three decoding methods of the (89, 45, 17) binary quadratic residue (QR) code to be presented are hard, soft and linear programming decoding algorithms. Firstly, a new hybrid algebraic decoding algorithm for the (89, 45, 17) QR code is proposed. It uses the Laplace formula to obtain the primary unknown syndromes, as done in Lin et al.'s algorithm when the number of errors v is less than or equal to 5, whereas Gaussian elimination is adopted to compute the unknown syndromes when v ≥ 6. Secondly, an appropriate modification to the algorithm developed by Chase is also given in this paper. Therefore, combining the proposed algebraic decoding algorithm with the modified Chase-II algorithm, called a new soft-decision decoding algorithm, becomes a complete soft decoding of QR codes. Thirdly, in order to further improve the error-correcting performance of the code, linear programming (LP) is utilized to decode the (89, 45, 17) QR code. Simulation results show that the proposed algebraic decoding algorithm reduces the decoding time when compared with Lin et al.'s hard decoding algorithm, and thus significantly reduces the decoding complexity of soft decoding while maintaining the same bit error rate (BER) performance. Moreover, the LP-based decoding improves the error-rate performance almost without increasing the decoding complexity, when compared with the new soft-decision decoding algorithm. It provides a coding gain of 0.2 dB at BER = 2 × 10-6.
For recent years, deep learning has been studied and utilized among decoders in wireless and optical communication. For low density parity check (LDPC) codes, most works use neural network (NN) to implement the belief propagation (BP) decoder and unfold its iterations into layers activated by different functions. However, the whole decoder composed by neural network performs lots of non-linear operations, which are time consuming and unfriendly to hardware implementation. In this work, a neural network-aided normalized min-sum (NN-aided NMS) decoder for LDPC code is proposed, in which the normalization factors are inferred from input log likelihood ratio (LLR) by apre-trained NN, while maintaining check and variable nodes processing the same as in min-sum (MS) decoder. In order to test the proposed decoder with irregular LDPC code, a rate-7/8 one was constructed using progressive edge growth (PEG) algorithm, showing better error correction capability than the standard of consultative committee for space data systems (CCSDS) LDPC (8176,7154) code by 0.08 dB with the same rate. Simulation results show that, NN-aided NMS decoder outperforms MS decoder by 0.3 dB, and its performance approaches BP decoder with a gap of 0.02 dB, which is 50% closer than the best NMS decoder using 0.7 as the normalization factor. The proposed decoder has good performance for both regular and irregular LDPC codes, and needs much less computation complexity than BP decoder. It introduces more linear computation than NMS decoder but achieves better bit error rate (BER) performance, thus becoming a good complement between BP and NMS decoder when trading off among complexity, error correction performance and hardware implementation for wireless and satellite communication.
In this letter, a neural self-corrected min-sum (NSCMS) decoder is proposed for 5G new radio (NR) low-density parity-check (LDPC) codes. Training in real-time on a rapidly changing channel requires low latency and minimal resource utilization. Unfortunately, typical neural decoders for LDPC codes use large and deep neural networks proportional to the code length, leading to latency and resource problems. In the network of NSCMS similar to network model pruning, certain nodes meeting the self correction condition are deleted and excluded from learning. This reduces the computational complexity of learning, compared to conventional networks. Thus, the NSCMS decoder has high practicality in real-time training using machine learning. Furthermore, self-correction allows for more reliable message-based learning and significantly improves performance. Simulation results demonstrate that NSCMS decoders exhibit lower error rates than previously proposed min-sum decoders.
A novel Neural Offset Min-Sum(NOMS) Belief Propagation(BP) decoding algorithm based on model-driven is proposed which applied to LDPC decoding. NOMS is improved multiplication in Neural Normalized Min-Sum(NNMS) into addition operation to reduce the complexity of calculation., a better Bit Error Rate (BER) performance is simultaneously achieved in the same condition. Secondly, considering that there are still many multiplication operations in NOMS, we propose a novel Shared Offset Min-Sum(SNOMS) to reduce the number of weights in the network by sharing parameters. Finally, codebook-based quantization is used to further reduce the memory consumption. Simulation experimental results show that the proposed method has a better BER performance, and the decoding accuracy of the decoder is 0.65dB higher than that of the NNMS after 5 iterations. In addition, SNOMS decoding method achieves almost the same decoding performance comparable to that of NOMS, but requires less complex calculation. Proposed quantization of code-book method reduces memory requirement significantly with slight performance loss.
Error-correcting codes are very important in modern communication systems. In this paper, we investigate efficient reduced-complexity deep neural network (DNN)-aided channel decoders. Specifically, we leverage DNN training to obtain individual scaling parameters for normalized min-sum algorithms, thereby leading to much faster convergence for the same target bit error rate (BER). Also, we propose to compress the DNN-aided channel decoders via weight sharing. A case study on DNN-aided BCH decoders is investigated. Simulation results and hardware complexity analysis show that our method can reduce 2.59 times of memory cost than non-compressed DNN-aided BCH decoders. Meanwhile, compared to the conventional BCH decoders, our method can improve convergence rate by 6 times with similar decoding performance.
In this paper, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to estimate the soft decoding performance, which avoids extensive simulations. Also, a simulation-based algorithm is proposed to obtain the maximum likelihood decoding performance of QR codes of lengths within 100. Moreover, four important theorems are proposed to predict the performance of the hard decoding and the maximum-likelihood decoding in which they can explore some internal properties of QR codes. It is shown that such four theorems can be applied to the QR codes with lengths less than 100 for predicting the decoding performance. In contrast, they can be straightforwardly generalized to longer QR codes. The result is never seen in the literature, to our knowledge. Simulation results show that the estimated hard decoding performance is very accurate in the whole signal-to-noise ratio (SNR) regimes, whereas the derived upper bounds of the maximum likelihood decoding are only tight for moderate to high SNR regions. For each of the considered QR codes, the soft decoding is approximately 1.5 dB better than the hard decoding. By using powerful redundant parity-check cuts, the linear programming-based decoding algorithm, i.e., the ACG-ALP decoding algorithm performs very well for any QR code. Sometimes, it is even superior to the Chase-based soft decoding algorithm significantly, and hence is only a few tenths of dB away from the maximum likelihood decoding.