Error-correcting codes have contributed in a significant way for both the theoretical referred to as random errors, or else errors can appear in bursts of many errors each It was shown that long LDPC codes with iterative decoding achieve. LDPC codes provide good random error performance nearer to Shannon limit. iterations such errors can be corrected by concatenating LDPC codes with RS codes. b...

I n this report we study the decoding algorithms for a family of codes called LDPC codes used over the binary erasure channel (BEC). LDPC codes are able to work at rates near Shannon capacity with linear time decoding algorithms. Those linear time decoding algorithms sometimes fail even when Gaussian elimination would still be able to restore the codeword. In this report we try to experimentall...

The multi-edge type LDPC codes, introduced by Richardson and Urbanke, present the general class of structured LDPC codes. In this paper, we derive the average weight distributions of the multi-edge type LDPC code ensembles. Furthermore, we investigate the asymptotic exponential growth rate of the average weight distributions and investigate the connection to the stability condition of the densi...

A kind of (1008, 3, 6) rules LDPC decoder was designed in this paper, in order to solving the high complexity of LDPC decoder hardware implementation, which adopted Min-Sum decoding algorithm and partparallel structure. The minimum module in the traditional check function unit (CFU) was improved, which could reduce the complexity of the hardware realization. In the end, the LDPC decoder achieve...

In the past decade, a significant progresshas been reported in the field of error control coding. In particular, the innovation ofturbo codes and rediscovery of LDPC codes have been recognized as two significant breakthroughs in this field. The distinct features of these capacity approaching codes have enabled them to be widely proposed and/or adopted in existing wireless standards. Furthermore...

We introduce a wide class of LDPC codes, large enough to include LDPC codes over finite fields, rings or groups as well as some non-linear codes. This class is defined by an extension of the parity-check equations involved in the code’s definition. A belief propagation decoding procedure with the same complexity as for the decoding of LDPC codes over finite fields is presented for theses new pa...

In this paper we design low-density parity-check (LDPC) codes for erasure channels with packet losses. Binary base matrices with good minimum stopping set size are designed and superposition is used with these matrices to construct LDPC codes which can correct losses of whole packets. By using superposition, rather than by using the more traditional codeword interleaving, LDPC codes are produce...

LDPC convolutional codes, also known as spatially coupled LDPC codes, have attracted considerable attention due to their promising properties. By coupling the protographs from different positions into a chain and terminating the chain properly, the resulting convolutional-like LDPC code ensemble is able to produce capacityachieving performance in the limit of large parameters. In addition, opti...

This paper attempts to examine the optimality of LDPC codes for compression of nonuniform source with Slepian-Wolf coding using density evolution technique. The primary goal is to evaluate the performance of LDPC codes with reference to turbo codes (in SF-ISF setup). The appreciable difference between LDPC and turbo codes is also discussed in this paper. The threshold values obtained from the d...