We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...

LDPC codes and digital fountain techniques have received significant attention from both academics and industry in the past few years. There have also been extensive interests in applying LDPC code techniques to distributed storage systems such as cloud data storage in recent years. This paper carries out the theoretical analysis on the feasibility and performance issues for applying LT codes t...

In this paper, we investigate the application of nonbinary low density parity check (LDPC) codes over Galois field GF(q) for both single-input single-output (SISO) and multipleinput multiple-output (MIMO) fading channels using higher order modulations. As opposed to the widely studied binary systems that employ joint detection and channel decoding, we propose a nonbinary system where optimal si...

We discuss the performance of polar codes, the capacity-achieving channel codes, on wireless communication channel in this paper. By generalizing the definition of Bhattacharyya Parameter in discrete memoryless channel, we present the special expression of the parameter for Gaussian and Rayleigh fading the two continuous channels, including the recursive formulas and the initial values. We anal...

Low-density parity-check (LDPC) code, a very promising near-optimal error correction code (ECC), is being widely considered in next generation industry standards. In this paper, two simple iterative low complexity algorithms for decoding LDPC codes have been explained. These algorithms are implemented using real additions only and also not dependent on power spectral density. Comparison of thes...

The progressive edge-growth (PEG) algorithm is known to construct low-density parity-check (LDPC) codes at finite code lengths with large girths by establishing edges between symbol and check nodes in an edge-by-edge manner. The linear-encoding PEG (LPEG) algorithm, a simple variation of the PEG algorithm, can be applied to generate linear time encodable LDPC codes whose m parity bits p1, p2, ....

Spatially coupled low-density parity-check (LDPC) codes have attracted considerable attention due to their promising performance. Recursive encoding of the codes with low delay and low complexity has been proposed in the literature but with constraints or restrictions. In this manuscript we propose an efficient method to construct parity-check matrices for recursively encoding spatially coupled...

The performance of low-density parity-check (LDPC) codes serially concatenated with generalized partial response channels is investigated. Various soft-input/soft-output detection schemes suitable for use in iterative detection/decoding systems are described. A low-complexity near-optimal detection algorithm that incorporates soft-input reliability information and generates soft-output reliabil...

Iterative decoding of Low Density Parity Check (LDPC) codes using the Parity Likelihood Ratio (PLR) algorithm have been proved to be more efficient compared to conventional Sum Product Algorithm (SPA). However, the nature of PLR algorithm tends to put numerious pieces of data to this decoder and perform computation intensive operations, which is a major challenge for building a practical real-t...