Protograph-based non-binary low-density parity-check (LDPC) codes with ultra-sparse parity-check matrices are compared with binary LDPC and turbo codes (TCs) from space communication standards. It is shown that larger coding gains are achieved, outperforming the binary competitors by more than 0.3 dB on the additive white Gaussian noise channel (AWGN). In the short block length regime, the desi...

This paper proposes belief propagation based combined decoding scheme for low-density parity-check (LDPC)-coded orthogonal frequency-division multiplexing (OFDM) system with a peak-to-average power ratio (PAPR) reduction using the partial transmit sequence (PTS), which does not transmit PTS side information about the phase factors. Keywords— Belief Propagation (BP), Partial Transmit Sequence (P...

In this paper, we conclude five kinds of methods for construction the regular low-density parity matrix H and three irregular parity-check H. Through analysis code rate parameters these eight structures, find that tends to be more flexible parameter variability is enhanced. We propose current development cost should lower with progress electronic technology need research on practical Low-Densit...

In this paper we consider low-density parity-check (LDPC) codes for the classic bursty channel. We present lower bounds on the maximum resolvable erasure burst length, Lmax, for arbitrary LDPC codes and then present constructions for LDPC codes with good burst erasure correction performance for channels with and without the presence of noise in the guard band.

We investigate the use of finite-geometry low-density parity-check (FG-LDPC) codes for channels with stuckat defects. Such a channel is corrupted by a stuck-at defect pattern in addition to the usual channel-induced noise. When the defect pattern is known to the encoder but not to the decoder, the capacity of the channel is the same as if the defect pattern were also revealed to the decoder. Ca...

In this paper, we investigate an efficient encoding approach for generalized low-density (GLD) parity check codes, a generalization of Gallager’s low-density parity check (LDPC) codes. We propose a systematic approach to construct approximate upper triangular GLD parity check matrix which defines a class of efficientencoding GLD codes. It’s shown that such GLD codes have equally good performanc...

An algorithm for encoding low-density parity check (LDPC) codes is investigated. The algorithm computes parity check symbols by solving a set of sparse equations, and the triangular factorization is employed to solve the equations efficiently. It is shown analytically and experimentally that the proposed algorithm is more efficient than the Richardson’s encoding algorithm if the code has a smal...

A novel method guaranteeing nondecreasing girth is presented for constructing longer low-density parity-check (LDPC) codes from shorter ones. The parity-check matrix of a shorter base code is decomposed into N (N ≥ 2) nonoverlapping components with the same size. Then, these components are combined together to form the parity-check matrix of a longer code, according to a given N×N Latin square....

Low-density parity-check (LDPC) codes have been shown to deliver capacity approaching performance; however, problematic graphical structures (e.g. trapping sets) in the Tanner graph of some LDPC codes can cause high error floors in bit-errorratio (BER) performance under conventional sum-product algorithm (SPA). This paper presents a serial concatenation scheme to avoid the trapping sets and to ...

| Binary Low Density Parity Check (LDPC) codes have been shown to have near Shannon limit performance when decoded using a probabilis-tic decoding algorithm. The analogous codes deened over nite elds GF (q) of order q > 2 show signii-cantly improved performance. We present the results of Monte Carlo simulations of the decoding of inn-nite LDPC Codes which can be used to obtain good construction...