Area and Energy Efficient VLSI Architectures for Low -Density Parity-Check Decoders Using an On-the-Fly Computation. (December 2006) Kiran Kumar Gunnam, M.S., Texas A&M University Co-Chairs of Advisory Committee: Dr. Gwan Choi Dr. Scott Miller The VLSI implementation complexity of a low density parity check (LDPC) decoder is largely influenced by the interconnect and the storage requirements. T...

We consider the design of convolutional codes and low-density parity-check (LDPC) codes with minimum-shift keying (MSK) when the receiver employs iterative decoding and demodulation. The main idea proposed is the design of coded schemes that are well matched to the iterative decoding algorithm being used rather than to hypothetical maximum-likelihood decoding. We first show that the design is c...

In this paper we propose the construction of Spatially Coupled Low-Density Parity-Check (SC-LDPC) codes using a Quasi-Cyclic (QC) algorithm. The QC based approach is optimized to obtain memory efficiency in storing the parity-check matrix in the decoders. A hardware model of the parity-check storage units has been designed for Xilinx FPGA to compare the logic and memory requirements for various...

— We present a class of concatenated codes called Parallel Concatenated Gallager Codes (PCGC) using Low-Density Parity-Check (LDPC) component codes. We report simulation results for PCGC that outperform those for comparable LDPC codes both in Additive White Gaussian Noise (AWGN) and ßat Rayleigh fading channels. The good performance of PCGC increases the capacity of CDMA systems while the reduc...

Low Density Parity Check Codes originally invented by Gallagher and subsequently rediscovered by multiple groups 30 years later has become the best known error correcting code in a variety of situations. In this paper, we review regular and irregular LDPC codes. We describe a number of message passing decoders for decoding these codes and explain their operation via examples. Density evolution,...

Sparse graph-based codes such as low-density parity-check (LDPC) codes have revolutionized coding theory and have been proposed for many emerging communication and storage systems due to their excellent performance. A substantial amount of research has been devoted to the study of binary LDPC codes. In contrast, non-binary LDPC codes had been deemed too complex and consequently have not been st...

In this paper we give a comparative analysis of decoding algorithms of Low Density Parity Check (LDPC) codes in a channel with the Nakagami distribution of the fading envelope. We consider the Progressive Edge-Growth (PEG) method and Improved PEG method for the parity check matrix construction, which can be used to avoid short girths, small trapping sets and a high level of error floor. A compa...

Performance of low-density parity-check (LDPC) codes with maximum likelihood decoding (MLD) for solid burst erasures is discussed. The columns of the paritycheck matrix of LDPC codes are permuted to increase the distance between elements (DBEs) which are defined as a number of symbol positions between elements 1 at each row of the parity-check matrix. The column permutation method can change th...

Low-density parity-check (LDPC) codes are one of the most powerful error correcting codes and are attracting much attention these days. LDPC codes are promising for communications and broadcasting as well where the use of error correcting codes are essential. LDPC codes have been standardized in some communication standards, such as, IEEE802.16e, DVB-S2, IEEE802.3an (10BASE-T), and so on. The p...