Low density parity check (LDPC) codes are one of the best error correcting codes in today’s coding world and are known to approach the Shannon limit. As with all other channel coding schemes, LDPC codes add redundancy to the uncoded input data to make it more immune to channel impairments. In addition to coding, the best modulation techniques available today are MSK (Minimum Shift Keying) and G...

The literature survey has been carried out in 3 phases. The first phase focussed on LDPC Codes .The 2 nd Phase on Projective Geometry and Majority Logic decoding and the 3 rd phase on p-adic extension of PG LDPC Codes. In the first phase, the introduction to LDPC Codes, their construction,comparision is done in the references from [1],[9]-[21].The decoding methodologies and various techniques a...

—In this paper, MIMO (Multiple-Input-Multiple Output) system based on turbo equalization techniques which LDPC (Low Density Parity Check) codes were outer code and STTC (Space Time Trellis Code) were employed as an inner code are studied. LDPC decoder and STTC decoder are connected through the interleaving and de-interleaving that updates each other's information repeatedly. On the receiver si...

OF THE THESIS Properties of LDGM-LDPC codes With Applications to Secrecy Coding by Manik Raina Thesis Directors: Professor Predrag Spasojević The ensemble of low-density generator-matrix/low-density parity-check (LDGM-LDPC) codes has been proposed in literature. In this thesis, an irregular LDGM-LDPC code is studied as a sub-code of an LDPC code with some randomly punctured outputbits. It is sh...

The research project described in this thesis concentrates on the study, and application of specific channel coding techniques, in particular, low-density parity-check (LDPC) codes, iterative decoding on Tanner graphs, and their application on joint iterative receivers based on the turbo principle, previously proposed. The construction of random LDPC codes that fulfil certain desirable characte...

We first consider the design of generalized LPDC (G-LDPC) codes with recursive systematic convolutional (RSC) constraint nodes in place of the standard single parity check constraint nodes. Because rate-1/2 RSC nodes lead to low-rate G-LDPC codes, we consider high-rate tail-biting RSC nodes for which Riedel’s APP-decoder based on the reciprocal-dual code trellis becomes necessary. We present th...

In this paper, we compare the finite-length performance of protograph-based spatially coupled lowdensity parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft bit-error-rate (BER) estimate is used for the q-ary SC-LDPC codes. Two regimes are considered: one w...

In this paper we investigate the minimum code distance of QC LDPC codes [1], [2], [3]. These codes form an important subclass of LDPC codes [4], [5]. These codes also are a subclass of protograph-based LDPC codes [6]. QC LDPC codes can be easily stored as their parity-check matrices can be easily described. Besides such codes have efficient encoding [7] and decoding [8] algorithms. All of these...

This work focuses on the decoding algorithm of the LDPC large block FEC codes for the packet erasure channel, also called AL-FEC (Application-Level Forward Error Correction). More specifically this work details the design and the performance of a hybrid decoding scheme, that starts with the Zyablov iterative decoding algorithm, a rapid but suboptimal algorithm in terms of erasure recovery capab...

In this paper, we compare the decoding error rates in the error floors for non-binary low-density parity-check (LDPC) codes over general linear groups with those for non-binary LDPC codes over finite fields transmitted through the q-ary memoryless symmetric channels under belief propagation decoding. To analyze non-binary LDPC codes defined over both the general linear group GL(m, F2) and the f...