In this paper, we conclude five kinds of methods for construction the regular low-density parity matrix H and three irregular parity-check H. Through analysis code rate parameters these eight structures, find that tends to be more flexible parameter variability is enhanced. We propose current development cost should lower with progress electronic technology need research on practical Low-Densit...

The most powerful channel coding schemes, namely, those based on turbo codes and LPDC (Low density parity check) codes have in common principle of iterative decoding. Shannon’s predictions for optimal codes would imply random like codes, intuitively implying that the decoding operation on these codes would be prohibitively complex. A brief comparison of Turbo codes and LDPC codes will be given ...

In his thesis, Wiberg showed the existence of thresholds for families of regular low-density parity-check codes under min-sum algorithm decoding. He also derived analytic bounds on these thresholds. In this paper, we formulate similar results for linear programming decoding of regular low-density parity-check codes.

Low-Density Parity-Check (LDPC) code is one kind of prominent error correcting codes (ECC) being considered in next generation industry standards. The decoder implementation complexity has been the bottleneck of its application. This paper presents an implementation of Quasi-Cyclic Low-Density Parity-Check decoder by using FPGA. Modified Min-Sum decoding algorithm is applied to reduce the memor...

In this paper Hard Decision and Soft Decision decoding techniques for Quasi-Cyclic-Low Density Parity Check (QC-LDPC) code and Low Density Parity Check (LDPC) code is introduced. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The decoding processes of these codes are easy to simplify and implement. The algorithms u...

We propose a new type of short to moderate block-length, linear error-correcting codes, called moderate-density parity-check (MDPC) codes. The number of one’s of the parity-check matrix of the codes presented is typically higher than the number of one’s of the parity-check matrix of low-density paritycheck (LDPC) codes. But, still lower than those of the parity-check matrix of classical block c...

We construct new families of error-correcting codes based on Gallager’s low-density parity-check codes. We improve on Gallager’s results by introducing irregular parity-check matrices and a new rigorous analysis of hard-decision decoding of these codes. We also provide efficient methods for finding good irregular structures for such decoding algorithms. Our rigorous analysis based on martingale...