Low-density parity-check (LDPC) codes are very powerful error-correction codes with capabilities approaching the Shannon’s limits. In evaluating the error performance of a LDPC code, the computer simulation time taken becomes a primary concern when tens of millions of noise-corrupted codewords are to be decoded, particularly for codes with very long lengths. In this paper, we propose modeling t...

In this paper, we present a construction method of terminated non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an expansion of Felstrom and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary LDPC convolutional codes is also discussed. The proposed ratecompatible code is designed from one single ...

Many classes of high-performance low-density parity-check (LDPC) codes are based on parity check matrices composed of permutation submatrices. We describe the design of a parallel-serial decoder architecture that can be used to map any LDPC code with such structure to a hardware emulation platform. High-throughput emulation allows for the exploration of the low bit error rate (BER) region and p...

In this paper, a fast-convergence algorithm is proposed for the decoding of low-density parity-check (LDPC) codes. By putting more weight on the message update from check node to variable node in current iteration, the proposed method speeds up the decoding significantly. Simulation results show that compared with the standard layered min-sum decoding algorithm, the proposed scheme may reduce a...

In this work, we propose structured root-low-density parity-check (LDPC) codes and design techniques for block-fading channels. In particular, quasi-cyclic root-LDPC codes, irregular repeat-accumulate root-LDPC codes and controlled doping root-LDPC codes based on progressive edge growth (PEG) techniques for block-fading channels are proposed. The proposed root-LDPC codes are both suitable for c...

This paper mainly about the study on one of the widely used error correcting codes that is Low parity check Codes (LDPC). In this paper, the Regular LDPC code has been discussed The LDPC codes explained in this paper is about the Regular Binary LDPC codes or the Gallager. Keywords—LDPC, channel coding.

This paper mainly about the study on one of the widely used error correcting codes that is Low parity check Codes (LDPC). In this paper, the Regular LDPC code has been discussed The LDPC codes explained in this paper is about the Regular Binary LDPC codes or the Gallager. Keywords—LDPC, channel coding.

In this paper, capacity-achieving codes for memoryless binary-input output-symmetric (MBIOS) channels under maximum-likelihood (ML) decoding with bounded graphical complexity are investigated. The graphical complexity of a code is defined as the number of edges in the graphical representation of the code per information bit and is proportional to the decoding complexity per information bit per ...

A low-density parity-check (LDPC) code is a linear error correcting code, and is used for transmitting message over a noisy transmission channel. A new class of error correcting codes called EG-LDPC (Euclidean Geometry-LDPC) codes and its encoder and decoder architectures for nanomemory applications is designed. EG-LDPC codes also have fault secure detection capability. One step majority logic ...

In this paper, a serial concatenation scheme and its iterative decoding algorithm between Low Density Parity Check codes (LDPC) and Reed-Solomon codes are proposed. For the decoder, the soft output values delivered by LDPC are used as reliability values to perform the Chase decoding of Reed-Solomon (RS) codes which return soft information to LDPC decoder. This approach presents an option scheme...