LDPC codes are state-of-art error correcting codes, included in and the received samples in LDPC-coded systems using M -QAM schemes. physical layer, especially on the forward-error correction code. (FEC) performance. low-density parity check (LDPC) codes can achieve high Using long FECs with short is possible to apply a non-uniform mapping like for example. Low-density parity-check (LDPC) code ...

Low-density parity-check (LDPC) codes on symmetric memoryless channels have been analyzed using statistical physics by several authors. In this paper, statistical mechanical analysis of LDPC codes is performed for asymmetric memoryless channels and general Markov channels. It is shown that the saddle point equations of the replica symmetric solution for a Markov channel is equivalent to the den...

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...

We study a modification method for constructing lowdensity parity-check (LDPC) codes for solid burst erasures. Our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random erasure channels. We show by simulation results t...

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 a new kind of high-throughput and memory efficient LDPC decoder architecture. In general, more than fifty percent of memory can be saved over conven...

This paper presents a construction of very high-rate low-density parity-check (LDPC) codes based on the incidence matrices of unital designs. Like the projective geometry and oval designs, unital designs exist with incidence matrices which are significantly rank deficient. Thus high-rate LDPC codes with a large number of linearly dependent parity-check equations can be constructed. The LDPC cod...

The design of future communication systems with high throughput demands will become a critical task, especially when sophisticated channel coding schemes have to be applied. Low-Density Parity-Check(LDPC) codes are among the most powerful forward error correcting codes, since they enable to get as close as a fraction of a dB from the Shannon limit. A simplified decoding algorithms for decoding ...

42 JANUARY 2004 1053-5888/04/$20.00©2004IEEE e consider the problem of designing unoriented bipartite graphs with large girth. These graphs are the Tanner graphs associated with the parity-check matrix H of low density parity-check (LDPC) codes or Gallager codes. Larger girth improves the computational and bit error rate (BER) performance of these codes. The article overviews several existing m...

In this paper we propose a new class of irregular low-density parity check (LDPC) codes with linear encoding complexity. We show that these codes offer performances compatible with irregular LDPC codes with randomly generated parity-check matrices. The non-systematic part of the paritycheck matrix has a simple triangular structure, which enables linear encoding, while the systematic part of the...

In this paper, we propose to leverage the simple and explicit parity checks inherent in low-density parity-check (LDPC) codes to realize dominant error events detection without code rate penalty. This is enabled by enforcing a very weak constraint on LDPC code parity check matrix structure. Such a constraint can be readily satisfied by most structured LDPC codes ever studied in the open literat...