Results 151 to 160 of about 6,933 (191)
Some of the next articles are maybe not open access.
Design of Low-Density Parity-Check Codes
IEEE Vehicular Technology Magazine, 2011This article provides an overview of the conflicting design tradeoffs of low-density parity-check (LDPC) codes and thus advocates a more holistic approach to their design for wireless channels. We reveal some of the intricate interdependencies of the LDPC code parameters and hence recommend designing codes that strike an attractive tradeoff concerning ...
Nicholas Bonello +2 more
openaire +1 more source
Low-density parity-check accumulate codes
2010 International Symposium On Information Theory & Its Applications, 2010This paper presents a class of high-rate codes called low-density parity-check accumulate (LDPCA) codes. The code design is the serial concatenation of an LDPC outer code and an accumulator with an interleaver. The iterative decoding for the LDPCA code design has complexity linear to the code length.
Chung-Li Wang, Shu Lin 0001
openaire +1 more source
An Introduction to Low-Density Parity-Check Codes
2002In this paper we will survey some of the most recent results on low-density parity-check codes. Our emphasis will be primarily on the asymptotic theory of these codes. For the most part, we will introduce the main concepts for the easier case of the erasure channel. We will also give an application of these methods to reliable content delivery.
openaire +1 more source
Improved low-density parity-check codes using irregular graphs [PDF]
IEEE Transactions on Information Theory, 2001 We construct new families of error-correcting codes based on Gallager’s low-density parity-check codes, which we call irregular codes. When decoded using belief propagation, our codes can correct more errors than previously known low-density parity-check
M Mitzenmacher, Daniel A Spielman
exaly +1 more source
Low-density parity-check codes
The purpose of this work is to study how to communicate reliably through a noisy communication channel. In particular, we focus on the low-density parity-check error-correcting codes, which were introduced by Robert Gallager in his PhD thesis in 1963.+6 more sources
Multilevel coding with low-density parity-check component codes
GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270), 2002We design multilevel coding (MLC) schemes with low-density parity-check (LDPC) codes as component codes at each level. We develop a method to analyze the performance of an LDPC code at any level as the codeword length goes to infinity, even if the equivalent binary-input component channels are not symmetric.
Jilei Hou +3 more
openaire +1 more source
Low Density Parity Check Codes
2016Besides the turbo codes, there is one more class of linear block codes that makes possible to approach to the Shannon bound. These are Low Density Parity Check (LDPC) codes. They were proposed by Gallager [83]. In principle they have a sparse parity - check matrix.
Predrag Ivaniš, Dušan Drajić
openaire +1 more source
Low-Density Parity-Check Codes
1963This is a complete presentation of all important theoretical and experimental work done on low-density codes. Low-density coding is one of the three techniques thus far developed for efficient communication over noisy channels with an arbitrarily low probability of error. A principal result of information theory is that if properly coded information is
openaire +1 more source
The semi-algebra low-density parity-check codes
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004In this paper, the construction of semi-algebra Low-density parity-check (LDPC) code with an arbitrary block length is presented. The encoding circuit is based on the original semi-algebra design and users can have the choice of using the matrix pattern and various code rates to design for different communication applications. Especially, a novel girth
Yu Yi, Gi Yean Hwang, Moon Ho Lee
openaire +1 more source
Low Density Parity Check Codes
2014The Tanner graph is described. A girth in the Tanner graph is equivalent to a short cycle of 1- symbols in the parity check matrix. The condition called row-column constraint is introduced, in order to allow practical decoding procedures. They are based on the sum-product algorithm, which is briefly outlined.
openaire +2 more sources