Results 221 to 230 of about 11,054,895 (265)
Some of the next articles are maybe not open access.
Low-density parity-check codes
IEEE Transactions on Information Theory, 1962R Gallager
exaly +4 more sources
Low-Density Parity-Check Codes
2009AbstractLow-density parity-check (LDPC) codes are among the most efficient error correcting codes in use. This chapter introduces an important family of LDPC ensembles, based on random factor graphs, and studies some of their basic properties. It focuses on performances under optimal decoding, when no constraint is imposed on the computational ...
Marc Mézard, Andrea Montanari
+6 more sources
Structured low-density parity-check codes
IEEE Signal Processing Magazine, 2004This article describes the different methods to design regular low density parity-check (LDPC) codes with large girth. In graph terms, this corresponds to designing bipartite undirected regular graphs with large girth. Large girth speeds the convergence of iterative decoding and improves the performance at least in the high SNR range, by slowing down ...
José M. F. Moura +2 more
openaire +2 more sources
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 +2 more sources
The renaissance of gallager's low-density parity-check codes
IEEE Communications Magazine, 2003LDPC codes were invented in 1960 by R. Gallager. They were largely ignored until the discovery of turbo codes in 1993. Since then, LDPC codes have experienced a renaissance and are now one of the most intensely studied areas in coding. In this article we review the basic structure of LDPC codes and the iterative algorithms that are used to decode them.
Richardson, T., Urbanke, R.
openaire +2 more sources
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 +2 more sources
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
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