Journal of Computer Applications (计算机应用) 2013/33:12 PP.3511-3513
Low Density Parity Check Code (LDPC) is a kind of (n,k) linear block codes. The conventional encoding method can complete the encoding work when the length of the codes is short, but as the codes become longer, the memory of computer is hard to bear when still using the common encoding methods. To solve this problem, two kinds of effective encoding and decoding schemes were proposed. Firstly, different from the traditional data parity bit decoding, the proposed data reconciliation scheme used side information and syndrome produced by the initial data to employ joint decoding. Secondly, the parity matrix was stored in a way that only the positions of 1 in the form of the cross circular list were recorded, which could greatly save memory space. At last, C implementation could improve effectiveness of the codes. Length of a block of codes in this experiment was 105. The Bit Error Ratio (BER) of codes was converged above 1.0 dB, only in need of 4 seconds to decode one block, the code rate could reach 24.85 kb/s when the decoder was converged. The results show that the proposed schemes have strong timeliness.