Low-complexity decoding algorithm capable of effectively improving performance at LDPC (low-density parity-check) code error floor
A technology of LDPC code and decoding algorithm, applied in coding, code conversion, coding components, etc., can solve the problems of poor performance, high decoding complexity, and limited use conditions of ML algorithm, so as to reduce the amount of calculation and improve the translation. The effect of reducing the coding performance and reducing the decoding complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0030] Embodiment: Taking a code word with a code length of 2304 and a code rate of 1 / 2 under the WiMAX standard as an example, the code word reaches the receiving end after passing through the AWGN channel. In order to ensure the effectiveness of the algorithm proposed in the present invention, the comparison algorithm we choose is the Min-Sum-Layered algorithm with better performance in the deformation of the BP algorithm. In order to allow the algorithm to fully iterate, the maximum number of iterations is selected to be 60 times, and the performance Compared with the performance of the post-processing decoding algorithm proposed by the present invention after the Min-Sum-Layered algorithm, considering the hardware implementation, all algorithms have been quantized, and the obtained FER and BER performance simulation curves are as follows: figure 1 . from figure 1 It can be seen that when the Min-Sum-Layered algorithm reaches the bit error platform, the performance curve ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


