High-speed coding method of LDPC and shortened codes thereof
A decoding and high-speed technology, applied in the field of encoding and decoding, can solve the problems of high hardware implementation platform cost, low computing speed, unfavorable large-scale application, etc., achieve optimal decoding effect, increase operating frequency, and save chip resource occupation.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0025] The present invention will be further described below in conjunction with the accompanying drawings.
[0026] The decoding algorithms of LDPC codes are:
[0027] 1. SPA (Sum-Product Algorithm), Probability-domain;
[0028] 2. SPA, Log-domain;
[0029] 3. Min-sum (simplified algorithm of Log-domain SPA), and its various revised versions;
[0030] 4. BF (Bit-Flipping);
[0031] 5. MLG (Majority-Logic), can only be applied to cyclic LDPC codes.
[0032] For the algorithms listed above, the complexity and bit error performance decrease in order. Among them, the Probability-domainSPA calculation is too complicated, and the BF algorithm and the MLG algorithm cannot provide good bit error performance, and are not suitable for use in practice. Among the several algorithms that can be used, the error performance of the modified Min-sum algorithm can be close to that of SPA, and the complexity is relatively low. Therefore, after comprehensive consideration, the modified Min-...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 