Low-density parity-check (LDPC) codes have been implemented in latest digital video broadcasting, broadband wireless access (WiMax), and fourth generation of wireless standards. In this paper, we have proposed a high efficient low-density parity-check code (LDPC) decoder architecture for low power applications. This study also considers the design and analysis of check node and variable node un...

Low-Density Parity-Check (LDPC) codes received much attention recently due to their capacity-approaching performance. The iterative message-passing algorithm is a widely adopted decoding algorithm for LDPC codes [7]. An important design issue for LDPC codes is designing codes with fast decoding speed while maintaining capacityapproaching performance. In another words, it is desirable that the c...

Aiming at seeking a low complexity decoder of the low-density parity-check (LDPC) codes, we present one modified multi-bit flipping (MMBF) algorithm. For those LDPC codes whose parity check matrices have light column weight, both the bootstrap step and a novel delay-handling step are included in MMBF, based on one framework which is the combination of conventional PWBF and IWBF. On the other ha...

Low-density parity-check (LDPC) code is linear-block error-correcting code defined by sparse parity-check matrix. It is decoded using the massage-passing algorithm, and in many cases, capable of outperforming turbo code. This paper presents a class of low-density parity-check (LDPC) codes showing good performance with low encoding complexity. The code is constructed using difference families fr...

Recently, Low-Density Parity-Check (LDPC) codes have attracted much attention because of their excellent error-correcting performance and highly parallelizable decoding scheme. However, main drawbacks of LDPC codes such as the higher encoding complexity and short cycles in the Tanner graph that result in difficulties of hardware implementation and poor performance with the iterative decoding al...

SUMMARY In this letter, we present a new scheme to find small fundamental instantons (SFIs) of regular low-density parity-check (LDPC) codes for the linear programming (LP) decoding over the binary symmetric channel (BSC). Based on the fact that each instanton-induced graph (IIG) contains at least one short cycle, we determine potential instantons by constructing possible IIGs which contain sho...

Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2m ), where m > 0 cyclic low-density paritycheck codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to in...

The performance of non-binary linear block codes is studied in this paper via the derivation of new upper bounds on the error probability under ML decoding. The transmission of these codes is assumed to take place over a memoryless and symmetric channel. The new bounds, which rely on the Gallager bounding technique, are applied to expurgated ensembles of non-binary and regular low-density parit...

A construction method based on the p-plane to design high-girth quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed. Firstly the good points in every line of the p-plane can be ascertained through filtering the bad points, because the designed parity-check matrixes using these points have the short cycles in Tanner graph of codes. Then one of the best points from the residual good...

This work explains the relationship between cycles, stopping sets, and dependent columns of the parity check matrix of low-density parity-check (LDPC) codes. Furthermore, it discusses how these structures limit LDPC code performance under belief propagation decoding. A new metric called extrinsic message degree (EMD) measures cycle connectivity in bipartite graphs. Using an easily computed esti...