Low-density parity-check codes, which is concerned by more and more researchers who devote their mind to coding,has become one of the best coding technology because of its low complexity iterative decoding algorithm and its approximate to the limited channel capacity. In this paper,on the basis of the existing theory of low-density parity-check codes,its coding and decoding ideas based on the figure model are expatiated systemically. Then,we begin to study the rapid coding of low-density parity-check codes, and then RU algorithm, one of the rapid coding algorithms, which can reduce the complexity of coding, is proposed. After having a good understanding of how to use the greedy algorithm to find the weighted factor of RU algorithm,a practical method of greedy algorithm is proposed. In decoding,the detailed derivation of the belief propagation(BP) algorithm information updated rules based on both probability measurements and log-BP algorithm are given. Finally, the hardware design of the low-density parity-check code is given,including the coder based on RU algorithm and the decoder based on log-BP algorithm. |