Abstract
Abstract
The Low Density Parity Check (LDPC) codes use an iterative decoding algorithm. The advantages of this algorithm are: the algorithm is completely parallel, so the decoding speed is extremely high; the complexity of the decoding algorithm is low, and the amount of calculation will not increase sharply due to the increase of the code length. It is incomparable with convolutional code and other group codes. A good compromise can be obtained in complexity and performance. Even for the same decoding algorithm, different iteration times can be selected according to channel conditions and system requirements, which is very flexible. In this paper, we review the construction and decoding of LDPC, analyze their advantages and provide their direction of future works.