The decoding algorithm of 1.LDPC code is a parallel iterative decoding algorithm based on sparse matrix. Its computational complexity is lower than that of Turbo code decoding algorithm, and it is easy to be implemented in hardware because of its parallel structure. Therefore, LDPC codes have more advantages in large-capacity communication applications.
2. The code rate of 2.LDPC codes can be arbitrarily constructed, which has great flexibility. Turbo codes can only achieve high bit rate by puncturing, so the selection of puncturing mode needs very careful consideration, otherwise it will cause great loss in performance.
Trubo code encoder structure 3. LDPC codes have a lower error rate platform, and can be used in wired communication, deep space communication, disk storage industry and other occasions that require more strict error rate. However, the error level of Turbo codes is in the order of 10. When used in similar situations, it usually needs to be cascaded with external codes to meet the requirements.
4.LDPC code was invented in 1960s. Now there are no secrets in theory and concept, so intellectual property rights and patents are not troublesome. This provides good development opportunities for countries and companies that entered the communication field later.
The disadvantages of LDPC codes are:
1. The demand for hardware resources is relatively large. A completely parallel decoding structure requires a large number of computing units and storage units.
2. The coding is complicated, so it is necessary to study a better coding algorithm. At the same time, because it takes a long code length to fully reflect the performance advantages, the coding delay is also relatively large.
3. It appeared relatively late and the industrial support was not enough.