dc.description.abstract | Utilize the message-passing decoding algorithm , we find that there is very good performance in decoding. But, because its complexity is on the high side, a lot are studying and discussing how to improve complexity , and it will not make the performance decay seriously. Decode algorithm of performing in efficiency as to hard type as soft to is it perform algorithm so outstanding to decode. So, less research puts forward and improves the performance of hard-decision decoding algorithms. However, the hard-decision decoding algorithms have some advantages. as if low complexity, and realizing of hardware easily. In this thesis , I will mainly discuss decoding algorithms of low- complexity, because it corrects one bit-node per iteration. so, it needs many iterations to finish decoding movements . Hence, I propose a method here. Utilizing the non-correlation of bits nodes and than judging what bit nodes to be flipped. As increasing the frequency of iterations, it represents the bit nodes are more reliable and can not be flipped arbitrarily. It should have a mechanism to judge if flipping multi-bits. When flipping multi-bits per iteration, we can find the performance of flipping multi-bits per iteration better than flipping one bit per iteration in the condition of less iterations. Flipping multi-bits per iteration can use less iterations to achieve the same performance. Therefore , it can save decoding time effectively and improve the speed of decoding. | en_US |